Authored website post credited to Terence Tao and published 6 April 2009. Its course category is 245C, Real Analysis; the byline applies to this post, not to a separately published book of every course resource.
Cited passages: §3, Definition 32 and Exercise 54: Schwartz hypotheses and Poisson summation on the integer lattice; §3, Exercise 41: transform of a scaled Gaussian; put r=1/sqrt(a) and adjust its prefactor.
Course context: 246B, complex analysis. These notes were posted on 23 December 2020.
Publisher: Terence Tao, What's new (author website).
Cited passages: §1, Theorem 2 and equation (6): neighbourhood of the closed disk, zeros counted with multiplicity, holomorphic special case.
Take the Gaussian function with . Every derivative is a polynomial times the same Gaussian function, so is a Schwartz function. The Fourier transform of a Gaussian gives, in the cycles convention,
Thus the Poisson summation formula gives the exact identity
The Gaussian Fourier transform is given in scaled form in Exercise 41 of Terence Tao's 245C, Notes 2: The Fourier transform.[ref] The identity is also the imaginary-axis transformation of the Jacobi theta function. At the Gaussian function is its own Fourier transform; at reciprocal values of its spatial and spectral widths exchange.
For a short derivation of the Gaussian Fourier transform, write . Differentiation under the integral and integration by parts, using , give
The Gaussian integral gives , so this ordinary differential equation yields the claimed formula. The decay of the Gaussian function justifies these steps and removes the boundary term.[ref]
Figure 1.
Gaussian weights at integer physical and dual points for reciprocal parameters 0.04 and 25
. Details.
For , the physical Gaussian function has width parameter , while its Fourier transform has width parameter . Many physical samples matter, but the dual zero sample already gives
For , use the physical side instead:
These are bounds on the full positive tails, obtained below, rather than estimates based only on the first omitted term. Ordinary floating-point arithmetic rounds these sums to and ; the exact real numbers are slightly larger. A Gaussian sum truncation bound lets us choose the cheaper side and certify its truncation error before evaluating it.