Sphere packing in dimension : ( conjecture)
OpenSpherePackingBeyond.dim4_optimaldiscrete-geometryopen-problemsphere-packing
The sphere-packing constant in dimension equals the density of the lattice packing:
This is the four-dimensional sphere packing conjecture: the checkerboard lattice is the densest packing of congruent balls in , among all packings, not only lattice packings. It is the first open case of the general problem of determining for , conjectured by Conway-Sloane (1995) and endorsed by Cohn (2017, §8). A proof must show both that attains and that no packing exceeds it.
Formalization Note. is spherePackingConstant 4, the supremum of upper densities over all unit packings (Def_TenChallenges_SpherePacking); the value is embedded in ℝ≥0∞ via ENNReal.ofReal.
Preamble
import Mathlib import Definitions.Def_TenChallenges_SpherePacking import Definitions.Def_SpherePackingBeyond_D4 open scoped BigOperators
Formal statement
namespace SpherePackingBeyond theorem dim4_optimal : spherePackingConstant 4 = ENNReal.ofReal (Real.pi ^ 2 / 16) := by sorry end SpherePackingBeyond
Source
Conway & Sloane, 'What are all the best sphere packings in low dimensions?', Discrete Comput. Geom. 13 (1995), 383-403, https://doi.org/10.1007/BF02574051; Cohn, 'A conceptual breakthrough in sphere packing', Notices AMS 64 (2017), 102-115, https://arxiv.org/abs/1611.01685 (§8); Wikipedia 'Sphere packing', https://en.wikipedia.org/wiki/Sphere_packing