Download data/lean/OAI/Geometry/CylinderCovering/Simplex/ProjectionDefinitions.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.59 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/CylinderCovering/Simplex/ProjectionDefinitions.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/CylinderCovering/Simplex/ProjectionDefinitions.lean
-
curl -L -o ProjectionDefinitions.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/CylinderCovering/Simplex/ProjectionDefinitions.lean
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 | |