File size: 4,645 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 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 | import OAI.Geometry.TriangularCovering.Basic
namespace OAI
noncomputable section
open Set MeasureTheory
open scoped InnerProductSpace
namespace CylinderCovering.AngularGeneral
abbrev Space := TriangularCovering.Space
structure Data where
count : β
node : β β β
alpha : β β β
beta : β β β
radius : β β β β β
def interval (D : Data) (j : β) : Set β := Icc (D.node j) (D.node (j+1))
def profile (q : β) : β := (q^2+q^4)/16
def lowerDirection (Ο : β) (D : Data) (j : β) : Space :=
TriangularCovering.point 1 (Ο*D.alpha j) (Ο*D.beta j)
def upperDirection (Ο : β) (D : Data) (j : β) : Space :=
TriangularCovering.point (-Ο*D.alpha j) 1 (Ο*D.beta j)
def unitDirection (v : Space) : Space := βvββ»ΒΉ β’ v
def lowerAxis (Ο : β) (D : Data) (j : β) : Space :=
unitDirection (lowerDirection Ο D j)
def upperAxis (Ο : β) (D : Data) (j : β) : Space :=
unitDirection (upperDirection Ο D j)
def lowerIntercept (D : Data) (j : β) : Set Space :=
{z | β q β interval D j, β S β Icc (0:β) (D.radius j q),
z = TriangularCovering.point 0 (q*S) S}
def upperIntercept (D : Data) (j : β) : Set Space :=
{z | β q β interval D j, β T β Icc (0:β) (D.radius j q),
z = TriangularCovering.point (q*T) 0 (1-T)}
def lowerBase (Ο : β) (D : Data) (j : β) : Set Space :=
TriangularCovering.projection (lowerAxis Ο D j) '' lowerIntercept D j
def upperBase (Ο : β) (D : Data) (j : β) : Set Space :=
TriangularCovering.projection (upperAxis Ο D j) '' upperIntercept D j
def carrier (u : Space) (B : Set Space) : Set Space :=
{z | β b β B, β r : β, z = b+r β’ u}
def lowerCylinder (Ο : β) (D : Data) (j : β) : Set Space :=
carrier (lowerAxis Ο D j) (lowerBase Ο D j)
def upperCylinder (Ο : β) (D : Data) (j : β) : Set Space :=
carrier (upperAxis Ο D j) (upperBase Ο D j)
def covers (Ο : β) (D : Data) : Prop :=
β z β TriangularCovering.K, β j : Fin D.count,
z β lowerCylinder Ο D j β¨ z β upperCylinder Ο D j
def totalArea (Ο : β) (D : Data) : β :=
β j : Fin D.count,
(TriangularCovering.area (lowerBase Ο D j) +
TriangularCovering.area (upperBase Ο D j))
def relativeCost (Ο : β) (D : Data) : β :=
β j : Fin D.count,
(TriangularCovering.area (lowerBase Ο D j) /
TriangularCovering.shadowArea (lowerAxis Ο D j) +
TriangularCovering.area (upperBase Ο D j) /
TriangularCovering.shadowArea (upperAxis Ο D j))
def integralCost (Ο : β) (D : Data) : β :=
β j : Fin D.count, β« q in D.node j..D.node (j+1),
(D.radius j q)^2 / Real.sqrt (1+Ο^2*((D.alpha j)^2+2*(D.beta j)^2))
def Admissible (Ο Ξ· E : β) (D : Data) : Prop :=
0 < D.count β§ D.node 0 = -1 β§ D.node D.count = 1 β§
(β j < D.count, D.node j < D.node (j+1)) β§
(β j β€ D.count, |D.node j| β€ 1) β§
(β L : β β β, ContinuousOn L (Icc (-1:β) 1) β§ L (-1) = 0 β§ L 1 = 0 β§
β j < D.count, β q β interval D j, D.alpha j-q*D.beta j = L q) β§
(β j < D.count, ContinuousOn (D.radius j) (interval D j)) β§
(β j < D.count, β q β interval D j, 0 < D.radius j q) β§
(β j < D.count, β q β interval D j,
|D.alpha j-(1+q^2)/4| β€ E*Ο^2 β§
|D.beta j-q/2| β€ E*Ο^2 β§
|D.radius j q-(1/2+Ο^2*(profile q+Ξ·))| β€ E*Ο^4)
def BaseProperties (u : Space) (B : Set Space) : Prop :=
βuβ = 1 β§ (β z β B, inner β u z = 0) β§
IsCompact B β§ MeasurableSet B β§ Measure.euclideanHausdorffMeasure 2 B β β€
def IsNondegenerateTriangle (B : Set Space) : Prop :=
β v : Fin 3 β Space, AffineIndependent β v β§ B = convexHull β (Set.range v)
def Conclusion (Ο Ξ· A : β) (D : Data) : Prop :=
covers Ο D β§
(β j < D.count,
BaseProperties (lowerAxis Ο D j) (lowerBase Ο D j) β§
BaseProperties (upperAxis Ο D j) (upperBase Ο D j)) β§
totalArea Ο D / TriangularCovering.H = integralCost Ο D β§
|totalArea Ο D / TriangularCovering.H - (1/2+(2*Ξ·-1/240)*Ο^2)| β€ A*Ο^4 β§
totalArea Ο D < TriangularCovering.A_min/2 β§ relativeCost Ο D < 1/2 β§
(β j < D.count, (β r : β, β q β interval D j, D.radius j q = r) β
IsNondegenerateTriangle (lowerBase Ο D j) β§
IsNondegenerateTriangle (upperBase Ο D j))
def Statement : Prop :=
β Ξ· : β, 0 < Ξ· β Ξ· < 1/480 β β E : β, 0 β€ E β
β Ξ΄ A : β, 0 < Ξ΄ β§ 0 < A β§
β Ο : β, 0 < Ο β Ο < Ξ΄ β β D : Data,
Admissible Ο Ξ· E D β Conclusion Ο Ξ· A D
end CylinderCovering.AngularGeneral
end
end OAI
|