Five-dimensional lower bound: (the lattice)
OpenKissingNumber.kissing_number_five_lowerdiscrete-geometrykissing-numberlatticespherical-codes
The kissing number in dimension is at least :
The root lattice has minimal vectors, all of the same length and pairwise separated by at least that length; rescaled to the unit sphere they form a kissing configuration of points. This gives the lower bound toward the goal .
It is the constructive half of the five-dimensional problem; the remaining open half is the upper bound .
Formalization Note. The inequality is in ℕ∞; a witness is a KissingConfig 5 with 40 points.
Preamble
import Definitions.Def_KissingNumber
Formal statement
namespace KissingNumber theorem kissing_number_five_lower : (40 : ℕ∞) ≤ kissingNumber 5 := by sorry end KissingNumber
Source