5 Cohn-Elkies linear programming bounds
In 2003 Cohn and Elkies [ 3 ] developed linear programming bounds that apply directly to sphere packings. The goal of this section is to formalize the Cohn–Elkies linear programming bound.
The following theorem is the key result of [ 3 ] . (Note that the original theorem is stated for a class of functions more general then Schwartz functions.)
Let \(X\subset \mathbb {R}^d\) be a discrete subset such that \(\| x-y\| \geq 1\) for any distinct \(x,y\in X\). Suppose that \(X\) is \(\Lambda \)-periodic with respect to some lattice \(\Lambda \subset \mathbb {R}^d\). Let \(f:\mathbb {R}^d\to \mathbb {R}\) be a Schwartz function that is not identically zero and satisfies the following conditions:
and
Then the density of any \(\Lambda \)-periodic sphere packing is bounded above by
Here we reproduce the proof given in [ 3 ] .
The inequality
follows from the condition 2 of the theorem and the assumption on the distances between points in \(X\). The equality
follows from the Poisson summation formula. The right hand side of the above equation can be written as
Note that \(\big|\sum _{x\in X/\Lambda }e^{2\pi i m x}\big|^2\geq 0\) for all \(m\in \Lambda ^*\). Moreover, the term corresponding to \(m=0\) satisfies \(\big|\sum _{x\in X/\Lambda }e^{2\pi i 0 x}\big|^2=\sharp (X/\Lambda )^2\). Now we use the condition 3 and estimate
Comparing inequalities 4 and 5 we arrive at
Now we see that the density of the periodic packing \(\mathcal{P}_X\) with balls of radius \(1/2\) is bounded by
This finishes the proof of the theorem for periodic packings.
The result follows immediately from Theorem 1.14 and Theorem 5.1.
The main step in our proof of corollary 1.17 is the explicit construction of an optimal function. It will be convenient for us to scale this function by \(\sqrt{2}\).
There exists a radial Schwartz function \(g:\mathbb {R}^8\to \mathbb {R}\) which satisfies:
Theorem 5.2 applied to the optimal function \(f(x)=g(x/\sqrt{2})\) immediately implies corollary 1.17.