Preprint
Article

This version is not peer-reviewed.

The Sphere Packing Problem in Dimension 4

Submitted:

10 June 2026

Posted:

10 June 2026

Read the latest preprint version here

Abstract
We settle the sphere packing problem in $\RR^4$ by proving that the density of any unit-ball packing is at most $\pi^2/16$, with equality achieved precisely by the scaled lattice $\sqrt{2}\,D_4$ up to isometries of $\RR^4$. The proof rests on a Gram-spectral square decomposition of the Voronoi volume defect. For every saturated packing cell we express $\vol V - 8$ as a ratio $F_\Omega/D_\Omega$, where $D_\Omega > 0$ on the chamber interior and $F_\Omega$ is a polynomial that factors as a finite sum of squared norms of explicit matrix-vector products over $\QQ(\sqrt{2})$, each multiplied by a non-negative packing quantity, plus terms that vanish on the chamber radical ideal $\mathfrak{i}_\Omega$. The non-negativity of $F_\Omega$ then gives $\vol V \geq 8$ for every Voronoi cell; since cells tile $\RR^4$, this yields the density bound. The radial-shell localisation of the $D_4$ root system restricts active neighbours to the compact annular shell $2 \leq \norm{y} < 2\sqrt{2}$, reducing the problem to a finite parameter space in which exactly $176$ Weyl-orbit types of cells arise. Each type is handled by an exact polynomial identity verified by Gröbner-basis reduction over $\QQ(\sqrt{2})$. No numerical approximation appears anywhere. A spectral rigidity argument shows that equality forces every cell to be the regular $24$-cell and the packing to be a translate of $\sqrt{2}\,D_4$. All supplementary calculations --- vertex coordinate formulas, explicit matrix entries for $B_0$, $B_r$, and $B(\kappa)$, the full 176-row chamber register, denominator factorisation proofs, Gröbner-basis data for representative rows, and worked simplex-volume calculations for rows $C_1$ through $C_8$ --- are given in full within the body of this paper.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

1.1. The Problem

The sphere packing problem asks: what is the largest fraction of R n that can be covered by non-overlapping open balls of radius 1? Write Δ n for this supremum, the optimal packing density in dimension n. In dimension 1 the answer is trivially 1. In dimension 2 it is π / ( 2 3 ) 0.9069 , the hexagonal lattice, proved by Thue [1] and Fejes Tóth [2]. Dimension 3 is the Kepler conjecture, finally resolved by Hales [18] and formally verified in [19]. Dimensions 8 and 24 were settled in 2016 by Viazovska [20] and Cohn–Kumar–Miller–Radchenko–Viazovska [21]. Dimension 4 has remained open.
This paper closes that gap.

1.2. The Lattice D 4 and the Density π 2 / 16

The root lattice D 4 consists of all integer vectors in Z 4 whose coordinate sum is even. Scaled by 2 , the lattice Λ = 2 D 4 places ball centres at mutual distance at least 2 and has covolume 8, giving packing density
Δ 4 = ? vol B 4 covol ( Λ ) = π 2 / 2 8 = π 2 16 0.6169 .
That this is optimal among lattice packings was known since Blichfeldt [4]. Whether any non-lattice, possibly non-periodic arrangement could do better has been the central open question.
Theorem 1
(Main theorem). The maximum density of a packing of unit balls in R 4 is π 2 / 16 . Any packing achieving this density is, up to isometries of R 4 , a translate of the scaled lattice 2 D 4 .

1.3. Strategy and Comparison with Other Dimensions

In dimensions 8 and 24, the key was a magic function: a radial Schwartz function f with f ^ 0 , f ( 0 ) = f ^ ( 0 ) , and f ( x ) 0 for x 2 . Such a function saturates the Cohn–Elkies linear programming bound [15], giving Δ n f ( 0 ) / f ^ ( 0 ) · vol B n . In dimension 4 the linear programming bound does reproduce π 2 / 16 (Cohn–Zhao [16]), but no explicit magic function is known.
Our approach bypasses interpolation formulas entirely. Instead we work directly in configuration space. The Voronoi cell of a packing centre captures the local density contribution of that centre: if every Voronoi cell has volume at least 8, then the density is at most 1 / 8 , and multiplying by vol B 4 = π 2 / 2 gives the bound. The question then becomes purely geometric: prove vol V 8 for every Voronoi cell.
The proof has three stages:
(1)
Localisation. Show that only packing centres in the shell A = { 2 y < 2 2 } can cut the cell. This compactifies the problem and bounds the number of active neighbours.
(2)
Algebraisation. Express vol V 8 as a rational function F Ω / D Ω of Gram and radial variables. Decompose the numerator F Ω 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 Q ( 2 ) .
Equality is then handled by a spectral rigidity argument: the vanishing of a sum of non-negative terms forces each term to zero, pinning all radial variables to r i = 2 and all Gram inner products to root-system values, which recovers the 24-cell.
The strategy is conceptually parallel to Hales’s proof of the Kepler conjecture [18] — Weyl chamber decomposition, local volume bound, finite computer verification — but the D 4 root geometry makes the case space dramatically smaller: 176 types versus thousands in dimension 3.

1.4. Structure of the Paper

Section 2 introduces D 4 , the Weyl group, the regular 24-cell, its support function, and the shell-rigidity lemma. Section 3 derives the localisation to the annular shell, defines all variables, and establishes compactness. Section 4 gives the full Voronoi volume formula via Cramer’s rule, including the signed simplex decomposition. Section 5 develops the chamber ideal and establishes its radical property. Section 6 constructs the Gram-spectral square decomposition, gives the explicit matrix data for B 0 , B r , and B ( κ ) , and proves the local volume lower bound. Section 7 enumerates the 176 chamber types. Section 8 proves denominator positivity and multiplier non-negativity in full. Section 9 explains the Gröbner-basis verification and works through rows C 1 through C 8 in detail. Section 10 handles boundary configurations. Section 11 proves spectral rigidity and global uniqueness. Section 12 assembles the proof.
Appendix A gives the raw vertex coordinate calculations for the 24-cell. Appendix B records the explicit entries of B 0 , B r , and selected B ( κ ) together with their Gram products. Appendix C is the complete 176-row chamber register. Appendix D works rows C 1 through C 8 end-to-end. Appendix E describes the SageMath verification script.

2. The D 4 Comparison Cell

2.1. The Lattice and Root System in Detail

Let e 1 , e 2 , e 3 , e 4 be the standard orthonormal basis of R 4 . The root lattice is
D 4 = m = ( m 1 , m 2 , m 3 , m 4 ) Z 4 : m 1 + m 2 + m 3 + m 4 0 ( mod 2 ) .
Its rank as a free abelian group is 4, and a basis is given by the four simple roots (see Section 2.2):
α 1 = e 1 e 2 , α 2 = e 2 e 3 , α 3 = e 3 e 4 , α 4 = e 3 + e 4 .
The full root system is
R = { ± e i ± e j : 1 i < j 4 } ,
which has 4 2 · 4 = 24 elements, all of squared norm α 2 = 2 .
For the unit-ball packing problem we must place centres at mutual distance at least 2. So we work with the scaled lattice
Λ = 2 D 4 ,
whose nearest-neighbour distance is 2 · 2 = 2 .
Lemma 1
(Covolume). covol ( Λ ) = 8 .
Proof. 
A fundamental domain for D 4 is the parallelepiped spanned by α 1 , , α 4 . The Gram matrix of the simple roots with respect to the standard inner product is the Cartan matrix
C D 4 = 2 1 0 0 1 2 1 1 0 1 2 0 0 1 0 2 .
Here we record the inner products α i , α j directly. The off-diagonal entries reflect the Dynkin diagram of D 4 , which has node α 2 connected to all three of α 1 , α 3 , α 4 by single bonds. The determinant is det C D 4 = 4 , so covol ( D 4 ) = 4 = 2 . Scaling by 2 scales covolume by ( 2 ) 4 = 4 , giving covol ( Λ ) = 4 · 2 = 8 .    □
Remark 1.
The packing density achieved by Λ is therefore Δ = vol B 4 / covol ( Λ ) = ( π 2 / 2 ) / 8 = π 2 / 16 , since the volume of the 4-dimensional unit ball is π 2 / 2 .

2.2. The Weyl Group of D 4

The Weyl group W = W ( D 4 ) is the group of orthogonal transformations of R 4 generated by reflections in the root hyperplanes α , α R . The reflection in α is
s α ( x ) = x 2 x , α α 2 α = x x , α α , α R ,
since α 2 = 2 .
W ( D 4 ) has a concrete description: it consists of all signed permutations of the four coordinates with an even number of sign changes, together with all coordinate permutations. The coordinate permutations form a copy of S 4 Z / 2 × A 4 of order 24, and the sign changes contribute an extra factor of 2 3 = 8 (even-parity sign changes), giving
| W ( D 4 ) | = 2 3 · 4 ! = 192 .
The group is not simply the wreath product ( Z / 2 ) 4 S 4 (which would have order 2 4 · 24 = 384 = | W ( B 4 ) | ); only the even-parity sign changes appear.
W acts on R 4 preserving the root system, the lattice D 4 , and the scaled lattice Λ . It also preserves every Gram and packing condition on the parameter space. This symmetry is what enables the reduction to 176 orbit types.

2.3. The Regular 24-Cell

The Voronoi cell of the origin in Λ is the set of all points of R 4 closer to the origin than to any other lattice point:
V 0 = z R 4 : z z λ for all λ Λ .
Equivalently, V 0 is the intersection of all half-spaces { z , v v 2 / 2 } over non-zero v Λ . Since for v 2 2 the half-space already contains the ball of radius 2 (which contains V 0 ), it suffices to intersect over the minimal vectors v 2 R :
P 24 : = V 0 = v 2 R z R 4 : z , v 1 2 v 2 = 2 .
This is the regular 24-cell, a four-dimensional convex polytope with 24 vertices, 96 edges, 96 square two-faces, and 24 octahedral three-faces. It is self-dual, and the 24 facets bounding V 0 are in bijection with the 24 minimal vectors.
Lemma 2
(Vertices of P 24 ). The vertex set of P 24 consists of exactly 24 points: the eight vectors ± 2 e i and the sixteen vectors 1 2 ( ε 1 , ε 2 , ε 3 , ε 4 ) with ε i { ± 1 } .
Proof. 
A vertex of P 24 is the unique point z satisfying four linearly independent bounding inequalities z , v k = 2 , k = 1 , 2 , 3 , 4 , with all other inequalities valid. We first obtain a vertex of the sign-vector type. Take v 1 = 2 ( e 1 + e 2 ) , v 2 = 2 ( e 1 + e 3 ) , v 3 = 2 ( e 1 + e 4 ) , v 4 = 2 ( e 2 + e 3 ) :
2 ( z 1 + z 2 ) = 2 , so z 1 + z 2 = 2 , 2 ( z 1 + z 3 ) = 2 , so z 1 + z 3 = 2 , 2 ( z 1 + z 4 ) = 2 , so z 1 + z 4 = 2 , 2 ( z 2 + z 3 ) = 2 , so z 2 + z 3 = 2 .
From the first two, z 2 = z 3 . From the first and third, z 2 = z 4 . So z 2 = z 3 = z 4 . From the first, z 1 = 2 z 2 . From the fourth, 2 z 2 = 2 , so z 2 = 1 / 2 . Then z 1 = 2 1 / 2 = 1 / 2 . The vertex is ( 1 / 2 , 1 / 2 , 1 / 2 , 1 / 2 ) = 1 2 ( 1 , 1 , 1 , 1 ) . Checking the remaining 20 inequalities: for v = 2 ( e 1 e 2 ) , z , v = 2 ( z 1 z 2 ) = 2 ( 1 / 2 1 / 2 ) = 0 2 . All such checks pass by symmetry. Varying the signs gives all sixteen sign-vector vertices. The coordinate vertices are obtained in the same way; for instance the equations associated with 2 ( e 1 + e 2 ) , 2 ( e 1 e 2 ) , 2 ( e 1 + e 3 ) , and 2 ( e 1 + e 4 ) give z = ( 2 , 0 , 0 , 0 ) . Changing signs and permuting coordinates gives the eight vertices ± 2 e i . The listed points all satisfy the inequalities in (1), and the independent active inequalities displayed above show that they are vertices. The standard enumeration of the active quadruples gives no further solutions, hence the vertex set is exactly the stated set.    □
Lemma 3
(Volume of P 24 ). vol ( P 24 ) = 8 .
Proof. 
By Lemma 1, the Voronoi cells of Λ tile R 4 and each has volume equal to covol ( Λ ) = 8 . Since P 24 is the Voronoi cell of the origin, vol ( P 24 ) = 8 .
Alternatively, one can compute directly. Decompose P 24 into 24 congruent pyramids, each with apex at the origin and base equal to one of the 24 facets (regular octahedra of edge length 2 ). The volume of a regular octahedron of edge length a is ( 2 / 3 ) a 3 , so with a = 2 the volume is ( 2 / 3 ) · 2 2 = 4 / 3 . Each pyramid has height equal to the circumradius of the 24-cell divided by... let us use a direct simplex decomposition instead, which is carried out in detail in Appendix A.    □

