it can be shown below that: harv|Grafakos|2004For the special case "t"=0 EquationNote|Eq.1 reduces to the version of the Poisson summation formula given above. The first version holds under the less restrictive conditions that 0 is a point of continuity of φ"T"("t"). This may fail to be the case even when both and are continuous and the sums converge absolutely harv|Katznelson|1976.
Intuitive Derivation of the Poisson Summation Formula
The function φ"T"("t") is periodic, with period "T". It can therefore be expanded into a Fourier series,whose coefficients are given by:
:
With a change of variables this becomes:
:
Substitution of these coefficients into the Fourier series produces EquationNote|Eq.1.
Applications of the Poisson Summation Formula
The Poisson Summation formula may be used to give a proof of the Shannon Sampling theorem harv|Pinsky|2002. It also provides a connection between Fourier analysis on the circle and the real line. harv|Grafakos|2004.
Computationally, the Poisson Summation Formula is useful since a slowly converging summationin real space is guaranteed to be converted into a quickly converging equivalent summation in Fourier space. (A broad function in real spacebecomes a narrow function in Fourier space and vice versa.) This is the essential idea behind Ewald summation.
Convergence conditions
Some conditions restricting must naturally be applied to have convergence. A useful way to get around stating those precisely is to use the language of distributions. Let δ("t") be the Dirac delta function. Then if we write
:
summed over "all" integers "n", we have that Δ is a distribution (a so-called Dirac comb), because applied to any test function we get a bi-infinite sum that has very small 'tails'. Then one may interpret the summation formula as saying that "is its own Fourier transform".
Again this depends on precise normalization in the transform, but it conveys good information about the variance of the formula. For example, for constant "a" ≠ 0 it would follow that
: "is the Fourier transform" of
Therefore we can always find a spacing λ"Z" of the integers, such that placing a delta-function at each of those points is its own transform, and each normalization will have a corresponding valid formula. It also suggests a method of proof that is intuitive: put instead a Gaussian centered at each integer, calculate using the known Fourier transform of a Gaussian, and then let the width of all the Gaussians become small.
Generalizations
There is a version in "n" dimensions, that is easy to formulate. Given a lattice Λ in R"n", there is a "dual lattice" Λ′ (defined by vector space or Pontryagin duality, as one wishes). Then the statement is that the sum of delta-functions at each point of Λ, and at each point of Λ′, are again Fourier transforms as distributions, subject to correct normalization.
This is applied in the theory of theta functions, and is a possible method in geometry of numbers. In fact in more recent work on counting lattice points in regions it is routinely used − summing the indicator function of a region "D" over lattice points is exactly the question, so that the LHS of the summation formula is what is sought and the RHS something that can be attacked by mathematical analysis.
Further generalisation to locally compact abelian groups is required in number theory. In non-commutative harmonic analysis, the idea is taken even further in the Selberg trace formula, but takes on a much deeper character.
Literature
* J.J. Benedetto; G. Zimmermann: "Sampling multipliers and the Poisson summation formula." J. Fourier Ana. App. 3(1997)5, [https://www.uni-hohenheim.de/~gzim/Publications/sm.html Preprint online]
* J.R. Higgins: "Five short stories about the cardinal series." Bull. AMS 12(1985)1, Online at [http://projecteuclid.org/euclid.bams/1183552334 Project Open Euclid]
*.
*
*.
*.