optimality, upper bound: every packing in has density
OpenSpherePackingBeyond.dim4_upperdiscrete-geometryopen-problemsphere-packing
Every unit packing in has upper density at most :
This is the upper-bound half of the optimality conjecture - the open core of the four-dimensional sphere packing problem. Together with the attainment statement D4_density it yields .
Formalization Note. IsUnitPacking C requires distinct centers at distance ; upperDensity is the limsup of the volume fraction of the union of unit balls inside .
Preamble
import Mathlib import Definitions.Def_TenChallenges_SpherePacking import Definitions.Def_SpherePackingBeyond_D4 open scoped BigOperators
Formal statement
namespace SpherePackingBeyond
theorem dim4_upper (C : PointSet 4) (hC : IsUnitPacking C) :
upperDensity C ≤ ENNReal.ofReal (Real.pi ^ 2 / 16) := by sorry
end SpherePackingBeyondSource
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)