The sphere-packing constant equals the lattice-packing constant in every dimension
OpenTenChallenges.challenge_07Lattice packings are optimal in every dimension. For every , the sphere-packing constant of equals its lattice-packing constant:
where is the supremum of the upper densities of all unit packings of and the supremum over lattice packings (unit packings that are additive subgroups spanning ). The statement is known for and open for every other ; it is a question rather than a conjecture, and in dimension the densest packing known is not a lattice packing, so the statement may be false.
Formalization Note. The statement is ∀ r, statement_07 r, an equality in the extended nonnegative reals.
import Definitions.Def_TenChallenges_Challenge_07
namespace TenChallenges theorem challenge_07 : ∀ r : ℕ, statement_07 r := by sorry end TenChallenges
Read-back
What the Lean code literally says, in plain math · claude-fable-5-1
The theorem asserts: for every natural number ,
an equality of two elements of the extended non-negative reals . There are no hypotheses on whatsoever; in particular and are included. The theorem is stated without a proof in this file. 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
(non-strict inequality). 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. No discreteness, countability or measurability of is required.
- , where ranges over all additive subgroups of (subsets containing , closed under and negation; no discreteness, closedness, finite generation or -basis 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.
So the claim is: for every , the supremum of upper densities over all unit packings of equals the supremum of upper densities over those additive subgroups of that are unit packings and linearly span (both suprema in ; the assertion is an equality, i.e. both and ). 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 the instance reads .
Confirmed by the mission captain (proposal self-audit).