Math 2.0

Harmonic analysis on Euclidean spaces Fourier transform Theorem

Convolution theorem

Builds on Fourier transformConvolutionLp spaceFubini's theorem

Statement

Let n≥1n \ge 1 and let f,g∈L1(ℝn)f, g \in L^1(\R^n). Let f∗gf * g be their convolution, (f∗g)(x)=∫ℝnf(y) g(x−y) dy(f * g)(x) = \int_{\R^n} f(y)\, g(x - y)\, dy. Let h^(ξ)=∫ℝnh(x)e−2πix⋅ξ dx\hat h(\xi) = \int_{\R^n} h(x) e^{-2\pi i x \cdot \xi}\, dx denote the Fourier transform of h∈L1(ℝn)h \in L^1(\R^n). Then f∗gf * g lies in L1(ℝn)L^1(\R^n), and f∗g^(ξ)=f^(ξ) g^(ξ)for every ξ∈ℝn.\widehat{f * g}(\xi) = \hat f(\xi)\, \hat g(\xi) \quad \text{for every } \xi \in \R^n.

Remarks

The proof is one application of Fubini's theorem. Write e−2πix⋅ξ=e−2πiy⋅ξe−2πi(x−y)⋅ξe^{-2\pi i x \cdot \xi} = e^{-2\pi i y \cdot \xi} e^{-2\pi i (x - y) \cdot \xi} inside the double integral of f(y)g(x−y)e−2πix⋅ξf(y) g(x - y) e^{-2\pi i x \cdot \xi}. The double integral converges absolutely because ∫∫∣f(y)∣∣g(x−y)∣ dy dx=∥f∥1∥g∥1\int\int \abs{f(y)} \abs{g(x - y)}\, dy\, dx = \norm{f}_1 \norm{g}_1. Integrating first in xx and then in yy gives f^(ξ)g^(ξ)\hat f(\xi) \hat g(\xi).

Example: on ℝ\R, let f=g=𝟏[−1/2,1/2]f = g = \mathbf{1}_{[-1/2, 1/2]}. Then f^(ξ)=sin⁡(πξ)/(πξ)\hat f(\xi) = \sin(\pi \xi)/(\pi \xi), and f∗gf * g is the triangle function max⁡(1−∣x∣,0)\max(1 - \abs{x}, 0). So the Fourier transform of the triangle function is sin⁡2(πξ)/(πξ)2\sin^2(\pi \xi)/(\pi \xi)^2.

There is a dual form: for f,gf, g in the Schwartz space, fg^=f^∗g^\widehat{f g} = \hat f * \hat g. The same identity holds for Fourier series, where the convolution on the circle becomes the product of Fourier coefficients.

Going deeper

For a student

The theorem is why the Fourier transform solves linear equations with constant coefficients: such equations are convolution equations, and the transform makes them algebraic. It also shows that L1(ℝn)L^1(\R^n) with convolution is a commutative algebra, and that f↦f^f \mapsto \hat f is an algebra homomorphism into bounded continuous functions with pointwise product. Fast convolution of long sequences uses the discrete version of the theorem together with the fast Fourier transform.

Reading path

To understand this page from the ground up, read these 12 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convolution concept
  2. Euclidean space object
  3. Fourier transform concept
  4. Function concept
  5. Lp space concept
  6. Function of several variables concept
  7. Iterated integral definition
  8. Limit of a function of several variables concept
  9. Continuity in R^n definition
  10. Double integral definition
  11. Fubini's theorem statement
  12. Convolution theorem statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Convolution_theorem
About this page
TagQY8ETVDA1Z
URIm2://QY8ETVDA1Z
Kindstatement, theorem
WritingW0 stub
MSC42B10, 42A85, 42A38
StatusThis copy of the site has no build data. Run m2 status QY8ETVDA1Z.
AboutFourier transform, Convolution
UsesFourier transform, Convolution, Lp space, Fubini's theorem
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by