WorksMathematics
A Universal Square-Root-of-Six Bound for Kissing Numbers
Abstract
The least positive number for which the Euclidean kissing numbers satisfy in every positive dimension is . We show how this follows from a classical spherical-cap estimate and known low-dimensional bounds, then give two elementary proofs that require no tables of kissing numbers. A recurrence for cap areas gives strict inequality in every dimension except two. A second proof packs explicit bodies of revolution into the unit ball. The Lean 4/Mathlib certificate registered in Palomar uses this volume construction to prove the universal bound, the planar value , and the optimality of the base.
The universal base
A kissing configuration in is a finite set satisfying
Multiplying its vectors by two gives the centers of nonoverlapping unit balls touching the unit ball at the origin. We write for the largest cardinality of a kissing configuration in . The bounds below also establish the existence of this maximum.
Theorem 1. For every integer ,
Corollary 2. The least real number such that for every is . Equivalently,
The planar regular hexagon forces every such to be at least . The issue is whether that same base works with prefactor one in every dimension. The question was raised in 2017 [5], motivated by a result of Bakshi, Das, Liu, and Ren [2 Theorem 4.1]. For a finite-index irreducible inclusion of type factors, the number of minimal intermediate subfactors is at most , where and is the basic construction. Theorem 1 thus gives the explicit bound . Cohn [6] anticipated the value and outlined an approach using the finite-dimensional bound of Kabatiansky and Levenshtein.
Throughout, put and . For a unit vector , let
This is the open cone of half-angle about . Its intersection with the unit sphere is the corresponding open spherical cap.
Lemma 3. For distinct members of a kissing configuration, .
Proof. A vector in the intersection could be normalized to a unit vector satisfying
a contradiction.
In dimension one the only unit vectors are and , so .
Deduction from published bounds. For , write for the fraction of the area of covered by a cap of angular radius . For , the estimate of Böröczky and Wintsche [3 Corollary 3.2(i)], also stated in [4 Lemma 3.4, (7)], gives
By Lemma 3, the open caps of angular radius about the points of are disjoint. Hence . For this is strictly smaller than . Squaring reduces the comparison to . It holds at since , and increases for . In dimensions one and two the elementary bounds are 2 and 6 (in the plane the angles between consecutive directions are at least ). For dimensions three through five, the upper bounds 12, 24, and 45 in Bachoc and Vallentin [1 Table 5.1] suffice. Thus results already available before the 2017 question imply Theorem 1. The proofs below derive all the needed low-dimensional estimates directly.
First proof: a spherical-cap recurrence
For and , polar coordinates about the cap center give
Indeed, the polar area element has a factor , and the transverse area cancels. Put . Disjointness gives
Lemma 4. For and ,
In particular, .
Proof. Put and . Substituting gives , with . Give the probability measure and denote its expectation by . Both and are strictly increasing. Thus
since the integrand is positive off the diagonal. It follows that
Integration by parts gives . Dividing the preceding inequality by this ratio gives the result.
First proof of Theorem 1. Direct integration gives and , since by squaring. From the strict recurrence gives in every even dimension . In dimension three, (3) gives . Integrality yields . To start the odd induction we use the stronger coefficient at :
where the last inequality follows from . Thus for every odd as well. Equation (3) proves the result, with strict inequality for . In each dimension the set of realizable cardinalities is nonempty and bounded in the nonnegative integers, so it has a greatest element.
Second proof: explicit Euclidean volumes
The second proof uses the bodies in the registered Lean certificate. For any unit direction , radial integration identifies the fraction of the unit ball in with the cap fraction of § 2. The common radial factor cancels. To obtain a packing bound it suffices to inscribe a body of sufficiently large volume in that sector. We now do this using only Euclidean integration and Lemma 3.
Let be the open unit ball and . Fix in orthogonal coordinates . Rotating any measurable body toward the points of gives disjoint bodies of equal volume by Lemma 3. Thus
For a continuous nonnegative profile on , Fubini’s theorem gives
The coordinate conditions for containment are
A bicone and the dimensions
Consider the union , where
It is a bicone of total height one and common base radius , with the base section omitted. More precisely, each point is a strict convex combination of a point of the disk
with either or . The disk lies in , whereas satisfy the weak inequalities defining their closures. The triangle inequality therefore gives .
By (5), the two cones have volumes and . Hence
The standard ball-volume formula gives
and consequently
The initial estimates
follow by squaring the first comparison and using for the second. Induction on each parity proves for all . In dimension two, the same bicone gives , so integrality gives .
Dimension three
Retain and replace the upper cone by
Together with this fills the entire sector apart from the joining slice , which has volume zero. Indeed, below the cone gives the smaller cross-section, and above the ball does. In particular lies in the cone because implies . Since , formula (5) gives
Here , and the strict inequality uses . Thus (4) yields , hence .
Dimension four
The bicone alone gives . To bring the packing bound below 37 while keeping the volume integral polynomial, retain and raise the upper chord by a quadratic that vanishes at its endpoints. More precisely, set
The coefficient 14 can be seen from the tangent at . There meets the circular profile at height . For the raised chord with coefficient to stay below the circle on the right, its derivative must satisfy , or . The largest integral candidate is 14. The following calculation checks containment on the entire interval. For we have , since . Writing , a factorization gives
Indeed, and the constant and linear coefficients in the last factor are positive because . Thus lies in the ball, and puts it in the cone as in dimension three.
A lower bound for the volume avoids cancellation in the exact integral. Write , , and . Then . The lower cone contributes to the profile integral in (5). For the upper piece use on . Integrating gives
Since , we have , so . Also by . The packing inequality (4) therefore gives
Thus .
Completion of the second proof of Theorem 1. The volume estimates cover every , and the dimension-one observation covers . Thus every kissing configuration satisfies the claimed bound, independently of the first proof. As before, the finite nonempty set of realizable cardinalities has an attained maximum, which is .
Sharpness and the equality case
Proof of Corollary 2. The vertices of a regular hexagon are
with every inner product between distinct vertices at most . These six unit vectors form a kissing configuration. Theorem 1 gives the reverse bound, so .
The base works by the theorem. Conversely, any positive universal base must satisfy , hence . Likewise, in every dimension, with equality at , proving the supremum statement.
Corollary 5. Dimension two is the unique maximizer of among positive integers .
Proof. The regular hexagon gives equality in dimension two, and the first proof of Theorem 1 gives for every .
Formal statements and provenance
The Palomar registration PALOMAR-2026-09-05-000002, version 1 of September 5, 2026, certifies eight statements in Lean 4/Mathlib. They bound every finite kissing configuration, establish the existence of a greatest realizable cardinality, and give the planar value and equivalent formulations of the optimal base. The proof uses the Euclidean bodies of Section 3, including the exceptional profiles in dimensions three and four. For the four-dimensional body the certificate evaluates the integral exactly, while the lower estimate in Section 3.3 suffices here. The cap recurrence and its strict consequence, Corollary 5, are additional informal results.
The registered sources contain the formal statements, proofs, and instructions for reproducing the checks. Comparator matched the challenge statements to the solution. The recorded verification includes checking by Lean’s kernel and independent replay by NanoDa.
The author’s provenance correction of September 5, 2026 attributes the original argument, manuscript, formalization, and registration preparation to OpenAI’s GPT-6 Astra, working from the author’s prompts. The archived metadata records the earlier credits to GPT-5.6 Pro and ChatGPT Work for the proof and to GPT-6 Pro for packaging. OpenAI’s GPT-6.2 Astra assisted with the present manuscript revision. The Lean development and Palomar record are those of the registered version.
Beijing Institute of Mathematical Sciences and Applications (BIMSA), Huairou District, Beijing 101408, China
References
- [1]C. Bahoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, J. Amer. Math. Soc. 21 (2008), 909–924.
- [2]K. C. Bakshi, S. Das, Z. Liu, and Y. Ren, An angle between intermediate subfactors and its rigidity, Trans. Amer. Math. Soc. 371 (2019), 5973–5991.arxiv.org/abs/1710.00285
- [3]K. Böröczky, Jr., and G. Wintsche, Covering the sphere by equal spherical balls, in Discrete and Computational Geometry: The Goodman–Pollack Festschrift, Algorithms Combin. 25, Springer, 2003, 235–251.DOI
- [4]M. Naszódi, On some covering problems in geometry, Proc. Amer. Math. Soc. 144 (2016), 3555–3562.arxiv.org/abs/1404.1691
- [5]S. Palcoux, Upper bound of the kissing number in n dimensions, MathOverflow question 282644 (2017), https://mathoverflow.net/questions/282644/.
- [6]H. Cohn, Answer to “Upper bound of the kissing number in n dimensions”, MathOverflow answer 282685 (2017), https://mathoverflow.net/a/282685/.