Worked solution: Viazovska's modular form solution to sphere packing in dimensions 8 and 24
Poisson summation is a magic trick that turns a sum of over a lattice's points into a sum of over a related lattice; applying it to the ball centres of the packing pins the Cohn–Elkies ratio from below by a specific number, , the reciprocal covolume of the scaled lattice. So to prove is optimal it is enough — and, tightly, necessary — to build a test function achieving equality in that identity, which forces to be zero everywhere the lattice's balls touch and to be zero on the corresponding dual pattern.
The Poisson summation formula relates sums of a function over a lattice to sums of its Fourier transform over the dual lattice; for the -lattice packing this gives . Combined with the sign conditions outside the ball and everywhere, the left side is at most (only the origin term can be positive) and the right side is at least (only the origin term is guaranteed, and every other term is ), which forces , exactly reproducing the Cohn–Elkies bound for the density.
Equality throughout this chain — the only way to actually prove is optimal rather than merely bound it — requires for every nonzero (every other packing vector) and for every nonzero . Since vectors come in shells of length , this means and must each vanish, to a very specific double-zero order, at every one of these shell radii; constructing such a pair is exactly the analytic problem solved in the next two steps.
- Poisson summation formula
- An identity that rewrites the sum of a function over every point of a lattice as the sum of its Fourier transform over every point of the dual lattice, letting a sign condition on control a sum that would otherwise be hard to bound directly.