A Universal Square-Root-of-Six Bound for Kissing Numbers

Primarily AI-generated textHuman understanding: some partsmath.MG — Metric Geometrymath.CO — Combinatorics

Contributed by Sebastien Palcoux ↗

Version 1 / Nov 18, 2026 / CC BY 4.0

Abstract

The least positive number α\alpha for which the Euclidean kissing numbers satisfy τn≤αn\tau_n\leq\alpha^n in every positive dimension is 6\sqrt{6}. 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 τ2=6\tau_2=6, and the optimality of the base.

Author comments: 6 pages. Includes the deduction from classical spherical-cap bounds, the original subfactor motivation, and an elementary proof that equality occurs only in dimension two. The volume proof uses the same four-dimensional body as the registered Lean certificate, with a shorter estimate for its volume.

Provenance statement

OpenAI’s GPT-6 Astra generated the original mathematical arguments, manuscript, and Lean 4/Mathlib formalization from prompts supplied by Sébastien Palcoux. GPT-6.2 Astra assisted with the November 2026 revision. The Palomar v1 certificate covers the Euclidean-volume proof of the universal bound, attainment of the kissing numbers, the planar value six, and optimality of the base. The cap recurrence and uniqueness of the equality dimension are proved in the manuscript.

Formalizations

Tools used

OpenAI
ChatGPTVersion GPT-6 Astra
OpenAI
ChatGPTVersion GPT-6.2 Astra
Lean
LeanVersion 4.33.0 with Mathlib
Lean proof verification
Comparator and NanoDa

References

  1. C. Bachoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming (https://doi.org/10.1090/S0894-0347-07-00589-9), J. Amer. Math. Soc. 21 (2008), 909--924.DOI
  2. K. C. Bakshi, S. Das, Z. Liu, and Y. Ren, An angle between intermediate subfactors and its rigidity (https://doi.org/10.1090/tran/7738), Trans. Amer. Math. Soc. 371 (2019), 5973--5991.DOI
  3. K. Böröczky, Jr., and G. Wintsche, Covering the sphere by equal spherical balls (https://doi.org/10.1007/978-3-642-55566-4_10), 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 (https://doi.org/10.1090/proc/12992), Proc. Amer. Math. Soc. 144 (2016), 3555--3562.DOI
  5. S. Palcoux, Upper bound of the kissing number in nn dimensions , MathOverflow question 282644 (2017), https://mathoverflow.net/questions/282644/.link
  6. H. Cohn, Answer to ``Upper bound of the kissing number in nn dimensions'' , MathOverflow answer 282685 (2017), https://mathoverflow.net/a/282685/.link

Version history

  1. v1 · 6 pagesSubmitted by Sebastien Palcoux6 pages. Includes the deduction from classical spherical-cap bounds, the original subfactor motivation, and an elementary proof that equality occurs only in dimension two. The volume proof uses the same four-dimensional body as the registered Lean certificate, with a shorter estimate for its volume.CurrentNov 18, 2026