The convolution theorem is a mathematical result stating that, under suitable conditions, the Fourier transform of the convolution of two functions equals the pointwise product of their Fourier transforms. A complementary identity relates the transform of a pointwise product to a convolution of transforms. These identities turn operations that combine values across an entire domain into multiplication at individual frequencies. They are fundamental to harmonic analysis, differential equations, probability, and numerical signal processing. Analogous results hold for Laplace transforms, Fourier series, and discrete transforms.
Continuous Fourier-transform formulation
For absolutely integrable functions , their convolution is
Adopt the Fourier-transform convention
Here is the original-domain variable and is frequency. With this convention, the convolution theorem is
The multiplication on the right is pointwise: both transforms are evaluated at the same frequency.
More precisely, if , the space of absolutely integrable functions, then exists almost everywhere, belongs to , and satisfies the identity at every real frequency. These facts follow from the bound
The notation is an instance of an space.
When Fourier inversion is applicable, the theorem can also be written
The complementary product identity
Under suitable additional hypotheses,
A convenient sufficient setting for both identities is that and are smooth functions whose derivatives decrease faster than every inverse power of , often called rapidly decreasing functions. The product identity also holds in broader settings, but the existence and interpretation of its terms must be checked separately. Absolute integrability of and alone does not automatically make every integral in this second identity well defined.
Together, the two identities express a duality: convolution in one domain corresponds to multiplication in the other.
Proof
For ,
Thus Fubini’s theorem permits the order of integration to be exchanged. Starting from the definitions,
Set , so . Then
and consequently
The essential mechanism is that an exponential function evaluated at a sum factors into a product. Absolute integrability justifies the rearrangement of the integrals.
Normalization conventions
Fourier transforms are defined with several placements of and normalization constants. These choices change the constants in the convolution theorem.
With angular frequency , a common convention is
Then
With the unitary convention
the identities become
and
An apparent disagreement between formulas can therefore be a difference of convention rather than a mathematical contradiction.
Discrete forms
Infinite sequences
For absolutely summable sequences and , define
Their discrete-time Fourier transforms are
Then
These transforms are periodic in with period .
Finite sequences and circular convolution
For a length- sequence, define the discrete Fourier transform by
with inverse
The corresponding operation is circular convolution:
The theorem states
Circular convolution treats the index as periodic, so contributions extending past the end of the array wrap around to its beginning. It is not generally the same as ordinary, or linear, convolution.
If two finite sequences have lengths and , their linear convolution has length at most . Padding both sequences with zeros to a common length
allows their linear convolution to be computed by an -point transform without wraparound.
Using a fast Fourier transform, this procedure requires arithmetic operations, compared with for direct evaluation. These estimates use big-O notation and describe asymptotic cost; direct convolution can still be faster for short sequences or small kernels.
Periodic functions and Fourier series
Let and have period , and define normalized periodic convolution by
Their Fourier-series coefficients are
and similarly for . Then
If periodic convolution is instead defined without the factor , its coefficient is . The normalization of the convolution itself therefore matters as well as the normalization of the transform.
Laplace-transform form
For functions on , define causal convolution by
If
and , then the Laplace transform satisfies
where the transforms converge absolutely.
Local integrability together with suitable exponential-growth bounds provides standard sufficient conditions. This form is useful in solving ordinary differential equations and describing causal systems. Unlike the Fourier transform, the Laplace transform includes a real exponential weighting through the real part of .
Example: rectangular functions
Let
The value of is the length of overlap between two intervals of unit length:
Thus convolving two rectangular functions produces a triangular function.
With
the Fourier transform of is . The theorem therefore gives
This obtains the transform of the triangular function without integrating its two linear pieces separately.
Applications
Linear systems and filtering
A linear time-invariant system with impulse response is represented, under appropriate assumptions, by
where is the input and is the output. The convolution theorem gives
The function is the frequency response: it describes how the system changes the amplitude and phase of each frequency component.
The same principle applies in several dimensions. Two-dimensional convolution, for example, models spatial filtering and blur in images. The multidimensional theorem follows by replacing scalar variables with vectors and the product in the exponential with an inner product.
Probability distributions
If independent random variables and have probability density functions and , then the density of their sum is
The theorem converts this convolution into multiplication of transforms.
Equivalently, using the characteristic function
independence implies
This identity remains valid when the distributions have no densities. It is a central tool in studying sums of random variables and proving limit results such as the central limit theorem.
Differential equations
Fourier transformation converts constant-coefficient differential operators into multiplication by frequency-dependent expressions. Combined with the convolution theorem, this allows solutions of many partial differential equations to be expressed using a kernel or Green’s function.
For example, the solution of the heat equation on the whole real line can be expressed, for suitable initial data, as convolution with a Gaussian heat kernel. Transforming the equation reduces the spatial differential operator to multiplication and leaves an ordinary differential equation in time.
Polynomial multiplication
The coefficients of the product of two polynomials are the linear convolution of their coefficient sequences. With adequate zero-padding, transform multiplication followed by inverse transformation computes these coefficients efficiently. Exact integer or modular implementations require additional care beyond floating-point Fourier computation.
Conditions, extensions, and limitations
The theorem is an identity under specified assumptions, not a guarantee that every formal convolution or transform exists.
- Integrability and interpretation: The setting gives a direct classical result. Extensions to square-integrable functions use norm-based interpretations of Fourier transformation; pointwise integral formulas need not hold everywhere.
- Generalized functions: In distribution theory, convolution and Fourier transformation extend to objects such as the Dirac delta. However, arbitrary distributions cannot always be convolved or multiplied. Appropriate support, smoothness, or growth conditions remain necessary.
- Boundary handling: A discrete Fourier transform represents periodic data. For finite records or images, zero extension, periodic extension, and reflected extension describe different boundary models and generally produce different convolution results.
- Numerical error: FFT-based convolution is subject to floating-point rounding. Its computational advantage does not imply exact arithmetic.
- Deconvolution: Formally recovering is unstable where is small and may be impossible where vanishes. Such inverse problems often require additional assumptions or regularization; the convolution theorem alone does not establish a stable inverse.
- Convolution versus correlation: Correlation uses a different arrangement of shifts and, for complex-valued functions, conjugation. Its transform identity generally contains a complex conjugate and must not be substituted unchanged for the convolution theorem.