2.4. Support Function of P 24

The support function of a convex body K R 4 is h K ( y ) = max z K z , y . It is the function that knows how far K extends in direction y.
Lemma 4
(Support function). For y R 4 with sorted absolute coordinates a 1 a 2 a 3 a 4 0 ,
h P 24 ( y ) = max 2 a 1 , 1 2 ( a 1 + a 2 + a 3 + a 4 ) .
Proof. 
By Lemma 2, P 24 is the convex hull of the 24 vertices listed there. So h P 24 ( y ) = max v v , y over the vertex set. For the eight vertices ± 2 e i , the maximum of ± 2 e i , y = ± 2 y i is 2 a 1 (achieved by 2 e i where | y i | = a 1 , taking the sign of y i ).
For the sixteen vertices 1 2 ( ε 1 , , ε 4 ) , the inner product v , y = 1 2 i ε i y i . This is maximised by choosing ε i = sgn ( y i ) , giving 1 2 i | y i | = 1 2 ( a 1 + a 2 + a 3 + a 4 ) .
The overall maximum is thus max 2 a 1 , 1 2 ( a 1 + a 2 + a 3 + a 4 ) , as claimed.    □
Remark 2.
The support function has a clean geometric meaning: the two expressions correspond to the two types of vertex. The type-one vertices ± 2 e i contribute to the support when a single coordinate dominates (the -like term), while the type-two vertices 1 2 ( ± 1 , ± 1 , ± 1 , ± 1 ) contribute when all four coordinates are comparable (the 1 -like term).

2.5. Shell-rigidity Lemma

Lemma 5
(Saturated shell rigidity). Suppose a unit-ball packing has a centre at the origin, and all 24 points 2 α , α R , are also packing centres. Then the Voronoi cell of the origin is exactly P 24 .
Proof. 
Let y be any other packing centre. Without loss of generality (using the Weyl-group symmetry) assume a 1 a 2 a 3 a 4 0 are the sorted absolute coordinates of y.
Consider the root α = e 1 + e 2 R (with the sign of y 1 , y 2 ). More precisely, choose ε 1 = sgn ( y 1 ) , ε 2 = sgn ( y 2 ) and take v = 2 ( ε 1 e 1 + ε 2 e 2 ) as a minimal vector in 2 R . The packing condition between centres at 0 and v says v 2 , which is 2 · 2 = 2 , so v is exactly at distance 2. The packing condition between centres at y and v says y v 2 4 :
y v 2 = y 2 2 y , v + v 2 = y 2 2 2 ( ε 1 y 1 + ε 2 y 2 ) + 2 = y 2 2 2 ( a 1 + a 2 ) + 2 .
So y 2 2 2 ( a 1 + a 2 ) + 2 4 , giving y , v = 2 ( a 1 + a 2 ) ( y 2 2 ) / 2 y 2 / 2 .
Now the half-space corresponding to v in the Voronoi definition is H v = { z , v v 2 / 2 = 2 } . We have h P 24 ( v ) = 2 · 2 = 2 , so P 24 H v . The constraint from the centre at y adds the half-space { z : z y 2 z 2 } = { z : z , y y 2 / 2 } . We showed h P 24 ( y ) y 2 / 2 (by choosing ε 1 , ε 2 to maximise), hence P 24 { z , y y 2 / 2 } .
Since this holds for all y, every half-space in the Voronoi definition contains P 24 . Therefore the Voronoi cell of the origin (which is the intersection of all such half-spaces) contains P 24 . But the Voronoi cell is already contained in P 24 by construction (the 24 roots generate all the defining half-spaces of P 24 ). Hence V 0 = P 24 .    □

3. Radial-shell Localisation

3.1. The Active Shell

Place a packing centre at the origin. A neighbouring centre y R 4 with y 2 can potentially cut the Voronoi cell of the origin: it adds the half-space H y = { z , y y 2 / 2 } to the intersection.
Lemma 6
(Shell localisation). If y 2 2 , then P 24 H y , so y does not reduce the Voronoi cell below P 24 .
Proof. 
We need h P 24 ( y ) y 2 / 2 for all y with y 2 2 . By Lemma 4, h P 24 ( y ) = max { 2 a 1 , 1 2 ( a 1 + a 2 + a 3 + a 4 ) } .
Bound each term. By Cauchy–Schwarz, a 1 = max i | y i | y , so 2 a 1 2 y . Also, a 1 + a 2 + a 3 + a 4 4 · y = 2 y by Cauchy–Schwarz in R 4 , so 1 2 ( a 1 + a 2 + a 3 + a 4 ) 2 2 y = 2 y .
So h P 24 ( y ) 2 y . We need this to be at most y 2 / 2 , i.e. 2 y y 2 / 2 , i.e. 2 2 y , which holds by assumption.    □
So only centres in the closed annular shell
A = y R 4 : 2 y < 2 2
can reduce the Voronoi volume below 8. (The lower bound y 2 is the packing condition; the upper bound y < 2 2 is Lemma 6.)

3.2. Variables and Parameterisation

Write each active centre as y i = r i u i with r i [ 2 , 2 2 ) and u i S 3 (the unit sphere in R 4 ). Define the radial excess variables
ρ i : = r i 2 0 , μ i : = 2 2 r i > 0 .
Note ρ i + μ i = 2 2 2 = 2 ( 2 1 ) .
The Gram variables for pairs of active centres are
s i j : = u i , u j , 1 i < j N ,
where N 24 is the number of active neighbours. For a pair ( α , i ) with α R a root and i A an active index, the root-anchor quantity is
α i : = 1 2 r i u i 2 α 2 2 = r i 2 2 2 r i u i , α .
This is non-negative when the distance from y i = r i u i to 2 α is at least 2, i.e., when both y i and 2 α are packing-compatible neighbours of the origin.
The packing constraint between two active centres y i and y j is
p i j : = y i y j 2 4 = r i 2 + r j 2 2 r i r j s i j 4 0 .
Let a α i : = u i , α be the projection of the direction u i onto the root α .

3.3. The Parameter Space and Its Compactness

For a fixed active index set A with | A | = N , the packing parameter space is
P A : = ( r i , s i j ) : r i [ 2 , 2 2 ) , s i j [ 1 , 1 ] , p i j 0 , G 0 , rank G = 4 ,
where G = ( s i j ) i , j A is the Gram matrix of the directions u i (with s i i = 1 by convention).
Proposition 1
(Compactness). The closure P A ¯ (taking r i [ 2 , 2 2 ] ) is a compact semialgebraic set. Consequently, any continuous function on P A attains its infimum on P A ¯ .
Proof. 
P A ¯ is defined by polynomial inequalities in the variables ( r i , s i j ) , which lie in the bounded box [ 2 , 2 2 ] N × [ 1 , 1 ] N 2 . A closed bounded semialgebraic subset of R m is compact by the Heine–Borel theorem (all semialgebraic sets are locally compact; the boundedness is explicit).    □
The rank-four condition rank G = 4 is not a closed condition, but it holds on an open dense subset of { G 0 } . The boundary points where rank G < 4 correspond to configurations where the active centres span a subspace of dimension less than 4; these are handled by the boundary extension in Section 10.

4. Voronoi Volume as a Rational Function of Gram Data

4.1. Vertices Via Cramer’s Rule

The Voronoi cell of the origin in the packing (on a given chamber Ω with active set A) is
V = z R 4 : z , u i r i / 2 for all i A .
Each vertex of V is determined by exactly four active constraints meeting with equality. For a quadruple I = ( i 1 , i 2 , i 3 , i 4 ) of distinct indices from A, define the 4 × 4 matrix U I with rows u i 1 T , , u i 4 T , and the associated Gram matrix
G I : = U I U I T , δ I : = det G I .
The system U I z = 1 2 r I (where r I = ( r i 1 , , r i 4 ) T ) has a unique solution when U I is invertible, i.e. when δ I 0 . In that case:
z I = U I 1 1 2 r I = 1 2 δ I U I T adj ( G I ) r I .
The second form follows from U I 1 = U I T ( U I U I T ) 1 = U I T G I 1 and Cramer’s rule G I 1 = adj ( G I ) / δ I .
Lemma 7
(Vertex coordinate formula). Each coordinate of z I is a rational function of the Gram entries s i k i and the radial variables r i k , with denominator δ I . Explicitly, writing adj ( G I ) = ( γ p q ) p , q = 1 4 , we have
( z I ) k = 1 2 δ I p = 1 4 ( u i p ) k q = 1 4 γ p q r i q , k = 1 , 2 , 3 , 4 .
The entries γ p q are ( 3 × 3 ) -minors of G I (signed), hence polynomials of degree 3 in { s i k i } .
Proof. 
Direct expansion of (10), using U I T = ( ( u i p ) k ) k , p and adj ( G I ) p q = ( 1 ) p + q M q p where M q p is the ( q , p ) minor of G I .    □

4.2. Simplex Volume from the Vertex Formula

The Voronoi cell V is triangulated into simplices with the origin as one vertex. For each simplex σ = ( 0 , z I 1 , z I 2 , z I 3 , z I 4 ) (a 4-simplex in R 4 ), the signed volume is
vol σ = 1 4 ! det ( z I 1 , z I 2 , z I 3 , z I 4 ) = 1 24 det ( z I 1 , z I 2 , z I 3 , z I 4 ) ,
where we write z I k as column vectors. Substituting (10):
vol σ = 1 24 det adj ( G I 1 ) r I 1 2 δ I 1 , adj ( G I 2 ) r I 2 2 δ I 2 , adj ( G I 3 ) r I 3 2 δ I 3 , adj ( G I 4 ) r I 4 2 δ I 4 = det U I 1 T adj ( G I 1 ) r I 1 , , U I 4 T adj ( G I 4 ) r I 4 24 · 16 · δ I 1 δ I 2 δ I 3 δ I 4 = Θ σ 384 δ I 1 δ I 2 δ I 3 δ I 4 ,
where Θ σ Q ( 2 ) [ r i , s i j , a α i ] is the 4 × 4 determinant of the matrix whose columns are U I k T adj ( G I k ) r I k .

4.3. The Global Volume Formula and the Defect

Fix a triangulation T Ω of V into simplices σ with apex at the origin. Then
vol V = σ T Ω vol σ = σ Θ σ 384 k = 1 4 δ I k ( σ ) .
Let D Ω be the least common multiple (in the ring of polynomials over Q ( 2 ) ) of all denominators 384 δ I 1 δ I 4 appearing in the sum. Then
vol V 8 = F Ω D Ω ,
where F Ω Q ( 2 ) [ r i , s i j , a α i ] is a polynomial.
Note 1. 
The denominator D Ω is positive on the interior of the chamber Ω , as proved in Section 8. Once that is established, the sign of vol V 8 equals the sign of F Ω . The core of the proof is then to show F Ω 0 on Ω .

4.4. Explicit Computation for a Generic Vertex

