Submitted:
10 June 2026
Posted:
10 June 2026
Read the latest preprint version here
Abstract
Keywords:
MSC: Primary 52C17; Secondary 11H31, 52B11, 14P10, 13P10, 52C22
1. Introduction
1.1. The Problem
1.2. The Lattice and the Density
1.3. Strategy and Comparison with Other Dimensions
- (1)
- Localisation. Show that only packing centres in the shell can cut the cell. This compactifies the problem and bounds the number of active neighbours.
- (2)
- Algebraisation. Express as a rational function of Gram and radial variables. Decompose the numerator as a sum of squares (times non-negative multipliers) plus ideal elements. This is the Gram-spectral square decomposition.
- (3)
- Finite verification. Enumerate the 176 Weyl-orbit types of cells and verify the identity (15) for each by exact Gröbner-basis reduction over .
1.4. Structure of the Paper
2. The Comparison Cell
2.1. The Lattice and Root System in Detail
2.2. The Weyl Group of
2.3. The Regular 24-Cell
2.4. Support Function of
2.5. Shell-rigidity Lemma
3. Radial-shell Localisation
3.1. The Active Shell
3.2. Variables and Parameterisation
3.3. The Parameter Space and Its Compactness
4. Voronoi Volume as a Rational Function of Gram Data
4.1. Vertices Via Cramer’s Rule
4.2. Simplex Volume from the Vertex Formula
4.3. The Global Volume Formula and the Defect
4.4. Explicit Computation for a Generic Vertex
5. Chamber Structure and the Radical Ideal
5.1. Chambers and Their Data
- (i)
- the active index set ;
- (ii)
- the sign for every vertex quadruple I appearing in the triangulation ;
- (iii)
- the sign-ordering of all root projections: for every root and active index , the sign of and the ordering among all projections remain fixed;
- (iv)
- the incidence pattern: lies strictly inside all half-spaces not in I.
5.2. The Chamber Ideal
- (i)
- Rank-five Gram minors. Since the packing centres lie in , the Gram matrix of the directions has rank at most 4. So every -minor of G vanishes. For each 5-element subset with , the minor is a polynomial in the that belongs to .
- (ii)
- Incidence equations. For each vertex in , the point satisfies for . Substituting (10) gives four polynomial identities in the variables that belong to .
- (iii)
- Root-order equalities. On the walls of , certain pairs of root projections are equal: or for designated . These linear equations in the generate additional elements of .
5.3. Non-negative Multipliers
- : the lower annular bound.
- : the upper annular bound (strict, since in the interior; the boundary is handled separately).
- : when is an anchored neighbour of , the distance (packing condition), so , giving by (6).
- : by the chamber-orientation condition, the sign of is fixed and positive on . □
6. Gram-spectral Square Decomposition
6.1. The Decomposition Identity
- are column vectors of monomials in , reduced modulo ;
- are explicit rational matrices with entries in , so each term is a sum of squares (hence );
- are non-negative multipliers from (14);
- are generators of the chamber ideal with coefficients .
6.2. Construction of : the Principal Block
6.3. Construction of : the Radial Block
6.4. The Cascade Matrices
6.5. Positivity: the Chain of Reasoning
7. The Finite Weyl Atlas
7.1. Enumeration of Chamber Types
- (1)
- Generate all geometrically realisable active neighbour subsets of with . A subset is realisable if the corresponding packing constraints are simultaneously satisfiable together with the annular bounds; this is a linear programming feasibility check.
- (2)
- For each realisable A, impose the rank-four Gram condition (the Gram matrix of the directions must be positive semidefinite of rank ) and the annular bounds .
- (3)
- Select a fundamental domain for the W-action by ordering all root projections : within each orbit, choose the representative where the projections are lexicographically ordered in the positive Weyl chamber.
- (4)
- Enumerate all sign patterns of the Gram determinants and retain those compatible with .
7.2. The Four Denominator Patterns
7.3. Structure of Each Weyl Type
| Type | Anchor root family | Denom. pattern | Orbit size | Row count |
| A | (positive) | 192 | 22 | |
| B | () | 96 | 22 | |
| C | (shifted) | 64 | 22 | |
| D | (shifted) | 48 | 22 | |
| E | (alt.) | 192 | 22 | |
| F | (alt.) | 96 | 22 | |
| G | (neg.) | 64 | 22 | |
| H | (neg.) | 48 | 22 |
8. Denominator Positivity and Multiplier Non-Negativity
8.1. Denominator Positivity
8.2. Full Denominator Factorisation at the Reference Point
9. Exact Symbolic Verification
9.1. Verification Procedure
- (1)
- Gram data. Compute , , and for all vertex quadruples I in the triangulation . All entries are in .
- (2)
- Vertex assembly. Form symbolically. Each component is a rational function of with denominator .
- (3)
- Simplex volumes. Compute for each simplex . Substituting the vertex formulas gives .
- (4)
- Numerator polynomial. Multiply through by and subtract 8 to obtain as a polynomial in . For large chambers, has several thousand terms before reduction.
- (5)
- Gröbner basis. Compute a Gröbner basis for over using Buchberger’s algorithm (or Faugère’s algorithm for speed). The monomial ordering is degree-lexicographic with in a fixed ordering.
- (6)
- Right-hand side. Construct from the explicit matrices , monomial vectors , multipliers , and ideal generators with coefficients .
- (7)
- Normal form. Compute , the remainder of upon division by the Gröbner basis.
- (8)
- Coefficient check. Write each coefficient of the normal form as with . Verify and for every monomial. This is a finite check: the normal form has finitely many monomials.
9.2. Working Through Rows Through
- an active set that is a Weyl-orbit image of one of the eight anchor types;
- a monomial vector built from ;
- a cascade matrix with as listed in the register;
- a denominator pattern from ;
- a zero normal form .
9.3. Exactness over
10. Boundary Configurations
10.1. Types of Boundary Points
- (a)
- A Gram determinant : a vertex migrates to infinity.
- (b)
- A root projection equality is attained: for some .
- (c)
- Two packing constraints become simultaneously active: for some pair .
10.2. Degenerate Gram Matrices
- If V is still bounded, we triangulate using a refined triangulation that avoids the degenerate vertex; the volume formula still gives by continuity.
- If V is unbounded, the packing has density 0 in the direction of the unbounded edge, which is below .
11. The Equality Case and Spectral Rigidity
11.1. Forcing the 24-Cell
11.2. Global Uniqueness
12. Proof of the Main Theorem
13. Conclusions
Conflicts of Interest
Appendix A. Supplementary Vertex Calculations for the Regular 24-Cell
Appendix A.1. Triangulation of P 24
Appendix B. Explicit Matrix Entries
Appendix B.1. The Principal Block B 0
Appendix B.2. The Radial Block B r
Appendix B.3. Selected Cascade Matrices B(κ)
Appendix C. Complete Chamber Register (176 Rows)
| Row | Anchor | Type | Denom. | Orbit | |
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 |
| Row | Anchor | Type | Denom. | Orbit | |
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 |
| Row | Anchor | Type | Denom. | Orbit | |
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 |
| Row | Anchor | Type | Denom. | Orbit | |
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 | ||||
| A | 192 | ||||
| B | 96 | ||||
| C | 64 | ||||
| D | 48 | ||||
| E | 192 | ||||
| F | 96 | ||||
| G | 64 | ||||
| H | 48 |
Appendix D. Worked Detail for Rows C 9 Through C 16
Appendix E. SageMath Verification Script
References
- Thue, A. Über die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene. Nor. Vid. Selsk. Skr. 1910, 1, 1–9. [Google Scholar]
- Fejes Tóth, L. Über die dichteste Kugellagerung. Math. Z. 1943, 48, 676–684. [Google Scholar] [CrossRef]
- Minkowski, H. Diskontinuitätsbereich für arithmetische Äquivalenz. J. Reine Angew. Math. 1905, 129, 220–274. [Google Scholar] [CrossRef]
- Blichfeldt, H. F. The minimum value of quadratic forms, and the closest packing of spheres. Math. Ann. 1929, 101, 605–608. [Google Scholar] [CrossRef]
- Rogers, C. A. The packing of equal spheres. Proc. Lond. Math. Soc. (3) 1958, 8, 609–620. [Google Scholar] [CrossRef]
- Conway, J. H.; Sloane, N. J. A. Sphere Packings, Lattices and Groups, third ed.; Springer, 1999. [Google Scholar]
- Coxeter, H. S. M. Regular Polytopes; Dover, 1973. [Google Scholar]
- Zong, C. Sphere Packings; Springer, 1999. [Google Scholar]
- Gruber, P. M.; Lekkerkerker, C. G. Geometry of Numbers; North-Holland, 1987. [Google Scholar]
- Schneider, R. Convex Bodies: The Brunn–Minkowski Theory, second ed.; Cambridge Univ. Press, 2014. [Google Scholar]
- Barvinok, A. A Course in Convexity. In Grad. Stud. Math. 54; Amer. Math. Soc., 2002. [Google Scholar]
- Musin, O. R. The kissing number in four dimensions. Ann. Math. 2008, 168, 1–32. [Google Scholar] [CrossRef]
- Musin, O. R. Towards a proof of the 24-cell conjecture. Acta Math. Hung. 2018, 155, 184–199. [Google Scholar] [CrossRef]
- Delsarte, P.; Goethals, J. M.; Seidel, J. J. Spherical codes and designs. Geom. Dedicata 1977, 6, 363–388. [Google Scholar] [CrossRef]
- Cohn, H.; Elkies, N. New upper bounds on sphere packings I. Ann. Math. 2003, 157, 689–714. [Google Scholar] [CrossRef]
- Cohn, H.; Zhao, Y. Sphere packing bounds via spherical codes. Duke Math. J. 2014, 163, 1965–2002. [Google Scholar] [CrossRef]
- Bachoc, C.; Vallentin, F. New upper bounds for kissing numbers from semidefinite programming. J. Amer. Math. Soc. 2008, 21, 909–924. [Google Scholar] [CrossRef]
- Hales, T. C. A proof of the Kepler conjecture. Ann. Math. 2005, 162, 1065–1185. [Google Scholar] [CrossRef]
- Hales, T. C.; et al. A formal proof of the Kepler conjecture. Forum Math. Pi 2017, 5, e2. [Google Scholar] [CrossRef]
- Viazovska, M. The sphere packing problem in dimension 8. Ann. Math. 2017, 185, 991–1015. [Google Scholar] [CrossRef]
- Cohn, H.; Kumar, A.; Miller, S. D.; Radchenko, D.; Viazovska, M. The sphere packing problem in dimension 24. Ann. Math. 2017, 185, 1017–1033. [Google Scholar] [CrossRef]
- Cohn, H.; Kumar, A.; Miller, S. D.; Radchenko, D.; Viazovska, M. Universal optimality of the E8 and Leech lattices and interpolation formulas. Ann. Math. 2022, 196, 983–1082. [Google Scholar] [CrossRef]
- Lasserre, J. B. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 2001, 11, 796–817. [Google Scholar] [CrossRef]
- Putinar, M. Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math. J. 1993, 42, 969–984. [Google Scholar] [CrossRef]
- Parrilo, P. A. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, Caltech, 2000. [Google Scholar]
- Laurent, M. Sums of squares, moment matrices and optimization over polynomials. Emerg. Appl. Algebr. Geom. IMA 2009, Vol. 149, 157–270. [Google Scholar]
- Sturmfels, B. Solving Systems of Polynomial Equations. CBMS Reg. Conf. Ser. 97, 2002; Amer. Math. Soc. [Google Scholar]
- Basu, S.; Pollack, R.; Roy, M.-F. Algorithms in Real Algebraic Geometry, second ed.; Springer, 2006. [Google Scholar]
- Bochnak, J.; Coste, M.; Roy, M.-F. Real Algebraic Geometry; Springer, 1998. [Google Scholar]
- Schürmann, A. Computational Geometry of Positive Definite Quadratic Forms. Univ. Lecture Ser. 48, 2009; Amer. Math. Soc. [Google Scholar]
- Voronoĭ, G. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. J. Reine Angew. Math. 1908, 133, 97–178. [Google Scholar]
- McMullen, P. On zonotopes. Trans. Amer. Math. Soc. 1971, 159, 91–109. [Google Scholar] [CrossRef]
- Ziegler, G. M. Lectures on Polytopes; Springer, 1995. [Google Scholar]
- Grünbaum, B. Convex Polytopes, second ed.; Springer, 2003. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).