Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Five-dimensional lower bound: τ(5)≥40\tau(5)\ge 40τ(5)≥40 (the D5D_5D5​ lattice)

Open
KissingNumber.kissing_number_five_lower

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

discrete-geometrykissing-numberlatticespherical-codes

The kissing number in dimension 555 is at least 404040:

τ(5)≥40.\tau(5)\ge 40.τ(5)≥40.

The D5D_5D5​ root lattice has 2⋅5⋅(5−1)=402\cdot 5\cdot(5-1)=402⋅5⋅(5−1)=40 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 404040 points. This gives the lower bound toward the goal τ(5)=40\tau(5)=40τ(5)=40.

It is the constructive half of the five-dimensional problem; the remaining open half is the upper bound τ(5)≤40\tau(5)\le 40τ(5)≤40.

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
https://en.wikipedia.org/wiki/Kissing_number (Known bounds, dimension 5); Conway & Sloane, Sphere Packings, Lattices and Groups, 3rd ed., Springer 1999 (D5 lattice, 40 roots)

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