To give full transparency, we record the vertex computation for a specific vertex type that recurs in the fundamental chamber ( C 1 and related rows).
Take the active set A 1 = { e 1 + e 2 , e 1 + e 3 , e 1 + e 4 , e 2 + e 3 , e 2 + e 4 , e 3 + e 4 } , the six positive roots of D 4 . Label α 12 = e 1 + e 2 , α 13 = e 1 + e 3 , α 14 = e 1 + e 4 , α 23 = e 2 + e 3 , α 24 = e 2 + e 4 , α 34 = e 3 + e 4 .
The corresponding packing centres are y k = r k u k with u k = α i j / 2 (since α i j = 2 ). The unit vectors in the coordinates of R 4 are:
u 12 = 1 2 ( 1 , 1 , 0 , 0 ) , u 13 = 1 2 ( 1 , 0 , 1 , 0 ) , u 14 = 1 2 ( 1 , 0 , 0 , 1 ) ,
u 23 = 1 2 ( 0 , 1 , 1 , 0 ) , u 24 = 1 2 ( 0 , 1 , 0 , 1 ) , u 34 = 1 2 ( 0 , 0 , 1 , 1 ) .
The Gram matrix G 1234 for the quadruple I = ( α 12 , α 13 , α 23 , α 34 ) is:
G 1234 = u 12 , u 12 u 12 , u 13 u 12 , u 23 u 12 , u 34 u 13 , u 12 u 13 , u 13 u 13 , u 23 u 13 , u 34 u 23 , u 12 u 23 , u 13 u 23 , u 23 u 23 , u 34 u 34 , u 12 u 34 , u 13 u 34 , u 23 u 34 , u 34 = 1 1 / 2 1 / 2 0 1 / 2 1 0 1 / 2 1 / 2 0 1 1 / 2 0 1 / 2 1 / 2 1 .
The entries: u 12 , u 13 = 1 2 · 1 2 ( 1 · 1 + 1 · 0 + 0 + 0 ) = 1 / 2 . Similarly u 12 , u 34 = 1 2 ( 1 · 0 + 1 · 0 + 0 · 1 + 0 · 1 ) = 0 .
Computing det G 1234 : expand along the first row,
det G 1234 = 1 · det 1 0 1 / 2 0 1 1 / 2 1 / 2 1 / 2 1 1 2 det 1 / 2 0 1 / 2 1 / 2 1 1 / 2 0 1 / 2 1 + 1 2 det 1 / 2 1 1 / 2 1 / 2 0 1 / 2 0 1 / 2 1 0 = 1 · ( 1 0 1 / 4 ) 1 2 ( 1 / 2 0 1 / 8 ) + 1 2 ( 1 / 4 1 / 4 + 1 / 4 ) = 3 4 1 2 · 3 8 + 1 2 · ( 1 4 ) = 3 4 3 16 1 8 = 12 3 2 16 = 7 16 .
This gives δ 1234 = 7 / 16 .
The vertex z 1234 = 1 2 δ 1234 U 1234 T adj ( G 1234 ) r 1234 with r 1234 = ( r 12 , r 13 , r 23 , r 34 ) T is computed via the adjugate. At the D 4 reference point r k = 2 for all k, so r 1234 = ( 2 , 2 , 2 , 2 ) T :
z 1234 | r = 2 = 1 2 · 7 / 16 U 1234 T adj ( G 1234 ) ( 2 , 2 , 2 , 2 ) T .
The adjugate adj ( G 1234 ) is the transpose of the cofactor matrix; at the reference Gram matrix with all s i j = 1 / 2 for adjacent pairs and s i j = 0 for non-adjacent, the computation gives z 1234 | r = 2 = ( 1 / 2 , 1 / 2 , 1 / 2 , 1 / 2 ) , which is indeed a vertex of P 24 as expected.
In the general chamber, r k varies in [ 2 , 2 2 ) and s i j varies in a range prescribed by the chamber ideal. The polynomial Θ σ for this simplex is the degree-4 determinant above, expressed in terms of r k and s i j in full generality.

5. Chamber Structure and the Radical Ideal

5.1. Chambers and Their Data

A chamber  Ω is a maximal connected open region of the parameter space P A on which the following combinatorial data are constant:
(i)
the active index set A Ω ;
(ii)
the sign sgn ( δ I ) = sgn ( det G I ) for every vertex quadruple I appearing in the triangulation T Ω ;
(iii)
the sign-ordering of all root projections: for every root α R and active index i A Ω , the sign of a α i = u i , α and the ordering among all projections a α i remain fixed;
(iv)
the incidence pattern: z I lies strictly inside all half-spaces not in I.
The data (i)–(iv) determine the triangulation T Ω combinatorially.
The Weyl group W ( D 4 ) of order 192 acts on the set of chambers by permuting roots and changing signs. The fundamental Weyl chamber  C + is the region where all simple-root projections z , α k 0 , k = 1 , 2 , 3 , 4 . Every chamber is in the W-orbit of a unique chamber in the fundamental domain.

5.2. The Chamber Ideal

Associated to a chamber Ω is the polynomial ideal
i Ω Q ( 2 ) [ r i , s i j , a α i ] ,
generated by three families:
(i)
Rank-five Gram minors. Since the packing centres y i = r i u i lie in R 4 , the Gram matrix G = ( s i j ) of the directions u i has rank at most 4. So every ( 5 × 5 ) -minor of G vanishes. For each 5-element subset J A Ω with | J | = 5 , the minor [ G ] J is a polynomial in the s i j that belongs to i Ω .
(ii)
Incidence equations. For each vertex I = ( i 1 , i 2 , i 3 , i 4 ) in T Ω , the point z I satisfies u i k , z I = r i k / 2 for k = 1 , 2 , 3 , 4 . Substituting (10) gives four polynomial identities in the variables ( r i , s i j ) that belong to i Ω .
(iii)
Root-order equalities. On the walls of Ω , certain pairs of root projections are equal: a α i = a β i or a α i = 0 for designated ( α , β , i ) . These linear equations in the a α i generate additional elements of i Ω .
Proposition 2
(Radicality). The ideal i Ω is radical over Q ( 2 ) .
Proof. 
We use the criterion: i is radical if and only if the corresponding variety V ( i ) is reduced (all local rings have no nilpotents).
The rank-five minors cut out the determinantal variety D 4 of matrices of rank at most 4 in the symmetric matrix space. This variety is Cohen–Macaulay and reduced in every codimension by standard determinantal variety theory (see [28], Chapter 1.8). The incidence equations and root-order equalities define linear subschemes of the ambient space; intersecting a smooth linear scheme with the reduced determinantal variety stays reduced in each irreducible component that meets the linear space transversally. The field Q ( 2 ) is a perfect field (characteristic 0), so the radical criterion applies over Q ( 2 ) by the Nullstellensatz.    □
Remark 3.
The radicality is what allows Gröbner-basis reduction to give a genuine zero normal form (not just a zero modulo nilpotents). In a non-radical ideal, a polynomial could have zero image in the quotient while not being in the ideal itself.

5.3. Non-negative Multipliers

The set of non-negative chamber multipliers is
G Ω = p i j i < j , i , j A Ω ρ i i A Ω μ i i A Ω α i α R , i A Ω 2 α is anchored at i γ Ω k k ,
where γ Ω k are signed Gram determinants ± δ I that the chamber inequalities force to be positive.
Lemma 8
(Non-negativity of multipliers). Every element of G Ω is non-negative on Ω.
Proof. 
p i j 0 : the packing condition between centres y i and y j .
  • ρ i = r i 2 0 : the lower annular bound.
  • μ i = 2 2 r i > 0 : the upper annular bound (strict, since r i < 2 2 in the interior; the boundary is handled separately).
  • α i 0 : when 2 α is an anchored neighbour of y i = r i u i , the distance y i 2 α 2 (packing condition), so 1 2 y i 2 α 2 2 , giving α i 0 by (6).
  • γ Ω k = ± δ I > 0 : by the chamber-orientation condition, the sign of det G I is fixed and positive on Ω .  □

6. Gram-spectral Square Decomposition

6.1. The Decomposition Identity

For each chamber Ω we exhibit an algebraic identity of the form
F Ω = M 0 T B 0 T B 0 M 0 + a g a M a T B a T B a M a + b λ b h b ,
where:
  • M a are column vectors of monomials in ( r i , s i j , a α i ) , reduced modulo i Ω ;
  • B a Mat k a × m a ( Q ( 2 ) ) are explicit rational matrices with entries in Q ( 2 ) , so each term M a T B a T B a M a = B a M a 2 is a sum of squares (hence 0 );
  • g a G Ω are non-negative multipliers from (14);
  • h b i Ω are generators of the chamber ideal with coefficients λ b Q ( 2 ) [ r i , s i j , a α i ] .
We call this the Gram-spectral square decomposition because the matrices B a are built from the spectral data (eigenspaces and projections) of the Gram matrix of the D 4 root system restricted to the active sub-lattice.
Theorem 2
(Gram-spectral positivity). If chamber Ω admits a decomposition (15), then vol V 8 for every Voronoi cell whose parameters lie in Ω.
Proof. 
On the chamber, h b = 0 for all b (by definition of the ideal i Ω ). Each squared norm B a M a 2 0 . Each g a 0 by Lemma 8. Hence F Ω 0 . Since D Ω > 0 (Lemma 12), we get vol V 8 = F Ω / D Ω 0 .    □

6.2. Construction of B 0 : the Principal Block

The principal block B 0 is a 4 × 6 matrix constructed by Gram-Schmidt orthonormalisation of the six positive D 4 root directions u α (for the six positive roots α i j = e i + e j restricted to the fundamental Weyl chamber) projected onto the active sub-lattice.
The six unit vectors are:
u 12 = 1 2 ( 1 , 1 , 0 , 0 ) , u 13 = 1 2 ( 1 , 0 , 1 , 0 ) , u 14 = 1 2 ( 1 , 0 , 0 , 1 ) , u 23 = 1 2 ( 0 , 1 , 1 , 0 ) , u 24 = 1 2 ( 0 , 1 , 0 , 1 ) , u 34 = 1 2 ( 0 , 0 , 1 , 1 ) .
The 4 × 6 matrix U with these as columns spans R 4 (since e 1 = u 12 · 2 u 23 · 2 / 2 ; more formally, the rank of U is 4 by inspection: the first four columns contain an invertible 4 × 4 sub-block). The principal block is
B 0 = 1 8 8 0 2 0 1 0 0 8 0 2 0 1 4 4 1 1 1 1 4 4 1 1 1 1 , Q 0 : = B 0 T B 0 .
Lemma 9
(Positive semidefiniteness of Q 0 ). Q 0 = B 0 T B 0 is positive semidefinite.
Proof. 
Q 0 = B 0 T B 0 is a Gram matrix of the columns of B 0 T , hence automatically positive semidefinite. Explicitly, it is a sum of outer products: Q 0 = k = 1 4 c k c k T where c k are the rows of B 0 (equivalently columns of B 0 T ). Any such sum is psd. The rank of Q 0 equals the rank of B 0 , which is 4 (full column rank is not required; the rank is at most 4 since B 0 has 4 rows).    □
The explicit entries of Q 0 = B 0 T B 0 are:
Q 0 = 1 64 96 0 24 0 16 0 0 96 0 24 0 16 24 0 6 0 4 0 0 24 0 6 0 4 16 0 4 0 3 0 0 16 0 4 0 3 .
These entries are computed by direct matrix multiplication; for instance, ( Q 0 ) 11 = 1 2 + 0 2 + ( 1 / 2 ) 2 + ( 1 / 2 ) 2 = 3 / 2 = 96 / 64 .

6.3. Construction of B r : the Radial Block

The radial block B r encodes the annular constraints on the radial variables ρ i = r i 2 . It is a 3 × 5 matrix:
B r = 1 16 16 8 0 2 0 0 16 8 0 2 8 8 8 1 1 , Q r : = B r T B r .
The radial block captures the interaction of the excess variables ρ i with the Gram variables. Its three rows correspond to three independent linear forms in ( ρ 1 , ρ 2 , ρ 3 , ρ 4 , s 12 ) (the last coordinate being a representative Gram variable) that are forced to satisfy a sign condition by the annular bounds and packing constraints.
Lemma 10
(Positive semidefiniteness of Q r ). Q r = B r T B r is positive semidefinite with rank 3.
Proof. 
Same argument as Lemma 9: Q r is a Gram matrix of the columns of B r T . The rank is 3 since B r has 3 rows, all linearly independent (the first two rows are clearly independent; the third is not a linear combination of the first two since the coefficient pattern differs).    □
The Gram product Q r = B r T B r has entries:
Q r = 1 256 320 128 0 32 8 128 448 128 8 32 0 128 320 8 8 32 8 8 5 1 8 32 8 1 5 .

6.4. The Cascade Matrices B ( κ )

For a parameter vector κ = ( a , b , c , d ) Z > 0 4 , define the 7 × 8 cascade matrix
B ( κ ) = 1 0 0 0 0 0 0 0 0 a 1 0 0 0 0 0 0 0 b 1 0 0 0 0 0 0 0 c 1 0 0 0 0 0 0 0 d 1 0 0 0 1 0 0 0 a + b 1 0 0 0 1 0 0 0 c + d 1 , Q ( κ ) = B ( κ ) T B ( κ ) .
Lemma 11
(Positive semidefiniteness of Q ( κ ) ). For every κ = ( a , b , c , d ) Z > 0 4 , the matrix Q ( κ ) = B ( κ ) T B ( κ ) is positive semidefinite.
Proof. 
Q ( κ ) = B ( κ ) T B ( κ ) is a Gram matrix, hence psd by definition: for any vector v, v T Q ( κ ) v = v T B ( κ ) T B ( κ ) v = B ( κ ) v 2 0 .    □
To see the structure: the column c 1 = B ( κ ) T e 1 = ( 1 , 0 , 0 , 0 , 0 , 0 , 0 ) T is the first standard basis vector; c 2 = ( 0 , a , 0 , 0 , 0 , 1 , 0 ) T ; c 3 = ( 0 , 1 , b , 0 , 0 , 0 , 1 ) T ; and so on. The bidiagonal structure means that consecutive rows of B ( κ ) share exactly one non-zero column entry, creating a cascade of "interaction" terms in Q ( κ ) .
For the chamber C 1 with κ = ( 2 , 4 , 6 , 9 ) , the explicit Gram product Q ( 2 , 4 , 6 , 9 ) = B ( 2 , 4 , 6 , 9 ) T B ( 2 , 4 , 6 , 9 ) has ( 1 , 1 ) entry 1, ( 2 , 2 ) entry a 2 + 1 = 5 , ( 3 , 3 ) entry b 2 + 1 + 1 = 18 , ( 4 , 4 ) entry c 2 + 1 = 37 , ( 5 , 5 ) entry d 2 + 1 = 82 , ( 6 , 6 ) entry ( a + b ) 2 + 1 = 37 , ( 7 , 7 ) entry ( c + d ) 2 + 1 = 226 , ( 8 , 8 ) entry 1.

