Kissing number in dimension 3:
OpenKissingNumber.kissing_number_threediscrete-geometrykissing-numberspherical-codes
In three-dimensional Euclidean space the kissing number is :
That is, the maximum number of non-overlapping unit balls in that can touch a common unit ball is . This is the Newton–Gregory problem, first proved by Schütte and van der Waerden (1953).
It is one of the six dimensions in which the general kissing number problem is solved exactly, and a cornerstone result of discrete geometry.
Formalization Note. kissingNumber is ℕ∞-valued; the statement asserts equality with the finite cardinal 12.
Preamble
import Definitions.Def_KissingNumber
Formal statement
namespace KissingNumber theorem kissing_number_three : kissingNumber 3 = (12 : ℕ∞) := by sorry end KissingNumber
Source
Schütte & van der Waerden, Das Problem der dreizehn Kugeln, Math. Ann. 125 (1953), 325–334; https://en.wikipedia.org/wiki/Kissing_number