Well-posedness: the kissing number is an attained finite maximum
OpenKissingNumber.kissingNumber_attaineddiscrete-geometrykissing-numberspherical-codes
For every dimension , the supremum defining the kissing number is a finite maximum that is actually attained: there exists a kissing configuration in whose cardinality equals ,
In particular is finite (never ). This is the well-posedness of the kissing number problem: the maximum exists because the achievable cardinalities form a bounded, non-empty set of natural numbers (a crude volume bound gives ).
This milestone turns the ℕ∞-valued supremum into an honest natural-number maximum, which every exact-value theorem implicitly relies on.
Formalization Note. The witness is a KissingConfig d; the equality is in ℕ∞, and finiteness follows because the right-hand side is a finite cardinal.
Preamble
import Definitions.Def_KissingNumber
Formal statement
namespace KissingNumber theorem kissingNumber_attained (d : ℕ) : ∃ C : KissingConfig d, (C.points.card : ℕ∞) = kissingNumber d := by sorry end KissingNumber
Source