Overview

This post explains the proof mechanism behind the optimal sphere packing theorems in dimensions and . The dimension theorem of Viazovska proves that the lattice is optimal (Viazovska, 2017). The dimension theorem of Cohn, Kumar, Miller, Radchenko, and Viazovska proves that the Leech lattice is optimal and uniquely optimal among periodic packings (Cohn et al., 2017).

The common structure comes from the Cohn-Elkies linear-programming bound (Cohn & Elkies, 2003). Equality in that bound predicts a very rigid zero pattern for an auxiliary function and its Fourier transform. The main achievement of the two Annals papers is the exact construction of such auxiliary functions using modular and quasimodular forms.

Packing Constants and Normalization

A packing of unit balls in is specified by a discrete set of centers

such that

The packing is

and its density is

The sphere packing constant is

Because density is invariant under uniform scaling, the proofs usually normalize the center separation rather than the ball radius. For the lattice one uses the normalization in which the shortest nonzero vectors have length ; for the Leech lattice, the shortest nonzero vectors have length . The corresponding densities are

Linear-Programming Certificate

The Cohn-Elkies method is a Fourier-analytic analogue of Delsarte linear programming. Let be an admissible function, and normalize the Fourier transform by

After radial symmetrization one may assume that depends only on .

Cohn-Elkies bound

Suppose is a radial Schwartz function satisfying

and

Then every packing in whose centers are at mutual distance at least has density at most

The proof is short but important. For a periodic packing, sum over all differences of sphere centers. On the physical side, every nonzero difference has length at least , so the sign condition makes every off-diagonal contribution nonpositive. On the Fourier side, Poisson summation expresses the same quantity in terms of , and all Fourier-side terms are nonnegative. Comparing the diagonal term on the physical side with the zero-frequency term on the Fourier side gives the density bound.

The geometric problem is therefore converted into a construction problem: find with the required signs and with the bound equal to the density of the proposed packing.

Saturation and Forced Zeros

The deeper part begins with asking what equality would require. Suppose a lattice is expected to be optimal, and suppose the linear-programming bound is sharp for it. In the Poisson summation comparison, all inequalities must become equalities. Consequently,

at the relevant lattice vector lengths, and similarly

For a self-dual or suitably scaled self-dual lattice, the same shell structure controls both and .

This gives the reverse-engineering principle behind the proof. The auxiliary function is not guessed from a generic optimization problem. Its zeros are prescribed by the candidate packing. For , the squared vector lengths are even positive integers,

For the Leech lattice, there are no norm- vectors, so the nonzero squared lengths begin at

The functions must vanish on exactly these shells, with high enough multiplicity to preserve the global sign pattern.

The nonminimal shells typically require double zeros. This is not a cosmetic condition. If is nonpositive beyond the first contact radius and vanishes at a later shell, then a simple zero would usually force a sign change. Double zeros allow to touch zero and remain on the required side.

Modular Forms as Fourier Machines

The construction becomes possible because Gaussian functions interact perfectly with the Fourier transform. For , the Fourier transform of a complex Gaussian has the schematic form

with the usual branch convention. Thus the Fourier transform acts on the parameter by the modular transformation

This is the conceptual bridge to modular forms. If one defines a radial function by an integral transform of the form

then applying the Fourier transform changes the contour and transforms by . If is chosen from a space of modular or quasimodular forms with the correct transformation law, the result is another explicitly controlled integral of the same kind. This is how the papers manufacture Fourier eigenfunctions.

The second modular transformation, , is responsible for the zero set. The finite difference identity

produces the factor

This factor vanishes exactly when

That is the same arithmetic progression in which the squared vector lengths of and the Leech lattice lie. The proof is therefore not merely using modular forms because the lattices are arithmetic; the modular transformations directly encode both Fourier invariance and the required lattice-shell zeros.

Dimension Eight

Viazovska constructs two radial functions from weakly holomorphic modular and quasimodular forms for congruence subgroups related to . They are arranged so that they behave well under Fourier transform and have the forced zero pattern at the vector lengths.

For , the two functions admit representations with the universal sine-squared factor:

and

The displayed formulas are not just formal. A major analytic step is to continue these functions to all by subtracting the polar or exponentially growing terms in the modular-form expansions. This continuation also gives the special values at and needed for normalization.

The final auxiliary function is the real-valued linear combination

The coefficients are chosen so that

and so that the first contact at has the required behavior. For , Viazovska rewrites the sign conditions as Laplace-type integrals

and

The functions and are explicit expressions in modular forms on the imaginary axis. The inequalities

then imply

with zeros only at the prescribed squared radii. The remaining verification is rigorous: Viazovska controls the -expansions and uses interval arithmetic to prove the required inequalities.