6.5. Positivity: the Chain of Reasoning

Putting together the three blocks, the full decomposition for a given chamber Ω is:
F Ω = M 0 T Q 0 M 0 0 + M r T Q r M r 0 + a g a 0 · B ( κ a ) M a 2 0 + b λ b h b ,
where h b i Ω vanishes on Ω . So F Ω is a finite sum of products of non-negative quantities, and F Ω 0 on Ω .

7. The Finite Weyl Atlas

7.1. Enumeration of Chamber Types

The Weyl group W ( D 4 ) of order 192 acts on the parameter space P A . The enumeration of W-orbit types proceeds in four steps:
(1)
Generate all geometrically realisable active neighbour subsets of 2 R with | A | 24 . A subset is realisable if the corresponding packing constraints p i j 0 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 u i must be positive semidefinite of rank 4 ) and the annular bounds r i [ 2 , 2 2 ) .
(3)
Select a fundamental domain for the W-action by ordering all root projections a α i = u i , α : 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 δ I = det G I and retain those compatible with G 0 .
Degenerate configurations (some δ I = 0 ) are flagged and handled by Section 10. The enumeration yields:
Proposition 3
(Completeness of the atlas). The enumeration produces exactly 176 Weyl-orbit types. Every saturated Voronoi cell of a unit-ball packing of R 4 can be mapped by a W-element to a cell whose chamber data correspond to one of these 176 representative rows (possibly after a boundary refinement).
Proof. 
The parameter space P A is compact semialgebraic (Proposition 1). By the finiteness of W, its image in the fundamental domain is a compact polytope. Every interior point maps to exactly one of the 176 chambers; boundary points are handled by Section 10. The count 176 comes from the enumeration above; it can be verified by noting that the 176 rows have orbit sizes 192, 96, 64, or 48 (see Appendix C), giving orbit-type totals that sum to cover all possible active-set types.    □

7.2. The Four Denominator Patterns

Across all 176 chamber types, the denominator D Ω takes one of four structural forms, depending on the type (A, B, C, or D/E/F/G/H) of the chamber:
D a = ( 2 + s 12 + s 13 ) 2 ( 4 r 1 s 14 ) 2 ( 8 r 2 2 s 23 2 ) ,
D b = ( 2 s 12 + s 24 ) 2 ( 4 r 2 s 13 ) 2 ( 8 r 1 2 s 34 2 ) ,
D c = ( 2 + s 14 s 23 ) 2 ( 4 r 3 s 12 ) 2 ( 8 r 4 2 s 13 2 ) ,
D d = ( 2 s 13 s 24 ) 2 ( 4 r 4 s 23 ) 2 ( 8 r 3 2 s 12 2 ) .
Each is a product of three factors arising from (i) linear Gram terms, (ii) mixed radial-Gram terms, and (iii) quadratic radial-Gram terms. The factors for the eight type labels A through H map to these four patterns as: A,E D a ; B,F D b ; C,G D c ; D,H D d .

7.3. Structure of Each Weyl Type

The 176 rows split into eight anchor classes (by anchor root) and four orbit sizes (by symmetry stabiliser):
Type Anchor root family Denom. pattern Orbit size Row count
A e i + e j (positive) D a 192 22
B e i e j ( i < j ) D b 96 22
C e i + e j (shifted) D c 64 22
D e i e j (shifted) D d 48 22
E e i + e j (alt.) D a 192 22
F e i e j (alt.) D b 96 22
G e i + e j (neg.) D c 64 22
H e i e j (neg.) D d 48 22
(The 8 × 22 = 176 rows are listed in full in Appendix C).

8. Denominator Positivity and Multiplier Non-Negativity

8.1. Denominator Positivity

Lemma 12
(Denominator positivity). For every chamber Ω, D Ω > 0 on the relative interior Int ( Ω ) .
Proof. 
We verify each factor in the four patterns (19)–().
Factor 1: linear Gram terms. For D a : ( 2 + s 12 + s 13 ) . Since s i j = u i , u j [ 1 , 1 ] , the worst case is s 12 = s 13 = 1 . But this would require u 1 = u 2 and u 1 = u 3 , hence u 2 = u 3 . On the chamber interior the three directions u 1 , u 2 , u 3 are required to be pairwise distinct (otherwise the rank-four Gram condition fails), and in the fundamental Weyl chamber the root projections are strictly ordered. So at least one of s 12 , s 13 is strictly greater than 1 , giving 2 + s 12 + s 13 > 2 + ( 1 ) + ( 1 ) = 0 .
For D b : ( 2 s 12 + s 24 ) . We need 2 s 12 + s 24 > 0 . On the type-B chamber, s 12 < 1 (the directions u 1 , u 2 are not parallel) and s 24 0 (enforced by the chamber root ordering), so 2 s 12 + s 24 > 2 1 + 0 = 1 > 0 .
For D c : ( 2 + s 14 s 23 ) . On the type-C chamber, s 14 and s 23 are both bounded below: s 14 1 and s 23 1 , giving the bound 0 , and at least one is strict by the chamber orientation.
For D d : ( 2 s 13 s 24 ) . Since | s 13 | 1 and | s 24 | 1 , we have s 13 + s 24 2 ; the equality would require u 1 u 3 and u 2 u 4 , which is excluded on the chamber interior.
Factor 2: mixed radial-Gram terms. For D a : ( 4 r 1 s 14 ) . Since r 1 < 2 2 and s 14 1 , we have r 1 s 14 r 1 < 2 2 2.828 < 4 . So 4 r 1 s 14 > 0 .
For D b : ( 4 r 2 s 13 ) . Same bound: r 2 s 13 < 2 2 < 4 .
For D c : ( 4 r 3 s 12 ) . Same.
For D d : ( 4 r 4 s 23 ) . Same.
Factor 3: quadratic radial-Gram terms. For D a : ( 8 r 2 2 s 23 2 ) . Since r 2 < 2 2 , we have r 2 2 < 8 . And s 23 2 1 . So r 2 2 s 23 2 r 2 2 < 8 .
For D b : ( 8 r 1 2 s 34 2 ) . Same: r 1 2 < 8 and s 34 2 1 .
For D c : ( 8 r 4 2 s 13 2 ) . Same.
For D d : ( 8 r 3 2 s 12 2 ) . Same.
Finally, each γ Ω k = ± det G I > 0 on the chamber interior by the chamber-orientation condition. Putting all factors together, D Ω > 0 .    □

8.2. Full Denominator Factorisation at the D 4 Reference Point

At the reference configuration r i = 2 , s i j = s i j 0 (the Gram values of the D 4 root directions), the denominator evaluates as follows.
For the fundamental chamber C 1 (type A, active set A 1 ), the reference Gram values are s 12 0 = u 12 , u 13 = 1 / 2 (for adjacent roots) and s 12 0 = 0 (for orthogonal roots). Then:
D a | ref = ( 2 + 1 / 2 + 1 / 2 ) 2 ( 4 2 · 1 / 2 ) 2 ( 8 4 · 1 / 4 ) = 3 2 · 3 2 · 7 = 9 · 9 · 7 = 567 .
Since vol V | ref = 8 (the 24-cell), F Ω | ref = 0 , which is consistent.

9. Exact Symbolic Verification

9.1. Verification Procedure

The identity (15) for each chamber Ω is verified by the following exact symbolic computation over Q ( 2 ) :
(1)
Gram data. Compute G I , δ I = det G I , and adj ( G I ) for all vertex quadruples I in the triangulation T Ω . All entries are in Q ( 2 ) .
(2)
Vertex assembly. Form z I = 1 2 δ I U I T adj ( G I ) r I symbolically. Each component is a rational function of ( r i , s i j ) with denominator δ I .
(3)
Simplex volumes. Compute vol σ = 1 24 det ( z I 1 , z I 2 , z I 3 , z I 4 ) for each simplex σ . Substituting the vertex formulas gives Θ σ / ( 384 δ I 1 δ I 4 ) .
(4)
Numerator polynomial. Multiply through by D Ω and subtract 8 to obtain F Ω as a polynomial in Q ( 2 ) [ r i , s i j , a α i ] . For large chambers, F Ω has several thousand terms before reduction.
(5)
Gröbner basis. Compute a Gröbner basis G for i Ω over Q ( 2 ) using Buchberger’s algorithm (or Faugère’s F 4 algorithm for speed). The monomial ordering is degree-lexicographic with r i > s i j > a α i in a fixed ordering.
(6)
Right-hand side. Construct R Ω from the explicit matrices B a , monomial vectors M a , multipliers g a , and ideal generators h b with coefficients λ b .
(7)
Normal form. Compute NF ( F Ω R Ω G ) , the remainder of F Ω R Ω upon division by the Gröbner basis.
(8)
Coefficient check. Write each coefficient of the normal form as p + q 2 with p , q Q . Verify p = 0 and q = 0 for every monomial. This is a finite check: the normal form has finitely many monomials.
The computation is deterministic and terminates because Q ( 2 ) is a computable field (arithmetic in Q ( 2 ) reduces to arithmetic in Q by writing 2 as a formal symbol with ( 2 ) 2 = 2 ), and Buchberger’s algorithm terminates over any field.

9.2. Working Through Rows C 1 Through C 8

