Challenge 7: equality of the sphere-packing and lattice-packing constants in dimension
DefinitionTenChallenges_Challenge_07The scaled form of Challenge 7. For a natural number , is the equality
of the sphere-packing constant and the lattice-packing constant of : some lattice packing is as dense as any packing. Known for ; is the first open case, and the statement may fail in some dimensions.
import Definitions.Def_TenChallenges_SpherePacking namespace TenChallenges /-- In dimension `r`, the sphere-packing constant equals the lattice packing constant. -/ def statement_07 (r : ℕ) : Prop := spherePackingConstant r = latticePackingConstant r end TenChallenges
Read-back
What the Lean code literally says, in plain math · claude-fable-5-1
For every natural number , the proposition is the equality
of two elements of the extended non-negative reals (an equality, i.e. both and ). It is a proposition, not a theorem: nothing is asserted about its truth. The two sides are the non-Mathlib quantities defined as follows.
Throughout, is the Euclidean space of real -tuples with the Euclidean () distance ; for it is the single point . is the default volume on this finite-dimensional real inner-product space: the Haar measure normalised so that the parallelepiped spanned by an orthonormal basis has measure (standard Lebesgue measure; in dimension the one-point space has mass ), with values in . is the open ball.
- A subset (arbitrary: no measurability, discreteness or finiteness assumed) is a unit packing iff for all with one has (non-strict). The empty set and all singletons are unit packings.
- The upper density of a subset is
with ranging over all reals, division in (, , so for , , ), and the limsup being the infimum of all such that the ratio is for all sufficiently large (equivalently ). For the ball is empty and the ratio is , which does not affect the limsup. For and the ratio lies in , so ; .
- , the supremum in over all unit packings (formally an indexed supremum over all subsets and all proofs that is a unit packing, non-unit-packings contributing ). The index set is non-empty because is a unit packing.
- , where ranges over all additive subgroups (subsets containing , closed under and negation; no discreteness, closedness or finite generation is assumed), "unit packing" and refer to the underlying set of , and is the smallest real linear subspace containing the set , required to be all of . Formally the supremum is over and over proofs of the two side conditions, failed conditions contributing ; it equals if no subgroup satisfies both.
Edge case : , for with ; the unit packings are (density ) and (density ), so ; the only additive subgroup is , which is a unit packing spanning the trivial space, so , and reads .
Confirmed by the mission captain (proposal self-audit).