File size: 1,291 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
import OAI.Geometry.CylinderCovering.Beams.sDefinitions
import OAI.Geometry.CylinderCovering.Beams.CostDefinitions
import OAI.Geometry.CylinderCovering.Radial.RiemannDefinitions
import OAI.Geometry.TriangularCovering.Basic

namespace OAI

open Filter
open scoped Topology
noncomputable section
namespace ShortenedBeam

def CoverageStatement : Prop :=
  βˆ€ a : ℝ, 0 < a β†’ a < 1/2 β†’
    IsCompact (beamMinus a) ∧ IsCompact (beamPlus a) ∧
    tetrahedron βŠ† beamMinus a βˆͺ beamPlus a βˆͺ strip a

def FiniteBeamsStatement : Prop :=
  βˆ€ a : ℝ, 0 < a β†’ a < 1/2 β†’
  βˆ€ tag : (N : β„•) β†’ Fin N β†’ ℝ,
    (βˆ€ N, CylinderCovering.RadialRiemann.IsTagged 0 1 N (tag N)) β†’
    βˆƒ Cminus Cplus : (N : β„•) β†’ Fin N β†’ TriangularCovering.TriCylinder,
      (βˆ€ N, 0 < N β†’
        (βˆ€ i, (Cminus N i).axis = axisMinus a (tag N i) ∧
          (Cplus N i).axis = axisPlus a (tag N i)) ∧
        (βˆ€ z ∈ beamMinus a, βˆƒ i : Fin N, z ∈ (Cminus N i).carrier) ∧
        (βˆ€ z ∈ beamPlus a, βˆƒ i : Fin N, z ∈ (Cplus N i).carrier)) ∧
      Tendsto (fun N => TriangularCovering.totalArea (Cminus N) +
        TriangularCovering.totalArea (Cplus N)) atTop
        (𝓝 ((Real.sqrt 2/4)*CylinderCovering.BeamCost.beamCost a))

end ShortenedBeam

end

end OAI