Kissing number in dimension 5 (goal):
OpenKissingNumber.kissing_number_fivediscrete-geometrykissing-numberopen-problemspherical-codes
The kissing number in five-dimensional Euclidean space is :
Equivalently, the largest number of non-overlapping unit balls in that can touch a common unit ball is . The lower bound is realized by the minimal vectors of the root lattice; the open content is the matching upper bound . This is the first dimension in which the kissing number is not known, and is the standard conjectured value (Cohn 2024: it "appears to be 40"). The best proved upper bound is (Tomar 2026), so the gap is .
This is the mission's goal: resolving the first open case of the general kissing number problem.
Formalization Note. kissingNumber is ℕ∞-valued; the statement asserts equality with the finite cardinal 40. This is an open conjecture, not a proved theorem.
Preamble
import Definitions.Def_KissingNumber
Formal statement
namespace KissingNumber theorem kissing_number_five : kissingNumber 5 = (40 : ℕ∞) := by sorry end KissingNumber
Source