math / data /lean /OAI /Geometry /CylinderCovering /Angular /GeneralDefinitions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.65 kB
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