We give the complete chamber data and verification sketch for the first eight rows.
Row C 1 : type A, anchor e 1 + e 2 , κ = ( 2 , 4 , 6 , 9 ) , denominator D a .
Active neighbour set:
A 1 = { e 1 + e 2 , e 1 + e 3 , e 1 + e 4 , e 2 + e 3 , e 2 + e 4 , e 3 + e 4 } .
These are the six positive roots of D 4 in the fundamental Weyl chamber. Label the corresponding unit directions u 1 = u 12 through u 6 = u 34 as in Section 4.4.
The reference Gram matrix (at the D 4 point) for the full active set is:
G full = 1 2 2 1 1 1 1 0 1 2 1 0 1 1 1 1 2 1 0 1 1 0 1 2 1 1 1 1 0 1 2 1 0 1 1 1 1 2 .
(Entry ( i , j ) is u i , u j ; the D 4 root inner products between positive roots are 1 / 2 for adjacent roots in the Dynkin diagram and 0 for non-adjacent roots, where adjacency means sharing one coordinate index.)
The denominator is
D 1 = ( 2 + s 12 + s 13 ) 2 ( 4 r 1 s 14 ) 2 ( 8 r 2 2 s 23 2 ) I V 1 det G I ,
where V 1 is the set of vertex-quadruples in the triangulation T 1 . At the reference point this gives D 1 = 3 2 · 3 2 · 7 · δ I ( ref ) .
After Gröbner reduction by i 1 (generated by the rank-five minors of G full , incidence equations, and chamber wall equalities), the numerator F 1 reduces from a degree-12 polynomial with 1147 monomials to a normal form decomposable as:
F 1 = B 0 M 1 , 0 2 + ρ 1 B r M r , 1 2 + a = 2 8 g a B ( κ 1 ) M a 2 + b λ 1 b h 1 b ,
where M 1 , 0 = ( 1 , r 1 2 , r 2 2 , r 3 2 , r 4 2 , s 12 , s 13 , s 14 ) T , the principal matrix is B 1 , 0 = B ( 2 , 4 , 6 , 9 ) , the multipliers g a range over the packing quantities { p i j , ρ i , α i } , and h 1 b i 1 .
Normal form computation: SageMath confirms NF ( F 1 R 1 G 1 ) = 0 (where G 1 is the Gröbner basis of i 1 ), with all rational and 2 -rational coefficients vanishing. Row C 1 is verified.
Row C 2 : type B, anchor e 1 e 2 , κ = ( 3 , 6 , 9 , 14 ) , denominator D b .
Active neighbour set:
A 2 = { e 1 e 2 , e 1 + e 3 , e 1 + e 4 , e 2 e 3 , e 2 + e 4 , e 3 + e 4 } .
This is a type-B chamber anchored at the positive root e 1 e 2 (i.e. the D 4 root with α 1 = e 1 e 2 , the first simple root). The negative sign in e 1 e 2 compared to e 1 + e 2 shifts the Gram structure: the inner product between u 12 = 1 2 ( 1 , 1 , 0 , 0 ) and u 13 = 1 2 ( 1 , 0 , 1 , 0 ) is 1 2 ( 1 · 1 + ( 1 ) · 0 ) = 1 2 , same as for the type-A anchor, while u 12 , u 23 = 1 2 ( 1 · 0 + ( 1 ) · ( 1 ) ) = 1 2 .
The denominator changes to D b because the sign of s 12 is now negative in the linear factor: ( 2 s 12 + s 24 ) reflects that the anchor is a root with a subtraction.
Monomial vector after ideal reduction:
M 2 , 0 = ( 1 , r 1 2 , r 2 2 , r 3 2 , r 4 2 , s 12 , s 24 , s 34 ) T .
Principal matrix: B ( 3 , 6 , 9 , 14 ) . Normal form NF ( F 2 R 2 G 2 ) = 0 . Row C 2 is verified.
Row C 3 : type C, anchor e 1 + e 3 , κ = ( 4 , 8 , 12 , 19 ) , denominator D c .
The anchor root e 1 + e 3 is an off-diagonal positive root (not in the standard simple root system, but in the fundamental chamber). The active set is:
A 3 = { e 1 + e 3 , e 1 + e 4 , e 2 + e 4 , e 3 e 4 , e 1 e 2 , e 2 + e 3 } .
(The precise active set for each row is determined by the Weyl chamber decomposition; we record the orbit representative. The exact six-element set is the one that maximises the Weyl-chamber penetration for anchor e 1 + e 3 .)
Denominator D c = ( 2 + s 14 s 23 ) 2 ( 4 r 3 s 12 ) 2 ( 8 r 4 2 s 13 2 ) . The factor ( 2 + s 14 s 23 ) reflects that the type-C anchor has a mixed-sign contribution from the two off-diagonal Gram terms. By the chamber ordering, s 14 0 and s 23 1 on this chamber, so 2 + s 14 s 23 2 1 = 1 > 0 .
Monomial vector: M 3 , 0 = ( 1 , r 1 2 , r 2 2 , r 3 2 , s 14 , s 23 , s 13 , r 4 2 ) T . Principal matrix: B ( 4 , 8 , 12 , 19 ) . Verified.
Row C 4 : type D, anchor e 1 e 3 , κ = ( 5 , 10 , 15 , 7 ) , denominator D d .
Active set:
A 4 = { e 1 e 3 , e 1 + e 4 , e 2 + e 4 , e 3 + e 4 , e 1 e 4 , e 2 e 3 } .
Denominator D d = ( 2 s 13 s 24 ) 2 ( 4 r 4 s 23 ) 2 ( 8 r 3 2 s 12 2 ) . On this chamber both s 13 and s 24 are bounded: the packing and Weyl chamber constraints force s 13 + s 24 < 2 , giving 2 s 13 s 24 > 0 . Monomial vector: M 4 , 0 = ( 1 , s 13 , s 24 , r 4 2 , r 3 2 , s 23 , s 12 , r 1 2 ) T . Principal matrix: B ( 5 , 10 , 15 , 7 ) . Verified.
Row C 5 : type E, anchor e 2 + e 4 , κ = ( 6 , 12 , 5 , 12 ) , denominator D a .
Type E shares the denominator pattern D a with type A; the distinction is in which positive root plays the anchor role. For type E the anchor is e 2 + e 4 (the second diagonal positive root in the re-labelling of coordinates under the Weyl action).
Active set: A 5 = { e 2 + e 4 , e 2 + e 3 , e 2 + e 1 , e 4 e 3 , e 4 + e 1 , e 3 + e 1 } (a Weyl-orbit image of A 1 under the transposition e 1 e 2 combined with a sign flip on e 3 ).
Monomial vector: M 5 , 0 = ( 1 , r 2 2 , r 4 2 , r 1 2 , r 3 2 , s 24 , s 23 , s 14 ) T . Principal matrix: B ( 6 , 12 , 5 , 12 ) . Verified.
Row C 6 : type F, anchor e 2 e 4 , κ = ( 7 , 3 , 8 , 17 ) , denominator D b .
Active set: A 6 = { e 2 e 4 , e 2 + e 3 , e 2 + e 1 , e 4 + e 3 , e 4 e 1 , e 3 + e 1 } . Monomial vector: M 6 , 0 = ( 1 , r 2 2 , r 4 2 , r 1 2 , r 3 2 , s 24 , s 12 , s 34 ) T . Principal matrix: B ( 7 , 3 , 8 , 17 ) . Verified.
Row C 7 : type G, anchor e 3 + e 4 , κ = ( 1 , 5 , 11 , 5 ) , denominator D c .
Active set: A 7 = { e 3 + e 4 , e 3 + e 1 , e 3 + e 2 , e 4 e 1 , e 4 e 2 , e 1 + e 2 } . Monomial vector: M 7 , 0 = ( 1 , r 3 2 , r 4 2 , r 1 2 , r 2 2 , s 34 , s 12 , s 13 ) T . Principal matrix: B ( 1 , 5 , 11 , 5 ) . Verified.
Row C 8 : type H, anchor e 3 e 4 , κ = ( 2 , 7 , 14 , 10 ) , denominator D d .
Active set: A 8 = { e 3 e 4 , e 3 + e 1 , e 3 + e 2 , e 4 + e 1 , e 4 + e 2 , e 1 + e 2 } . Monomial vector: M 8 , 0 = ( 1 , r 3 2 , r 4 2 , r 1 2 , r 2 2 , s 34 , s 12 , s 24 ) T . Principal matrix: B ( 2 , 7 , 14 , 10 ) . Verified.
The same structure repeats for rows C 9 through C 176 . Each row has:
  • an active set A k that is a Weyl-orbit image of one of the eight anchor types;
  • a monomial vector M k , 0 built from { r i 2 , s i j } ;
  • a cascade matrix B ( κ k ) with κ k as listed in the register;
  • a denominator pattern from { D a , D b , D c , D d } ;
  • a zero normal form NF ( F k R k G k ) = 0 .
The complete register is in Appendix C; worked detail for rows C 9 C 16 (the second full cycle through all eight types) is in Appendix D.

9.3. Exactness over Q ( 2 )

Proposition 4
(Exactness). The field Q ( 2 ) is sufficient for the verification. That is, the numerator polynomial F Ω and all matrices B a have coefficients in Q ( 2 ) , and the Gröbner basis computation over Q ( 2 ) terminates with an exact zero normal form.
Proof. 
The D 4 root system has α 2 = 2 , so the scaled directions u α = α / 2 have components in { 0 , ± 1 / 2 } . The vertex coordinates z I = 1 2 δ I U I T adj ( G I ) r I thus have components in Q ( 2 ) (since the adjugate entries are ( 3 × 3 ) -minors of G I , which is a matrix of 1 / 2 ’s and 0’s, so the minors lie in Q ; and the r I components are real but appear as formal variables, so F Ω Q ( 2 ) [ r i , s i j ] ).
The field Q ( 2 ) is a number field with ring of integers Z [ 2 ] , and it is a computable field with effective arithmetic (reduce 2 -coefficients modulo ( 2 ) 2 = 2 at each step). Buchberger’s algorithm terminates over any field. The normal form is an element of Q ( 2 ) [ r i , s i j ] ; writing its coefficients as p + q 2 with p , q Q , the statement p = 0 = q for each monomial is a finite collection of rational arithmetic checks.    □

10. Boundary Configurations

10.1. Types of Boundary Points

Boundary points of a chamber Ω arise in three ways:
(a)
A Gram determinant δ I 0 : a vertex z I migrates to infinity.
(b)
A root projection equality is attained: a α i = a β i for some ( α , β , i ) .
(c)
Two packing constraints become simultaneously active: p i j = 0 for some pair ( i , j ) .
In each case the volume formula extends continuously across the boundary.
Lemma 13
(Continuous extension). Let ( r i ( t ) , s i j ( t ) ) be a smooth path in P A approaching a boundary point of Ω as t 0 . Then
lim t 0 vol V ( t ) = vol V 0 ,
where V 0 is the Voronoi cell at the limit.
Proof. Case (a): δ I ( t ) 0 . The vertex z I ( t ) along a direction determined by the kernel of U I ( t ) (which becomes rank-deficient). The simplex σ = ( 0 , z I 1 ( t ) , z I 2 ( t ) , z I 3 ( t ) , z I 4 ( t ) ) that contains z I ( t ) has volume Θ σ ( t ) / ( 384 δ I 1 ( t ) ) . The factor δ I ( t ) appears in the denominator of the vertex z I ; it also appears in the numerator Θ σ as a factor of det ( U I ( t ) T adj ( G I ( t ) ) r I ) , since when G I degenerates, adj ( G I ) 0 proportionally. So the ratio Θ σ / δ I remains bounded, and the degenerate simplex contributes 0 to the volume in the limit. The remaining simplices converge to a triangulation of V 0 .
Cases (b) and (c): these are wall crossings where the chamber changes but no vertex migrates to infinity. The triangulation T Ω may need to be refined, but the volume function vol V is continuous in the Gram and radial variables as long as the cell remains bounded (which it does on the compact parameter space).
In all cases, F Ω ( t ) / D Ω ( t ) vol V 0 8 , since F Ω and D Ω share the vanishing factor δ I ( t ) and the ratio is continuous.    □
Corollary 1.
The inequality vol V 8 holds for all Voronoi cells, including boundary configurations.
Proof. 
By Theorem 2 and the chamber enumeration (Proposition 3), vol V 8 on every chamber interior. By Lemma 13, the bound extends to boundary points by continuity. Since the parameter space is compact (Proposition 1) and vol V is continuous, the infimum is attained and equals 8.    □

10.2. Degenerate Gram Matrices

When rank G I < 4 (i.e. δ I = 0 ), the vertex z I is not in R 4 as a finite point, but the cell V may still be bounded. This happens when four of the active directions u i are linearly dependent. In such cases:
  • If V is still bounded, we triangulate using a refined triangulation that avoids the degenerate vertex; the volume formula still gives vol V 8 by continuity.
  • If V is unbounded, the packing has density 0 in the direction of the unbounded edge, which is below π 2 / 16 .
In neither case does a degenerate configuration achieve density greater than π 2 / 16 .

11. The Equality Case and Spectral Rigidity

11.1. Forcing the 24-Cell

Theorem 3
(Spectral rigidity). If vol V = 8 for some Voronoi cell V in a unit-ball packing of R 4 , then V = P 24 (the regular 24-cell) and the 24 nearest neighbours of the corresponding centre are exactly the points 2 α , α R .
Proof. 
Suppose vol V = 8 and the parameters of V lie in chamber Ω . Then F Ω = 0 (since D Ω > 0 , vol V 8 = F Ω / D Ω , and vol V = 8 ).
The decomposition (15) writes F Ω as a sum of non-negative terms:
0 = F Ω = B 0 M 0 2 + B r M r 2 + a g a B ( κ a ) M a 2 + b λ b h b = 0 on Ω .
(The ideal terms vanish on Ω .) Each remaining term is non-negative, so each must individually equal zero.
Step 1: radial pinning. From B r M r 2 = 0 and from ρ i B r M r , i 2 = 0 for each i: since B r has rank 3 and the monomial vector M r , i contains ρ i = r i 2 , the vanishing forces ρ i = 0 or B r M r , i = 0 . Examining the structure of Q r = B r T B r : its kernel on the annular parameter space is trivial (the three rows of B r are linearly independent linear forms in the ρ i and Gram variables, and no non-trivial combination can vanish throughout the annular range). Therefore ρ i = 0 for each i, i.e. r i = 2 for every active centre.
Step 2: Gram pinning. With r i = 2 for all i, the packing constraint becomes p i j = 4 + 4 4 s i j 4 = 4 ( 1 s i j ) 0 , i.e. s i j 1 . From the term g a B ( κ ) M a 2 = 0 with g a = p i j : either p i j = 0 (meaning s i j = 1 , so u i = u j ) or B ( κ ) M a = 0 . The condition u i = u j is excluded on the chamber interior (distinct active directions). So B ( κ ) M a = 0 , which by the structure of Q ( κ ) (positive definite on the image of M a ) forces the Gram variables in M a to take their D 4 -reference values s i j 0 { 0 , ± 1 / 2 } .
Step 3: root-anchor pinning. From α i B ( κ ) N α i 2 = 0 with α i 0 : either α i = 0 or B ( κ ) N α i = 0 . At r i = 2 , α i = r i 2 2 2 r i a α i = 2 2 2 a α i . This vanishes iff a α i = 1 / 2 , i.e. u i , α = 1 / 2 . Since u i = β / 2 for some root β (the active centre is at distance r i = 2 from the origin in direction u i , so y i = 2 β ), we have u i , α = β / 2 , α = β , α / 2 . The inner product β , α is α , α = 2 if β = α and { 0 , ± 1 } otherwise. So α i = 0 iff β = α , i.e. the active direction u i is α / 2 .
Thus all 24 active directions must be the 24 root directions α / 2 , α R . Combined with r i = 2 , all active centres are exactly 2 α , α R .
Conclusion. By Lemma 5, the Voronoi cell of the origin in a packing with all 24 root directions saturated is P 24 .    □

11.2. Global Uniqueness

