Download data/lean/OAI/Geometry/CoveringDensity/Model.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.44 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/CoveringDensity/Model.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/CoveringDensity/Model.lean
-
curl -L -o Model.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/CoveringDensity/Model.lean
4.44 kB
| import Mathlib | |
| namespace OAI | |
| namespace CoveringOrder | |
| open Set MeasureTheory | |
| open scoped ENNReal | |
| abbrev Space (n : β) := EuclideanSpace β (Fin n) | |
| /-- Actual discrete full-rank lattice coverings; no assumed density theorem. -/ | |
| structure LatticeCover {n : β} (K : Set (Space n)) where | |
| lattice : Submodule β€ (Space n) | |
| discrete : DiscreteTopology lattice | |
| fullrank : IsZLattice β lattice | |
| covers : β y, β l : lattice, y - l.val β K | |
| noncomputable def euclideanVolume (n : β) : | |
| (EuclideanSpace β (Fin n)) | |
| (.measurableSpace 2 (Fin n β β) | |
| (.pi (Fin n) (fun _ => β) (fun _ => Real.measurableSpace))) := | |
| .map (Fin n β β) (EuclideanSpace β (Fin n)) | |
| (.pi (Fin n) (fun _ => β) (fun _ => Real.measurableSpace)) | |
| (.measurableSpace 2 (Fin n β β) | |
| (.pi (Fin n) (fun _ => β) (fun _ => Real.measurableSpace))) | |
| (.toLp 2 (Fin n β β)) | |
| (Measure.pi (fun _ : Fin n => @volume β Real.measureSpace)) | |
| noncomputable def euclideanCovolume {n : β} | |
| (lattice : Submodule β€ (EuclideanSpace β (Fin n))) : ββ₯0β := | |
| addCovolume lattice (EuclideanSpace β (Fin n)) (euclideanVolume n) | |
| noncomputable def latticeDensity {n : β} {K : Set (Space n)} | |
| (cover : LatticeCover K) : ββ₯0β := | |
| euclideanVolume n K / euclideanCovolume cover.lattice | |
| noncomputable def thetaL {n : β} (K : Set (EuclideanSpace β (Fin n))) : ββ₯0β := | |
| β¨ cover : LatticeCover K, latticeDensity cover | |
| end CoveringOrder | |
| namespace TranslativeCovering | |
| open Set Filter MeasureTheory | |
| open scoped ENNReal | |
| abbrev Space (n : β) := EuclideanSpace β (Fin n) | |
| def cube (n : β) (R : β) : Set (Space n) := | |
| {x | β i, -R β€ x i β§ x i β€ R} | |
| def LocallyFiniteCenters {n : β} (X : Set (Space n)) : Prop := | |
| β B : Set (Space n), Bornology.IsBounded B β (X β© B).Finite | |
| def Covers {n : β} (K X : Set (Space n)) : Prop := | |
| β y, β x β X, y - x β K | |
| def ConvexBody {n : β} (K : Set (Space n)) : Prop := | |
| IsCompact K β§ Convex β K β§ (interior K).Nonempty | |
| def CentrallySymmetric {n : β} (K : Set (Space n)) : Prop := | |
| β z, β x, x β K β (2 : β) β’ z - x β K | |
| noncomputable def upperCenterIntensity {n : β} (X : Set (Space n)) : ββ₯0β := | |
| Filter.limsup (fun R : β => | |
| (β(X β© cube n R).ncard : ββ₯0β) / ENNReal.ofReal ((2 * R) ^ n)) atTop | |
| noncomputable def thetaT {n : β} (K : Set (Space n)) : ββ₯0β := | |
| β¨ X : {X : Set (Space n) // LocallyFiniteCenters X β§ Covers K X}, | |
| volume K * upperCenterIntensity X.val | |
| end TranslativeCovering | |
| namespace CoveringOrder | |
| open Set MeasureTheory | |
| open scoped ENNReal | |
| abbrev Body (n : β) := {K : Set (Space n) // TranslativeCovering.ConvexBody K} | |
| abbrev SymmetricBody (n : β) := | |
| {K : Body n // TranslativeCovering.CentrallySymmetric K.val} | |
| noncomputable def translativeSup (n : β) : ββ₯0β := | |
| β¨ K : Body n, TranslativeCovering.thetaT K.val | |
| noncomputable def symmetricTranslativeSup (n : β) : ββ₯0β := | |
| β¨ K : SymmetricBody n, TranslativeCovering.thetaT K.val.val | |
| noncomputable def latticeSup (n : β) : ββ₯0β := | |
| β¨ K : Body n, thetaL K.val | |
| noncomputable def symmetricLatticeSup (n : β) : ββ₯0β := | |
| β¨ K : SymmetricBody n, thetaL K.val.val | |
| /-- The finite real comparison scale, viewed in extended nonnegative reals. -/ | |
| def orderBounds (c C : β) (n : β) (a : ββ₯0β) : Prop := | |
| ENNReal.ofReal (c * (n : β) * Real.log (n : β)) β€ a β§ | |
| a β€ ENNReal.ofReal (C * (n : β) * Real.log (n : β)) | |
| /-- All four extremal quantities have common | |
| absolute positive comparison constants. ENNReal bounds imply finiteness rather | |
| than mapping a potentially infinite density to zero through `toReal`. -/ | |
| def OptimalOrder : Prop := | |
| β c C : β, 0 < c β§ 0 < C β§ β nβ : β, β n : β, nβ β€ n β | |
| orderBounds c C n (translativeSup n) β§ | |
| orderBounds c C n (symmetricTranslativeSup n) β§ | |
| orderBounds c C n (latticeSup n) β§ | |
| orderBounds c C n (symmetricLatticeSup n) | |
| end CoveringOrder | |
| namespace TranslativeCovering | |
| open Set | |
| def MainStatement : Prop := | |
| β c : β, 0 < c β§ β nβ : β, β n : β, nβ β€ n β | |
| β K : Set (Space n), ConvexBody K β§ CentrallySymmetric K β§ | |
| ENNReal.ofReal (c * (n : β) * Real.log (n : β)) < thetaT K | |
| end TranslativeCovering | |
| end OAI | |