Minkowski-Hlawka lower bound:
OpenSpherePackingBeyond.minkowski_hlawkadiscrete-geometrygeometry-of-numberssphere-packing
Minkowski-Hlawka theorem. For every integer there exists a lattice packing of unit balls in whose density is at least ; equivalently the lattice-packing constant satisfies
This is the classical lower bound of Hlawka (1943), refining Minkowski's geometry-of-numbers argument, and the benchmark lower bound in every open dimension.
Formalization Note. is written as the convergent series ∑' n : ℕ, 1 / (n+1)^d; the bound is stated for latticePackingConstant d in ℝ≥0∞.
Preamble
import Mathlib import Definitions.Def_TenChallenges_SpherePacking import Definitions.Def_SpherePackingBeyond_D4 open scoped BigOperators
Formal statement
namespace SpherePackingBeyond
theorem minkowski_hlawka (d : ℕ) (hd : 2 ≤ d) :
ENNReal.ofReal ((∑' n : ℕ, (1 : ℝ) / ((n + 1 : ℝ) ^ d)) / (2 : ℝ) ^ (d - 1)) ≤ latticePackingConstant d := by sorry
end SpherePackingBeyondSource
Hlawka, 'Zur Geometrie der Zahlen', Math. Z. 49 (1943), 285-312, https://doi.org/10.1007/BF01174201; Wikipedia 'Minkowski-Hlawka theorem', https://en.wikipedia.org/wiki/Minkowski%E2%80%93Hlawka_theorem