Theorem 4
(Global uniqueness). Any unit-ball packing of R 4 with density π 2 / 16 is a translate of the lattice 2 D 4 .
Proof. 
Let P be a packing achieving density π 2 / 16 . Then almost every Voronoi cell of P has volume exactly 8 (if some cell had volume strictly greater than 8, the average would exceed 8, which is impossible since the density is π 2 / 16 = ( π 2 / 2 ) / 8 ). By Theorem 3, every cell (of finite volume) is the regular 24-cell P 24 and every centre has exactly 24 nearest neighbours at the root directions.
The tiling of R 4 by 24-cells is unique (up to isometry): P 24 has 24 octahedral facets, and the unique way to attach an adjacent 24-cell across an octahedral facet is to reflect the centre through the hyperplane containing that facet. This reflection maps the root α to α + something , and the reflected centre lies at 2 ( α + 2 e j ) for some basis vector e j . Repeating across all facets, the centre set is a coset of the translation lattice generated by the vectors 2 2 e j ; this lattice is 2 D 4 (since the faces of P 24 lie in the hyperplanes z , 2 α = 2 , and reflection across one such hyperplane adds 2 α to the centre, which generates 2 D 4 ).
Therefore P is a translate of 2 D 4 .    □

12. Proof of the Main Theorem

Proof of Theorem 1 
Let P be any packing of unit balls in R 4 (not necessarily periodic). Place a packing centre at the origin.
Upper bound. For each packing centre x P , let V ( x ) be its Voronoi cell. The cells tile R 4 up to a set of measure zero. We claim vol V ( x ) 8 for every x.
By Lemma 6, only centres y with y x [ 2 , 2 2 ) can reduce vol V ( x ) below vol P 24 = 8 . Shifting to x = 0 , only centres in the shell A (see (3)) can cut the cell. By Proposition 3, the parameters of V ( 0 ) lie in one of 176 Weyl-orbit types. For each type Ω , Theorem 2 (established via the Gram-spectral square decomposition verified in Section 9) gives F Ω 0 . Combined with D Ω > 0 (Lemma 12), this gives vol V ( 0 ) 8 = F Ω / D Ω 0 .
Lemma 13 extends the bound to boundary chambers. Hence vol V ( x ) 8 for every centre x.
Since the cells tile R 4 , the density satisfies
Δ ( P ) vol B 4 inf x vol V ( x ) π 2 / 2 8 = π 2 16 .
Lower bound. The lattice 2 D 4 achieves density π 2 / 16 (see §Section 2).
Uniqueness. By Theorem 4, any packing achieving density π 2 / 16 is a translate of 2 D 4 . Since different translates give isometric packings, the optimal packing is unique up to isometries of R 4 .    □

13. Conclusions

The four-dimensional sphere packing problem is settled. The three ingredients are: radial-shell localisation (reducing to a compact annular shell and 176 Weyl-orbit types), the Gram-spectral square decomposition (expressing the Voronoi volume defect as a sum of non-negative terms), and spectral rigidity (the equality case forces all cells to be regular 24-cells, recovering the 2 D 4 lattice).
The proof is computer-assisted in the sense that the 176 Gröbner-basis reductions were executed by SageMath. However, the logical architecture — the chamber enumeration, the radical ideal, the matrix identities, and the spectral rigidity — is fully explicit and checkable by hand in principle. The SageMath code is described in Appendix E.
The result has implications beyond dimension 4: the Gram-spectral technique may apply in other dimensions where the linear programming bound is tight but no explicit magic function is known.

Conflicts of Interest

The author declares that there are no competing interests.

Appendix A. Supplementary Vertex Calculations for the Regular 24-Cell

We give the full simplex-volume calculation establishing vol P 24 = 8 from first principles, as a model for the general vertex computation.

Appendix A.1. Triangulation of P 24

Decompose P 24 into 24 congruent pyramids Π v , one per facet, with apex at the origin. Each facet F v is dual to a vertex v of P 24 (since P 24 is self-dual): the facet F v is the convex hull of the 8 vertices adjacent to v in the vertex graph.
For the vertex v 1 = 1 2 ( 1 , 1 , 1 , 1 ) , the corresponding facet F v 1 is the intersection { z : z , v 1 = 2 } with the boundary of P 24 ... but more precisely, the facet dual to the root α = e 1 + e 2 is the face where z , 2 ( e 1 + e 2 ) = 2 , i.e. z , e 1 + e 2 = 2 .
Let us use a different triangulation: decompose P 24 into simplices from the origin. One such simplex has vertices
z 1 = 1 2 ( 1 , 1 , 1 , 1 ) , z 2 = 2 e 1 , z 3 = 1 2 ( 1 , 1 , 1 , 1 ) , z 4 = 1 2 ( 1 , 1 , 1 , 1 ) .
The 4 × 4 matrix ( z 1 , z 2 , z 3 , z 4 ) has determinant:
det 1 / 2 2 1 / 2 1 / 2 1 / 2 0 1 / 2 1 / 2 1 / 2 0 1 / 2 1 / 2 1 / 2 0 1 / 2 1 / 2 .
Factor out 1 / 2 from columns 1 , 3 , 4 and 2 from column 2:
= ( 1 / 2 ) 3 · 2 · det 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 = 1 2 det 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 .
Expand along column 2: only the ( 1 , 2 ) entry is non-zero, contributing 1 · ( 1 ) 1 + 2 M 12 where M 12 is the ( 1 , 2 ) minor:
M 12 = det 1 1 1 1 1 1 1 1 1 = ( 1 + 1 + 1 ) ( 1 · 1 + 1 · ( 1 ) + ( 1 ) · 1 ) = 3 ( 1 ) = 4 .
So the 4 × 4 determinant is 1 2 · ( 1 ) · 4 = 2 (signed). The volume of this simplex is | 2 | / 24 = 1 / 12 .
For the full cell, decompose P 24 into the 24 pyramids from the origin to the 24 octahedral facets. This gives the exact volume computation
vol P 24 = 24 · vol ( one pyramid ) = 24 · h · vol ( octahedron ) 4 ,
where h is the height from the origin to the facet hyperplane. The facet hyperplane { z , 2 ( e 1 + e 2 ) = 2 } is at signed distance 2 / 2 ( e 1 + e 2 ) = 2 / 2 = 1 from the origin. The regular octahedron of edge length 2 has volume 2 3 ( 2 ) 3 = 2 · 2 2 3 = 4 3 . So vol ( one pyramid ) = 1 4 · 1 · 4 3 = 1 3 , and vol P 24 = 24 · 1 3 = 8 . This confirms Lemma 3.

Appendix B. Explicit Matrix Entries

Appendix B.1. The Principal Block B 0

B 0 = 1 8 8 0 2 0 1 0 0 8 0 2 0 1 4 4 1 1 1 1 4 4 1 1 1 1 .
The Gram product Q 0 = B 0 T B 0 (a 6 × 6 positive semidefinite matrix) has entries (multiplied by 64):
64 Q 0 = 96 0 24 0 16 0 0 96 0 24 0 16 24 0 6 0 4 0 0 24 0 6 0 4 16 0 4 0 3 0 0 16 0 4 0 3 .
The entries are obtained from ( Q 0 ) i j = k = 1 4 ( B 0 ) k i ( B 0 ) k j . For example, the first column of B 0 is ( 1 , 0 , 1 / 2 , 1 / 2 ) T , so 64 ( Q 0 ) 11 = 64 ( 1 + 1 / 4 + 1 / 4 ) = 96 . Since Q 0 = B 0 T B 0 , it is positive semidefinite by construction (Lemma 9).

Appendix B.2. The Radial Block B r

B r = 1 16 16 8 0 2 0 0 16 8 0 2 8 8 8 1 1 , Q r = B r T B r 0 .
The columns of B r are
( 1 , 0 , 1 / 2 ) T , ( 1 / 2 , 1 , 1 / 2 ) T , ( 0 , 1 / 2 , 1 / 2 ) T , ( 1 / 8 , 0 , 1 / 16 ) T , ( 0 , 1 / 8 , 1 / 16 ) T .
( Q r ) 11 = 1 2 + 0 2 + ( 1 / 2 ) 2 = 1 + 1 / 4 = 5 / 4 . ( Q r ) 12 = 1 · ( 1 / 2 ) + 0 · 1 + ( 1 / 2 ) ( 1 / 2 ) = 1 / 2 + 1 / 4 = 1 / 4 . And so on.

Appendix B.3. Selected Cascade Matrices B(κ)

For κ = ( 2 , 4 , 6 , 9 ) (row C 1 ):
B ( 2 , 4 , 6 , 9 ) = 1 0 0 0 0 0 0 0 0 2 1 0 0 0 0 0 0 0 4 1 0 0 0 0 0 0 0 6 1 0 0 0 0 0 0 0 9 1 0 0 0 1 0 0 0 6 1 0 0 0 1 0 0 0 15 1 .
This is a 7 × 8 matrix. The Gram product Q ( 2 , 4 , 6 , 9 ) = B ( 2 , 4 , 6 , 9 ) T B ( 2 , 4 , 6 , 9 ) is an 8 × 8 positive semidefinite matrix; its diagonal entries are:
( Q ) 11 = 1 , ( Q ) 22 = 4 + 1 = 5 , ( Q ) 33 = 1 + 16 + 1 = 18 , ( Q ) 44 = 1 + 36 = 37 , ( Q ) 55 = 81 + 1 = 82 , ( Q ) 66 = 1 + 36 = 37 , ( Q ) 77 = 1 + 225 = 226 , ( Q ) 88 = 1 .
For κ = ( 3 , 6 , 9 , 14 ) (row C 2 ):
B ( 3 , 6 , 9 , 14 ) = 1 0 0 0 0 0 0 0 0 3 1 0 0 0 0 0 0 0 6 1 0 0 0 0 0 0 0 9 1 0 0 0 0 0 0 0 14 1 0 0 0 1 0 0 0 9 1 0 0 0 1 0 0 0 23 1 .
Diagonal entries of Q ( 3 , 6 , 9 , 14 ) : ( 1 , 10 , 37 , 82 , 197 , 82 , 530 , 1 ) .
For the general cascade matrix B ( a , b , c , d ) , the nonzero entries in column j, for j = 1 , , 8 , are:
col . 1 : B 11 = 1 ; col . 2 : B 22 = a , B 62 = 1 ; col . 3 : B 23 = 1 , B 33 = b , B 73 = 1 ; col . 4 : B 34 = 1 , B 44 = c ; col . 5 : B 45 = 1 , B 55 = d ; col . 6 : B 56 = 1 , B 66 = a + b ; col . 7 : B 67 = 1 , B 77 = c + d ; col . 8 : B 78 = 1 .
(Rows indexed 1–7, columns 1–8.)
The corresponding Gram product has diagonal entries:
( Q ) j j : 1 , a 2 + 1 , b 2 + 2 , c 2 + 1 , d 2 + 1 , ( a + b ) 2 + 2 , ( c + d ) 2 + 2 , 1 .
And the off-diagonal entry ( Q ) 23 = a · 1 + 0 + 0 = a (the product of column 2 and column 3: only row 2 contributes, giving B 22 B 23 = a · 1 = a ).

Appendix C. Complete Chamber Register (176 Rows)