At that point the Cohn-Elkies theorem gives

while the packing gives equality. The same zero pattern, together with the uniqueness criterion from Cohn-Elkies, gives uniqueness among periodic packings.

Dimension Twenty-Four

The dimension proof follows the same architecture, but the modular forms and the sign analysis are more complicated. The Leech lattice has no norm- vectors, so the zero pattern begins at

or equivalently at

The authors construct two radial Fourier eigenfunctions in . The first is built from a weakly holomorphic quasimodular form of weight and depth for . The second is built from a weakly holomorphic modular form of weight for . Their linear combination is

It satisfies

and both and have zeros at

Except for the boundary root of at , these are double roots.

For , the sign of is again reduced to an explicit Laplace integral:

The inequality follows from a modular-form inequality on the imaginary axis. The Fourier-side inequality is subtler. One obtains an analogous formula for , but the growth of the corresponding integrand at infinity causes an extra complication for

The paper handles this by subtracting the leading growth terms, proving that the remaining integral is nonnegative, and verifying the residual inequalities by exact finite calculations with truncated -series and Sturm’s theorem.

This proves

The Cohn-Elkies theorem with gives

which is exactly the Leech lattice density. The absence of extraneous roots for gives uniqueness among periodic packings.

Structural Comparison

ComponentDimension Dimension
Candidate latticeLeech lattice
First contact radius
Forced squared radii
Auxiliary function
Modular inputcongruence-subgroup modular and quasimodular formsweight quasimodular form and weight modular form
Sign verification-expansion estimates and interval arithmetic-series truncation, rational bounds, and Sturm’s theorem
Uniqueness conclusionunique optimal periodic packingunique optimal periodic packing

The two proofs are best understood as exact solutions to the same interpolation problem. The desired function must know the lattice shell radii, must transform predictably under Fourier transform, and must have a global sign. The sine-squared factor supplies the shell zeros, the modular transformation supplies Fourier control, and the final inequalities prove that the constructed function has the correct sign everywhere, not merely at the lattice shells.

The original Cohn-Elkies paper also explains why the sharp functions in dimensions and were numerically plausible before the modular-form construction was known. The numerical ansatz uses the radial Laguerre basis

These functions are Fourier eigenfunctions:

Thus a trial function

has Fourier transform

After normalizing , the objective and the sign constraints for and are linear conditions in the coefficients , once the radius variable is discretized.

The finite-dimensional discretized program is implemented in content/codes/2026 Summer/cohn_elkies_lp_validation.py; its saved report is content/codes/2026 Summer/cohn_elkies_lp_results.txt. The computation is not a proof, because it checks inequalities on finite grids. It gives numerical evidence for the mechanism in Cohn-Elkies: increasing the polynomial degree drives the LP ratio toward the expected sharp value.

For dimension , the degree- run gives

so the numerical bound is within about of the density. For dimension , the conservative degree- run gives

This is much less sharp, but it still shows the same trend. The discrepancy is also instructive: the Leech lattice case is numerically delicate, and a finite grid LP can become unstable near forced zeros. The exact modular construction is precisely what turns this numerical evidence into a rigorous global certificate.

Conceptual Consequence

The proof is not a classification of all possible local sphere arrangements. It is a global certificate. Once the auxiliary function exists, every possible packing is bounded simultaneously by the same Poisson summation inequality.

This explains why the 2003 Cohn-Elkies paper is the natural starting point. It identified the correct optimization problem and predicted sharp auxiliary functions in dimensions and . The 2017 papers solve the missing analytic construction problem. Their depth lies in showing that the rigid zero pattern demanded by linear programming is not an accident of numerical optimization, but is produced exactly by modular forms.

Remaining Context

The results determine the optimal packing densities in dimensions

The methods do not solve sphere packing in arbitrary dimension. They depend on an exceptional coincidence: the shell structures of and the Leech lattice are compatible with modular-form transformations strongly enough to produce exact Fourier-analytic certificates.

The uniqueness statements in the two papers are for periodic packings. The density optimality statements are for all packings. This distinction is important: the linear-programming bound gives the universal density upper bound, while the additional root-structure argument controls periodic equality cases.

See Also

References

🐻  Cohn, H. & Elkies, N. 2003. New upper bounds on sphere packings I. Annals of Mathematics 157(2), 689–714.
🐻  Cohn, H., Kumar, A., Miller, S.D., Radchenko, D. & Viazovska, M.S. 2017. The sphere packing problem in dimension 24. Annals of Mathematics 185(3), 1017–1033.
🐻  Viazovska, M.S. 2017. The sphere packing problem in dimension 8. Annals of Mathematics 185(3), 991–1015.