Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Challenge 7: equality of the sphere-packing and lattice-packing constants in dimension rrr

Definition
TenChallenges_Challenge_07

by utkuokur · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

latticessphere-packingten-challenges

The scaled form of Challenge 7. For a natural number rrr, SP(r)\mathrm{SP}(r)SP(r) is the equality

Δr=ΔrL\Delta_r=\Delta_r^LΔr​=ΔrL​

of the sphere-packing constant and the lattice-packing constant of Rr\mathbb R^rRr: some lattice packing is as dense as any packing. Known for r∈{1,2,3,8,24}r\in\{1,2,3,8,24\}r∈{1,2,3,8,24}; r=4r=4r=4 is the first open case, and the statement may fail in some dimensions.

Definition code
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
Source
Ten Challenges repository, file Challenges/challenge_07.lean (commit ff14a56), https://github.com/TenChallenges/ten-challenges/blob/main/Challenges/challenge_07.lean; V. Bajpai, N. Bowler, J. Carmesin, U. Okur, 10 Scalable Challenges in Combinatorics, AI4Math @ CICM 2026, challenge 7.
Read-back

What the Lean code literally says, in plain math · claude-fable-5-1

For every natural number r∈{0,1,2,… }r\in\{0,1,2,\dots\}r∈{0,1,2,…}, the proposition statement07(r)\mathrm{statement}_{07}(r)statement07​(r) is the equality

Δr  =  ΔrL\Delta_r \;=\; \Delta^{L}_rΔr​=ΔrL​

of two elements of the extended non-negative reals [0,∞][0,\infty][0,∞] (an equality, i.e. both ≤\le≤ and ≥\ge≥). 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, Rr\mathbb{R}^rRr is the Euclidean space of real rrr-tuples with the Euclidean (ℓ2\ell^2ℓ2) distance dist⁡\operatorname{dist}dist; for r=0r=0r=0 it is the single point 000. vol⁡\operatorname{vol}vol 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 111 (standard Lebesgue measure; in dimension 000 the one-point space has mass 111), with values in [0,∞][0,\infty][0,∞]. B(x,ρ)={y:dist⁡(y,x)<ρ}B(x,\rho)=\{y:\operatorname{dist}(y,x)<\rho\}B(x,ρ)={y:dist(y,x)<ρ} is the open ball.

  • A subset C⊆RrC\subseteq\mathbb{R}^rC⊆Rr (arbitrary: no measurability, discreteness or finiteness assumed) is a unit packing iff for all x,y∈Cx,y\in Cx,y∈C with x≠yx\neq yx=y one has 2≤dist⁡(x,y)2\le\operatorname{dist}(x,y)2≤dist(x,y) (non-strict). The empty set and all singletons are unit packings.
  • The upper density of a subset C⊆RrC\subseteq\mathbb{R}^rC⊆Rr is
δ‾(C)=lim sup⁡R→+∞vol⁡ ⁣((⋃x∈CB(x,1))∩B(0,R))vol⁡(B(0,R))∈[0,∞],\overline{\delta}(C)=\limsup_{R\to+\infty}\frac{\operatorname{vol}\!\big((\bigcup_{x\in C}B(x,1))\cap B(0,R)\big)}{\operatorname{vol}(B(0,R))}\in[0,\infty],δ(C)=R→+∞limsup​vol(B(0,R))vol((⋃x∈C​B(x,1))∩B(0,R))​∈[0,∞],

with RRR ranging over all reals, division in [0,∞][0,\infty][0,∞] (0−1=∞0^{-1}=\infty0−1=∞, ∞−1=0\infty^{-1}=0∞−1=0, so a/0=∞a/0=\inftya/0=∞ for a≠0a\neq0a=0, 0/0=00/0=00/0=0, a/∞=0a/\infty=0a/∞=0), and the limsup being the infimum of all a∈[0,∞]a\in[0,\infty]a∈[0,∞] such that the ratio is ≤a\le a≤a for all sufficiently large RRR (equivalently inf⁡R0sup⁡R≥R0\inf_{R_0}\sup_{R\ge R_0}infR0​​supR≥R0​​). For R≤0R\le0R≤0 the ball B(0,R)B(0,R)B(0,R) is empty and the ratio is 0/0=00/0=00/0=0, which does not affect the limsup. For r≥1r\ge1r≥1 and R>0R>0R>0 the ratio lies in [0,1][0,1][0,1], so δ‾(C)∈[0,1]\overline{\delta}(C)\in[0,1]δ(C)∈[0,1]; δ‾(∅)=0\overline{\delta}(\emptyset)=0δ(∅)=0.

  • Δr=sup⁡{δ‾(C):C⊆Rr a unit packing}\Delta_r=\sup\{\overline{\delta}(C): C\subseteq\mathbb{R}^r \text{ a unit packing}\}Δr​=sup{δ(C):C⊆Rr a unit packing}, the supremum in [0,∞][0,\infty][0,∞] over all unit packings (formally an indexed supremum over all subsets CCC and all proofs that CCC is a unit packing, non-unit-packings contributing 000). The index set is non-empty because ∅\emptyset∅ is a unit packing.
  • ΔrL=sup⁡{δ‾(L):L an additive subgroup of Rr, L a unit packing, span⁡R(L)=Rr}\Delta^{L}_r=\sup\{\overline{\delta}(L): L \text{ an additive subgroup of } \mathbb{R}^r,\ L \text{ a unit packing},\ \operatorname{span}_{\mathbb{R}}(L)=\mathbb{R}^r\}ΔrL​=sup{δ(L):L an additive subgroup of Rr, L a unit packing, spanR​(L)=Rr}, where LLL ranges over all additive subgroups (subsets containing 000, closed under +++ and negation; no discreteness, closedness or finite generation is assumed), "unit packing" and δ‾\overline{\delta}δ refer to the underlying set of LLL, and span⁡R(L)\operatorname{span}_{\mathbb{R}}(L)spanR​(L) is the smallest real linear subspace containing the set LLL, required to be all of Rr\mathbb{R}^rRr. Formally the supremum is over LLL and over proofs of the two side conditions, failed conditions contributing 000; it equals 000 if no subgroup satisfies both.

Edge case r=0r=0r=0: R0={0}\mathbb{R}^0=\{0\}R0={0}, B(0,R)={0}B(0,R)=\{0\}B(0,R)={0} for R>0R>0R>0 with vol⁡({0})=1\operatorname{vol}(\{0\})=1vol({0})=1; the unit packings are ∅\emptyset∅ (density 000) and {0}\{0\}{0} (density 111), so Δ0=1\Delta_0=1Δ0​=1; the only additive subgroup is {0}\{0\}{0}, which is a unit packing spanning the trivial space, so Δ0L=1\Delta^L_0=1Δ0L​=1, and statement07(0)\mathrm{statement}_{07}(0)statement07​(0) reads 1=11=11=1.

Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

  • Endorsed by utkuokur · Nov 4, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me