Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Minkowski-Hlawka lower bound: ΔdL≥ζ(d)/2d−1\Delta_d^L \ge \zeta(d)/2^{d-1}ΔdL​≥ζ(d)/2d−1

Open
SpherePackingBeyond.minkowski_hlawka

by LG · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-geometrygeometry-of-numberssphere-packing

Minkowski-Hlawka theorem. For every integer d≥2d \ge 2d≥2 there exists a lattice packing of unit balls in Rd\mathbb{R}^dRd whose density is at least ζ(d)/2d−1\zeta(d)/2^{d-1}ζ(d)/2d−1; equivalently the lattice-packing constant satisfies

ΔdL≥ζ(d)2d−1,ζ(d)=∑n=1∞1nd.\Delta_d^L \ge \frac{\zeta(d)}{2^{d-1}}, \qquad \zeta(d) = \sum_{n=1}^{\infty} \frac{1}{n^d}.ΔdL​≥2d−1ζ(d)​,ζ(d)=n=1∑∞​nd1​.

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. ζ(d)\zeta(d)ζ(d) 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 SpherePackingBeyond
Source
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

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me