File size: 4,444 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 | 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 : β) :
@Measure (EuclideanSpace β (Fin n))
(@WithLp.measurableSpace 2 (Fin n β β)
(@MeasurableSpace.pi (Fin n) (fun _ => β) (fun _ => Real.measurableSpace))) :=
@Measure.map (Fin n β β) (EuclideanSpace β (Fin n))
(@MeasurableSpace.pi (Fin n) (fun _ => β) (fun _ => Real.measurableSpace))
(@WithLp.measurableSpace 2 (Fin n β β)
(@MeasurableSpace.pi (Fin n) (fun _ => β) (fun _ => Real.measurableSpace)))
(@WithLp.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
|