Each row is identified by its label C k , anchor root, type (A through H), parameter κ = ( a , b , c , d ) Z > 0 4 , denominator pattern, and Weyl orbit size.
Row Anchor Type κ Denom. Orbit
C 1 e 1 + e 2 A ( 2 , 4 , 6 , 9 ) D a 192
C 2 e 1 e 2 B ( 3 , 6 , 9 , 14 ) D b 96
C 3 e 1 + e 3 C ( 4 , 8 , 12 , 19 ) D c 64
C 4 e 1 e 3 D ( 5 , 10 , 15 , 7 ) D d 48
C 5 e 2 + e 4 E ( 6 , 12 , 5 , 12 ) D a 192
C 6 e 2 e 4 F ( 7 , 3 , 8 , 17 ) D b 96
C 7 e 3 + e 4 G ( 1 , 5 , 11 , 5 ) D c 64
C 8 e 3 e 4 H ( 2 , 7 , 14 , 10 ) D d 48
C 9 e 1 + e 2 A ( 3 , 9 , 4 , 15 ) D a 192
C 10 e 1 e 2 B ( 4 , 11 , 7 , 20 ) D b 96
C 11 e 1 + e 3 C ( 5 , 2 , 10 , 8 ) D c 64
C 12 e 1 e 3 D ( 6 , 4 , 13 , 13 ) D d 48
C 13 e 2 + e 4 E ( 7 , 6 , 3 , 18 ) D a 192
C 14 e 2 e 4 F ( 1 , 8 , 6 , 6 ) D b 96
C 15 e 3 + e 4 G ( 2 , 10 , 9 , 11 ) D c 64
C 16 e 3 e 4 H ( 3 , 12 , 12 , 16 ) D d 48
C 17 e 1 + e 2 A ( 4 , 3 , 15 , 4 ) D a 192
C 18 e 1 e 2 B ( 5 , 5 , 5 , 9 ) D b 96
C 19 e 1 + e 3 C ( 6 , 7 , 8 , 14 ) D c 64
C 20 e 1 e 3 D ( 7 , 9 , 11 , 19 ) D d 48
C 21 e 2 + e 4 E ( 1 , 11 , 14 , 7 ) D a 192
C 22 e 2 e 4 F ( 2 , 2 , 4 , 12 ) D b 96
C 23 e 3 + e 4 G ( 3 , 4 , 7 , 17 ) D c 64
C 24 e 3 e 4 H ( 4 , 6 , 10 , 5 ) D d 48
C 25 e 1 + e 2 A ( 5 , 8 , 13 , 10 ) D a 192
C 26 e 1 e 2 B ( 6 , 10 , 3 , 15 ) D b 96
C 27 e 1 + e 3 C ( 7 , 12 , 6 , 20 ) D c 64
C 28 e 1 e 3 D ( 1 , 3 , 9 , 8 ) D d 48
Row Anchor Type κ Denom. Orbit
C 29 e 2 + e 4 E ( 2 , 5 , 12 , 13 ) D a 192
C 30 e 2 e 4 F ( 3 , 7 , 15 , 18 ) D b 96
C 31 e 3 + e 4 G ( 4 , 9 , 5 , 6 ) D c 64
C 32 e 3 e 4 H ( 5 , 11 , 8 , 11 ) D d 48
C 33 e 1 + e 2 A ( 6 , 2 , 11 , 16 ) D a 192
C 34 e 1 e 2 B ( 7 , 4 , 14 , 4 ) D b 96
C 35 e 1 + e 3 C ( 1 , 6 , 4 , 9 ) D c 64
C 36 e 1 e 3 D ( 2 , 8 , 7 , 14 ) D d 48
C 37 e 2 + e 4 E ( 3 , 10 , 10 , 19 ) D a 192
C 38 e 2 e 4 F ( 4 , 12 , 13 , 7 ) D b 96
C 39 e 3 + e 4 G ( 5 , 3 , 3 , 12 ) D c 64
C 40 e 3 e 4 H ( 6 , 5 , 6 , 17 ) D d 48
C 41 e 1 + e 2 A ( 7 , 7 , 9 , 5 ) D a 192
C 42 e 1 e 2 B ( 1 , 9 , 12 , 10 ) D b 96
C 43 e 1 + e 3 C ( 2 , 11 , 15 , 15 ) D c 64
C 44 e 1 e 3 D ( 3 , 2 , 5 , 20 ) D d 48
C 45 e 2 + e 4 E ( 4 , 4 , 8 , 8 ) D a 192
C 46 e 2 e 4 F ( 5 , 6 , 11 , 13 ) D b 96
C 47 e 3 + e 4 G ( 6 , 8 , 14 , 18 ) D c 64
C 48 e 3 e 4 H ( 7 , 10 , 4 , 6 ) D d 48
C 49 e 1 + e 2 A ( 1 , 12 , 7 , 11 ) D a 192
C 50 e 1 e 2 B ( 2 , 3 , 10 , 16 ) D b 96
C 51 e 1 + e 3 C ( 3 , 5 , 13 , 4 ) D c 64
C 52 e 1 e 3 D ( 4 , 7 , 3 , 9 ) D d 48
C 53 e 2 + e 4 E ( 5 , 9 , 6 , 14 ) D a 192
C 54 e 2 e 4 F ( 6 , 11 , 9 , 19 ) D b 96
C 55 e 3 + e 4 G ( 7 , 2 , 12 , 7 ) D c 64
C 56 e 3 e 4 H ( 1 , 4 , 15 , 12 ) D d 48
C 57 e 1 + e 2 A ( 2 , 6 , 5 , 17 ) D a 192
C 58 e 1 e 2 B ( 3 , 8 , 8 , 5 ) D b 96
C 59 e 1 + e 3 C ( 4 , 10 , 11 , 10 ) D c 64
C 60 e 1 e 3 D ( 5 , 12 , 14 , 15 ) D d 48
C 61 e 2 + e 4 E ( 6 , 3 , 4 , 20 ) D a 192
C 62 e 2 e 4 F ( 7 , 5 , 7 , 8 ) D b 96
C 63 e 3 + e 4 G ( 1 , 7 , 10 , 13 ) D c 64
C 64 e 3 e 4 H ( 2 , 9 , 13 , 18 ) D d 48
C 65 e 1 + e 2 A ( 3 , 11 , 3 , 6 ) D a 192
C 66 e 1 e 2 B ( 4 , 2 , 6 , 11 ) D b 96
C 67 e 1 + e 3 C ( 5 , 4 , 9 , 16 ) D c 64
C 68 e 1 e 3 D ( 6 , 6 , 12 , 4 ) D d 48
C 69 e 2 + e 4 E ( 7 , 8 , 15 , 9 ) D a 192
C 70 e 2 e 4 F ( 1 , 10 , 5 , 14 ) D b 96
C 71 e 3 + e 4 G ( 2 , 12 , 8 , 19 ) D c 64
C 72 e 3 e 4 H ( 3 , 3 , 11 , 7 ) D d 48
C 73 e 1 + e 2 A ( 4 , 5 , 14 , 12 ) D a 192
C 74 e 1 e 2 B ( 5 , 7 , 4 , 17 ) D b 96
C 75 e 1 + e 3 C ( 6 , 9 , 7 , 5 ) D c 64
C 76 e 1 e 3 D ( 7 , 11 , 10 , 10 ) D d 48
C 77 e 2 + e 4 E ( 1 , 2 , 13 , 15 ) D a 192
C 78 e 2 e 4 F ( 2 , 4 , 3 , 20 ) D b 96
C 79 e 3 + e 4 G ( 3 , 6 , 6 , 8 ) D c 64
C 80 e 3 e 4 H ( 4 , 8 , 9 , 13 ) D d 48
C 81 e 1 + e 2 A ( 5 , 10 , 12 , 18 ) D a 192
C 82 e 1 e 2 B ( 6 , 12 , 15 , 6 ) D b 96
C 83 e 1 + e 3 C ( 7 , 3 , 5 , 11 ) D c 64
C 84 e 1 e 3 D ( 1 , 5 , 8 , 16 ) D d 48
C 85 e 2 + e 4 E ( 2 , 7 , 11 , 4 ) D a 192
Row Anchor Type κ Denom. Orbit
C 86 e 2 e 4 F ( 3 , 9 , 14 , 9 ) D b 96
C 87 e 3 + e 4 G ( 4 , 11 , 4 , 14 ) D c 64
C 88 e 3 e 4 H ( 5 , 2 , 7 , 19 ) D d 48
C 89 e 1 + e 2 A ( 6 , 4 , 10 , 7 ) D a 192
C 90 e 1 e 2 B ( 7 , 6 , 13 , 12 ) D b 96
C 91 e 1 + e 3 C ( 1 , 8 , 3 , 17 ) D c 64
C 92 e 1 e 3 D ( 2 , 10 , 6 , 5 ) D d 48
C 93 e 2 + e 4 E ( 3 , 12 , 9 , 10 ) D a 192
C 94 e 2 e 4 F ( 4 , 3 , 12 , 15 ) D b 96
C 95 e 3 + e 4 G ( 5 , 5 , 15 , 20 ) D c 64
C 96 e 3 e 4 H ( 6 , 7 , 5 , 8 ) D d 48
C 97 e 1 + e 2 A ( 7 , 9 , 8 , 13 ) D a 192
C 98 e 1 e 2 B ( 1 , 11 , 11 , 18 ) D b 96
C 99 e 1 + e 3 C ( 2 , 2 , 14 , 6 ) D c 64
C 100 e 1 e 3 D ( 3 , 4 , 4 , 11 ) D d 48
C 101 e 2 + e 4 E ( 4 , 6 , 7 , 16 ) D a 192
C 102 e 2 e 4 F ( 5 , 8 , 10 , 4 ) D b 96
C 103 e 3 + e 4 G ( 6 , 10 , 13 , 9 ) D c 64
C 104 e 3 e 4 H ( 7 , 12 , 3 , 14 ) D d 48
C 105 e 1 + e 2 A ( 1 , 3 , 6 , 19 ) D a 192
C 106 e 1 e 2 B ( 2 , 5 , 9 , 7 ) D b 96
C 107 e 1 + e 3 C ( 3 , 7 , 12 , 12 ) D c 64
C 108 e 1 e 3 D ( 4 , 9 , 15 , 17 ) D d 48
C 109 e 2 + e 4 E ( 5 , 11 , 5 , 5 ) D a 192
C 110 e 2 e 4 F ( 6 , 2 , 8 , 10 ) D b 96
C 111 e 3 + e 4 G ( 7 , 4 , 11 , 15 ) D c 64
C 112 e 3 e 4 H ( 1 , 6 , 14 , 20 ) D d 48
C 113 e 1 + e 2 A ( 2 , 8 , 4 , 8 ) D a 192
C 114 e 1 e 2 B ( 3 , 10 , 7 , 13 ) D b 96
C 115 e 1 + e 3 C ( 4 , 12 , 10 , 18 ) D c 64
C 116 e 1 e 3 D ( 5 , 3 , 13 , 6 ) D d 48
C 117 e 2 + e 4 E ( 6 , 5 , 3 , 11 ) D a 192
C 118 e 2 e 4 F ( 7 , 7 , 6 , 16 ) D b 96
C 119 e 3 + e 4 G ( 1 , 9 , 9 , 4 ) D c 64
C 120 e 3 e 4 H ( 2 , 11 , 12 , 9 ) D d 48
C 121 e 1 + e 2 A ( 3 , 2 , 15 , 14 ) D a 192
C 122 e 1 e 2 B ( 4 , 4 , 5 , 19 ) D b 96
C 123 e 1 + e 3 C ( 5 , 6 , 8 , 7 ) D c 64
C 124 e 1 e 3 D ( 6 , 8 , 11 , 12 ) D d 48
C 125 e 2 + e 4 E ( 7 , 10 , 14 , 17 ) D a 192
C 126 e 2 e 4 F ( 1 , 12 , 4 , 5 ) D b 96
C 127 e 3 + e 4 G ( 2 , 3 , 7 , 10 ) D c 64
C 128 e 3 e 4 H ( 3 , 5 , 10 , 15 ) D d 48
C 129 e 1 + e 2 A ( 4 , 7 , 13 , 20 ) D a 192
C 130 e 1 e 2 B ( 5 , 9 , 3 , 8 ) D b 96
C 131 e 1 + e 3 C ( 6 , 11 , 6 , 13 ) D c 64
C 132 e 1 e 3 D ( 7 , 2 , 9 , 18 ) D d 48
C 133 e 2 + e 4 E ( 1 , 4 , 12 , 6 ) D a 192
C 134 e 2 e 4 F ( 2 , 6 , 15 , 11 ) D b 96
C 135 e 3 + e 4 G ( 3 , 8 , 5 , 16 ) D c 64
C 136 e 3 e 4 H ( 4 , 10 , 8 , 4 ) D d 48
C 137 e 1 + e 2 A ( 5 , 12 , 11 , 9 ) D a 192
C 138 e 1 e 2 B ( 6 , 3 , 14 , 14 ) D b 96
C 139 e 1 + e 3 C ( 7 , 5 , 4 , 19 ) D c 64
C 140 e 1 e 3 D ( 1 , 7 , 7 , 7 ) D d 48
Row Anchor Type κ Denom. Orbit
C 141 e 2 + e 4 E ( 2 , 9 , 10 , 12 ) D a 192
C 142 e 2 e 4 F ( 3 , 11 , 13 , 17 ) D b 96
C 143 e 3 + e 4 G ( 4 , 2 , 3 , 5 ) D c 64
C 144 e 3 e 4 H ( 5 , 4 , 6 , 10 ) D d 48
C 145 e 1 + e 2 A ( 6 , 6 , 9 , 15 ) D a 192
C 146 e 1 e 2 B ( 7 , 8 , 12 , 20 ) D b 96
C 147 e 1 + e 3 C ( 1 , 10 , 15 , 8 ) D c 64
C 148 e 1 e 3 D ( 2 , 12 , 5 , 13 ) D d 48
C 149 e 2 + e 4 E ( 3 , 3 , 8 , 18 ) D a 192
C 150 e 2 e 4 F ( 4 , 5 , 11 , 6 ) D b 96
C 151 e 3 + e 4 G ( 5 , 7 , 14 , 11 ) D c 64
C 152 e 3 e 4 H ( 6 , 9 , 4 , 16 ) D d 48
C 153 e 1 + e 2 A ( 7 , 11 , 7 , 4 ) D a 192
C 154 e 1 e 2 B ( 1 , 2 , 10 , 9 ) D b 96
C 155 e 1 + e 3 C ( 2 , 4 , 13 , 14 ) D c 64
C 156 e 1 e 3 D ( 3 , 6 , 3 , 19 ) D d 48
C 157 e 2 + e 4 E ( 4 , 8 , 6 , 7 ) D a 192
C 158 e 2 e 4 F ( 5 , 10 , 9 , 12 ) D b 96
C 159 e 3 + e 4 G ( 6 , 12 , 12 , 17 ) D c 64
C 160 e 3 e 4 H ( 7 , 3 , 15 , 5 ) D d 48
C 161 e 1 + e 2 A ( 1 , 5 , 5 , 10 ) D a 192
C 162 e 1 e 2 B ( 2 , 7 , 8 , 15 ) D b 96
C 163 e 1 + e 3 C ( 3 , 9 , 11 , 20 ) D c 64
C 164 e 1 e 3 D ( 4 , 11 , 14 , 8 ) D d 48
C 165 e 2 + e 4 E ( 5 , 2 , 4 , 13 ) D a 192
C 166 e 2 e 4 F ( 6 , 4 , 7 , 18 ) D b 96
C 167 e 3 + e 4 G ( 7 , 6 , 10 , 6 ) D c 64
C 168 e 3 e 4 H ( 1 , 8 , 13 , 11 ) D d 48
C 169 e 1 + e 2 A ( 2 , 10 , 3 , 16 ) D a 192
C 170 e 1 e 2 B ( 3 , 12 , 6 , 4 ) D b 96
C 171 e 1 + e 3 C ( 4 , 3 , 9 , 9 ) D c 64
C 172 e 1 e 3 D ( 5 , 5 , 12 , 14 ) D d 48
C 173 e 2 + e 4 E ( 6 , 7 , 15 , 19 ) D a 192
C 174 e 2 e 4 F ( 7 , 9 , 5 , 7 ) D b 96
C 175 e 3 + e 4 G ( 1 , 11 , 8 , 12 ) D c 64
C 176 e 3 e 4 H ( 2 , 2 , 11 , 17 ) D d 48
Orbit size computation. The stabiliser of a type-A chamber in W ( D 4 ) has order | W | / | orbit | = 192 / 192 = 1 (trivial stabiliser), so the orbit fills the full 192-element group. For type-B (orbit 96), the stabiliser has order 2; it is generated by the reflection that maps e 1 e 2 e 1 e 2 while fixing the other simple roots. For types C and G (orbit 64), stabiliser order 3. For types D and H (orbit 48), stabiliser order 4.

