Kabatyanskii-Levenshtein upper bound:
OpenSpherePackingBeyond.kabatiansky_levenshteinasymptotic-boundsdiscrete-geometrysphere-packing
Kabatyanskii-Levenshtein bound. The optimal sphere-packing density decays at least exponentially: for every , for all sufficiently large ,
i.e. . This 1978 upper bound remains essentially the best known in high dimensions and applies to every open dimension asymptotically.
Formalization Note. The is unpacked in the standard form; the real power is Real.rpow.
Preamble
import Mathlib import Definitions.Def_TenChallenges_SpherePacking import Definitions.Def_SpherePackingBeyond_D4 open scoped BigOperators
Formal statement
namespace SpherePackingBeyond
theorem kabatiansky_levenshtein :
∀ ε : ℝ, 0 < ε → ∃ N : ℕ, ∀ d : ℕ, N ≤ d →
spherePackingConstant d ≤ ENNReal.ofReal ((2 : ℝ) ^ (-(0.599 - ε) * (d : ℝ))) := by sorry
end SpherePackingBeyondSource
Kabatyanskii & Levenshtein, 'Bounds for packings on a sphere and in space', Problems Inform. Transmission 14 (1978), no. 1, 1-17; Cohn, 'A conceptual breakthrough in sphere packing', Notices AMS 64 (2017), 102-115, https://arxiv.org/abs/1611.01685 (§1)