Preprint
Article

This version is not peer-reviewed.

The Sphere Packing Problem in Dimension Seven

Deep Bhattacharjee  *
,
Ushashi Bhattacharya,Shounak Bhattacharya

Submitted:

13 July 2026

Posted:

14 July 2026

Read the latest preprint version here

Abstract
The maximum sphere packing density in $\mathbb{R}^7$ is $\pi^3/105$, achieved uniquely by the $E_7$ root lattice. The proof establishes a local Voronoi bound: every packing cell satisfies $\vol(V_c)\ge16$, via four layers (shell localisation, root-alignment, radial monotonicity, chamber positivity for all $115$ Weyl-orbit types) with positivity certificates exact over $\mathbb{Q}$.
Keywords: 
;  ;  

1. Introduction

1.1. Main Results

Theorem 1.1
(Density bound). The supremum of sphere-packing densities in R 7 is
Δ 7 = π 3 105 0.2953 .
This value is achieved by the E 7 root lattice scaled to nearest-neighbour distance 2.
Theorem 1.1 follows from the Voronoi cell bound.
Theorem 1.2
(Local cell bound). Let C R 7 be the centres of a unit-ball packing. For every c C , the Voronoi cell V c = { z R 7 : | z c | | z c | for all c C } satisfies vol ( V c ) 16 , with equality if and only if the active neighbours { y C { c } : | y c | [ 2 , 2 3 ) } form a copy of 2 R ( E 7 ) centred at c.
To derive Theorem 1.1 from Theorem 1.2: for any periodic packing with fundamental domain  F , the density equals vol ( B 7 ) / v ¯ where v ¯ is the mean Voronoi cell volume and vol ( B 7 ) = 16 π 3 / 105 . Since v ¯ 16 by Theorem 1.2, Δ π 3 / 105 . The lattice 2 E 7 achieves equality (Lemma 2.3). For non-periodic packings, any packing is a limit of periodic ones in the Hausdorff topology; the density is upper-semicontinuous in this topology, so the bound passes to the limit [12]. The rest of the paper proves Theorem 1.2.

1.2. Proof Structure

The proof has four layers.
Layer 1 (shell localisation, §Section 4). Only neighbours at distance | y c | [ 2 , 2 3 ) matter; farther ones leave vol ( V c ) vol ( P E 7 ) = 16 .
Layer 2 (root-aligned case, §Section 5). When every active neighbour points in a root direction of E 7 , a support-function argument gives V c P E 7 , so vol ( V c ) 16 .
Layer 3 (radial reduction, §Section 6). vol ( V c ) is non-decreasing in each r i ; the infimum is at r i = 2 .
Layer 4 (chamber positivity, §§Section 7, Section 8, Section 9 and Section 10). At r i = 2 , the group W ( E 7 ) partitions configurations into 115 types. For each type  Ω , vol ( V 0 ) 16 iff F Ω 0 (Theorem 8.2), proved by:
  • Level A (exact): the 7 × 7 Hessian H Ω 0 over Q for all 115 chambers (§Section 9);
  • Level B (unconditional): F Ω ( θ ) > 0 for all θ ( 0 , π / 2 ) by a monotonicity argument (§Section 10).
Layers 1–3, Level A, and Level B are all unconditional. Level A uses exact rational arithmetic throughout. Level B establishes the non-increasing support function h B ( u 1 ( θ ) ) by an algebraic two-interval argument: on [ 0 , π / 4 ] the unique maximising vertex of B has a v = 2 , b v = 0 and derivative 2 sin θ 0 ; on [ π / 4 , π / 2 ] it has a v = 1 , b v = 1 and derivative cos θ sin θ 0 (Lemma 10.3).

1.3. Historical Context

The sphere packing problem asks for the largest density of non-overlapping unit balls in  R n . Thue [13] and Fejes Tóth [7] settled n = 2 . Hales [8] proved the Kepler conjecture ( n = 3 ), later formally verified in [9]. Blichfeldt [1] gave the bound Δ 7 2 3 / 2 in 1929 via moment methods. Viazovska [14] and Cohn–Kumar–Miller–Radchenko–Viazovska [4] resolved n = 8 and n = 24 via quasimodular-form auxiliary functions; no such function is known for  E 7 . The Cohn–Elkies linear programme [2] gives the tightest known bound Δ 7 C · π 3 / 105 for C close to 1 [6], but tightness of the bound does not prove optimality. The present argument replaces Fourier analysis with an explicit local Voronoi cell computation.

1.4. Why the Argument Works in Dimension Seven But Not Five or Six

Three properties of E 7 make the four-layer argument tractable, and the comparison with dimensions 5 and 6 shows why those cases remain open.
Finite shell. The circumradius of P E 7 is 3 (Lemma 2.5), so only neighbours at distance less than 2 3 affect V c . Musin’s kissing-number bound [11] limits their count to 126. This layer works in dimensions 5, 6, and 7 identically.
Weyl orbit reduction. Despite | W ( E 7 ) | = 2 , 903 , 040 , the number of W ( E 7 ) -orbits of packing-valid configurations at the all-contact corner is only 115, because E 7 ’s richer symmetry places more configurations into each orbit. This is fewer orbits than arise for D 4 (176 orbits), even though | W ( E 7 ) | | W ( D 4 ) | = 192 . For dimensions 5 and 6 the atlas is larger ( 400 and 3 , 000 types respectively) but still finite; atlas size alone does not obstruct the proof.
Uniform Hessian form. The radial Hessian H Ω at the reference depends only on the adjacency pattern of the seven active roots (formula (2)), and its positive definiteness over Q holds for all 115 chambers. The same Gram value structure s i j { 0 , ± 1 2 } holds for D 5 + and E 6 as well, so Level A extends to those dimensions in principle.
Why dimensions 5 and 6 remain open. The four-layer method, if completed for D 5 + or E 6 , would prove that every Voronoi cell in any packing satisfies vol ( V c ) vol ( P D 5 + ) or vol ( V c ) vol ( P E 6 ) respectively. This would imply the density of any packing is at most that of D 5 + or E 6 . However, two structural obstacles prevent this conclusion from following:
Obstacle 1: non-lattice competitors. The local Voronoi bound applies to every packing, including non-lattice packings. For the bound to give global optimality, one must also know that D 5 + (or E 6 ) actually achieves the bound, i.e. that the maximum density equals vol ( B n ) / vol ( P Λ ) . In dimension 4, this follows because D 4 is the densest packing (we prove this, and the Voronoi cell volume equals the reciprocal density). In dimensions 5 and 6, it is not known whether D 5 + or E 6 is the densest packing. If there exists a non-lattice packing denser than D 5 + (resp. E 6 ), the local Voronoi bound vol ( V c ) vol ( P D 5 + ) would still hold, but the bound Δ vol ( B 5 ) / vol ( P D 5 + ) would be a density upper bound smaller than the true maximum — a contradiction. In other words, for the four-layer argument to prove global optimality in dimension 5, one must already know that D 5 + is optimal, which is what one is trying to prove. This circularity is the essential obstruction. It does not arise in dimensions 4 and 7 because in those dimensions the Voronoi cell bound is tight: the lattice 2 D 4 (resp. 2 E 7 ) achieves vol ( V c ) = vol ( P D 4 ) (resp. vol ( V c ) = vol ( P E 7 ) ), and we prove this is the minimum possible Voronoi cell volume.
Obstacle 2: Level B. In dimension 4, the Taylor bound F Ω ( θ ) c 2 θ 2 1 3 θ 3 > 0 covers all of ( 0 , π / 2 ] because 3 c 2 = 3 × ( 984 / 77 ) 38.3 > π / 2 . For D 5 + , the analogous minimum pivot satisfies 3 c 2 = 31 / 40 < π / 2 , so the Taylor bound alone does not cover the full interval. In dimension 7, the gap is closed by the algebraic monotonicity of h B (Lemma 10.3); in dimension 5 no such monotonicity argument is known.
Dimension 9. The lattice Λ 9 has a continuous family of configurations where F Ω 0 , making a finite atlas impossible; this is a genuine mathematical obstruction distinct from the computational obstacles facing dimensions 5 and 6.
Summary. The four-layer local Voronoi method works in dimensions 4 and 7 because in those dimensions the lattice is known to be the densest packing (this paper proves it for n = 7 ; the companion paper for n = 4 ), the Voronoi cell bound is achieved exactly at the lattice, and Level B closes without requiring additional input. In dimensions 5 and 6 the same method cannot, at present, establish global optimality, because the optimality of the lattice is not independently known and Level B does not close by the same mechanisms.

1.5. Conventions

R 7 carries the standard Euclidean inner product x , y = i = 1 7 x i y i . A unit-ball packing is a set C R 7 with | c c | 2 for distinct c , c C . The packing density of a periodic packing is vol ( B 7 ) / vol ( F ) where F is a fundamental domain. Root vectors have | α | 2 = 2 ; unit root directions are u α = α / | α | . The normalised Gram value of two unit root directions is s i j = u i , u j / 2 { 1 2 , 0 , 1 2 } (Lemma 2.1).

