The Tammes problem for fifteen points
Authors/Creators
Description
This is AI-generated research: the results, proofs and code were found and written by AI. Credit goes to all the humans whose work it builds on.
We prove that the largest possible minimal angular distance between fifteen points on the unit sphere is $\arccos u\approx 53.65785^\circ$, where $u$ is the root in $(1/2,7/10)$ of $13u^5-u^4+6u^3+2u^2-3u-1$. This value is attained by two configurations described by Buddenhagen and Kottwitz, whose contact graphs are not isomorphic, so the optimum is not unique. As Musin and Tarasov did for thirteen and fourteen points, a written reduction leads to plane graphs with at most fifteen vertices, and an interval computation rules out each of them except near the two known optima, where a local rigidity estimate concludes. The computation records certificates, and a second program written independently confirms it. Lean 4 proves every step except the enumeration of the plane graphs and their refutation by the program, which enter the formal proof as hypotheses.
Corollary 1.2 of the paper answers in the negative, for $N=15$, Question 2 of Section 6 of Musin and Tarasov, Extremal problems of circle packings on a sphere and irreducible contact graphs, Proc. Steklov Inst. Math. 288 (2015), 117–131 (doi:10.1134/S0081543815010095), numbered as in its Russian version arXiv:1410.0744: is the contact graph of a maximal configuration of $N>5$ points unique up to isomorphism?
Lean 4 with Mathlib proves the main theorem and Corollary 1.2, with only the standard axioms, from two hypotheses checked by computation: D2, the completeness of the list of plane graphs, which plantri enumerates, and the search trees of the program, accepted by interval procedures that it computes and whose certificates the repository replays. Two steps are proved on paper: that the program computes these procedures, and D2 from the description of plantri. A second program, written separately, refutes every graph that the first level of the search leaves.
Code, Lean proofs and certificates: github.com/mt0-svg/tammes-15
Files
tammes-15.pdf
Files
(45.4 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:a3567dd878aca55d2233c512d42a860a
|
5.5 MB | Preview Download |
|
md5:a49d75d94ee6e08d4c7f62451ea5af23
|
764.1 kB | Preview Download |
|
md5:4dc7d5f02412541053f6dcbdabe05f40
|
27.2 MB | Download |
|
md5:164f47eb925df195dd7e12d40115cece
|
5.2 MB | Download |
|
md5:4fbcebeed0aa0e50ede929e566baa5e0
|
6.4 MB | Download |
|
md5:774c63ecd24a1fad824f7b77bcf04c94
|
339.0 kB | Download |
Additional details
References
- C. Bachoc and F. Vallentin: New upper bounds for kissing numbers from semidefinite programming, J. Amer. Math. Soc. 21 (2008), 909-924; arXiv:math/0608426.
- K. Böröczky: The problem of Tammes for n = 11, Studia Sci. Math. Hungar. 18 (1983), 165-171.
- K. Böröczky and L. Szabó: Arrangements of 13 points on a sphere, in: A. Bezdek (ed.), Discrete Geometry, Dekker, New York (2003), 111-184.
- G. Brinkmann and B. D. McKay: Fast generation of planar graphs, MATCH Commun. Math. Comput. Chem. 58 (2007), 323-357; program plantri, version 5.8, with its guide plantri-guide.txt, https://users.cecs.anu.edu.au/~bdm/plantri/.
- J. Buddenhagen and D. A. Kottwitz: Multiplicity and symmetry breaking in (conjectured) densest packings of congruent circles on a sphere, preprint, formerly at buddenbooks.com, archived copy https://web.archive.org/web/20210507001707/http://www.buddenbooks.com/jb/pack/sphere/toggles7.pdf.
- H. Cohn, D. de Laat and N. Leijenhorst: Optimality of spherical codes via exact semidefinite programming bounds, preprint, arXiv:2403.16874 (2024).
- H. Cohn, Y. Jiao, A. Kumar and S. Torquato: Rigidity of spherical codes, Geom. Topol. 15 (2011), 2235-2273; arXiv:1102.5060.
- Comparator, a check that a Lean proof proves a given statement, https://github.com/leanprover/comparator, tag v4.34.0, commit d03acab, with lean4export, https://github.com/leanprover/lean4export, commit 076e8e5.
- R. Connelly: Generic global rigidity, Discrete Comput. Geom. 33 (2005), 549-563.
- L. Danzer: Finite point-sets on S^2 with minimum distance as large as possible, Discrete Math. 60 (1986), 3-66.
- L. Fejes Tóth: Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems, Jber. Deutsch. Math.-Verein. 53 (1943), 66-68.
- L. Fejes Tóth, G. Fejes Tóth and W. Kuperberg: Lagerungen: Arrangements in the Plane, on the Sphere, and in Space, Grundlehren der mathematischen Wissenschaften 360, Springer, Cham (2023); doi:10.1007/978-3-031-21800-2.
- R. J. George, W. Adkisson and A. Anandkumar: FloatLib: Verified floating-point arithmetic in Lean, preprint (2026), arXiv:2609.19352.
- A. Makhorin: GNU Linear Programming Kit, https://www.gnu.org/software/glpk/.
- L. Hárs: The Tammes problem for n = 10, Studia Sci. Math. Hungar. 21 (1986), 439-451.
- D. A. Kottwitz: The densest packing of equal circles on a sphere, Acta Cryst. Sect. A 47 (1991), 158-165.
- L. Kryvonos, L. Liehr and M. A. Taylor: Energy minimization for eight points on the sphere, preprint (2026), arXiv:2609.22077; Lean development at https://github.com/lukasliehr/Energy-Minimization-8-Points, commit 50d14bc.
- landrun, a sandbox for Linux processes based on Landlock, https://github.com/Zouuup/landrun, commit 811cfff.
- L. de Moura and S. Ullrich: The Lean 4 theorem prover and programming language, in: A. Platzer and G. Sutcliffe (eds.), Automated Deduction, CADE 28, Lecture Notes in Comput. Sci. 12699, Springer, Cham (2021), 625-635.
- Float.Model, pull request 14079 of the Lean 4 repository (2026), https://github.com/leanprover/lean4/pull/14079.
- O. Lhomme: Consistency techniques for numeric CSPs, in: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 1993), 232-238.
- The mathlib Community: The Lean mathematical library, in: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020), ACM, New York (2020), 367-381.
- L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier and P. Zimmermann: MPFR: a multiple-precision binary floating-point library with correct rounding, ACM Trans. Math. Software 33 (2007), Art. 13.
- R. C. Mullin and P. J. Schellenberg: The enumeration of c-nets via quadrangulations, J. Combin. Theory 4 (1968), 259-276.
- O. R. Musin and A. V. Nikitenko: Optimal packings of congruent circles on a square flat torus, Discrete Comput. Geom. 55 (2016), 1-20; arXiv:1212.0649.
- O. R. Musin and A. S. Tarasov: The strong thirteen spheres problem, Discrete Comput. Geom. 48 (2012), 128-141; arXiv:1002.1439.
- O. R. Musin and A. S. Tarasov: Extreme problems of circle packings on a sphere and irreducible contact graphs (in Russian), arXiv:1410.0744 (2014); English version: Extremal problems of circle packings on a sphere and irreducible contact graphs, Proc. Steklov Inst. Math. 288 (2015), 117-131. Section and question numbers refer to the arXiv version.
- O. R. Musin and A. S. Tarasov: The Tammes problem for N = 14, Exp. Math. 24 (2015), 460-468; arXiv:1410.2536.
- nanoda_lib, a type checker for the Lean 4 kernel language, https://github.com/ammkrn/nanoda_lib, commit 3a24072.
- T. Nipkow, G. Bauer and P. Schultz: Flyspeck I: Tame graphs, in: U. Furbach and N. Shankar (eds.), Automated Reasoning (IJCAR 2006), Lecture Notes in Comput. Sci. 4130, Springer, Berlin (2006), 21-35.
- OEIS Foundation: The On-Line Encyclopedia of Integer Sequences, sequences A000944 and A290326, https://oeis.org/A000944 and https://oeis.org/A290326.
- The PARI Group: PARI/GP, version 2.17.4, Université de Bordeaux, https://pari.math.u-bordeaux.fr/.
- R. M. Robinson: Arrangement of 24 points on a sphere, Math. Ann. 144 (1961), 17-48.
- B. Roth and W. Whiteley: Tensegrity frameworks, Trans. Amer. Math. Soc. 265 (1981), 419-446.
- The Rust Project: Float semantics, Rust RFC 3514 (2023), https://github.com/rust-lang/rfcs/pull/3514.
- The Rust Project: The Rust standard library, primitive type f64, methods next_up and next_down, stable since Rust 1.86.0, https://doc.rust-lang.org/std/primitive.f64.html.
- The Sage Developers: SageMath, the Sage Mathematics Software System, version 10.9 (2026), https://www.sagemath.org.
- K. Schütte and B. L. van der Waerden: Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?, Math. Ann. 123 (1951), 96-124.
- P. M. L. Tammes: On the origin of number and arrangement of the places of exit on the surface of pollen-grains, Recueil Trav. Bot. Néerl. 27 (1930), 1-84.
- M. Utting, B. J. Webb and I. J. Hayes: Differential testing of a verification framework for compiler optimizations (experience paper), preprint (2022), arXiv:2212.01748.