math / data /lean /OAI /Geometry /CylinderCovering /Simplex /ProjectionDefinitions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.59 kB
import OAI.Geometry.CylinderCovering.Convexity.GlobalDefinitions
namespace OAI
noncomputable section
open Set MeasureTheory
open scoped InnerProductSpace
namespace CylinderCovering
abbrev Euclidean (d : β„•) := EuclideanSpace ℝ (Fin d)
def simplexCarrier {d : β„•} (v : Fin (d + 1) β†’ Euclidean d) : Set (Euclidean d) :=
convexHull ℝ (range v)
def orthogonalProjection {d : β„•} (u x : Euclidean d) : Euclidean d :=
x - inner ℝ u x β€’ u
def simplexShadowArea {d : β„•} (v : Fin (d + 1) β†’ Euclidean d)
(u : Euclidean d) : ℝ :=
(Measure.euclideanHausdorffMeasure (d - 1)
(orthogonalProjection u '' simplexCarrier v)).toReal
def longestChord {d : β„•} (S : Set (Euclidean d)) (u : Euclidean d) : ℝ :=
sSup {r : ℝ | 0 ≀ r ∧ βˆƒ x ∈ S, x + r β€’ u ∈ S}
def simplexMinimumShadowArea {d : β„•} (v : Fin (d + 1) β†’ Euclidean d) : ℝ :=
sInf {a : ℝ | βˆƒ u : Euclidean d, β€–uβ€– = 1 ∧ a = simplexShadowArea v u}
def SimplexChordProjectionStatement : Prop :=
βˆ€ d : β„•, 2 ≀ d β†’ βˆ€ v : Fin (d + 1) β†’ Euclidean d,
AffineIndependent ℝ v β†’
(βˆ€ u : Euclidean d, β€–uβ€– = 1 β†’
0 < longestChord (simplexCarrier v) u ∧
(βˆƒ x ∈ simplexCarrier v,
x + longestChord (simplexCarrier v) u β€’ u ∈ simplexCarrier v) ∧
simplexShadowArea v u * longestChord (simplexCarrier v) u =
(d : ℝ) * volume.real (simplexCarrier v)) ∧
(βˆƒ u : Euclidean d, β€–uβ€– = 1 ∧
simplexShadowArea v u = simplexMinimumShadowArea v) ∧
simplexMinimumShadowArea v =
(d : ℝ) * volume.real (simplexCarrier v) / Metric.diam (simplexCarrier v)
def TetrahedronEdgeMinimizerStatement : Prop :=
βˆ€ v : Fin 4 β†’ Space, AffineIndependent ℝ v β†’
βˆƒ i j : Fin 4, i β‰  j ∧
shadowArea (convexHull ℝ (range v))
(β€–v j - v i‖⁻¹ β€’ (v j - v i)) =
minimumShadowArea (convexHull ℝ (range v))
def RegularProjectionNormalizationStatement : Prop :=
βˆ€ v : Fin 4 β†’ Space, AffineIndependent ℝ v β†’
βˆ€ edge : ℝ, 0 < edge β†’
(βˆ€ i j : Fin 4, i β‰  j β†’ dist (v i) (v j) = edge) β†’
minimumShadowArea (convexHull ℝ (range v)) = edge ^ 2 / (2 * Real.sqrt 2) ∧
βˆ€ i j : Fin 4, i β‰  j β†’
shadowArea (convexHull ℝ (range v))
(β€–v j - v i‖⁻¹ β€’ (v j - v i)) = edge ^ 2 / (2 * Real.sqrt 2)
def SimplexProjectionIdentityStatement : Prop :=
SimplexChordProjectionStatement ∧ TetrahedronEdgeMinimizerStatement ∧
RegularProjectionNormalizationStatement
end CylinderCovering
end
end OAI