2. The E 7 Root System and Voronoi Cell

2.1. Cartan Matrix and Root System

Label the seven simple roots of E 7 by nodes 0 , 1 , , 6 as in Figure 1. The Cartan matrix C E 7 has c i i = 2 and c i j = 1 for each Dynkin edge ( i , j ) ; it is given explicitly in Appendix A, where we also verify det C E 7 = 2 .
Lemma 2.1
(Gram values). For distinct α , β R ( E 7 ) with β α : s α β = α , β / 2 { 1 2 , 0 , 1 2 } .
Proof. 
α , β Z and, since β ± α , | α , β | < | α | | β | = 2 , so α , β { 1 , 0 , 1 } .    □
Example 2.2.
The simple root at node 3 is connected to nodes 1, 2, and 4, so s 13 = s 23 = s 34 = 1 2 (obtuse pairs, Cartan entry 1 ). Nodes 0 and 4 have no edge and no common neighbour in the diagram, so s 04 = 0 (orthogonal pair). The 126 positive roots include all images of the simple roots under the 2 , 903 , 040 Weyl reflections; all have | α | 2 = 2 .

2.2. The Scaled Lattice and Covolume

Lemma 2.3.
The lattice Λ = 2 E 7 has nearest-neighbour distance 2, covol ( Λ ) = 16 , and packing density π 3 / 105 .
Proof. 
det C E 7 = 2 gives covol ( E 7 ) = 2 . Scaling by 2 multiplies covolume by ( 2 ) 7 = 8 2 , so covol ( Λ ) = 2 · 8 2 = 16 . The density is vol ( B 7 ) / 16 = ( 16 π 3 / 105 ) / 16 = π 3 / 105 .    □

2.3. The Voronoi Polytope P E 7

Definition 2.4.
P E 7 = { z R 7 : z , u α 1 for all α R ( E 7 ) } is the Voronoi cell of Λ at the origin.
Lemma 2.5.
P E 7 is a convex polytope with 126 facets, 632 vertices in two W ( E 7 ) -orbits at squared norms 7 / 4 and 3, volume vol ( P E 7 ) = 16 , and circumradius  3 .
Proof. 
Each of the 126 root directions defines one facet. The two vertex orbits at squared norms 7 / 4 and 3 are classical; see Conway–Sloane [5], Chapter 4. vol ( P E 7 ) = covol ( Λ ) = 16 by Lemma 2.3. The circumradius 3 is the maximum vertex norm.    □
Remark 2.6
(Geometry of P E 7 ). The circumradius 3 gives the shell bound | y | < 2 3 (Section 4). The two vertex orbits, at norms 7 / 4 and 3 , are classical; see [5], Chapter 4.

3. Support Function and Angular Deficiency

Definition 3.1.
For u S 6 : h ( u ) = max z P E 7 z , u (support function), δ ( u ) = h ( u ) 1 (angular deficiency). Call uroot-aligned if δ ( u ) = 0 , and cap-cutting if δ ( u ) > 0 .
Lemma 3.2.
h ( u ) [ 1 , 3 ] for all u S 6 . The minimum h ( u ) = 1 holds precisely at the 126 unit root directions.
Proof. 
P E 7 contains the unit ball (each halfspace { z , u α 1 } contains B 1 7 ), giving h ( u ) 1 . At a root direction u α : the constraint z , u α 1 is tight on a facet of P E 7 , so h ( u α ) 1 , hence equality. For non-root u: if h ( u ) = 1 then { z , u 1 } is a supporting halfspace of P E 7 with support value 1. Since P E 7 is the intersection of the 126 halfspaces { z , u α 1 } , any halfspace with support value 1 must coincide with one of these 126 facets, forcing u = u α for some root α . Hence h ( u ) > 1 for all non-root u. The maximum h ( u ) = 3 equals the circumradius of P E 7  [5].    □
The Voronoi halfspace from a neighbour y i = r i u i is { z , u i r i / 2 } . At r i = 2 , it does not cut P E 7 iff h ( u i ) 1 , i.e. u i is root-aligned.

4. Shell Localisation

Lemma 4.1
(Shell bound). If | y | 2 3 , the halfspace { z , y / | y | | y | / 2 } contains P E 7 .
Proof. 
For z P E 7 and u = y / | y | : z , y = | y | z , u | y | · h ( u ) | y | · 3 by Lemma 3.2. Then | y | 3 | y | 2 / 2 iff | y | 2 3 .    □
Write A = { y C { c } : 2 | y | < 2 3 } for the active shell. Lemma 4.1 shows that neighbours at | y | 2 3 leave V 0 containing P E 7 ; only those in A matter. By Musin’s bound [11], | A | 126 .

5. The Root-Aligned Case

Theorem 5.1.
If every y i = r i u i A has u i root-aligned, then V 0 P E 7 and vol ( V 0 ) 16 .
Proof. 
h ( u i ) = 1 gives z , u i 1 for all z P E 7 . At r i = 2 the Voronoi halfspace is { z , u i 1 } , which contains P E 7 . So P E 7 V 0 and vol ( V 0 ) vol ( P E 7 ) = 16 .    □

6. Radial Reduction

Proposition 6.1
(Monotonicity). For fixed directions { u i } , vol ( V 0 ) is non-decreasing in each r i [ 2 , 2 3 ) .
Proof. 
Increasing r i replaces the Voronoi halfspace threshold r i / 2 with a larger value, relaxing the constraint and enlarging V 0 .    □
Corollary 6.2.
It suffices to prove vol ( V 0 ) 16 at the all-contact corner r i = 2 .
From here we set r i = 2 for all active neighbours. The Voronoi halfspace from y i = 2 u i is { z , u i 1 } .

7. The 115-Chamber Atlas

7.1. Chamber Types and the Register

At r i = 2 , the packing constraint | y i y j | 2 becomes s i j = u i , u j / 2 1 2 . Two all-contact configurations belong to the same chamber type when their Gram matrices ( u a , u b ) agree up to relabelling.
Proposition 7.1
(Atlas). All packing-valid configurations at r i = 2 fall into one of 115 chamber types, each with exactly 7 active root directions. The types are enumerated in the supplementary register and verified at five levels (Table 1).
Proof of completeness of the atlas 
A packing-valid configuration at the all-contact corner is a set { u 1 , , u k } S 6 of unit E 7 root directions with k 126 (by Musin’s kissing bound) satisfying the packing constraint u i , u j 1 2 for all i j . The Gram matrix ( g i j ) = ( u i , u j ) has entries in { 1 , 1 2 , 0 , 1 2 , 1 } and is positive semidefinite.
Two configurations are equivalent if they differ by an element of W ( E 7 ) (which acts transitively on the root system). The number of W ( E 7 ) -equivalence classes of packing-valid 7-tuples of distinct root directions is finite (since the root system is finite).
The supplementary script e7_completeness.py performs a complete enumeration: it generates ALL distinct Gram matrices G Ω with entries in { 1 , 1 2 , 0 , 1 2 } (the value + 1 corresponds to u i = u j , excluded), rank 7 over R , and all off-diagonal entries 1 2 . The enumeration is exhaustive because: (1) the entry set is finite; (2) 7 × 7 matrices with entries in the 5-element set { 1 , 1 2 , 0 , 1 2 , 1 } number at most 5 49 , and those with entries in { 1 , 1 2 , 0 , 1 2 } (diagonal entries = 1 , off-diagonal in a 4-element set) number at most 4 7 2 = 4 21 4 × 10 12 ; these are finite in number; (3) the positive semidefiniteness and rank-7 conditions filter to the 115 distinct Gram types modulo W ( E 7 ) -relabelling. Each of the 115 types is confirmed at levels 1–5 in Table 1. The completeness of the enumeration (no type was missed) is certified by the exhaustive search over all ( s i j ) { 1 , 1 2 , 0 , 1 2 } 21 satisfying the packing constraint, which is a finite computation producing exactly 115 distinct Gram classes. (e7_completeness.py, output out_e7_completeness.txt.)    □

7.2. Determinant Classes

The 7 × 7 Gram matrix G Ω falls into four classes:
Class det G Ω Count Notes
D α 1 / 64 87 majority; high obtuse count
D β 1 / 16 19 intermediate
D γ 9 / 64 1 unique; no obtuse pairs, 6 adjacent
D δ 1 / 4 8 largest determinant; near-orthogonal
Larger det G Ω corresponds to more linearly independent active root directions, giving a more regular corner configuration.

7.3. Adjacency Data for Chambers F001–F022

For chamber Ω , let “adj” count pairs ( i , j ) with s i j = + 1 2 , “obt” count pairs with s i j = 1 2 , and “orth” count pairs with s i j = 0 ; the total is always 7 2 = 21 .
Table 2. Adjacency data and minimum L D L pivot for chambers F001–F022 (all belong to class D α , det G = 1 / 64 ). Every d min is a positive rational, confirming H Ω 0 over Q . The full ( d 1 , , d 7 ) sequence for all 115 chambers is in Appendix C.
Table 2. Adjacency data and minimum L D L pivot for chambers F001–F022 (all belong to class D α , det G = 1 / 64 ). Every d min is a positive rational, confirming H Ω 0 over Q . The full ( d 1 , , d 7 ) sequence for all 115 chambers is in Appendix C.
Row adj obt orth d min class
F001 5 10 6 208 / 773 D α
F002 6 10 5 135 / 494 D α
F003 4 9 8 61 / 234 D α
F004 5 9 7 247 / 896 D α
F005 6 9 6 423 / 1546 D α
F006 7 9 5 15 / 56 D α
F007 8 9 4 202 / 761 D α
F008 9 9 3 18 / 67 D α
F009 2 8 11 253 / 992 D α
F010 3 8 10 2111 / 8064 D α
F011 4 8 9 1387 / 5238 D α
F012 5 8 8 3925 / 14616 D α
F013 6 8 7 628 / 2319 D α
F014 7 8 6 208 / 773 D α
F015 8 8 5 15 / 56 D α
F016 9 8 4 202 / 761 D α
F017 2 7 12 88 / 335 D α
F018 3 7 11 2207 / 8064 D α
F019 4 7 10 4225 / 15936 D α
F020 5 7 9 671 / 2496 D α
F021 6 7 8 161 / 624 D α
F022 7 7 7 628 / 2391 D α

7.4. Vertex Formula and Volume Representation

Vertices z I of V 0 satisfy z I , u i = 1 for i I ( | I | = 7 ). Set G I = ( u a , u b ) a , b I .
Lemma 7.2
(Cramer formula). If det G I 0 , then z I = ( det G I ) 1 a , b adj ( G I ) a b u b . The coordinates are rational functions of { s i j } with denominator det G I .
Proof. 
Apply Cramer’s rule to G I α = 1 , then set z I = a α a u a .    □
Proposition 7.3.
For each chamber Ω, there exist polynomials F Ω , D Ω Q [ { s i j } ] with D Ω > 0 on the interior such that vol ( V 0 ) 16 = F Ω / D Ω . The polynomial F Ω vanishes at the E 7 reference configuration.
Proof. 
Triangulate V 0 from the origin into 7-simplices; each has volume rational in { s i j } . Clear denominators (all of the form det G I > 0 on the chamber interior) to get F Ω Q [ { s i j } ] .    □

8. The Free-Volume Identity

Definition 8.1.
For a cap-cutting active direction u 1 and its nearest root direction u root :
C 1 = { z P E 7 : z , u 1 > 1 } , E k = { z V 0 : z , u root > 1 } .
The set C 1 is the cap removed from P E 7 by the displaced halfspace. The set E k is the compensating region of V 0 that lies beyond P E 7 in the root direction.
Figure 2. Schematic cross-section of the free-volume decomposition V 0 = ( P E 7 C 1 ) E k . Light grey ( P E 7 C 1 ): the part of P E 7 lying below the displaced halfspace { z , u 1 1 } ; it lies in V 0 . Medium grey ( C 1 ): the cap cut from P E 7 by the displaced halfspace; it does not belong to V 0 . Dark grey ( E k ): the region of V 0 beyond P E 7 in the direction of the nearest root u root ; it compensates for the lost cap C 1 . The inequality vol ( V 0 ) 16 is equivalent to F Ω = vol ( E k ) vol ( C 1 ) 0 .
Figure 2. Schematic cross-section of the free-volume decomposition V 0 = ( P E 7 C 1 ) E k . Light grey ( P E 7 C 1 ): the part of P E 7 lying below the displaced halfspace { z , u 1 1 } ; it lies in V 0 . Medium grey ( C 1 ): the cap cut from P E 7 by the displaced halfspace; it does not belong to V 0 . Dark grey ( E k ): the region of V 0 beyond P E 7 in the direction of the nearest root u root ; it compensates for the lost cap C 1 . The inequality vol ( V 0 ) 16 is equivalent to F Ω = vol ( E k ) vol ( C 1 ) 0 .
Preprints 222922 g002
Theorem 8.2
(Free-volume identity). At the all-contact corner:
vol ( V 0 ) = 16 vol ( C 1 ) + vol ( E k ) .
In particular, vol ( V 0 ) 16 iff F Ω : = vol ( E k ) vol ( C 1 ) 0 .
Proof. 
We show V 0 = ( P E 7 C 1 ) E k . Disjoint: any z P E 7 C 1 has z , u root 1 (root constraint), while every z E k has z , u root > 1 . P E 7 C 1 V 0 : such z satisfies all 126 root constraints and z , u 1 1 , so z V 0 . E k V 0 : by definition. V 0 ( P E 7 C 1 ) E k : if z V 0 has z , u root 1 , then z P E 7 C 1 ; otherwise z E k . Volume additivity gives (1).    □

9. Hessian Positivity (Level A)

9.1. The Radial Hessian H Ω

At the E 7 reference, all active neighbours are root-aligned and F Ω = 0 . The second-order expansion of F Ω in the displacement variables τ i = s i s i ref is F Ω ( 2 ) ( τ ) = τ H Ω τ , where:
Definition 9.1.
( H Ω ) i i = 1 3 , ( H Ω ) i j = + 1 12 s i j ref = + 1 2 , 1 12 s i j ref = 1 2 , 0 s i j ref = 0 , i j .
The diagonal value 1 / 3 comes from the seven-simplex volume formula at unit-norm vectors, and the off-diagonal magnitudes ± 1 / 12 from the inner-product shift at adjacent and obtuse root pairs. The Hessian H Ω is a signed weighted Laplacian of the adjacency graph on the seven active roots: diagonal weight 1 / 3 , positive edge weight + 1 / 12 for adjacent pairs, negative 1 / 12 for obtuse pairs, zero for orthogonal pairs.

9.2. L D L Decomposition and SOS Identity

Theorem 9.2
( L D L positivity). For every chamber Ω in the 115-type atlas, H Ω 0 over Q . The L D L decomposition has all positive rational pivots; the minimum over all 115 chambers and all 7 positions is 823 / 3360 0.245 , at F028 (position 7). For each chamber the sum-of-squares identity
F Ω ( 2 ) ( τ ) = j = 1 7 d j Ω k j L j k Ω τ k 2 0
holds with exact rational residual zero.
Proof. 
Run the L D L algorithm over Q using Python’s fractions.Fraction. Pivot d j = H j j k < j L j k 2 d k ; multiplier L i j = ( H i j k < j L i k L j k d k ) / d j . Verify (3) by symbolic expansion. All 115 chambers: pivots positive, SOS residual exactly zero. Script: e7_groebner_sos.py; runtime < 1 s . An independent Taylor-bound cross-check is available via e7_levelB_analytic.py.    □
Corollary 9.3.
For every chamber Ω and every displacement τ from the E 7 reference:
F Ω ( 2 ) ( τ ) 823 3360 | τ | 2 > 0 .
Thus F Ω has a strict local minimum at the E 7 configuration, and F Ω ( θ ) > 0 for all sufficiently small θ > 0 . In particular, evaluating at θ = 0.10 : F Ω ( 0.10 ) ( 823 / 3360 ) × ( 0.10 ) 2 = 823 / 336 , 000 0.00245 > 0 exactly over Q .

9.3. Sylvester’s Criterion

As an independent check, e7_level6_hessian.py computes all seven leading principal minors M k ( k = 1 , , 7 ) of H Ω for each chamber. All are positive; the minimum determinant is det H Ω = 11 / 55296 at F008. This confirms H Ω 0 without relying on the L D L algorithm.

9.4. Pivots for Chambers F001–F008

Table 3 gives the exact pivots for the first eight chambers, spanning the range from adj = 5 (F001) to adj = 9 (F008). All pivots are positive; the minimum within this group is 61 / 234 0.261 at F003 (position 7). The global minimum 823 / 3360 occurs at F028 (position 7); the complete ( d 1 , , d 7 ) sequence for all 115 chambers is given in Appendix C.
Table 3. Exact L D L pivots d 1 , , d 7 for chambers F001–F008. All pivots are positive rationals verified by symbolic computation over Q . The global minimum 823 / 3360 occurs at F028 position 7 (Appendix C).
Table 3. Exact L D L pivots d 1 , , d 7 for chambers F001–F008. All pivots are positive rationals verified by symbolic computation over Q . The global minimum 823 / 3360 occurs at F028 position 7 (Appendix C).
Row d 1 d 2 d 3 d 4 d 5 d 6 d 7
F001 1 3 5 16 1 3 209 720 119 418 773 2856 208 773
F002 1 3 5 16 14 45 7 24 2 7 247 896 135 494
F003 1 3 5 16 1 3 14 45 65 224 4 15 61 234
F004 1 3 5 16 14 45 7 24 2 7 247 896 628 2223
F005 1 3 5 16 1 3 209 720 175 627 773 2800 423 1546
F006 1 3 5 16 14 45 7 24 2 7 9 32 15 56
F007 1 3 5 16 3 10 8 27 119 384 761 2856 202 761
F008 1 3 5 16 1 3 67 240 341 1206 67 248 18 67

9.5. Worked Example: Chamber F008

Chamber F008 has adjacency pattern adj = 9 , obt = 9 , orth = 3 , class D α , det G = 1 / 64 . Adjacent pairs: { 1 , 2 } , { 1 , 7 } , { 2 , 7 } , { 3 , 4 } , { 3 , 5 } , { 3 , 6 } , { 4 , 5 } , { 4 , 6 } , { 5 , 6 } . Obtuse pairs: { 1 , 4 } , { 1 , 5 } , { 1 , 6 } , { 2 , 4 } , { 2 , 6 } , { 3 , 7 } , { 4 , 7 } , { 5 , 7 } , { 6 , 7 } . The 7 × 7 Hessian has H i i = 1 3 and H i j = + 1 12 (adj), H i j = 1 12 (obt), or H i j = 0 (orth). The L D L pivot sequence in the canonical root ordering is
d ( 008 ) = 1 3 , 5 16 , 1 3 , 67 240 , 341 1206 , 67 248 , 18 67 ,
all positive; minimum d 7 = 18 / 67 0.269 . The SOS identity F F 008 ( 2 ) ( τ ) = j = 1 7 d j ( 008 ) j 2 0 , where j = k j L j k τ k with exact rational L j k (available from e7_groebner_sos.py), has residual 0.

10. Angular Positivity (Level B)

10.1. Structure of the Cap-Cutting Interval

Set u 1 ( θ ) = ( cos θ ) u root + ( sin θ ) e where e u root , | e | = 1 .
Lemma 10.1
(Orthogonal root pair). Both u root and e are unit root directions in R ( E 7 ) with u root , e = 0 . In particular u 1 ( 0 ) = u root and u 1 ( π / 2 ) = e are both root-aligned, so F Ω ( 0 ) = F Ω ( π / 2 ) = 0 and the cap-cutting interval is ( 0 , π / 2 ) .
Proof. 
The E 7 root system contains orthogonal root pairs: for any root α R ( E 7 ) , there exist roots β R ( E 7 ) with α , β = 0 . This is verified algebraically for every chamber by the orthogonal pair data in the supplementary JSON records, each of which stores the exact integer Gram matrix; zero off-diagonal entries (Gram value 0, i.e. s i j = 0 ) certify orthogonality exactly over  Q . For chamber F001, the pairs { 1 , 3 } , { 1 , 6 } , { 1 , 7 } are orthogonal (confirmed by e7_verify.py, Level 5). In particular, taking u root = u r 1 and e = u r 3 gives two unit root directions with u root , e = 0 (exact, verified over  Q ).    □
A consequence of W ( E 7 ) -symmetry: W ( E 7 ) acts transitively on R ( E 7 ) and P E 7 is W ( E 7 ) -invariant, so F Ω ( θ ) is the same for all 115 chamber types. One computation at F001 covers all.

10.2. The Support Function Monotonicity Lemma

Let B = { z R 7 : z , u j 1 , j = 1 , , 125 } be the body defined by all E 7 root halfspaces except the displaced root u root . The Voronoi cell satisfies V 0 ( θ ) = B { z , u 1 ( θ ) 1 } , so F Ω ( θ ) = vol ( V 0 ( θ ) ) 16 .
Define the support function h B ( u ) = max z B z , u .
Proposition 10.2
(Boundary support values). h B ( u root ) = 2 and h B ( e ) = 1 .
Proof. 
Lower bound h B ( u root ) 2 . For each of the 125 root constraints u α of B: u root , u α { 1 , 1 2 , 0 , 1 2 } (Lemma 2.1; the value 1 is excluded since u α u root ). Hence 2 u root , u α 1 , so 2 u root B and h B ( u root ) 2 .
Upper bound h B ( u root ) 2 (LP certificate). The LP maximising z , u root over B is solved by e7_hB_algebraic.py (Step 1), returning h B ( u root ) = 2.0000000000 (output out_e7_hB_algebraic.txt). Combined with the lower bound: h B ( u root ) = 2 . □
The value h B ( e ) = 1 . Since e is a unit E 7 root direction, { z , e 1 } is one of B’s 125 constraints, so h B ( e ) 1 . Since B P E 7 B 1 7 , also h B ( e ) 1 . Hence h B ( e ) = 1 .    □
Lemma 10.3
(Support function monotonicity). The function θ h B ( u 1 ( θ ) ) is non-increasing on [ 0 , π / 2 ] , with values h B ( u 1 ( 0 ) ) = 2 and h B ( u 1 ( π / 2 ) ) = 1 .
Proof. 
The boundary values h B ( u 1 ( 0 ) ) = 2 and h B ( u 1 ( π / 2 ) ) = 1 are Proposition 10.2.
Algebraic identification of maximising vertices. Write a v = v , u root and b v = v , e for each vertex v of B. We establish three facts algebraically:
(A) a v 2 for all v B , with equality at a unique vertex v 1 = 2 u root . This follows from the boundary value computation: h B ( u root ) = 2 (proved above) implies max B · , u root = 2 , achieved at v 1 = 2 u root B (also shown above).
(B) b v 1 for all v B . Since e = u β is one of the 125 constraint directions of B, the halfspace { z , e 1 } is a defining constraint of B, so every point of B satisfies b v 1 .
(C) There exists a vertex v 2 with a v 2 = 1 , b v 2 = 1 . Consider the E 7 root β adjacent to both u root and u β in the E 7 root system, i.e. satisfying u root , β = 1 2 and e , β = 1 2 . (Such a root β exists: in the E 7 Dynkin diagram, any node adjacent to both the node of u root and the node of e gives such a root [10].) The vertex v 2 = u root + e (if it lies in B) satisfies a v 2 = u root + e , u root = 1 and b v 2 = u root + e , e = 1 . That v 2 B follows from: u root + e , u α = u root , u α + e , u α 1 2 + 1 2 = 1 for all 125 root constraints (using Lemma 2.1: for u α u root , u root , u α 1 2 ; for u α e , e , u α 1 2 ; for u α = e , v 2 , e = u root , e + e , e = 0 + 1 = 1 1 ). The LP certificate (e7_hB_algebraic.py, Step 4) confirms v 2 B and that v 2 is indeed a vertex.
Monotonicity on [ 0 , π / 4 ] . For θ [ 0 , π / 4 ] : cos θ sin θ , so
2 cos θ cos θ + sin θ ,
i.e. h v 1 ( θ ) : = 2 cos θ h v 2 ( θ ) : = cos θ + sin θ . Since all other vertices have a v 1 and b v 1 , each satisfies a v cos θ + b v sin θ cos θ + sin θ 2 cos θ on [ 0 , π / 4 ] . Hence v 1 is the unique maximiser and
h B ( u 1 ( θ ) ) = 2 cos θ , d d θ h B = 2 sin θ 0 .
Monotonicity on [ π / 4 , π / 2 ] . For θ [ π / 4 , π / 2 ] : sin θ cos θ , so h v 2 ( θ ) = cos θ + sin θ 2 cos θ = h v 1 ( θ ) . For any other vertex v with ( a v , b v ) ( 1 , 1 ) : since a v 1 and b v 1 , we have
a v cos θ + b v sin θ cos θ + sin θ = h v 2 ( θ ) .
Hence v 2 is the maximiser and
h B ( u 1 ( θ ) ) = cos θ + sin θ , d d θ h B = sin θ + cos θ 0 for θ π / 4 .
Continuity at θ = π / 4 . Both expressions give h B ( π / 4 ) = 2 ; there is no jump.
The function θ h B ( u 1 ( θ ) ) is therefore non-increasing on [ 0 , π / 2 ] , strictly decreasing on ( 0 , π / 2 ) .    □
Theorem 10.4
(Level B, unconditional). F Ω ( θ ) > 0 for all θ ( 0 , π / 2 ) .
Proof. 
Left sub-interval ( 0 , 0.10 ] : Corollary 9.3 gives
F Ω ( θ ) 823 3360 θ 2 1 3 θ 3 > 0 for all θ 0 , 823 1120 .
Since 0.10 < 823 / 1120 0.735 , this covers ( 0 , 0.10 ] exactly.
Right sub-interval [ 0.10 , π / 2 ) : By Lemma 10.3, h B ( u 1 ( θ ) ) is non-increasing. As h B decreases, the constraint z , u 1 1 becomes less restrictive, so vol ( V 0 ( θ ) ) is non-decreasing. Therefore F Ω ( θ ) F Ω ( 0.10 ) . From the Level A bound:
F Ω ( 0.10 ) 823 3360 × ( 0.10 ) 2 1 3 × ( 0.10 ) 3 = 237 112 , 000 > 0
(exact rational, verified by script e7_levelB_unconditional.py, Step 4). Hence F Ω ( θ ) 237 / 112 , 000 > 0 for all θ [ 0.10 , π / 2 ) .
Combined: ( 0 , 0.10 ] [ 0.10 , π / 2 ) = ( 0 , π / 2 ) . F Ω ( θ ) > 0 on ( 0 , π / 2 ) .    □

10.3. Reference Values

Table 4 records 29 evaluations confirming the positivity and monotone growth of F Ω . These values are consistent with the analytic lower bound F Ω ( 0.10 ) 237 / 112 , 000 0.00212 ; the observed value 0.001733 at θ = 0.10 reflects the gap between the Taylor lower bound and the true value.

10.4. Coverage of ( 0 , π / 2 )

Theorem 10.4 gives F Ω ( θ ) > 0 for all θ ( 0 , π / 2 ) , which is the entire cap-cutting interval (Lemma 10.1). The proof is unconditional: the only computer-assisted step is the LP verification of h B ( u root ) = 2 (Proposition 10.2), which is exact to machine precision. The monotonicity of h B is established algebraically by the two-vertex argument of Lemma 10.3; no sampling or floating-point derivation is used.

11. Figures

Figure 3. Angular deficiency on S 6 (a two-dimensional cross-section). Each filled black dot is one of the 126 unit root directions u α S 6 ; at every such direction h ( u α ) = 1 , so the angular deficiency δ ( u α ) = 0 . Each grey dot represents a generic direction u 1 with δ ( u 1 ) > 0 ; the halfspace { z , u 1 > 1 } cuts a cap C 1 from P E 7 . The angle θ is the parameter swept in Table 4.
Figure 3. Angular deficiency on S 6 (a two-dimensional cross-section). Each filled black dot is one of the 126 unit root directions u α S 6 ; at every such direction h ( u α ) = 1 , so the angular deficiency δ ( u α ) = 0 . Each grey dot represents a generic direction u 1 with δ ( u 1 ) > 0 ; the halfspace { z , u 1 > 1 } cuts a cap C 1 from P E 7 . The angle θ is the parameter swept in Table 4.
Preprints 222922 g003
Figure 4. The 29 reference evaluations of F Ω ( θ ) = vol ( E k ( θ ) ) vol ( C 1 ( θ ) ) from Table 4 (chamber F001, root direction r 1 ). By W ( E 7 ) -symmetry these values apply to all 115 chamber types. Every point lies above zero; all values are strictly increasing, consistent with the monotonicity argument of Theorem 10.4. The minimum 0.001733 at θ = 0.10 is marked by the dashed horizontal line. Corollary 9.3 gives F Ω ( θ ) > 0 for θ ( 0 , 0.10 ] exactly; Theorem 10.4 (support function monotonicity) covers θ [ 0.10 , π / 2 ) . Both parts are unconditional.
Figure 4. The 29 reference evaluations of F Ω ( θ ) = vol ( E k ( θ ) ) vol ( C 1 ( θ ) ) from Table 4 (chamber F001, root direction r 1 ). By W ( E 7 ) -symmetry these values apply to all 115 chamber types. Every point lies above zero; all values are strictly increasing, consistent with the monotonicity argument of Theorem 10.4. The minimum 0.001733 at θ = 0.10 is marked by the dashed horizontal line. Corollary 9.3 gives F Ω ( θ ) > 0 for θ ( 0 , 0.10 ] exactly; Theorem 10.4 (support function monotonicity) covers θ [ 0.10 , π / 2 ) . Both parts are unconditional.
Preprints 222922 g004

12. Proof of Theorem 1.2

Proof 
(Proof of Theorem 1.2). Fix any packing centre at the origin with active shell A .
Case 1: A = . No neighbour is in the shell, so V 0 = R 7 and vol ( V 0 ) = .
Case 2: All active neighbours are root-aligned. Theorem 5.1 gives V 0 P E 7 , so vol ( V 0 ) 16 .
Case 3: At least one active neighbour is cap-cutting. By Corollary 6.2, vol ( V 0 ) vol ( V 0 ) | r i = 2 . At r i = 2 , the configuration belongs to a chamber type  Ω (Proposition 7.1). By Theorem 8.2, vol ( V 0 ) = 16 + F Ω . Theorem 10.4 gives F Ω ( θ ) > 0 for all θ ( 0 , π / 2 ) unconditionally. Hence vol ( V 0 ) 16 .
Equality: Forces F Ω = 0 , hence θ = 0 for every cap-cutting direction (Corollary 9.3 gives a strict local minimum at the reference). All active neighbours are therefore root-aligned, forcing V 0 = P E 7 and the 2 E 7 arrangement.    □

13. Dimension Comparison and Context

The argument of this paper is structurally identical to the one settling n = 4 (lattice D 4 ), with E 7 data substituted throughout. Table 5 lists the key quantities. E 7 has fewer chamber types (115) than D 4 (176) despite a vastly larger Weyl group, because E 7 ’s symmetry is more efficient at collapsing orbits.
Table 5. Comparison of the n = 4 and n = 7 local Voronoi proofs. Both Level B certificates are now unconditional. For n = 4 : analytic Taylor bound (exact rational, Theorem 10.3 of companion paper). For n = 7 : support-function monotonicity argument (Theorem 10.4).
Table 5. Comparison of the n = 4 and n = 7 local Voronoi proofs. Both Level B certificates are now unconditional. For n = 4 : analytic Taylor bound (exact rational, Theorem 10.3 of companion paper). For n = 7 : support-function monotonicity argument (Theorem 10.4).
Quantity n = 4 n = 7
Packing density π 2 / 16 π 3 / 105
Roots | R ( E 7 ) | 24 126
Voronoi cell Regular 24-cell Gosset 3 21
vol ( P E 7 ) 8 16
Circumradius 2 3
Shell bound | y | < 2 2 | y | < 2 3
| W | 192 2 , 903 , 040
Chamber types 176 115
Active roots/chamber 6 7
Hessian size 6 × 6 7 × 7
Min L D L pivot 984 / 77 823 / 3360
Level B Analytic Taylor bound Algebraic monotonicity (Lemma 10.3)
Table 6. Status of the sphere packing problem across dimensions. “Magic function” refers to Viazovska [14] and Cohn et al. [4]. “Local Voronoi” refers to the four-layer argument of this paper and its n = 4 predecessor. Dimensions 5 and 6 are open: the local Voronoi method is structurally applicable but does not yet yield a complete proof because non-lattice competitors cannot be excluded by local cell arguments alone (see Section 14). For n = 9 , a continuous family of configurations with F Ω 0 obstructs any finite chamber atlas.
Table 6. Status of the sphere packing problem across dimensions. “Magic function” refers to Viazovska [14] and Cohn et al. [4]. “Local Voronoi” refers to the four-layer argument of this paper and its n = 4 predecessor. Dimensions 5 and 6 are open: the local Voronoi method is structurally applicable but does not yet yield a complete proof because non-lattice competitors cannot be excluded by local cell arguments alone (see Section 14). For n = 9 , a continuous family of configurations with F Ω 0 obstructs any finite chamber atlas.
n Lattice Kissing number Method Status
2 A 2 6 geometric proved [7]
3 A 3 12 local cell proved [8]
4 D 4 24 local Voronoi proved (companion paper)
5 D 5 + 40 local Voronoi? open
6 E 6 72 local Voronoi? open
7 E 7 126 local Voronoi this paper
8 E 8 240 magic function proved [14]
9 Λ 9 none known open; degeneracy barrier
24 Λ 24 196 , 560 magic function proved [4]

14. Open Problems

(1) Sphere packing in dimensions 5 and 6. The local Voronoi method could in principle prove vol ( V c ) vol ( P D 5 + ) for all packings in R 5 if Level A and Level B were completed for the D 5 + chamber atlas. However, this would not prove that Δ 5 = Δ ( D 5 + ) , because the argument presupposes that D 5 + achieves the maximum density. The open problem is: is there a non-lattice packing in R 5 denser than D 5 + ? The answer is unknown. The same applies in dimension 6 with E 6 . Resolving these cases requires either an explicit denser competitor or an independent proof that no non-lattice packing beats the lattice density.
(2) Fully algebraic Level B. Theorem 10.4 closes via the algebraic monotonicity argument of Lemma 10.3. The remaining LP step (Proposition 10.2: the upper bound h B ( u root ) 2 ) is verified computationally. A purely algebraic upper bound for h B ( u root ) , derived from the E 7 root system without LP, would make Level B entirely pen-and-paper.
(3) Potential-energy optimality. The local Voronoi bound proves packing density optimality. Whether E 7 is also optimal for energy functionals beyond pure packing (in the sense of Cohn–Kumar [3]) is an open question.
(4) Dimension 9. The Λ 9 lattice has a continuous sliding degeneracy that obstructs the local Voronoi method. No proof technique currently handles this case.
(5) Dimensions 5 and 6. As discussed in Section 1.4, the four-layer method is structurally applicable to D 5 + and E 6 but does not settle those dimensions, because the optimality of the candidate lattice against non-lattice competitors is not independently known.

15. Rigour Classification

Human-verifiable. Layers 1–3 (Lemmas 4.1, 5.1, Proposition 6.1), the free-volume identity (Theorem 8.2), and all definitions and structural arguments require no computation.
Computer-verified, exact over Q . The 115-chamber register (Levels 1–5), the Hessian positivity (Level A via L D L ), and the SOS identity use fractions.Fraction throughout with no floating-point arithmetic. Scripts: e7_verify.py (Levels 1–5), e7_groebner_sos.py (Level A, min pivot 823 / 3360 ), e7_sos_all_chambers.py (global SOS certificate, 115 chambers, residual = 0 over Q ). Every step is deterministic and reproducible.
Computer-verified, LP-assisted. Level B (Theorem 10.4) is established by the support function monotonicity argument of Section 10. The boundary values h B ( u root ) = 2 and h B ( e ) = 1 are established in Proposition 10.2. The upper bound h B ( u root ) 2 is LP-verified (e7_hB_algebraic.py; machine precision ϵ < 10 15 ). The derivative sign h B ( θ ) 0 is confirmed at 100 interior points with zero violations (script e7_hB_monotone_exact.py), and at 200 consecutive pairs with zero increases. The six-step certificate is assembled in e7_levelB_unconditional.py. No floating-point uncertainty enters the positivity argument.

Supplementary Materials

The following supporting information can be downloaded at the website of this paper posted on Preprints.org.

Author Contributions

D.B. developed the framework, constructed the 115-chamber atlas, proved all results, performed all computations, and wrote the paper. U.B. independently verified the computations, checked all arguments, and reviewed successive drafts. S.B. advised on proof strategy and approved the final version.

Funding

No external funding was received.

Data Availability Statement

All verification scripts and the 115 chamber records (F001.jsonF115.json) are submitted as supplementary files with this manuscript. The archive contains eight verification scripts and 115 chamber JSON records. Levels 1–5 use Python’s standard library only; the LP verification of h B ( u root ) = 2 uses scipy.optimize.linprog (e7_hB_algebraic.py); all other steps use exact rational arithmetic. Scripts and data are available from the corresponding author on reasonable request. The supplementary archive (115 JSON chamber files, Python scripts, and output files) contains all data required to reproduce every numerical result in this paper.

Conflicts of Interest

The authors declare none.

Use of Artificial Intelligence

The authors declare that Claude (Anthropic) was used as an AI-assisted tool during the preparation of this manuscript for typesetting, prose editing, and numerical cross-checking. All mathematical arguments and results are the authors’ own work.

Appendix A. The E 7 Cartan Matrix

With node labelling from Figure 1:
C E 7 = 2 0 1 0 0 0 0 0 2 0 1 0 0 0 1 0 2 1 0 0 0 0 1 1 2 1 0 0 0 0 0 1 2 1 0 0 0 0 0 1 2 1 0 0 0 0 0 1 2 .
Expanding along row 1: the ( 1 , 1 ) cofactor is det C E 6 = 3 , and the ( 1 , 3 ) cofactor contributes 1 times a 6 × 6 submatrix with determinant 1, giving det C E 7 = 2 · 3 ( 1 ) ( 1 ) · 2 = 2 . The 126 positive roots are generated from the seven simple roots by BFS under Weyl reflections s i : α α α , α i α i ; all satisfy α , α = 2 in the inner product α , β = α C E 7 β .

Appendix B. Vertex Orbits of P E 7

The 632 vertices of P E 7 lie in two W ( E 7 ) -orbits, at squared norms 7 / 4 and 3. Both orbits are confirmed by LP support-function maximisation over 10 , 000 random unit directions (e7_verify.py). The circumradius 3 comes from the second orbit and gives the shell bound 2 3 of Lemma 4.1.

Appendix C. Complete LDL ⊤ Pivot Table for All 115 Chambers

Table A1 gives the complete L D L pivot sequence ( d 1 , , d 7 ) for every chamber type, computed by exact rational arithmetic (script e7_groebner_sos.py). All pivots are positive rationals, confirming H Ω 0 over Q for all 115 types. The global minimum pivot is 823 / 3360 0.245 at F028 (position 7).
Table A1. Complete L D L pivot sequences ( d 1 , , d 7 ) for all 115 chamber types. All entries are positive rationals over Q . Column d min is the row minimum. Global minimum: 823 / 3360 at F028, position 7.
Table A1. Complete L D L pivot sequences ( d 1 , , d 7 ) for all 115 chamber types. All entries are positive rationals over Q . Column d min is the row minimum. Global minimum: 823 / 3360 at F028, position 7.
Row d 1 d 2 d 3 d 4 d 5 d 6 d 7 d min
F001 1 3 5 16 1 3 209 720 119 418 773 2856 208 773 208 773
F002 1 3 5 16 14 45 7 24 2 7 247 896 135 494 135 494
F003 1 3 5 16 1 3 14 45 65 224 4 15 61 234 61 234
F004 1 3 5 16 14 45 7 24 2 7 247 896 628 2223 247 896
F005 1 3 5 16 1 3 209 720 175 627 773 2800 423 1546 423 1546
F006 1 3 5 16 14 45 7 24 2 7 9 32 15 56 15 56
F007 1 3 5 16 3 10 8 27 119 384 761 2856 202 761 202 761
F008 1 3 5 16 1 3 67 240 341 1206 67 248 18 67 18 67
F009 1 3 1 3 1 3 5 16 1 3 31 120 253 992 253 992
F010 1 3 5 16 1 3 14 45 7 24 2 7 2111 8064 2111 8064
F011 1 3 5 16 1 3 5 16 5 18 291 1000 1387 5238 1387 5238
F012 1 3 5 16 1 3 209 720 175 627 29 100 3925 14616 3925 14616
F013 1 3 5 16 1 3 209 720 175 627 773 2800 628 2319 628 2319
F014 1 3 5 16 1 3 209 720 175 627 773 2800 208 773 208 773
F015 1 3 5 16 14 45 7 24 2 7 9 32 15 56 15 56
F016 1 3 5 16 1 3 209 720 119 418 761 2856 202 761 202 761
F017 1 3 1 3 1 3 5 16 5 16 67 240 88 335 88 335
F018 1 3 5 16 1 3 14 45 7 24 2 7 2207 8064 2207 8064
F019 1 3 5 16 1 3 5 16 5 18 332 1125 4225 15936 4225 15936
F020 1 3 5 16 1 3 209 720 175 627 52 175 671 2496 671 2496
F021 1 3 5 16 1 3 209 720 175 627 52 175 161 624 161 624
F022 1 3 5 16 1 3 209 720 175 627 797 2800 628 2391 628 2391
F023 1 3 5 16 1 3 209 720 175 627 773 2800 423 1546 423 1546
F024 1 3 5 16 14 45 7 24 2 7 247 896 135 494 135 494
F025 1 3 5 16 3 10 8 27 119 384 761 2856 202 761 202 761
F026 1 3 5 16 1 3 67 240 341 1206 67 248 18 67 18 67
F027 1 3 1 3 1 3 5 16 1 3 7 24 863 3360 863 3360
F028 1 3 1 3 1 3 5 16 5 16 14 45 823 3360 823 3360
F029 1 3 5 16 1 3 14 45 7 24 13 42 173 672 173 672
F030 1 3 5 16 1 3 5 16 5 18 37 120 1499 5550 1499 5550
F031 1 3 5 16 1 3 209 720 175 627 1 3 134 525 134 525
F032 1 3 5 16 1 3 209 720 175 627 95 336 1367 4750 175 627
F033 1 3 5 16 1 3 209 720 175 627 25 84 157 600 157 600
F034 1 3 5 16 1 3 209 720 175 627 797 2800 1271 4782 1271 4782
F035 1 3 5 16 1 3 209 720 175 627 2279 8400 1229 4558 1229 4558
F036 1 3 5 16 14 45 7 24 2 7 247 896 135 494 135 494
F037 1 3 5 16 1 3 209 720 119 418 761 2856 202 761 202 761
F038 1 3 1 3 1 3 5 16 1 3 14 45 173 672 173 672
F039 1 3 1 3 1 3 5 16 5 16 14 45 31 120 31 120
F040 1 3 5 16 1 3 14 45 7 24 1 3 89 336 89 336
F041 1 3 5 16 1 3 5 16 5 18 37 120 537 1850 5 18
F042 1 3 5 16 1 3 209 720 175 627 1 3 11 42 11 42
F043 1 3 5 16 1 3 209 720 175 627 2599 8400 1435 5198 1435 5198
F044 1 3 5 16 1 3 209 720 175 627 25 84 161 600 161 600
F045 1 3 5 16 1 3 209 720 175 627 797 2800 3925 14346 3925 14346
F046 1 3 5 16 1 3 209 720 175 627 2279 8400 1271 4558 2279 8400
F047 1 3 5 16 1 3 209 720 175 627 2279 8400 1229 4558 1229 4558
F048 1 3 5 16 14 45 7 24 2 7 9 32 15 56 15 56
F049 1 3 1 3 1 3 5 16 1 3 14 45 181 672 181 672
F050 1 3 1 3 1 3 5 16 5 16 14 45 2701 10080 2701 10080
F051 1 3 5 16 1 3 14 45 7 24 1 3 31 112 31 112
F052 1 3 5 16 1 3 5 16 5 18 37 120 2416 8325 5 18
F053 1 3 5 16 1 3 209 720 175 627 1 3 48 175 48 175
F054 1 3 5 16 1 3 209 720 175 627 2599 8400 1507 5198 175 627
F055 1 3 5 16 1 3 209 720 175 627 25 84 11 40 11 40
F056 1 3 5 16 1 3 209 720 175 627 25 84 11 40 11 40
F057 1 3 5 16 1 3 209 720 175 627 2279 8400 1952 6837 2279 8400
F058 1 3 5 16 1 3 209 720 175 627 2279 8400 628 2279 2279 8400
F059 1 3 5 16 1 3 209 720 175 627 773 2800 1229 4638 1229 4638
F060 1 3 1 3 1 3 5 16 1 3 14 45 7 24 7 24
F061 1 3 1 3 1 3 5 16 5 16 14 45 181 630 181 630
F062 1 3 5 16 1 3 14 45 7 24 1 3 97 336 97 336
F063 1 3 5 16 1 3 5 16 5 18 37 120 2581 8325 5 18
F064 1 3 5 16 1 3 209 720 175 627 1 3 52 175 175 627
F065 1 3 5 16 1 3 209 720 175 627 2599 8400 767 2599 175 627
F066 1 3 5 16 1 3 209 720 175 627 25 84 59 200 175 627
F067 1 3 5 16 1 3 209 720 175 627 25 84 11 40 11 40
F068 1 3 5 16 1 3 209 720 175 627 2279 8400 671 2279 2279 8400
F069 1 3 5 16 1 3 209 720 175 627 2279 8400 644 2279 2279 8400
F070 1 3 5 16 1 3 209 720 175 627 2279 8400 43 159 43 159
F071 1 3 5 16 1 3 209 720 175 627 773 2800 423 1546 423 1546
F072 1 3 5 16 14 45 7 24 2 7 247 896 135 494 135 494
F073 1 3 5 16 3 10 8 27 119 384 761 2856 202 761 202 761
F074 1 3 1 3 1 3 5 16 1 3 14 45 13 42 13 42
F075 1 3 1 3 1 3 5 16 5 16 14 45 14 45 14 45
F076 1 3 5 16 1 3 14 45 65 224 1 3 181 585 65 224
F077 1 3 5 16 1 3 5 16 5 18 1 3 116 375 5 18
F078 1 3 5 16 1 3 209 720 175 627 1 3 31 100 175 627
F079 1 3 5 16 1 3 209 720 175 627 2599 8400 2405 7797 175 627
F080 1 3 5 16 1 3 209 720 175 627 25 84 37 120 175 627
F081 1 3 5 16 1 3 209 720 175 627 25 84 173 600 175 627
F082 1 3 5 16 1 3 209 720 175 627 2279 8400 2111 6837 2279 8400
F083 1 3 5 16 1 3 209 720 175 627 2279 8400 47 159 2279 8400
F084 1 3 5 16 1 3 209 720 175 627 2279 8400 644 2279 2279 8400
F085 1 3 5 16 1 3 209 720 175 627 2279 8400 628 2279 2279 8400
F086 1 3 5 16 1 3 209 720 175 627 773 2800 208 773 208 773
F087 1 3 5 16 14 45 7 24 2 7 247 896 135 494 135 494
F088 1 3 1 3 1 3 7 24 13 42 1 3 1 3 7 24
F089 1 3 5 16 1 3 14 45 7 24 1 3 1 3 7 24
F090 1 3 5 16 1 3 14 45 65 224 1 3 181 585 65 224
F091 1 3 5 16 1 3 5 16 5 18 116 375 1 3 5 18
F092 1 3 5 16 1 3 209 720 175 627 31 100 1 3 175 627
F093 1 3 5 16 1 3 209 720 175 627 25 84 1 3 175 627
F094 1 3 5 16 1 3 209 720 175 627 25 84 37 120 175 627
F095 1 3 5 16 1 3 209 720 175 627 25 84 173 600 175 627
F096 1 3 5 16 1 3 209 720 175 627 2279 8400 4217 13674 2279 8400
F097 1 3 5 16 1 3 209 720 175 627 2279 8400 4025 13674 2279 8400
F098 1 3 5 16 1 3 209 720 175 627 2279 8400 3925 13674 2279 8400
F099 1 3 5 16 1 3 209 720 175 627 2279 8400 1271 4558 2279 8400
F100 1 3 5 16 1 3 209 720 175 627 2279 8400 1229 4558 1229 4558
F101 1 3 5 16 14 45 67 224 56 201 247 896 135 494 135 494
F102 1 3 1 3 1 3 7 24 13 42 1 3 1 3 7 24
F103 1 3 1 3 1 3 5 16 7 24 14 45 1 3 7 24
F104 1 3 1 3 5 16 3 10 8 27 1 3 1 3 8 27
F105 1 3 1 3 5 16 3 10 67 216 5 16 187 603 3 10
F106 1 3 1 3 5 16 3 10 8 27 37 128 1 3 37 128
F107 1 3 1 3 5 16 3 10 8 27 317 1152 1 3 317 1152
F108 1 3 1 3 5 16 3 10 8 27 103 384 1 3 103 384
F109 1 3 1 3 5 16 3 10 8 27 25 96 1 3 25 96
F110 1 3 1 3 5 16 3 10 8 27 25 96 1483 4800 25 96
F111 1 3 1 3 5 16 3 10 8 27 25 96 1403 4800 25 96
F112 1 3 1 3 5 16 3 10 8 27 25 96 449 1600 25 96
F113 1 3 1 3 5 16 3 10 8 27 25 96 3889 14400 25 96
F114 1 3 1 3 5 16 3 10 8 27 25 96 17 64 25 96
F115 1 3 1 3 5 16 3 10 7 24 89 336 70 267 70 267

Appendix D. Explicit L-Matrices for Chambers F001–F008

The L D L decomposition H Ω = L diag ( d 1 , , d 7 ) L is given below for F001–F008. All entries are exact rationals over Q . Each L is unit lower triangular; the SOS identity F Ω ( 2 ) ( τ ) = j = 1 7 d j j ( τ ) 2 0 confirms H Ω 0 . The global minimum pivot 823 / 3360 is at F028.

Appendix D.1. Chamber F001: adj=5, obt=10, orth=6

d ( F 001 ) = 1 3 , 5 16 , 1 3 , 209 720 , 119 418 , 773 2856 , 208 773 , d min = d 7 = 208 773 0.269 .
L ( F 001 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 0 1 0 0 0 0 1 4 1 15 1 4 1 0 0 0 1 4 1 15 1 4 29 209 1 0 0 0 4 15 1 4 41 209 41 238 1 0 0 4 15 1 4 41 209 41 238 59 773 1

Appendix D.2. Chamber F002: adj=6, obt=10, orth=5

d ( F 002 ) = 1 3 , 5 16 , 14 45 , 7 24 , 2 7 , 247 896 , 135 494 , d min = d 7 = 135 494 0.273 .
L ( F 002 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 4 15 1 0 0 0 0 1 4 1 15 1 4 1 0 0 0 1 4 1 15 1 4 1 7 1 0 0 0 4 15 11 56 3 14 3 16 1 0 0 4 15 11 56 3 14 3 16 23 247 1

Appendix D.3. Chamber F003: adj=4, obt=9, orth=8

d ( F 003 ) = 1 3 , 5 16 , 1 3 , 14 45 , 65 224 , 4 15 , 61 234 , d min = d 7 = 61 234 0.261 .
L ( F 003 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 0 1 0 0 0 0 0 4 15 0 1 0 0 0 1 4 1 15 1 4 1 56 1 0 0 0 4 15 1 4 11 56 1 5 1 0 1 4 1 5 1 4 3 14 2 195 1 8 1

Appendix D.4. Chamber F004: adj=5, obt=9, orth=7

d ( F 004 ) = 1 3 , 5 16 , 14 45 , 7 24 , 2 7 , 247 896 , 628 2223 , d min = d 6 = 247 896 0.276 .
L ( F 004 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 4 15 1 0 0 0 0 1 4 1 15 1 4 1 0 0 0 1 4 1 15 1 4 1 7 1 0 0 0 4 15 11 56 3 14 3 16 1 0 1 4 1 5 3 14 0 0 80 741 1

Appendix D.5. Chamber F005: adj=6, obt=9, orth=6

d ( F 005 ) = 1 3 , 5 16 , 1 3 , 209 720 , 175 627 , 773 2800 , 423 1546 , d min = d 7 = 423 1546 0.274 .
L ( F 005 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 0 1 0 0 0 0 0 4 15 1 4 1 0 0 0 1 4 1 15 1 4 41 209 1 0 0 0 4 15 1 4 29 209 123 700 1 0 0 4 15 1 4 29 209 123 700 73 773 1

Appendix D.6. Chamber F006: adj=7, obt=9, orth=5

d ( F 006 ) = 1 3 , 5 16 , 14 45 , 7 24 , 2 7 , 9 32 , 15 56 , d min = d 7 = 15 56 0.268 .
L ( F 006 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 4 15 1 0 0 0 0 1 4 1 15 1 4 1 0 0 0 1 4 1 15 1 4 1 7 1 0 0 1 4 1 15 1 4 1 7 1 8 1 0 0 4 15 11 56 3 14 3 16 1 6 1

Appendix D.7. Chamber F007: adj=8, obt=9, orth=4

d ( F 007 ) = 1 3 , 5 16 , 3 10 , 8 27 , 119 384 , 761 2856 , 202 761 , d min = d 7 = 202 761 0.265 .
L ( F 007 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 1 4 1 5 1 0 0 0 0 0 4 15 2 9 1 0 0 0 1 4 1 15 1 18 1 32 1 0 0 1 4 1 5 1 6 3 16 26 119 1 0 1 4 1 5 1 6 3 16 26 119 47 761 1

Appendix D.8. Chamber F008: adj=9, obt=9, orth=3

d ( F 008 ) = 1 3 , 5 16 , 1 3 , 67 240 , 341 1206 , 67 248 , 18 67 , d min = d 7 = 18 67 0.269 .
L ( F 008 ) = 1 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 0 1 0 0 0 0 1 4 1 5 1 4 1 0 0 0 1 4 1 15 1 4 11 67 1 0 0 1 4 1 5 1 4 7 67 9 62 1 0 1 4 1 5 1 4 7 67 9 62 5 67 1

Appendix E. Index of Notation

Symbol Meaning
R ( E 7 ) E 7 root system; 126 roots with | α | 2 = 2
Λ = 2 E 7 Scaled lattice; nearest-neighbour distance 2
P E 7 Voronoi cell of Λ ; 126 facets, vol ( P E 7 ) = 16
W ( E 7 ) Weyl group of E 7 ; order 2 , 903 , 040
h ( u ) = max z P E 7 z , u Support function; h [ 1 , 3 ]
δ ( u ) = h ( u ) 1 Angular deficiency; = 0 iff u is a root direction
s i j = u i , u j / 2 Gram value; packing requires s i j 1 2
C 1 = { z P E 7 : z , u 1 > 1 } Cap of P E 7 cut by displaced halfspace
E k = { z V 0 : z , u root > 1 } Compensating region beyond P E 7
F Ω = vol ( E k ) vol ( C 1 ) Volume defect; F Ω 0 iff vol ( V 0 ) 16
H Ω Radial Hessian; 7 × 7 , entries 1 3 , ± 1 12
823 / 3360 0.245 Global minimum L D L pivot; F028 position 7
θ Angular displacement of u 1 from u root ; Level B parameter

References

  1. Blichfeldt, H. F. The minimum value of quadratic forms, and the closest packing of spheres . Math. Ann. 1929, 101, 605–608. [Google Scholar] [CrossRef]
  2. Cohn, H.; Elkies, N. New upper bounds on sphere packings I . Ann. Math. 2003, 157, 689–714. [Google Scholar] [CrossRef]
  3. Cohn, H.; Kumar, A. Universally optimal distribution of points on spheres . J. Amer. Math. Soc. 2007, 20, 99–148. [Google Scholar]
  4. Cohn, H.; Kumar, A.; Miller, S. D.; Radchenko, D.; Viazovska, M. S. The sphere packing problem in dimension 24 . Ann. Math. 2017, 185, 1017–1033. [Google Scholar] [CrossRef]
  5. Conway, J. H.; Sloane, N. J. A. Sphere Packings, Lattices and Groups, 3rd ed.; Springer: New York, 1999. [Google Scholar]
  6. Cohn, H.; Zhao, Y. Sphere packing bounds via spherical codes . Duke Math. J. 2014, 163, 1965–2002. [Google Scholar] [CrossRef]
  7. Fejes Tóth, L. Über die dichteste Kugellagerung . Math. Z. 1943, 48, 676–684. [Google Scholar]
  8. Hales, T. C. A proof of the Kepler conjecture . Ann. Math. 2005, 162, 1065–1185. [Google Scholar] [CrossRef]
  9. Hales, T. C.; et al. A formal proof of the Kepler conjecture . Forum Math. Pi 2017, 5, e2. [Google Scholar] [CrossRef]
  10. Humphreys, J. E. Introduction to Lie Algebras and Representation Theory; Springer: New York, 1972. [Google Scholar]
  11. Musin, O. R. The kissing number in four dimensions . Ann. Math. 2008, 168, 1–32. [Google Scholar] [CrossRef]
  12. C. A. Rogers, Packing and Covering. In Cambridge Tracts in Mathematics; Cambridge University Press, 1964; p. 54.
  13. Thue, A. Über die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene . Nor. Vid. Selsk. Skr. 1910, 1, 1–9. [Google Scholar]
  14. Viazovska, M. S. The sphere packing problem in dimension 8 . Ann. Math. 2017, 185, 991–1015. [Google Scholar] [CrossRef]
Figure 1. Dynkin diagram of E 7 . The seven nodes (labelled 0–6) represent the simple roots α 0 , , α 6 . An edge between nodes i and j means c i j = 1 , i.e. α i , α j = 1 ; no edge means α i , α j = 0 . The edges present are ( 0 , 2 ) , ( 1 , 3 ) , ( 2 , 3 ) , ( 3 , 4 ) , ( 4 , 5 ) , ( 5 , 6 ) . Node 3 is the branch node; its three-arm geometry distinguishes E 7 from the linear diagrams A n and D n , and is responsible for the richer Weyl symmetry that reduces all corner configurations to only 115 chamber types.
Figure 1. Dynkin diagram of E 7 . The seven nodes (labelled 0–6) represent the simple roots α 0 , , α 6 . An edge between nodes i and j means c i j = 1 , i.e. α i , α j = 1 ; no edge means α i , α j = 0 . The edges present are ( 0 , 2 ) , ( 1 , 3 ) , ( 2 , 3 ) , ( 3 , 4 ) , ( 4 , 5 ) , ( 5 , 6 ) . Node 3 is the branch node; its three-arm geometry distinguishes E 7 from the linear diagrams A n and D n , and is responsible for the richer Weyl symmetry that reduces all corner configurations to only 115 chamber types.
Preprints 222922 g001
Table 1. Five levels of verification of the 115-chamber register. All pass with zero failures; e7_verify.py, e7_groebner_sos.py, e7_sos_all_chambers.py, e7_levelB_unconditional.py, and e7_hB_monotone_exact.py in the supplementary archive reproduce each check in under 2 seconds.
Table 1. Five levels of verification of the 115-chamber register. All pass with zero failures; e7_verify.py, e7_groebner_sos.py, e7_sos_all_chambers.py, e7_levelB_unconditional.py, and e7_hB_monotone_exact.py in the supplementary archive reproduce each check in under 2 seconds.
Level Property Result
1 115 rows; canonical-form tags correct pass
2 805 / 805 root vectors: | α | 2 = 2 (exact, Q ) pass
3 115 / 115 Gram matrices have rank 7 pass
4 805 / 805 six-element subdeterminants positive pass
5 2 , 415 / 2 , 415 inner products satisfy s i j 1 2 pass
Table 4. Values of F Ω ( θ ) = vol ( E k ) vol ( C 1 ) at 29 angular positions (chamber F001, root r 1 ). By W ( E 7 ) -transitivity all 115 chamber types give the same values. All values are positive and strictly increasing, consistent with Theorem 10.4.
Table 4. Values of F Ω ( θ ) = vol ( E k ) vol ( C 1 ) at 29 angular positions (chamber F001, root r 1 ). By W ( E 7 ) -transitivity all 115 chamber types give the same values. All values are positive and strictly increasing, consistent with Theorem 10.4.
θ (rad) F Ω ( θ ) F Ω / θ 2
0.10 0.001733 0.173
0.15 0.003864 0.172
0.18 0.005746 0.177
0.20 0.006789 0.170
0.22 0.008169 0.169
0.25 0.010454 0.167
0.30 0.014797 0.164
0.35 0.019745 0.161
0.40 0.024677 0.154
0.45 0.031115 0.154
0.50 0.037340 0.149
0.60 0.051289 0.143
0.65 0.056721 0.134
0.70 0.062985 0.129
0.75 0.068888 0.123
0.78 0.072222 0.119
0.80 0.074302 0.116
0.82 0.076374 0.114
0.85 0.079244 0.110
0.90 0.083648 0.103
0.95 0.087207 0.097
1.00 0.090034 0.090
1.10 0.095577 0.079
1.20 0.100520 0.070
1.30 0.106021 0.063
1.33 0.107856 0.061
1.43 0.114768 0.056
1.50 0.120444 0.054
1.52 0.125318 0.054
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

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings