• Images
• Videos
• Documents
• Books
• Articles

Periodization of a function

Let s ( x ) {\textstyle s\left(x\right)} be a smooth, complex valued function on R {\displaystyle \mathbb {R} } which decays at infinity with all derivatives (Schwartz function), and its Fourier transform S ( f ) {\displaystyle S\left(f\right)} , defined as S ( f ) = ∫ − ∞ ∞ s ( x ) e − 2 π i x f d x . {\displaystyle S(f)=\int _{-\infty }^{\infty }s(x)e^{-2\pi ixf}dx.} Then S ( f ) {\displaystyle S(f)} is also a Schwartz function, and we have the reciprocal relationship that s ( x ) = ∫ − ∞ ∞ S ( f ) e 2 π i x f d f . {\displaystyle s(x)=\int _{-\infty }^{\infty }S(f)e^{2\pi ixf}df.}

The periodization of s ( x ) {\displaystyle s(x)} with period P > 0 {\displaystyle P>0} is given by s P ( x ) ≜ ∑ n = − ∞ ∞ s ( x + n P ) . {\displaystyle s_{_{P}}(x)\triangleq \sum _{n=-\infty }^{\infty }s(x+nP).} Likewise, the periodization of S ( f ) {\displaystyle S(f)} with period 1 / T {\displaystyle 1/T} , where T > 0 {\displaystyle T>0} , is S 1 / T ( f ) ≜ ∑ k = − ∞ ∞ S ( f + k / T ) . {\displaystyle S_{1/T}(f)\triangleq \sum _{k=-\infty }^{\infty }S(f+k/T).}

Then Eq.1, ∑ n = − ∞ ∞ s ( n ) = ∑ k = − ∞ ∞ S ( k ) , {\displaystyle \sum _{n=-\infty }^{\infty }s(n)=\sum _{k=-\infty }^{\infty }S(k),} is a special case (P=1, x=0) of this generalization:²³

s P ( x ) = ∑ k = − ∞ ∞ 1 P ⋅ S ( k P ) ⏟ S [ k ]   e i 2 π k P x , {\displaystyle s_{_{P}}(x)=\sum _{k=-\infty }^{\infty }\underbrace {{\frac {1}{P}}\cdot S\left({\frac {k}{P}}\right)} _{S[k]}\ e^{i2\pi {\frac {k}{P}}x},}

Eq.2

which is a Fourier series expansion with coefficients that are samples of the function S ( f ) . {\displaystyle S(f).} Conversely, Eq.2 follows from Eq.1 by applying the known behavior of the Fourier transform under translations (see the Fourier transform properties time scaling and shifting).

Similarly:

S 1 / T ( f ) = ∑ n = − ∞ ∞ T ⋅ s ( n T ) ⏟ s [ n ]   e − i 2 π n T f , {\displaystyle S_{1/T}(f)=\sum _{n=-\infty }^{\infty }\underbrace {T\cdot s(nT)} _{s[n]}\ e^{-i2\pi nTf},}

Eq.3

also known as the important Discrete-time Fourier transform.

Derivations

We prove that,⁴ if s ∈ L 1 ( R ) {\displaystyle s\in L^{1}(\mathbb {R} )} , then the (possibly divergent) Fourier series of s P ( x ) {\displaystyle s_{P}(x)} is s P ( x ) ∼ ∑ k = − ∞ ∞ 1 P S ( k P ) e 2 π i k / P . {\displaystyle s_{_{P}}(x)\sim \sum _{k=-\infty }^{\infty }{\frac {1}{P}}S\left({\frac {k}{P}}\right)e^{2\pi ik/P}.} When s ( x ) {\displaystyle s(x)} is a Schwartz function, this establishes equality in Eq.2 of the previous section.

First, the periodization s P ( x ) {\displaystyle s_{P}(x)} converges in L 1 {\displaystyle L^{1}} norm to an L 1 ( [ 0 , P ] ) {\displaystyle L^{1}([0,P])} function which is periodic on R {\displaystyle \mathbb {R} } , and therefore integrable on any interval of length P . {\displaystyle P.} We must therefore show that the Fourier series coefficients of s P ( x ) {\displaystyle s_{_{P}}(x)} are 1 P S ( k P ) {\textstyle {\frac {1}{P}}S\left({\frac {k}{P}}\right)} where S ( f ) {\textstyle S\left(f\right)} is the Fourier transform of s ( x ) {\textstyle s\left(x\right)} . (Not S [ k ] {\textstyle S\left[k\right]} , which is the Fourier coefficient of s P ( x ) {\displaystyle s_{_{P}}(x)} .)

Proceeding from the definition of the Fourier coefficients we have:

S [ k ]   ≜   1 P ∫ 0 P s P ( x ) ⋅ e − i 2 π k P x d x =   1 P ∫ 0 P ( ∑ n = − ∞ ∞ s ( x + n P ) ) ⋅ e − i 2 π k P x d x =   1 P ∑ n = − ∞ ∞ ∫ 0 P s ( x + n P ) ⋅ e − i 2 π k P x d x , {\displaystyle {\begin{aligned}S[k]\ &\triangleq \ {\frac {1}{P}}\int _{0}^{P}s_{_{P}}(x)\cdot e^{-i2\pi {\frac {k}{P}}x}\,dx\\&=\ {\frac {1}{P}}\int _{0}^{P}\left(\sum _{n=-\infty }^{\infty }s(x+nP)\right)\cdot e^{-i2\pi {\frac {k}{P}}x}\,dx\\&=\ {\frac {1}{P}}\sum _{n=-\infty }^{\infty }\int _{0}^{P}s(x+nP)\cdot e^{-i2\pi {\frac {k}{P}}x}\,dx,\end{aligned}}}

where the interchange of summation with integration is justified by dominated convergence. With a change of variables ( τ = x + n P {\displaystyle \tau =x+nP} ), this becomes the following, completing the proof of Eq.2:

S [ k ] = 1 P ∑ n = − ∞ ∞ ∫ n P ( n + 1 ) P s ( τ )   e − i 2 π k P τ   e i 2 π k n ⏟ 1 d τ   =   1 P ∫ − ∞ ∞ s ( τ )   e − i 2 π k P τ d τ ≜ 1 P ⋅ S ( k P ) . {\displaystyle {\begin{aligned}S[k]={\frac {1}{P}}\sum _{n=-\infty }^{\infty }\int _{nP}^{(n+1)P}s(\tau )\ e^{-i2\pi {\frac {k}{P}}\tau }\ \underbrace {e^{i2\pi kn}} _{1}\,d\tau \ =\ {\frac {1}{P}}\int _{-\infty }^{\infty }s(\tau )\ e^{-i2\pi {\frac {k}{P}}\tau }d\tau \triangleq {\frac {1}{P}}\cdot S\left({\frac {k}{P}}\right)\end{aligned}}.}

This proves Eq.2 for L 1 {\displaystyle L^{1}} functions, in the sense that the right-hand side is the (possibly divergent) Fourier series of the left-hand side. Similarly, if S ( f ) {\displaystyle S(f)} is in L 1 ( R ) {\displaystyle L^{1}(\mathbb {R} )} , a similar proof shows the corresponding version of Eq.3.

Finally, if s P ( x ) {\displaystyle s_{_{P}}(x)} has an absolutely convergent Fourier series, then Eq.2 holds as an equality almost everywhere. This is the case, in particular, when s ( x ) {\displaystyle s(x)} is a Schwartz function. Similarly, Eq.3 holds when S ( f ) {\displaystyle S(f)} is a Schwartz function.

Distributional formulation

These equations can be interpreted in the language of distributions⁵⁶: §7.2  for a function s {\displaystyle s} whose derivatives are all rapidly decreasing (see Schwartz function). The Poisson summation formula arises as a particular case of the Convolution Theorem on tempered distributions, using the Dirac comb distribution and its Fourier series:

∑ n = − ∞ ∞ δ ( x − n T ) ≡ ∑ k = − ∞ ∞ 1 T ⋅ e − i 2 π k T x ⟺ F 1 T ⋅ ∑ k = − ∞ ∞ δ ( f − k / T ) . {\displaystyle \sum _{n=-\infty }^{\infty }\delta (x-nT)\equiv \sum _{k=-\infty }^{\infty }{\frac {1}{T}}\cdot e^{-i2\pi {\frac {k}{T}}x}\quad {\stackrel {\mathcal {F}}{\Longleftrightarrow }}\quad {\frac {1}{T}}\cdot \sum _{k=-\infty }^{\infty }\delta (f-k/T).}

In other words, the periodization of a Dirac delta δ , {\displaystyle \delta ,} resulting in a Dirac comb, corresponds to the discretization of its spectrum which is constantly one. Hence, this again is a Dirac comb but with reciprocal increments.

For the case T = 1 , {\displaystyle T=1,} Eq.1 readily follows:

∑ k = − ∞ ∞ S ( k ) = ∑ k = − ∞ ∞ ( ∫ − ∞ ∞ s ( x )   e − i 2 π k x d x ) = ∫ − ∞ ∞ s ( x ) ( ∑ k = − ∞ ∞ e − i 2 π k x ) ⏟ ∑ n = − ∞ ∞ δ ( x − n ) d x = ∑ n = − ∞ ∞ ( ∫ − ∞ ∞ s ( x )   δ ( x − n )   d x ) = ∑ n = − ∞ ∞ s ( n ) . {\displaystyle {\begin{aligned}\sum _{k=-\infty }^{\infty }S(k)&=\sum _{k=-\infty }^{\infty }\left(\int _{-\infty }^{\infty }s(x)\ e^{-i2\pi kx}dx\right)=\int _{-\infty }^{\infty }s(x)\underbrace {\left(\sum _{k=-\infty }^{\infty }e^{-i2\pi kx}\right)} _{\sum _{n=-\infty }^{\infty }\delta (x-n)}dx\\&=\sum _{n=-\infty }^{\infty }\left(\int _{-\infty }^{\infty }s(x)\ \delta (x-n)\ dx\right)=\sum _{n=-\infty }^{\infty }s(n).\end{aligned}}}

Similarly:

∑ k = − ∞ ∞ S ( f − k / T ) = ∑ k = − ∞ ∞ F { s ( x ) ⋅ e i 2 π k T x } = F { s ( x ) ∑ k = − ∞ ∞ e i 2 π k T x ⏟ T ∑ n = − ∞ ∞ δ ( x − n T ) } = F { ∑ n = − ∞ ∞ T ⋅ s ( n T ) ⋅ δ ( x − n T ) } = ∑ n = − ∞ ∞ T ⋅ s ( n T ) ⋅ F { δ ( x − n T ) } = ∑ n = − ∞ ∞ T ⋅ s ( n T ) ⋅ e − i 2 π n T f . {\displaystyle {\begin{aligned}\sum _{k=-\infty }^{\infty }S(f-k/T)&=\sum _{k=-\infty }^{\infty }{\mathcal {F}}\left\{s(x)\cdot e^{i2\pi {\frac {k}{T}}x}\right\}\\&={\mathcal {F}}{\bigg \{}s(x)\underbrace {\sum _{k=-\infty }^{\infty }e^{i2\pi {\frac {k}{T}}x}} _{T\sum _{n=-\infty }^{\infty }\delta (x-nT)}{\bigg \}}={\mathcal {F}}\left\{\sum _{n=-\infty }^{\infty }T\cdot s(nT)\cdot \delta (x-nT)\right\}\\&=\sum _{n=-\infty }^{\infty }T\cdot s(nT)\cdot {\mathcal {F}}\left\{\delta (x-nT)\right\}=\sum _{n=-\infty }^{\infty }T\cdot s(nT)\cdot e^{-i2\pi nTf}.\end{aligned}}}

Or:⁷: 143 

∑ k = − ∞ ∞ S ( f − k / T ) = S ( f ) ∗ ∑ k = − ∞ ∞ δ ( f − k / T ) = S ( f ) ∗ F { T ∑ n = − ∞ ∞ δ ( x − n T ) } = F { s ( x ) ⋅ T ∑ n = − ∞ ∞ δ ( x − n T ) } = F { ∑ n = − ∞ ∞ T ⋅ s ( n T ) ⋅ δ ( x − n T ) } as above . {\displaystyle {\begin{aligned}\sum _{k=-\infty }^{\infty }S(f-k/T)&=S(f)*\sum _{k=-\infty }^{\infty }\delta (f-k/T)\\&=S(f)*{\mathcal {F}}\left\{T\sum _{n=-\infty }^{\infty }\delta (x-nT)\right\}\\&={\mathcal {F}}\left\{s(x)\cdot T\sum _{n=-\infty }^{\infty }\delta (x-nT)\right\}={\mathcal {F}}\left\{\sum _{n=-\infty }^{\infty }T\cdot s(nT)\cdot \delta (x-nT)\right\}\quad {\text{as above}}.\end{aligned}}}

The Poisson summation formula can also be proved quite conceptually using the compatibility of Pontryagin duality with short exact sequences such as⁸ 0 → Z → R → R / Z → 0. {\textstyle 0\to \mathbb {Z} \to \mathbb {R} \to \mathbb {R} /\mathbb {Z} \to 0.}

Applicability

Eq.2 holds provided s ( x ) {\displaystyle s(x)} is a continuous integrable function which satisfies | s ( x ) | + | S ( x ) | ≤ C ( 1 + | x | ) − 1 − δ {\textstyle |s(x)|+|S(x)|\leq C(1+|x|)^{-1-\delta }} for some C > 0 , δ > 0 {\displaystyle C>0,\delta >0} and every x . {\displaystyle x.} ⁹¹⁰ Note that such s ( x ) {\displaystyle s(x)} is uniformly continuous, this together with the decay assumption on s {\displaystyle s} , show that the series defining s P {\displaystyle s_{_{P}}} converges uniformly to a continuous function. Eq.2 holds in the strong sense that both sides converge uniformly and absolutely to the same limit.¹¹

Eq.2 holds in a pointwise sense under the strictly weaker assumption that s {\displaystyle s} has bounded variation and¹²

2 ⋅ s ( x ) = lim ε → 0 s ( x + ε ) + lim ε → 0 s ( x − ε ) . {\displaystyle 2\cdot s(x)=\lim _{\varepsilon \to 0}s(x+\varepsilon )+\lim _{\varepsilon \to 0}s(x-\varepsilon ).}

The Fourier series on the right-hand side of Eq.2 is then understood as a (conditionally convergent) limit of symmetric partial sums.

As shown above, Eq.2 holds under the much less restrictive assumption that s ( x ) {\displaystyle s(x)} is in L 1 ( R ) {\displaystyle L^{1}(\mathbb {R} )} , but then it is necessary to interpret it in the sense that the right-hand side is the (possibly divergent) Fourier series of s P ( x ) . {\displaystyle s_{_{P}}(x).} ¹³ In this case, one may extend the region where equality holds by considering summability methods such as Cesàro summability. When interpreting convergence in this way Eq.2, case x = 0 , {\displaystyle x=0,} holds under the less restrictive conditions that s ( x ) {\displaystyle s(x)} is integrable and 0 is a point of continuity of s P ( x ) {\displaystyle s_{_{P}}(x)} . However, Eq.2 may fail to hold even when both s {\displaystyle s} and S {\displaystyle S} are integrable and continuous, and the sums converge absolutely.¹⁴

Applications

Method of images

In partial differential equations, the Poisson summation formula provides a rigorous justification for the fundamental solution of the heat equation with absorbing rectangular boundary by the method of images. Here the heat kernel on R 2 {\displaystyle \mathbb {R} ^{2}} is known, and that of a rectangle is determined by taking the periodization. The Poisson summation formula similarly provides a connection between Fourier analysis on Euclidean spaces and on the tori of the corresponding dimensions.¹⁵ In one dimension, the resulting solution is called a theta function.

In electrodynamics, the method is also used to accelerate the computation of periodic Green's functions.¹⁶

Sampling

In the statistical study of time-series, if s {\displaystyle s} is a function of time, then looking only at its values at equally spaced points of time is called "sampling." In applications, typically the function s {\displaystyle s} is band-limited, meaning that there is some cutoff frequency f o {\displaystyle f_{o}} such that S ( f ) {\displaystyle S(f)} is zero for frequencies exceeding the cutoff: S ( f ) = 0 {\displaystyle S(f)=0} for | f | > f o . {\displaystyle |f|>f_{o}.} For band-limited functions, choosing the sampling rate 1 T > 2 f o {\displaystyle {\tfrac {1}{T}}>2f_{o}} guarantees that no information is lost: since S {\displaystyle S} can be reconstructed from these sampled values. Then, by Fourier inversion, so can s . {\displaystyle s.} This leads to the Nyquist–Shannon sampling theorem.¹⁷

Ewald summation

Computationally, the Poisson summation formula is useful since a slowly converging summation in real space is guaranteed to be converted into a quickly converging equivalent summation in Fourier space.¹⁸ (A broad function in real space becomes a narrow function in Fourier space and vice versa.) This is the essential idea behind Ewald summation.

Approximations of integrals

The Poisson summation formula is also useful to bound the errors obtained when an integral is approximated by a (Riemann) sum. Consider an approximation of S ( 0 ) = ∫ − ∞ ∞ d x s ( x ) {\textstyle S(0)=\int _{-\infty }^{\infty }dx\,s(x)} as δ ∑ n = − ∞ ∞ s ( n δ ) {\textstyle \delta \sum _{n=-\infty }^{\infty }s(n\delta )} , where δ ≪ 1 {\displaystyle \delta \ll 1} is the size of the bin. Then, according to Eq.2 this approximation coincides with ∑ k = − ∞ ∞ S ( k / δ ) {\textstyle \sum _{k=-\infty }^{\infty }S(k/\delta )} . The error in the approximation can then be bounded as | ∑ k ≠ 0 S ( k / δ ) | ≤ ∑ k ≠ 0 | S ( k / δ ) | {\textstyle \left|\sum _{k\neq 0}S(k/\delta )\right|\leq \sum _{k\neq 0}|S(k/\delta )|} . This is particularly useful when the Fourier transform of s ( x ) {\displaystyle s(x)} is rapidly decaying if 1 / δ ≫ 1 {\displaystyle 1/\delta \gg 1} .

Lattice points inside a sphere

The Poisson summation formula may be used to derive Landau's asymptotic formula for the number of lattice points inside a large Euclidean sphere. It can also be used to show that if an integrable function, s {\displaystyle s} and S {\displaystyle S} both have compact support then s = 0. {\displaystyle s=0.} ¹⁹

Number theory

In number theory, Poisson summation can also be used to derive a variety of functional equations including the functional equation for the Riemann zeta function.²⁰

One important such use of Poisson summation concerns theta functions: periodic summations of Gaussians. Put q = e i π τ {\displaystyle q=e^{i\pi \tau }} , for τ {\displaystyle \tau } a complex number in the upper half plane, and define the theta function:

θ ( τ ) = ∑ n q n 2 . {\displaystyle \theta (\tau )=\sum _{n}q^{n^{2}}.}

The relation between θ ( − 1 / τ ) {\displaystyle \theta (-1/\tau )} and θ ( τ ) {\displaystyle \theta (\tau )} turns out to be important for number theory, since this kind of relation is one of the defining properties of a modular form. By choosing s ( x ) = e − π x 2 {\displaystyle s(x)=e^{-\pi x^{2}}} and using the fact that S ( f ) = e − π f 2 , {\displaystyle S(f)=e^{-\pi f^{2}},} one can conclude:

θ ( − 1 τ ) = τ i θ ( τ ) , {\displaystyle \theta \left({-1 \over \tau }\right)={\sqrt {\tau \over i}}\theta (\tau ),} by putting 1 / λ = τ / i . {\displaystyle {1/\lambda }={\sqrt {\tau /i}}.}

It follows from this that θ 8 {\displaystyle \theta ^{8}} has a simple transformation property under τ ↦ − 1 / τ {\displaystyle \tau \mapsto {-1/\tau }} and this can be used to prove Jacobi's formula for the number of different ways to express an integer as the sum of eight perfect squares.

Sphere packings

Cohn & Elkies²¹ proved an upper bound on the density of sphere packings using the Poisson summation formula, which subsequently led to a proof of optimal sphere packings in dimension 8 and 24.

Other

• Let s ( x ) = e − a x {\displaystyle s(x)=e^{-ax}} for 0 ≤ x {\displaystyle 0\leq x} and s ( x ) = 0 {\displaystyle s(x)=0} for x < 0 {\displaystyle x<0} to get coth ⁡ ( x ) = x ∑ n ∈ Z 1 x 2 + π 2 n 2 = 1 x + 2 x ∑ n ∈ Z + 1 x 2 + π 2 n 2 . {\displaystyle \coth(x)=x\sum _{n\in \mathbb {Z} }{\frac {1}{x^{2}+\pi ^{2}n^{2}}}={\frac {1}{x}}+2x\sum _{n\in \mathbb {Z} _{+}}{\frac {1}{x^{2}+\pi ^{2}n^{2}}}.}
• It can be used to prove the functional equation for the theta function.
• Poisson's summation formula appears in Ramanujan's notebooks and can be used to prove some of his formulas, in particular it can be used to prove one of the formulas in Ramanujan's first letter to Hardy.
• It can be used to calculate the quadratic Gauss sum.

Generalizations

The Poisson summation formula holds in Euclidean space of arbitrary dimension. Let Λ {\displaystyle \Lambda } be the lattice in R d {\displaystyle \mathbb {R} ^{d}} consisting of points with integer coordinates. For a function s {\displaystyle s} in L 1 ( R d ) {\displaystyle L^{1}(\mathbb {R} ^{d})} , consider the series given by summing the translates of s {\displaystyle s} by elements of Λ {\displaystyle \Lambda } :

P s ( x ) = ∑ ν ∈ Λ s ( x + ν ) . {\displaystyle \mathbb {P} s(x)=\sum _{\nu \in \Lambda }s(x+\nu ).}

Theorem For s {\displaystyle s} in L 1 ( R d ) {\displaystyle L^{1}(\mathbb {R} ^{d})} , the above series converges pointwise almost everywhere, and defines a Λ {\displaystyle \Lambda } -periodic function on R d {\displaystyle \mathbb {R} ^{d}} , hence a function P s ( x ¯ ) {\displaystyle \mathbb {P} s({\bar {x}})} on the torus R d / Λ . {\displaystyle \mathbb {R} ^{d}/\Lambda .} a.e. P s {\displaystyle \mathbb {P} s} lies in L 1 ( R d / Λ ) {\displaystyle L^{1}(\mathbb {R} ^{d}/\Lambda )} with ‖ P s ‖ L 1 ( R d / Λ ) ≤ ‖ s ‖ L 1 ( R ) . {\displaystyle \|\mathbb {P} s\|_{L_{1}(\mathbb {R} ^{d}/\Lambda )}\leq \|s\|_{L_{1}(\mathbb {R} )}.} Moreover, for all ν {\displaystyle \nu } in Λ , {\displaystyle \Lambda ,}

P S ( ν ) = ∫ R d / Λ P s ( x ¯ ) e − i 2 π ν ⋅ x ¯ d x ¯ {\displaystyle \mathbb {P} S(\nu )=\int _{\mathbb {R} ^{d}/\Lambda }\mathbb {P} s({\bar {x}})e^{-i2\pi \nu \cdot {\bar {x}}}d{\bar {x}}}

(the Fourier transform of P s {\displaystyle \mathbb {P} s} on the torus R d / Λ {\displaystyle \mathbb {R} ^{d}/\Lambda } ) equals

S ( ν ) = ∫ R d s ( x ) e − i 2 π ν ⋅ x d x {\displaystyle S(\nu )=\int _{\mathbb {R} ^{d}}s(x)e^{-i2\pi \nu \cdot x}\,dx}

(the Fourier transform of s {\displaystyle s} on R d {\displaystyle \mathbb {R} ^{d}} ).

When s {\displaystyle s} is in addition continuous, and both s {\displaystyle s} and S {\displaystyle S} decay sufficiently fast at infinity, then one can "invert" the Fourier series back to their domain R d {\displaystyle \mathbb {R} ^{d}} and make a stronger statement. More precisely, if

| s ( x ) | + | S ( x ) | ≤ C ( 1 + | x | ) − d − δ {\displaystyle |s(x)|+|S(x)|\leq C(1+|x|)^{-d-\delta }}

for some C, δ > 0, then²²: VII §2 

∑ ν ∈ Λ s ( x + ν ) = ∑ ν ∈ Λ S ( ν ) e i 2 π ν ⋅ x , {\displaystyle \sum _{\nu \in \Lambda }s(x+\nu )=\sum _{\nu \in \Lambda }S(\nu )e^{i2\pi \nu \cdot x},}

where both series converge absolutely and uniformly on Λ. When d = 1 and x = 0, this gives Eq.1 above.

More generally, a version of the statement holds if Λ is replaced by a more general lattice in a finite dimensional vector space V {\displaystyle V} . Choose a translation invariant measure m {\displaystyle m} on V {\displaystyle V} . It is unique up to positive scalar. Again for a function s ∈ L 1 ( V , m ) {\displaystyle s\in L_{1}(V,m)} we define the periodisation

P s ( x ) = ∑ ν ∈ Λ s ( x + ν ) {\displaystyle \mathbb {P} s(x)=\sum _{\nu \in \Lambda }s(x+\nu )}

as above.

The dual lattice Λ ′ {\displaystyle \Lambda '} is defined as a subset of the dual vector space V ′ {\displaystyle V'} that evaluates to integers on the lattice Λ {\displaystyle \Lambda } or alternatively, by Pontryagin duality, as the characters of V {\displaystyle V} that contain Λ {\displaystyle \Lambda } in the kernel. Then the statement is that for all ν ∈ Λ ′ {\displaystyle \nu \in \Lambda '} the Fourier transform P S {\displaystyle \mathbb {P} S} of the periodisation P s {\displaystyle \mathbb {P} s} as a function on V / Λ {\displaystyle V/\Lambda } and the Fourier transform S {\displaystyle S} of s {\displaystyle s} on V {\displaystyle V} itself are related by proper normalisation

P S ( ν ) = 1 m ( V / Λ ) ∫ V / Λ P s ( x ¯ ) e − i 2 π ⟨ ν , x ¯ ⟩ m ( d x ¯ ) = 1 m ( V / Λ ) ∫ V s ( x ) e − i 2 π ⟨ ν , x ⟩ m ( d x ) = 1 m ( V / Λ ) S ( ν ) {\displaystyle {\begin{aligned}\mathbb {P} S(\nu )&={\frac {1}{m(V/\Lambda )}}\int _{V/\Lambda }\mathbb {P} s({\bar {x}})e^{-i2\pi \langle \nu ,{\bar {x}}\rangle }m(d{\bar {x}})\\&={\frac {1}{m(V/\Lambda )}}\int _{V}s(x)e^{-i2\pi \langle \nu ,x\rangle }m(dx)\\&={\frac {1}{m(V/\Lambda )}}S(\nu )\end{aligned}}}

Note that the right-hand side is independent of the choice of invariant measure μ {\displaystyle \mu } . If s {\displaystyle s} and S {\displaystyle S} are continuous and tend to zero faster than 1 / r dim ⁡ ( V ) + δ {\displaystyle 1/r^{\dim(V)+\delta }} then

∑ λ ∈ Λ s ( λ + x ) = ∑ ν ∈ Λ ′ P S ( ν ) e i 2 π ⟨ ν , x ⟩ = 1 m ( V / Λ ) ∑ ν ∈ Λ ′ S ( ν ) e i 2 π ⟨ ν , x ⟩ {\displaystyle \sum _{\lambda \in \Lambda }s(\lambda +x)=\sum _{\nu \in \Lambda '}\mathbb {P} S(\nu )e^{i2\pi \langle \nu ,x\rangle }={\frac {1}{m(V/\Lambda )}}\sum _{\nu \in \Lambda '}S(\nu )e^{i2\pi \langle \nu ,x\rangle }}

In particular

∑ λ ∈ Λ s ( λ ) = 1 m ( V / Λ ) ∑ ν ∈ Λ ′ S ( ν ) {\displaystyle \sum _{\lambda \in \Lambda }s(\lambda )={\frac {1}{m(V/\Lambda )}}\sum _{\nu \in \Lambda '}S(\nu )}

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.

Selberg trace formula

Main article: Selberg trace formula

Further generalization 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.

A series of mathematicians applying harmonic analysis to number theory, most notably Martin Eichler, Atle Selberg, Robert Langlands, and James Arthur, have generalised the Poisson summation formula to the Fourier transform on non-commutative locally compact reductive algebraic groups G {\displaystyle G} with a discrete subgroup Γ {\displaystyle \Gamma } such that G / Γ {\displaystyle G/\Gamma } has finite volume. For example, G {\displaystyle G} can be the real points of S L n {\displaystyle SL_{n}} and Γ {\displaystyle \Gamma } can be the integral points of S L n {\displaystyle SL_{n}} . In this setting, G {\displaystyle G} plays the role of the real number line in the classical version of Poisson summation, and Γ {\displaystyle \Gamma } plays the role of the integers n {\displaystyle n} that appear in the sum. The generalised version of Poisson summation is called the Selberg Trace Formula and has played a role in proving many cases of Artin's conjecture and in Wiles's proof of Fermat's Last Theorem. The left-hand side of Eq.1 becomes a sum over irreducible unitary representations of G {\displaystyle G} , and is called "the spectral side," while the right-hand side becomes a sum over conjugacy classes of Γ {\displaystyle \Gamma } , and is called "the geometric side."

The Poisson summation formula is the archetype for vast developments in harmonic analysis and number theory.

Semiclassical trace formula

The Selberg trace formula was later generalized to more general smooth manifolds (without any algebraic structure) by Gutzwiller, Balian-Bloch, Chazarain, Colin de Verdière, Duistermaat-Guillemin, Uribe, Guillemin-Melrose, Zelditch and others. The "wave trace" or "semiclassical trace" formula relates geometric and spectral properties of the underlying topological space. The spectral side is the trace of a unitary group of operators (e.g., the Schrödinger or wave propagator) which encodes the spectrum of a differential operator and the geometric side is a sum of distributions which are supported at the lengths of periodic orbits of a corresponding Hamiltonian system. The Hamiltonian is given by the principal symbol of the differential operator which generates the unitary group. For the Laplacian, the "wave trace" has singular support contained in the set of lengths of periodic geodesics; this is called the Poisson relation.

Convolution theorem

See also: Convolution theorem § Convolution theorem for tempered distributions

The Poisson summation formula is a particular case of the convolution theorem on tempered distributions. If one of the two factors is the Dirac comb, one obtains periodic summation on one side and sampling on the other side of the equation. Applied to the Dirac delta function and its Fourier transform, the function that is constantly 1, this yields the Dirac comb identity.

See also

• Fourier analysis § Summary
• Post's inversion formula
• Voronoi formula
• Discrete-time Fourier transform
• Explicit formulae for L-functions

Further reading

• Benedetto, J.J.; Zimmermann, G. (1997), "Sampling multipliers and the Poisson summation formula", J. Fourier Anal. Appl., 3 (5): 505–523, Bibcode:1997JFAA....3..505B, doi:10.1007/BF02648881, archived from the original on 2011-05-24, retrieved 2008-06-19
• Gasquet, Claude; Witomski, Patrick (1999), Fourier Analysis and Applications, Springer, pp. 344–352, ISBN 0-387-98485-2
• Higgins, J.R. (1985), "Five short stories about the cardinal series", Bull. Amer. Math. Soc., 12 (1): 45–89, doi:10.1090/S0273-0979-1985-15293-0

References

1. Stein and Weiss, p 251 ↩

2. Pinsky, M. (2002), Introduction to Fourier Analysis and Wavelets., Brooks Cole, ISBN 978-0-534-37660-4 978-0-534-37660-4 ↩

3. Zygmund, Antoni (1968), Trigonometric Series (2nd ed.), Cambridge University Press (published 1988), ISBN 978-0-521-35885-9 978-0-521-35885-9 ↩

4. Pinsky, M. (2002), Introduction to Fourier Analysis and Wavelets., Brooks Cole, ISBN 978-0-534-37660-4 978-0-534-37660-4 ↩

5. Córdoba, A., "La formule sommatoire de Poisson", Comptes Rendus de l'Académie des Sciences, Série I, 306: 373–376 ↩

6. Hörmander, L. (1983), The analysis of linear partial differential operators I, Grundl. Math. Wissenschaft., vol. 256, Springer, doi:10.1007/978-3-642-96750-4, ISBN 3-540-12104-8, MR 0717035 3-540-12104-8 ↩

7. Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). Discrete-time signal processing (2nd ed.). Upper Saddle River, N.J.: Prentice Hall. ISBN 0-13-754920-2. samples of the Fourier transform of an aperiodic sequence x[n] can be thought of as DFS coefficients of a periodic sequence obtained through summing periodic replicas of x[n]. 0-13-754920-2 ↩

8. Deitmar, Anton; Echterhoff, Siegfried (2014), Principles of Harmonic Analysis, Universitext (2 ed.), doi:10.1007/978-3-319-05792-7, ISBN 978-3-319-05791-0 978-3-319-05791-0 ↩

9. Grafakos, Loukas (2004), Classical and Modern Fourier Analysis, Pearson Education, Inc., pp. 253–257, ISBN 0-13-035399-X 0-13-035399-X ↩

10. Stein, Elias; Weiss, Guido (1971), Introduction to Fourier Analysis on Euclidean Spaces, Princeton, N.J.: Princeton University Press, ISBN 978-0-691-08078-9 978-0-691-08078-9 ↩

11. Stein, Elias; Weiss, Guido (1971), Introduction to Fourier Analysis on Euclidean Spaces, Princeton, N.J.: Princeton University Press, ISBN 978-0-691-08078-9 978-0-691-08078-9 ↩

12. Zygmund, Antoni (1968), Trigonometric Series (2nd ed.), Cambridge University Press (published 1988), ISBN 978-0-521-35885-9 978-0-521-35885-9 ↩

13. Zygmund, Antoni (1968), Trigonometric Series (2nd ed.), Cambridge University Press (published 1988), ISBN 978-0-521-35885-9 978-0-521-35885-9 ↩

14. Katznelson, Yitzhak (1976), An introduction to harmonic analysis (Second corrected ed.), New York: Dover Publications, Inc, ISBN 0-486-63331-4 0-486-63331-4 ↩

15. Grafakos, Loukas (2004), Classical and Modern Fourier Analysis, Pearson Education, Inc., pp. 253–257, ISBN 0-13-035399-X 0-13-035399-X ↩

16. Kinayman, Noyan; Aksun, M. I. (1995). "Comparative study of acceleration techniques for integrals and series in electromagnetic problems". Radio Science. 30 (6): 1713–1722. Bibcode:1995RaSc...30.1713K. doi:10.1029/95RS02060. hdl:11693/48408. /wiki/%C4%B0r%C5%9Fadi_Aksun ↩

17. Pinsky, M. (2002), Introduction to Fourier Analysis and Wavelets., Brooks Cole, ISBN 978-0-534-37660-4 978-0-534-37660-4 ↩

18. Woodward, Philipp M. (1953). Probability and Information Theory, with Applications to Radar. Academic Press, p. 36. /wiki/Philip_Woodward ↩

19. Pinsky, M. (2002), Introduction to Fourier Analysis and Wavelets., Brooks Cole, ISBN 978-0-534-37660-4 978-0-534-37660-4 ↩

20. H. M. Edwards (1974). Riemann's Zeta Function. Academic Press, pp. 209–11. ISBN 0-486-41740-9. /wiki/Harold_Edwards_(mathematician) ↩

21. Cohn, Henry; Elkies, Noam (2003), "New upper bounds on sphere packings I", Ann. of Math., 2, 157 (2): 689–714, arXiv:math/0110009, doi:10.4007/annals.2003.157.689, MR 1973059 /wiki/ArXiv_(identifier) ↩

22. Stein, Elias; Weiss, Guido (1971), Introduction to Fourier Analysis on Euclidean Spaces, Princeton, N.J.: Princeton University Press, ISBN 978-0-691-08078-9 978-0-691-08078-9 ↩