File size: 3,268 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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
import OAI.Geometry.CylinderCovering.Physical.CostDefinitions
import OAI.Geometry.CylinderCovering.Convexity.SimilarityDefinitions

namespace OAI

noncomputable section
namespace CylinderCovering.UnitEdgeFootprints

def linearReflection (z : Space) : Space := !β‚‚[-z 1, z 0, -z 2]

def reflection (z : Space) : Space := !β‚‚[-z 1, z 0, height - z 2]

def secondRepresentedPoint (Ξ· s ρ y : ℝ) : Space :=
  !β‚‚[s * ρ - Ξ· * y * (1 / 4 + s ^ 2), y, height * (1 - ρ + 2 * Ξ· * y * s)]

def secondSweep (Ξ· : ℝ) : Set Space :=
  {z | βˆƒ s ∈ Set.Icc (-1 / 2 : ℝ) (1 / 2), βˆƒ ρ ∈ Set.Icc (0 : ℝ) (sourceCap Ξ· s),
    βˆƒ y : ℝ, |y| ≀ 1 / 2 ∧ z = secondRepresentedPoint Ξ· s ρ y}

def secondAxis (Ξ· m : ℝ) : Space := linearReflection (axis Ξ· m)

def secondBase (Ξ· d M m : ℝ) : Set Space :=
  TriangularCovering.projection (secondAxis Ξ· m) '' (reflection '' foot Ξ· d M m)

def PairedFamilyStatement : Prop :=
  βˆ€ Ξ· : ℝ, 0 < Ξ· β†’
    βˆƒ C₁ Cβ‚‚ : (N : β„•) β†’ Fin N β†’ TriangularCovering.TriCylinder,
      (βˆ€ N (i : Fin N),
        (C₁ N i).axis = axis Ξ· (midpoint N i) ∧
        (C₁ N i).base = base Ξ· (mesh N) (maximumCap (sourceCap Ξ·) N i) (midpoint N i) ∧
        (Cβ‚‚ N i).axis = secondAxis Ξ· (midpoint N i) ∧
        (Cβ‚‚ N i).base = secondBase Ξ· (mesh N) (maximumCap (sourceCap Ξ·) N i) (midpoint N i) ∧
        TriangularCovering.area (C₁ N i).base =
          areaFormula η (mesh N) (maximumCap (sourceCap η) N i) (midpoint N i) ∧
        TriangularCovering.area (Cβ‚‚ N i).base =
          areaFormula η (mesh N) (maximumCap (sourceCap η) N i) (midpoint N i)) ∧
      (βˆ€ N, 0 < N β†’ βˆ€ z ∈ sweep Ξ· (sourceCap Ξ·) βˆͺ secondSweep Ξ·,
        βˆƒ i : Fin N, z ∈ (C₁ N i).carrier ∨ z ∈ (Cβ‚‚ N i).carrier) ∧
      Filter.Tendsto (fun N => TriangularCovering.totalArea (C₁ N) +
        TriangularCovering.totalArea (Cβ‚‚ N)) Filter.atTop
        (nhds (2 * limitingArea Ξ· (sourceCap Ξ·)))

def tetrahedron : Set Space :=
  {z | βˆƒ t ∈ Set.Icc (0 : ℝ) 1, z 2 = height * t ∧
    |z 0| ≀ (1 - t) / 2 ∧ |z 1| ≀ t / 2}

def CoverageStatement : Prop :=
  βˆƒ Ξ΄ : ℝ, 0 < Ξ΄ ∧ βˆ€ Ξ· : ℝ, 0 < Ξ· β†’ Ξ· < Ξ΄ β†’
    tetrahedron βŠ† sweep Ξ· (sourceCap Ξ·) βˆͺ secondSweep Ξ·

def FiniteStrictStatement : Prop :=
  βˆƒ Ξ΄ : ℝ, 0 < Ξ΄ ∧ βˆ€ Ξ· : ℝ, 0 < Ξ· β†’ Ξ· < Ξ΄ β†’
    βˆƒ N : β„•, 0 < N ∧ βˆƒ C₁ Cβ‚‚ : Fin N β†’ TriangularCovering.TriCylinder,
      (βˆ€ i, (C₁ i).axis = axis Ξ· (midpoint N i) ∧
        (C₁ i).base = base Ξ· (mesh N) (maximumCap (sourceCap Ξ·) N i) (midpoint N i) ∧
        (Cβ‚‚ i).axis = secondAxis Ξ· (midpoint N i) ∧
        (Cβ‚‚ i).base = secondBase Ξ· (mesh N) (maximumCap (sourceCap Ξ·) N i) (midpoint N i)) ∧
      (βˆ€ z ∈ tetrahedron, βˆƒ i : Fin N, z ∈ (C₁ i).carrier ∨ z ∈ (Cβ‚‚ i).carrier) ∧
      TriangularCovering.totalArea C₁ + TriangularCovering.totalArea Cβ‚‚ < height / 4

def FullStatement : Prop :=
  LocalRealizationStatement ∧ FamilyRealizationStatement ∧ PairedFamilyStatement ∧
    SourceCostStatement ∧ CoverageStatement ∧ FiniteStrictStatement ∧
      Similarity.minimumArea tetrahedron = height / 2

end CylinderCovering.UnitEdgeFootprints

end

end OAI