Convolution, Approximate Identities, and Poisson Summation
Convolution averages translated copies of one function against another. It composes translation-invariant kernels, moves derivatives onto a smooth factor, and turns into ordinary multiplication after Fourier transformation. A uniformly -bounded, unit-mass family whose absolute mass concentrates at the origin is an approximate identity: it recovers the input in a declared topology as the scale is removed. When its kernels are smooth, it also regularizes at every positive scale. Periodization performs the discrete–continuous step. With the conventions fixed below, the three central statements are
and, for and a full-rank lattice ,
Each line has different authorizing hypotheses. A convolution may exist only almost everywhere, smoothing comes from regularity of the kernel, approximate identity convergence is not generally uniform or pointwise everywhere, and the displayed Poisson formula is not being asserted for arbitrary or functions.
Required background. Lebesgue Integration and Convergence Theorems supplies the dominated, monotone, and absolute-convergence arguments used throughout. This page will still identify the step at which a limit or integral exchange is used.
Helpful background. Fourier Series, Fourier Transforms, and Plancherel Theory develops the transform rules and norm extension in full. It is useful but not required: the formulas needed for periodization are repeated here.
For targeted review, Product Measures, Fubini–Tonelli, and Change of Variables and Spaces, Inequalities, and Weak Convergence are targeted review links for double integrals and norm estimates, not additional prerequisites.
Convolution domains and a reliable workflow
Section titled “Convolution domains and a reliable workflow”The noncompact calculations use , Lebesgue measure, and the site’s positive-forward Fourier convention
The first formula is literal for inputs; both are pointwise safe on the Schwartz class. Periodic formulas will state the lattice, cell volume, reciprocal lattice, and phase separately.
A dependable convolution or lattice calculation has six steps:
- Specify the domain, measure, and boundary conditions.
- Name the input class and the theorem that makes the convolution or sum exist.
- Before exchanging integrals or sums, establish nonnegativity or absolute integrability.
- State the topology of every limit: pointwise, uniform, , or test-function convergence.
- Carry the Fourier phase, reciprocal-lattice definition, , and cell volume together.
- Check a normalized Gaussian or the zero Fourier mode by a second route.
The stop rule is important. Delta functions, delta combs, singular kernels, and conditionally convergent mode sums require tempered distributions and Fourier calculus or additional summation and regularization arguments. They are not ordinary functions merely because they appear beneath an integral sign.
Convolution composes translation-invariant kernels
Section titled “Convolution composes translation-invariant kernels”For measurable complex-valued functions, define
whenever the integral exists. The second form follows from a change of variables. If , Tonelli’s theorem gives
Thus is finite almost everywhere and belongs to . The qualifier “almost” cannot be dropped. On , the functions
are integrable, but contains and diverges.
Young’s inequality and the endpoint used below
Section titled “Young’s inequality and the endpoint used below”The full Young convolution inequality says that if , , , and
then
The definition, theorem, and useful endpoints are stated in Hunter 2014, Definition 1.22, Theorem 1.23, and Examples 1.24–1.26, p. 9, official UC Davis lecture-note PDF.
The case used for approximate identities has and :
For , Minkowski’s integral inequality and translation invariance of Lebesgue measure give the proof directly:
For , take the essential supremum after applying the pointwise integral bound.
If , absolute integrability also licenses the changes of variables and regrouping that give, almost everywhere,
Consequently the convolution operators compose by . This is the precise sense in which convolution composes translation-invariant kernels. Outside an integrable setting, formal associativity is not permission to rearrange divergent integrals.
Smoothing comes from the smooth factor
Section titled “Smoothing comes from the smooth factor”Let and . Compact support makes
finite for every , and dominated convergence moves derivatives onto the kernel:
Hence is smooth even when is not. Convolution alone does not have this effect. For example, is a continuous triangular function but is not differentiable at all of its corners.
For Schwartz functions, Fubini also gives the convolution theorem in the positive-forward convention:
By contrast, pointwise multiplication obeys
The absence of a factor in the first identity and its presence in the second are a normalization check, not a cosmetic choice. The two Fourier rules are treated in Dyatlov 2022, Propositions 11.10 and 11.18, pp. 122–125, official MIT lecture-note PDF; his negative-forward phase is translated here by .
Approximate identities concentrate and recover
Section titled “Approximate identities concentrate and recover”A family is an approximate identity if
and, for every ,
The last condition says that the mass concentrates near the origin. Unit integral by itself is not enough.
A standard mollifier starts with a nonnegative supported in the unit ball and normalized by . Define
Then is supported in the ball of radius , has integral and norm equal to one, and forms an approximate identity.
The norm-convergence proof
Section titled “The norm-convergence proof”Let and define the translation . Translations are continuous in :
One proof first verifies this for compactly supported continuous functions by uniform continuity, then approximates a general function by such a function. The same density argument fails in , where continuous functions are not norm-dense.
Normalization gives
Minkowski therefore yields
Choose so that the translation norm is small for . On that ball, the uniform bound controls the integral. Outside it, use and the concentration condition. Both pieces vanish, proving
The standard mollifier construction, smoothness, convergence at Lebesgue points, and local convergence are developed in Hunter 2014, § 1.9 and Theorem 1.28, pp. 11–12, official UC Davis lecture-note PDF.
| Input and kernel | Guaranteed convergence |
|---|---|
| f in Lᵖ, 1 ≤ p < ∞; bounded approximate identity | Lᵖ-norm convergence |
| Bounded uniformly continuous f; nonnegative normalized concentrating kernel | Uniform convergence |
| f locally integrable; standard nonnegative radial mollifier | Pointwise convergence at every Lebesgue point, hence almost everywhere |
| General f in L∞ | No general L∞-norm convergence |
For a domain , ordinary convolution near the boundary also needs a choice: restrict to points farther than from , extend outside , or use a boundary-adapted kernel. Silent zero extension can create an artificial boundary layer.
Pointwise and uniform failure at a jump
Section titled “Pointwise and uniform failure at a jump”Let on and take an even mollifier. At the jump,
for every . The value of the chosen representative could instead be or , and changing that one value changes no class. Moreover, continuous mollifications cannot converge uniformly to the discontinuous step. Thus convergence for finite , almost-everywhere convergence, and uniform convergence are genuinely different statements.
The Gaussian gives a semigroup and a second check
Section titled “The Gaussian gives a semigroup and a second check”The heat kernel
is a noncompactly supported approximate identity. Direct Gaussian integration and the transform convention above give
The multiplier immediately checks the composition law:
so Fourier inversion gives
Completing the square in the convolution integral gives the same result without Fourier transformation. The normalization is dimensionally consistent: , so has dimension .
For , the recommended Fourier page’s Plancherel theorem supplies an independent convergence proof:
by dominated convergence. The heat-kernel formula, its unit mass, smoothing, and recovery are given in Hunter 2014, §§ 5.1.1–5.1.2, pp. 130–131, official UC Davis lecture-note PDF.
For every bounded continuous function ,
This is the safe meaning of calling a delta sequence on this page. It does not say that converges pointwise or in to an ordinary function called .
Periodization produces reciprocal-lattice coefficients
Section titled “Periodization produces reciprocal-lattice coefficients”Let be an invertible real matrix and define the full-rank lattice, a fundamental cell, its volume, and the reciprocal lattice by
The defining property is for every and . For , the periodization
and all of its differentiated sums converge absolutely and locally uniformly. It is a smooth -periodic function.
For , unfold the cell translates:
Absolute convergence authorizes both the sum–integral exchange and the unfolding. Fourier-series reconstruction on the cell now gives the shifted Poisson summation formula
with pointwise and locally uniform convergence. At ,
For a rectangular box,
The factor in and the factor in the Fourier series are inseparable.
Dyatlov states the lattice-comb identity and explains its relation to Fourier-series periodization in Dyatlov 2022, Theorem 11.32, pp. 133–134, official MIT lecture-note PDF. His transform has negative forward phase, so . Because , the unshifted sum is unchanged; the sign in the shifted exponential is fixed by the reconstruction formula displayed here.
The Schwartz hypothesis is a safe theorem, not a claim of optimality. Weaker versions exist when the periodized sum and the Fourier series have sufficient convergence or when both sides are interpreted distributionally. Membership in alone does not guarantee pointwise sampling, absolute summability of the samples, or pointwise Fourier-series reconstruction.
Mode sums equal a continuum term plus images
Section titled “Mode sums equal a continuum term plus images”Let be a momentum-space function and define its inverse transform
Apply Poisson summation to . At this gives the exact identity
Separating the zero image produces
The first term is the continuum momentum integral. The nonzero images are the exact finite-volume correction under these hypotheses. This is stronger than the heuristic replacement : it displays the remainder rather than discarding it.
The shifted form is
Generic loop integrands are not Schwartz, and their sum and integral may both diverge. In that situation the displayed identity is a guide to a regulated calculation, not permission to subtract infinities term by term.
A Gaussian round trip
Section titled “A Gaussian round trip”Set . Its inverse transform is , so the image formula becomes
For the one-dimensional lattice , the shifted identity is
Integrating either side over gives . On the image side, the cells tile and the Gaussian has unit mass. On the mode side, every nonzero Fourier mode integrates to zero. This is an independent check of the phase, , Gaussian exponent, and normalization.
Finite-volume mode sums and regulated delta sequences
Section titled “Finite-volume mode sums and regulated delta sequences”The periodized heat kernel
is an ordinary smooth function for every . The image representation shows that it is nonnegative and -periodic; the zero Fourier mode shows that
Define periodic convolution by
The Fourier multiplier of is . Hence
and for every continuous periodic ,
For periodic data, , convergence instead holds in . Thus is a regulated periodic delta sequence. The formal limit
is meaningful through its action on smooth periodic test functions, not as a pointwise-convergent series or an ordinary value at . In the opposite limit, , every nonzero mode is suppressed and , the convolution kernel for projection onto the constant mode.
In canonical field notation, the continuum equal-time relation is written formally as
Tong gives the three-dimensional canonical relation in Tong 2006–2007, § 2.1, p. 21, equation (2.2), official lecture-note PDF. In a periodic-box calculation, Tong also identifies with the spatial volume in Tong 2006–2007, § 2.3, p. 25, equation (2.25), official lecture-note PDF. Discrete modes then replace the continuum delta by ; inserting replaces it by the smooth kernel . At finite this is a regulated approximation that modifies the exact canonical commutator; the canonical algebra is recovered only in the test-function limit. Fourier Series, Fourier Transforms, and Plancherel Theory uses for fixed-time spatial reconstruction. Replacing by changes the displayed phase, but the heat sum is unchanged because both the reciprocal lattice and the multiplier are even.
This example is deliberately limited. The heat factor is a spatial smoothing choice, not automatically a Lorentz-invariant regulator, and it leaves the coefficient equal to one. It therefore does not cure an infrared zero-mode problem; Massless Scalars, Zero Modes, and Infrared Limits develops that separate issue. The meaning and domains of smeared quantum fields are treated on Quantum Fields as Operator-Valued Distributions, within the broader Foundations treatment. Tong motivates the same distinction between point notation and smeared fields in Tong 2006–2007, § 2.4, p. 31, equations (2.52)–(2.53), official lecture-note PDF.
Diagnostics and common pitfalls
Section titled “Diagnostics and common pitfalls”Using associativity before proving integrability. Algebraic parentheses do not license a change in the order of divergent integrals. Establish a Tonelli, Fubini, or Young bound first.
Assuming convolution always smooths. Regularity is inherited from a factor whose derivatives can be moved through the integral. Two rough functions need not have a smooth convolution.
Checking only unit mass. An approximate identity must also concentrate at the origin and have uniformly bounded norm. Mass can otherwise escape to infinity or grow by cancellation.
Demanding the wrong convergence. Finite- norm convergence does not imply uniform convergence or determine values at jumps. State the topology before taking the limit.
Treating a sharp mode cutoff as a positive mollifier. A Dirichlet kernel has unit integral but oscillates and its norm is not uniformly bounded. Mode coefficients tending individually to one do not by themselves define a well-behaved approximate identity.
Applying Poisson summation from alone. Integrability controls an integral, not point samples or absolute convergence of two lattice sums. Use a safe class such as , or state the stronger theorem or distributional interpretation being used.
Dropping the reciprocal-lattice normalization. If , then and . Omitting either factor breaks the Gaussian check.
Setting the regulator to zero inside the series. For the periodic heat kernel is smooth. At its Fourier series represents a delta comb only in a test-function sense; is not an ordinary finite value.
Confusing ultraviolet smoothing with infrared control. The factor damps large momentum but leaves untouched. A regulator must be matched to the limit or singularity it is intended to control.
What the method now controls
Section titled “What the method now controls”Convolution composes translation-invariant kernels and obeys norm bounds that make its existence checkable. A smooth approximate identity regularizes rough data and then recovers it in the topology justified by the input class. Periodization converts a noncompact Schwartz function into a smooth periodic function whose Fourier coefficients sample the continuous transform. Poisson summation makes that relation exact, while the image expansion separates a finite-volume mode sum into its continuum contribution and controlled image corrections.
Useful continuations are:
- Fourier Series, Fourier Transforms, and Plancherel Theory supplies the full transform and norm framework used in the optional momentum-space checks.
- Tempered Distributions and Fourier Calculus defines delta distributions and supplies the machinery for interpreting combs, convolution, and Fourier operations beyond ordinary functions.
- Heat Kernels, Zeta Functions, and Spectral Determinants develops heat kernels as spectral objects rather than only mollifiers.
- Quantum Fields as Operator-Valued Distributions gives the physical treatment of smearing and point-field notation.
Exercises
Section titled “Exercises”A convolution that is not smooth. Compute and check its support, integral, and maximum.
Solution
The convolution is the length of the overlap between and :
Its support is , its maximum is , and its integral is the area of the triangle, equal to . The corners show that convolution of two functions need not be smooth.
Scaling a mollifier. Let with and . Verify its mass, norm, and Fourier transform.
Solution
With ,
and the same substitution with absolute values gives . For the positive-forward transform,
Thus shrinking in position space broadens the momentum-space multiplier.
A jump and the endpoint. For an even nonnegative mollifier, show that mollifying cannot converge in the norm.
Solution
At the origin the mollified value is . More strongly, continuity forces a transition region in which the mollification takes values between and , whereas the step takes only those endpoint values almost everywhere. For every , the essential supremum of the difference is at least . Hence the difference cannot tend to zero in , even though it tends to zero in for every finite on bounded intervals.
The Gaussian semigroup by completing the square. Verify directly that .
Solution
The exponent in the convolution satisfies
The centered Gaussian integral is
Combining it with the two kernel prefactors leaves
This agrees with the multiplier calculation .
The theta transformation. In the one-dimensional Gaussian Poisson formula, set , , and with . Derive the resulting identity.
Solution
The image side becomes
while the mode side becomes
Therefore
Applying the transformation twice returns the original series, which checks the reciprocal scaling.
The regulated periodic delta. Show from its mode expansion that has unit mass, composes as a semigroup, and leaves the zero mode undamped.
Solution
Cell integration kills every term with and multiplies the term by , so the mass is one. Periodic convolution multiplies Fourier coefficients, and
which proves the semigroup law. At the multiplier is for every . The regulator therefore suppresses high modes but does not alter the constant mode.
References
Section titled “References”- Semyon Dyatlov, Lecture Notes for 18.155: Distributions, Elliptic Regularity, and Applications to PDEs, MIT (2022), Propositions 11.10 and 11.18 and Theorem 11.32, pp. 122–125 and 133–134, official lecture-note PDF. Schwartz convolution, Fourier multiplication, and Poisson summation.
- John K. Hunter, Notes on Partial Differential Equations, revised 2014, Hunter 2014, §§ 1.7, 1.9, and 5.1, pp. 9–12 and 130–131, official UC Davis lecture-note PDF. Young’s inequality, mollification, approximate-identity convergence, and the Gaussian heat kernel.
- David Tong, Quantum Field Theory, Cambridge Part III lecture notes (2006–2007), Tong 2006–2007, §§ 2.1, 2.3, and 2.4, pp. 21, 25, and 31, official lecture-note PDF. Canonical equal-time field commutators and their delta normalization.