Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Kissing number in dimension 5 (goal): τ(5)=40\tau(5)=40τ(5)=40

Open
KissingNumber.kissing_number_five

by LG · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-geometrykissing-numberopen-problemspherical-codes

The kissing number in five-dimensional Euclidean space is 404040:

τ(5)=40.\tau(5)=40.τ(5)=40.

Equivalently, the largest number of non-overlapping unit balls in R5\mathbb{R}^5R5 that can touch a common unit ball is 404040. The lower bound τ(5)≥40\tau(5)\ge 40τ(5)≥40 is realized by the 404040 minimal vectors of the D5D_5D5​ root lattice; the open content is the matching upper bound τ(5)≤40\tau(5)\le 40τ(5)≤40. This is the first dimension in which the kissing number is not known, and 404040 is the standard conjectured value (Cohn 2024: it "appears to be 40"). The best proved upper bound is 434343 (Tomar 2026), so the gap is 40≤τ(5)≤4340\le\tau(5)\le 4340≤τ(5)≤43.

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
https://en.wikipedia.org/wiki/Kissing_number (Known bounds table, dimension 5); H. Cohn, Variations on five-dimensional sphere packings, arXiv:2412.00937 (2024); T. S. Tomar, The kissing numbers in dimensions five, six and seven are at most 43, 76 and 132, preprint 2026, doi:10.5281/zenodo.24093811

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me