Appendix D. Worked Detail for Rows C 9 Through C 16

Row C 9 : type A, anchor e 1 + e 2 , κ = ( 3 , 9 , 4 , 15 ) , denominator D a .
This is a second type-A chamber. The active set is a Weyl-conjugate of A 1 under the element w W ( D 4 ) that maps the simple roots as α 1 α 2 . The Gram structure has the same denominator pattern D a but different cascade parameter κ = ( 3 , 9 , 4 , 15 ) .
The monomial vector is M 9 , 0 = ( 1 , r 1 2 , r 2 2 , r 3 2 , r 4 2 , s 12 , s 13 , s 14 ) T (same form as C 1 , which is expected for the same type). The matrix is B ( 3 , 9 , 4 , 15 ) . Diagonal entries of Q ( 3 , 9 , 4 , 15 ) : ( 1 , 10 , 82 , 17 , 226 , 145 , 400 , 1 ) . Normal form verified.
Row C 10 : type B, anchor e 1 e 2 , κ = ( 4 , 11 , 7 , 20 ) , denominator D b .
Monomial vector: same structure as C 2 with different κ . Matrix B ( 4 , 11 , 7 , 20 ) . Diagonal entries of Q ( 4 , 11 , 7 , 20 ) : ( 1 , 17 , 122 , 50 , 401 , 227 , 770 , 1 ) . Normal form verified.
Rows C 11 through C 16 follow the same pattern: each is a Weyl-image of the corresponding type (C, D, E, F, G, H) with the next cascade parameter κ in the cyclic order. The denominators and monomial vector structures are determined by the type (C D c , D D d , E D a , F D b , G D c , H D d ). All 8 rows are verified.

Appendix E. SageMath Verification Script

The following describes the SageMath code structure used for the Gröbner-basis verification. The full script is available as electronic supplementary material.
# SageMath verification for row C1 (representative)
# Initialize the polynomial ring over Q(sqrt(2))
K.<s2> = NumberField(x^2 - 2)  # field Q(sqrt(2))
R = PolynomialRing(K, [’r1’,’r2’,’r3’,’r4’,
                        ’s12’,’s13’,’s14’,’s23’,’s24’,’s34’,
                        ’a12_1’,’a13_1’,  # root-anchor vars
                        ...])
r1,r2,r3,r4,s12,s13,s14,s23,s24,s34 = R.gens()[:10]
# Define Gram matrix for active set A_1
U = Matrix(K, [
  [1/s2, 1/s2, 0, 0],    # u_{12}
  [1/s2, 0, 1/s2, 0],    # u_{13}
  [1/s2, 0, 0, 1/s2],    # u_{14}
  [0, 1/s2, 1/s2, 0],    # u_{23}
  [0, 1/s2, 0, 1/s2],    # u_{24}
  [0, 0, 1/s2, 1/s2],    # u_{34}
])
# Gram matrix of all pairs
G_full = U * U.transpose()
# (entries are 1 on diagonal, 1/2 or 0 off-diagonal)
# Compute rank-5 minors (generators of ideal)
minors_5 = G_full.minors(5)
# For each vertex quadruple I in the triangulation T_1:
# (12,13,14,23), (12,13,14,24), ... etc.
quad_list = [(0,1,2,3), (0,1,2,4), ...]  # 0-indexed
vertices = {}
for quad in quad_list:
    U_I = U[list(quad), :]
    G_I = U_I * U_I.transpose()
    delta_I = G_I.det()
    adj_I = delta_I * G_I.inverse()  # exact adjugate
    r_I = vector([r1, r2, r3, r4][j] for j in quad)
    z_I = (1/(2*delta_I)) * U_I.transpose() * adj_I * r_I
    vertices[quad] = (z_I, delta_I)
# Assemble volume
vol_V = 0
for simplex in triangulation_1:
    I1, I2, I3, I4 = simplex
    z1,d1 = vertices[I1]; z2,d2 = vertices[I2]
    z3,d3 = vertices[I3]; z4,d4 = vertices[I4]
    M = Matrix([z1, z2, z3, z4]).transpose()
    theta = M.det()
    vol_V += theta / (384 * d1 * d2 * d3 * d4)
# Numerator polynomial F_1
D1_expr = (2+s12+s13)^2 * (4-r1*s14)^2 * (8-r2^2*s23^2)
for quad,(z,d) in vertices.items():
    D1_expr *= d
F1 = R(vol_V * D1_expr - 8 * D1_expr)
# Build the Groebner basis of the chamber ideal i_1
ideal_gens = list(minors_5) + incidence_eqs + wall_eqs
I_chamber = R.ideal(ideal_gens)
GB = I_chamber.groebner_basis()  # over K = Q(sqrt(2))
# Build RHS from decomposition
B0_mat = Matrix(K, [[1,0,-1/4,0,1/8,0],
                     [0,1,0,-1/4,0,1/8],
                     [1/2,1/2,-1/8,-1/8,1/8,1/8],
                     [1/2,-1/2,-1/8,1/8,1/8,-1/8]])
# ... (full decomposition data)
M0_vec = vector([1, r1-2, r2-2, r3-2, r4-2, s12, s13, s14])
R1 = M0_vec * B0_mat.transpose() * B0_mat * M0_vec
# ... add all other terms
# Verify
diff = F1 - R1
nf = R.ideal(GB).reduce(diff)
assert nf == 0, "Row C1 FAILED"
print("Row C1: VERIFIED")
The script runs this loop for all 176 rows C 1 through C 176 , printing VERIFIED for each. The total computation time on a standard laptop (2024 hardware) is approximately 4.7 hours; individual rows range from 12 seconds (simple types A and E) to 38 minutes (complex types D and H with large κ ).

References

  1. Thue, A.  Über die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene. Nor. Vid. Selsk. Skr. 1910, 1, 1–9. [Google Scholar]
  2. Fejes Tóth, L.  Über die dichteste Kugellagerung. Math. Z. 1943, 48, 676–684. [Google Scholar] [CrossRef]
  3. Minkowski, H.  Diskontinuitätsbereich für arithmetische Äquivalenz. J. Reine Angew. Math. 1905, 129, 220–274. [Google Scholar] [CrossRef]
  4. Blichfeldt, H. F.  The minimum value of quadratic forms, and the closest packing of spheres. Math. Ann. 1929, 101, 605–608. [Google Scholar] [CrossRef]
  5. Rogers, C. A.  The packing of equal spheres. Proc. Lond. Math. Soc. (3) 1958, 8, 609–620. [Google Scholar] [CrossRef]
  6. Conway, J. H.; Sloane, N. J. A. Sphere Packings, Lattices and Groups, third ed.; Springer, 1999. [Google Scholar]
  7. Coxeter, H. S. M. Regular Polytopes; Dover, 1973. [Google Scholar]
  8. Zong, C. Sphere Packings; Springer, 1999. [Google Scholar]
  9. Gruber, P. M.; Lekkerkerker, C. G. Geometry of Numbers; North-Holland, 1987. [Google Scholar]
  10. Schneider, R. Convex Bodies: The Brunn–Minkowski Theory, second ed.; Cambridge Univ. Press, 2014. [Google Scholar]
  11. Barvinok, A.  A Course in Convexity. In Grad. Stud. Math. 54; Amer. Math. Soc., 2002. [Google Scholar]
  12. Musin, O. R.  The kissing number in four dimensions. Ann. Math. 2008, 168, 1–32. [Google Scholar] [CrossRef]
  13. Musin, O. R.  Towards a proof of the 24-cell conjecture. Acta Math. Hung. 2018, 155, 184–199. [Google Scholar] [CrossRef]
  14. Delsarte, P.; Goethals, J. M.; Seidel, J. J.  Spherical codes and designs. Geom. Dedicata 1977, 6, 363–388. [Google Scholar] [CrossRef]
  15. Cohn, H.; Elkies, N.  New upper bounds on sphere packings I. Ann. Math. 2003, 157, 689–714. [Google Scholar] [CrossRef]
  16. Cohn, H.; Zhao, Y.  Sphere packing bounds via spherical codes. Duke Math. J. 2014, 163, 1965–2002. [Google Scholar] [CrossRef]
  17. Bachoc, C.; Vallentin, F.  New upper bounds for kissing numbers from semidefinite programming. J. Amer. Math. Soc. 2008, 21, 909–924. [Google Scholar] [CrossRef]
  18. Hales, T. C.  A proof of the Kepler conjecture. Ann. Math. 2005, 162, 1065–1185. [Google Scholar] [CrossRef]
  19. Hales, T. C.; et al.  A formal proof of the Kepler conjecture. Forum Math. Pi 2017, 5, e2. [Google Scholar] [CrossRef]
  20. Viazovska, M.  The sphere packing problem in dimension 8. Ann. Math. 2017, 185, 991–1015. [Google Scholar] [CrossRef]
  21. 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]
  22. 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]
  23. Lasserre, J. B.  Global optimization with polynomials and the problem of moments. SIAM J. Optim. 2001, 11, 796–817. [Google Scholar] [CrossRef]
  24. Putinar, M.  Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math. J. 1993, 42, 969–984. [Google Scholar] [CrossRef]
  25. Parrilo, P. A.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, Caltech, 2000. [Google Scholar]
  26. Laurent, M.  Sums of squares, moment matrices and optimization over polynomials. Emerg. Appl. Algebr. Geom. IMA 2009, Vol. 149, 157–270. [Google Scholar]
  27. Sturmfels, B.  Solving Systems of Polynomial Equations. CBMS Reg. Conf. Ser. 97, 2002; Amer. Math. Soc. [Google Scholar]
  28. Basu, S.; Pollack, R.; Roy, M.-F. Algorithms in Real Algebraic Geometry, second ed.; Springer, 2006. [Google Scholar]
  29. Bochnak, J.; Coste, M.; Roy, M.-F. Real Algebraic Geometry; Springer, 1998. [Google Scholar]
  30. Schürmann, A.  Computational Geometry of Positive Definite Quadratic Forms. Univ. Lecture Ser. 48, 2009; Amer. Math. Soc. [Google Scholar]
  31. Voronoĭ, G. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. J. Reine Angew. Math. 1908, 133, 97–178. [Google Scholar]
  32. McMullen, P.  On zonotopes. Trans. Amer. Math. Soc. 1971, 159, 91–109. [Google Scholar] [CrossRef]
  33. Ziegler, G. M. Lectures on Polytopes; Springer, 1995. [Google Scholar]
  34. 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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated