1.2. Proof Structure
The proof has four layers.
Layer 1 (shell localisation, §Section 4). Only neighbours at distance
matter; farther ones leave
.
Layer 2 (root-aligned case, §Section 5). When every active neighbour points in a root direction of
, a support-function argument gives
, so
.
Layer 3 (radial reduction, §Section 6). is non-decreasing in each
; the infimum is at
.
Layer 4 (chamber positivity, §§Section 7, Section 8, Section 9 and Section 10). At
, the group
partitions configurations into 115 types. For each type
,
iff
(Theorem 8.2), proved by:
Level A (exact): the
Hessian
over
for all 115 chambers (§
Section 9);
Level B (unconditional): for all
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 by an algebraic two-interval argument: on the unique maximising vertex of B has , and derivative ; on it has , and derivative (Lemma 10.3).
1.4. Why the Argument Works in Dimension Seven But Not Five or Six
Three properties of 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
is
(Lemma 2.5), so only neighbours at distance less than
affect
. 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 , the number of -orbits of packing-valid configurations at the all-contact corner is only 115, because ’s richer symmetry places more configurations into each orbit. This is fewer orbits than arise for (176 orbits), even though . For dimensions 5 and 6 the atlas is larger ( and types respectively) but still finite; atlas size alone does not obstruct the proof.
Uniform Hessian form. The radial Hessian
at the reference depends only on the adjacency pattern of the seven active roots (formula (
2)), and its positive definiteness over
holds for all 115 chambers. The same Gram value structure
holds for
and
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 or , would prove that every Voronoi cell in any packing satisfies or respectively. This would imply the density of any packing is at most that of or . 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 (or ) actually achieves the bound, i.e. that the maximum density equals . In dimension 4, this follows because 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 or is the densest packing. If there exists a non-lattice packing denser than (resp. ), the local Voronoi bound would still hold, but the bound 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 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 (resp. ) achieves (resp. ), and we prove this is the minimum possible Voronoi cell volume.
Obstacle 2: Level B. In dimension 4, the Taylor bound covers all of because . For , the analogous minimum pivot satisfies , so the Taylor bound alone does not cover the full interval. In dimension 7, the gap is closed by the algebraic monotonicity of (Lemma 10.3); in dimension 5 no such monotonicity argument is known.
Dimension 9. The lattice has a continuous family of configurations where , 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 ; the companion paper for ), 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.