3. Density of Packings
-
SpherePacking.finiteDensity_le[axiom-like (no body)] -
SpherePacking.finiteDensity_ge[axiom-like (no body)]
Finite density is squeezed between center counts in slightly smaller/larger balls.
Code for Lemma3.1●2 definitions, 2 incomplete
Associated Lean declarations
-
SpherePacking.finiteDensity_le[axiom-like (no body)]
-
SpherePacking.finiteDensity_ge[axiom-like (no body)]
-
SpherePacking.finiteDensity_le[axiom-like (no body)] -
SpherePacking.finiteDensity_ge[axiom-like (no body)]
-
axiom
SpherePacking.finiteDensity_le : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.SpherePacking.finiteDensity_le : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`. -
axiom
SpherePacking.finiteDensity_ge : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.SpherePacking.finiteDensity_ge : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Compare unions of radius-r/2 balls and use disjointness.
-
Lemma 3.3Blueprint label
-
«lemma:periodic-points-bounds»
Group- Volume-count asymptotics for lattice and periodic center sets.
-
-
Lemma 3.4Blueprint label
-
«lemma:volume-ball-ratio-limit»
Group- Volume-count asymptotics for lattice and periodic center sets.
-
-
«lemma:periodic-points-bounds»
- Volume-count asymptotics for lattice and periodic center sets.
-
PeriodicSpherePacking.aux2_ge'[axiom-like (no body)] -
PeriodicSpherePacking.aux2_le'[axiom-like (no body)]
The number of lattice points in a radius-R ball is controlled by ball-volume over fundamental-domain volume.
Code for Lemma3.2●2 definitions, 2 incomplete
Associated Lean declarations
-
PeriodicSpherePacking.aux2_ge'[axiom-like (no body)]
-
PeriodicSpherePacking.aux2_le'[axiom-like (no body)]
-
PeriodicSpherePacking.aux2_ge'[axiom-like (no body)] -
PeriodicSpherePacking.aux2_le'[axiom-like (no body)]
-
axiom
PeriodicSpherePacking.aux2_ge' : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.PeriodicSpherePacking.aux2_ge' : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`. -
axiom
PeriodicSpherePacking.aux2_le' : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.PeriodicSpherePacking.aux2_le' : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Use the lattice tiling by translates of a bounded fundamental domain.
-
Lemma 3.2Blueprint label
-
«lemma:lattice-points-bound»
Group- Volume-count asymptotics for lattice and periodic center sets.
-
-
Lemma 3.4Blueprint label
-
«lemma:volume-ball-ratio-limit»
Group- Volume-count asymptotics for lattice and periodic center sets.
-
-
«lemma:lattice-points-bound»
- Volume-count asymptotics for lattice and periodic center sets.
-
PeriodicSpherePacking.aux_ge[axiom-like (no body)] -
PeriodicSpherePacking.aux_le[axiom-like (no body)]
Center counts for periodic sets are controlled by lattice counts times the quotient cardinality.
Code for Lemma3.3●2 definitions, 2 incomplete
Associated Lean declarations
-
PeriodicSpherePacking.aux_ge[axiom-like (no body)]
-
PeriodicSpherePacking.aux_le[axiom-like (no body)]
-
PeriodicSpherePacking.aux_ge[axiom-like (no body)] -
PeriodicSpherePacking.aux_le[axiom-like (no body)]
-
axiom
PeriodicSpherePacking.aux_ge : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.PeriodicSpherePacking.aux_ge : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`. -
axiom
PeriodicSpherePacking.aux_le : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.PeriodicSpherePacking.aux_le : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Intersect the fundamental-domain tilings with the periodic center set.
-
Lemma 3.2Blueprint label
-
«lemma:lattice-points-bound»
Group- Volume-count asymptotics for lattice and periodic center sets.
-
-
Lemma 3.3Blueprint label
-
«lemma:periodic-points-bounds»
Group- Volume-count asymptotics for lattice and periodic center sets.
-
-
«lemma:lattice-points-bound»
- Volume-count asymptotics for lattice and periodic center sets.
-
volume_ball_ratio_tendsto_nhds_one''[axiom-like (no body)]
For fixed C > 0, we have
\mathrm{Vol}(B_d(R)) / \mathrm{Vol}(B_d(R + C)) \to 1 as R \to \infty.
Code for Lemma3.4●1 definition, incomplete
Associated Lean declarations
-
volume_ball_ratio_tendsto_nhds_one''[axiom-like (no body)]
-
volume_ball_ratio_tendsto_nhds_one''[axiom-like (no body)]
-
axiom
volume_ball_ratio_tendsto_nhds_one'' : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.volume_ball_ratio_tendsto_nhds_one'' : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Expand ball volumes and simplify to a rational power limit.
-
PeriodicSpherePacking.density_eq[axiom-like (no body)]
For periodic packing centers X with lattice \Lambda and separation r,
\Delta_{\mathcal{P}} = |X / \Lambda| \cdot \mathrm{Vol}(B_d(r/2)) / \mathrm{Vol}(\mathbb{R}^d / \Lambda).
Code for Theorem3.5●1 definition, incomplete
Associated Lean declarations
-
PeriodicSpherePacking.density_eq[axiom-like (no body)]
-
PeriodicSpherePacking.density_eq[axiom-like (no body)]
-
axiom
PeriodicSpherePacking.density_eq : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.PeriodicSpherePacking.density_eq : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Combine the counting bounds and apply the sandwich theorem with
Lemma 3.4
For fixed C > 0, we have
\mathrm{Vol}(B_d(R)) / \mathrm{Vol}(B_d(R + C)) \to 1 as R \to \infty.