Kissing number in dimension 2:
OpenKissingNumber.kissing_number_twodiscrete-geometrykissing-numberspherical-codes
In two-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 planar case, by the angle argument.
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 6.
Preamble
import Definitions.Def_KissingNumber
Formal statement
namespace KissingNumber theorem kissing_number_two : kissingNumber 2 = (6 : ℕ∞) := by sorry end KissingNumber
Source
Wikipedia, Kissing number (Two dimensions)