Fourier Transform on R^n and the Plancherel Theorem
Anchor (Master): Stein-Weiss, Introduction to Fourier Analysis on Euclidean Spaces (Princeton 1971) §I-V; Hörmander, The Analysis of Linear Partial Differential Operators I §7; Reed-Simon, Methods of Modern Mathematical Physics II §IX; Grafakos, Classical Fourier Analysis 3e §2-5
Intuition Beginner
A Fourier series writes a periodic function as a sum of pure sine and cosine waves at integer-multiple frequencies. The Fourier transform asks the same question for a non-periodic function: which pure frequencies do we need, and at what strengths, to reconstruct it? The catch is that a non-periodic function generally needs a continuous range of frequencies, not just integers. The discrete sum of harmonics becomes a continuous integral over the frequency axis, and the list of Fourier coefficients becomes a smooth function of frequency.
The physical motivation is a spectrogram. When a microphone records a voice, the waveform in time looks like a complicated wiggle. Run that waveform through the Fourier transform and a different picture appears: a smooth function of frequency that tells you the strength of each pure tone present in the voice. Vowels show clear peaks at certain frequencies called formants, while consonants spread their energy more broadly. The same picture works for any signal: a photograph has a Fourier transform that separates smooth gradients from sharp edges, and a radio signal has one that separates the carrier from the modulation.
The same engine solves linear differential equations. The heat equation is hard to solve directly, but each pure sine wave is an eigenfunction: it just decays exponentially in time, with high frequencies dying faster than low ones. The trick is to decompose the initial temperature into pure waves using the Fourier transform, solve each wave separately, and add the answers back together using the inverse Fourier transform. The same trick works for the wave equation, the Schrödinger equation of quantum mechanics, and Laplace's equation in electrostatics — each becomes a one-line solution in the frequency domain.
A central fact is that the Fourier transform conserves energy. The total energy of the signal, measured as the integral of its square over time, equals the total energy of its frequency content, measured as the integral of the squared transform over frequency. This is Plancherel's theorem. It says the Fourier transform is a perfect dictionary: nothing is lost when switching between the time-domain picture and the frequency-domain picture, and the round trip from time to frequency and back recovers the original signal exactly.
The one-sentence takeaway: the Fourier transform decomposes a non-periodic signal into a continuous spectrum of pure frequencies, the Plancherel theorem says the transform preserves total energy, and the inverse Fourier transform rebuilds the original signal from its spectrum.
Visual Beginner
Picture a Gaussian bump centered at the origin, a smooth bell-shaped curve. Now picture its Fourier transform: another Gaussian bump, centered at frequency zero. A wide bell in time corresponds to a narrow bell in frequency, and a narrow bell in time corresponds to a wide bell in frequency. Sharp localization in one domain forces spreading in the other. This is the picture behind the Heisenberg uncertainty principle.
Now picture a rectangular pulse: a function equal to one on a short interval and zero outside. Its Fourier transform is the sinc function, a smooth wave that oscillates and decays slowly as the frequency increases. The sharp edges of the rectangle generate slowly decaying high-frequency tails, while the smooth Gaussian generates rapidly decaying tails. The smoother the function, the faster its transform decays at infinity.
Six pictures showing the time-frequency duality: narrow becomes wide, smooth becomes rapidly decaying, sharp becomes slowly oscillating — that is the visual content of the Fourier transform.
Worked example Beginner
We compute the Fourier transform of the Gaussian function on the real line and observe its self-transforming property.
Step 1. The Fourier transform of a function on the real line is defined as the integral of against the pure-frequency wave over all of the real line. Different conventions place the factor of two pi in different positions, but the structural content is the same. For our calculation we use the convention without the factor of two pi: the Fourier transform of at frequency is the integral of from minus infinity to plus infinity.
Step 2. Substituting , we need to evaluate the integral of over the real line. Complete the square in the exponent: . The first term is a shifted parabolic exponential; the second term is a constant in that can be pulled out of the integral.
Step 3. The remaining integral is times the integral of over the real line. By contour shifting (the integrand is entire and decays as the real part of goes to plus or minus infinity), the integral over the shifted contour equals the integral over the real axis, which is the standard Gaussian integral equal to the square root of two pi.
Step 4. Putting it together, the Fourier transform of the Gaussian is . Up to the multiplicative constant, the Gaussian is its own Fourier transform: the transform of a Gaussian is another Gaussian with the same shape. This self-transforming property is unique to the Gaussian (modulo dilation and translation) and is the source of many special properties — Gaussians are the unique minimizers of the Heisenberg uncertainty principle, the heat-equation kernel, and the ground-state wavefunction of the quantum harmonic oscillator.
Step 5. As a parallel example, the rectangular pulse on the interval from minus one half to plus one half and zero outside has Fourier transform equal to the sinc function, , evaluated at the angular frequency . The sinc function has slowly decaying oscillating tails, in contrast to the Gaussian's rapid decay. The sharp edges of the rectangle produce the slow decay; the smoothness of the Gaussian produces the fast decay. This decay-versus-smoothness duality is a recurring theme throughout the theory.
Check your understanding Beginner
Formal definition Intermediate+
Let , the space of Lebesgue-integrable functions on [from 02.07.06]. The Fourier transform of is the function defined by where is the Euclidean inner product on . The integral converges absolutely because is integrable. The -convention used here makes Parseval's identity hold with no factor; alternative conventions place factors of elsewhere with corresponding adjustments. We will note the convention-translation at key formulas.
The map , , is linear and bounded with operator norm : for every , Hence .
Basic identities. For and constants , , :
- Linearity. .
- Translation. Let . Then .
- Modulation. Let . Then .
- Dilation. Let . Then .
- Conjugation. .
These identities follow from substitution in the defining integral.
Definition (Riemann-Lebesgue, on ). The Fourier transform of an -function vanishes at infinity: for , as .
Definition (convolution). For , the convolution is defined almost everywhere by By Fubini-Tonelli [from 02.07.07] applied to the function on , the convolution is well-defined for almost every and lies in , with .
Definition (Gaussian on ). The Gaussian with normalization satisfies the self-transforming property : the Gaussian is its own Fourier transform under the -convention.
Definition (Schwartz space). The Schwartz space is the set of smooth functions such that for every pair of multi-indices . The seminorms make into a Fréchet space (complete metrizable locally convex topological vector space). Equivalently, iff and all its derivatives decay faster than any polynomial at infinity. Examples: the Gaussian , Hermite functions , smooth compactly supported functions .
Definition (-Fourier transform via Plancherel). The Fourier transform defined by the integral formula extends uniquely to a continuous linear operator that is a unitary isomorphism. The extension is the content of the Plancherel theorem (Theorem 4 below).
Counterexamples to common slips Intermediate+
need not be in . For , the Fourier transform is bounded and continuous and vanishes at infinity, but need not be in . The rectangular pulse has Fourier transform (sinc function), which decays like and is not in . Consequently, the Fourier inversion integral does not converge absolutely; pointwise inversion requires additional hypotheses on or interpretation via summability methods (Cesàro, Abel) or in the principal-value sense.
Pointwise inversion can fail. If but , the Fourier inversion integral does not converge in the Lebesgue sense and may diverge pointwise. The cleanest framework where inversion holds pointwise is the Schwartz space , where both and are Schwartz and absolutely integrable; on , inversion holds in the -norm but not necessarily pointwise.
Plancherel holds on , not on . The identity is the central Plancherel statement on , but no analogous identity holds on : the Fourier transform of an -function is in (with ), and the only -norm identity available across and is the strict inequality .
The Hausdorff-Young inequality fails for . The inequality holds for with conjugate exponent , where . For , no boundedness of the Fourier transform holds: the Fourier transform of a generic -function with need not be a function at all (it is a tempered distribution), and the Hausdorff-Young inequality fails.
Convolution and Fourier transform exchange. The identity (Fourier transform of a convolution is the product of Fourier transforms) holds for . The converse identity (Fourier transform of a product is the convolution of Fourier transforms) requires more care: need not be integrable even when , and the right-hand convolution may not converge. The cleanest formulation is on the Schwartz space, where both identities hold without integrability concerns.
Key theorem with proof Intermediate+
Theorem (Plancherel; Plancherel 1910 Rend. Circ. Mat. Palermo 30, 289). The Fourier transform, initially defined on by the integral formula satisfies the Plancherel identity for . Consequently extends uniquely by continuity to a bounded linear operator , and this extension is a unitary isomorphism: is norm-preserving on , and its inverse is the inverse Fourier transform (extended to by the same density argument).
Proof. The proof proceeds via the Schwartz space as a dense subspace of .
Step 1 (Fourier inversion on Schwartz space). We first establish: for every , , and the inversion formula holds pointwise for every .
That when : differentiation under the integral sign (justified by the Schwartz-decay of and its derivatives) gives , and integration by parts gives . Combining, is the Fourier transform of a Schwartz function, hence bounded, so satisfies the Schwartz seminorm bounds.
For the inversion formula, apply the Fourier transform to and use the Gaussian approximation. Let be the family of Gaussians with (using the self-transforming property of the Gaussian and the dilation identity). The family is an approximate identity: for all , and as in the distributional sense.
For , the integral may not converge absolutely, but its Gaussian-regularized version does:
Substituting and applying Fubini (legal because the double integrand is in thanks to the Gaussian factor): using the Fourier transform of the Gaussian .
As , the approximate-identity property gives pointwise for every (using continuity of ). Also, dominated convergence gives pointwise (since is Schwartz, hence in , and the Gaussian factor is bounded by uniformly and tends to pointwise). Equating limits: This is Fourier inversion on .
Step 2 (Plancherel identity on Schwartz space). For , we show , where .
Compute, using (the conjugate of the Fourier inversion formula for ): By Fubini (both Schwartz, so both integrals converge absolutely):
Taking gives the Plancherel identity on .
Step 3 (extension by density to ). The Schwartz space is dense in (a consequence of density of and density of in , both standard). Given , choose a Schwartz sequence in -norm. The Plancherel identity on gives , so is Cauchy in . By Riesz-Fischer completeness [from 02.07.06], the sequence has a limit, which we denote . The limit is independent of the choice of approximating sequence (by another Cauchy argument), so is well-defined.
By continuity, the Plancherel identity passes to the limit: . So the extended operator is an isometry.
Step 4 (surjectivity and inverse). The inverse Fourier transform , defined analogously by on and extended by density to , satisfies on by the inversion formula from Step 1. By density, the same identities hold on . So is an -isometry with two-sided inverse , hence a unitary isomorphism of .
Bridge. The Plancherel theorem is the continuous-frequency analogue of the Parseval identity for Fourier series [from 02.10.01]. Both say the spectral decomposition is an isometry: discrete-frequency-amplitude space () for the circle, continuous-frequency-density space () for the line. The structural mechanism is the same in both cases: a dense subspace ( or ) on which the Fourier transform is well-behaved and the relevant identity is verifiable by direct calculation; the identity extends by continuity to the full -completion using Riesz-Fischer. The Plancherel framework unifies the discrete and continuous spectral decompositions under the umbrella of Pontryagin duality on locally compact abelian groups: the Fourier transform on a group is always an -isometry into of the Pontryagin dual , with paired against , paired against , and finite cyclic groups paired against themselves. The Plancherel identity is the same theorem in each case, with the same proof template — density of a regular subspace plus continuity-extension via completeness.
Exercises Intermediate+
Lean formalization Intermediate+
lean_status: partial — Mathlib provides the central Fourier-transform infrastructure for . Real.fourierIntegral is the integral for , Real.fourierInversion is the inverse-Fourier-transform integral, and Real.zero_at_infty_fourierIntegral is the Riemann-Lebesgue lemma stating for . The Schwartz space is SchwartzMap, with the Fréchet-space structure as SchwartzMap.topology and the seminorms SchwartzMap.seminorm. The Fourier transform on Schwartz space is SchwartzMap.fourierTransformCLM as a continuous linear self-map. The Fourier-inversion theorem on Schwartz space is SchwartzMap.fourierInversion. The Plancherel theorem is MeasureTheory.fourier_isometryL2, with the unitary -extension Real.fourierIntegralL2. The convolution theorem Real.fourierIntegral_convolution_eq_mul and the differentiation-multiplication duality Real.fourierIntegral_iteratedDeriv_eq_mul_pow are in Mathlib.Analysis.Fourier.FourierTransform. The Poisson summation formula is Real.tsum_eq_tsum_fourierIntegral, valid for Schwartz functions. The Heisenberg uncertainty principle is MeasureTheory.heisenberg_uncertainty. Tempered distributions are SchwartzMap.Dual, but the Fourier transform on tempered distributions as a continuous linear self-map of SchwartzMap.Dual is in the contributor branch of Mathlib (as of 2026, not in main). The Hausdorff-Young inequality Real.fourierIntegral_lp_le is partial: the and endpoints are in Mathlib via Plancherel, but the Riesz-Thorin interpolation to the intermediate inequalities is not yet formalized. The Paley-Wiener support theorem is not in Mathlib as of 2026.
import Mathlib.Analysis.Fourier.FourierTransform
import Mathlib.Analysis.Distribution.SchwartzSpace
import Mathlib.MeasureTheory.Function.LpSpace
open MeasureTheory Real Complex SchwartzMap
variable (f : ℝ → ℂ)
-- Fourier transform of an L^1 function
noncomputable def fourierIntegral (f : ℝ → ℂ) (ξ : ℝ) : ℂ :=
∫ x : ℝ, f x * Complex.exp (-2 * π * I * ξ * x)
-- Riemann-Lebesgue lemma: Fourier integral of L^1 vanishes at infinity
theorem riemann_lebesgue_R (f : ℝ → ℂ) (hf : Integrable f) :
Filter.Tendsto (fourierIntegral f) (Filter.cocompact ℝ) (nhds 0) := by
sorry -- proof via density of Schwartz functions + direct calculation
-- Plancherel identity for L^2 functions
theorem plancherel_identity (f : ℝ → ℂ) (hf : MemLp f 2) :
∫ ξ : ℝ, ‖fourierIntegral f ξ‖^2 = ∫ x : ℝ, ‖f x‖^2 := by
sorry -- proof via density of Schwartz + Plancherel on Schwartz
-- Convolution theorem
theorem fourierIntegral_convolution (f g : ℝ → ℂ) (hf : Integrable f) (hg : Integrable g) :
fourierIntegral (f ⋆ g) = fun ξ => fourierIntegral f ξ * fourierIntegral g ξ := by
sorry -- proof via Fubini
-- Heisenberg uncertainty principle
theorem heisenberg_uncertainty (f : ℝ → ℂ) (hf : MemLp f 2) (h_norm : ∫ x, ‖f x‖^2 = 1) :
Real.sqrt (∫ x : ℝ, x^2 * ‖f x‖^2) *
Real.sqrt (∫ ξ : ℝ, ξ^2 * ‖fourierIntegral f ξ‖^2) ≥ 1 / (4 * π) := by
sorry -- proof via Cauchy-Schwarz + integration by partsAdvanced results Master
The advanced theory of the Fourier transform on splits across nine strands: the Schwartz-space framework with its Fréchet-space topology, the full Fourier inversion theorem on Schwartz, the Plancherel theorem as a -unitary, the Hausdorff-Young inequality interpolating between and endpoints, the extension to tempered distributions, the convolution theorem and its applications to constant-coefficient linear PDEs (heat, wave, Schrödinger), the Poisson summation formula, the Heisenberg uncertainty principle in its sharp form, and the Paley-Wiener-Schwartz support theorem relating compact support to entire-function exponential type.
Theorem 1 (Riemann-Lebesgue on ). Let . Then is continuous and bounded on , and as .
The proof mirrors the Fourier-series version (Theorem 1 of 02.10.01): density of step functions in plus direct computation of the Fourier transform on indicators of rectangles. The continuity of follows from dominated convergence: is bounded by uniformly in , so is continuous by DCT. The vanishing at infinity is the structural Riemann-Lebesgue statement [Riemann 1854; Lebesgue 1903] — Fourier-transform values inherit the cancellation behaviour from simple test functions at high frequency. The image is a strict subset of , the space of continuous functions vanishing at infinity (a deep fact: not every is the Fourier transform of an -function).
Theorem 2 (Schwartz space as a Fréchet space). The Schwartz space with the seminorm family is a Fréchet space (complete metrizable locally convex topological vector space). It is dense in every for , and dense in .
Schwartz 1950 [Schwartz 1950] introduced in his foundational Théorie des distributions as the natural test-function space for the Fourier transform. The Fréchet structure: the countable family defined by generates the topology, equivalent to the multi-index formulation. Completeness follows from completeness of in each polynomial-weighted -norm. Density in follows from and density of in .
Theorem 3 (Fourier inversion on Schwartz space). The Fourier transform is a continuous linear bijection with inverse . Both and are continuous in the Fréchet topology.
The inversion formula on is the heart of the Fourier-analytic edifice. Proof via Gaussian regularization (as in the Key Theorem proof, Step 1): approximate the inverse-Fourier integral by a Gaussian-damped version, apply Fubini, recognize the result as a convolution with the heat kernel , and pass to the limit using the approximate-identity property of . The continuity of on follows from the seminorm bound (proved by integration-by-parts in the integral defining , with the polynomial-decay-of- traded against the high-derivative-bound on ).
Theorem 4 (Plancherel theorem; Plancherel 1910 Rend. Circ. Mat. Palermo 30, 289). The Fourier transform extends from to a unitary isomorphism with for all .
Plancherel's 1910 paper [Plancherel 1910] extended the Parseval identity for Fourier series to the Fourier-transform setting, establishing the -isometry that bears his name. The original proof used a direct truncation argument (approximate by its restrictions to bounded intervals and pass to the limit); the modern proof via the Schwartz-space density (Key Theorem) is cleaner and more conceptual. The Plancherel theorem is the structural origin of all -based Fourier analysis: the Fourier transform diagonalizes the translation operators in the -spectral sense (with each translation becoming multiplication by in the Fourier picture), and the simultaneous diagonalization of the abelian translation group is the spectral decomposition of as a representation of .
Theorem 5 (Hausdorff-Young inequality; Hausdorff 1923 Math. Z. 16, 163; Young 1912 Proc. Roy. Soc. A 87, 331). For with conjugate exponent (), the Fourier transform extends to a bounded linear map with .
The Hausdorff-Young inequality interpolates between the endpoint (immediate from the integral formula) and the endpoint (Plancherel). The Riesz-Thorin interpolation theorem [Hausdorff 1923] gives the intermediate inequalities with constant . The endpoint conjugate exponent is sharp: for , no boundedness holds. The Beckner 1975 sharp constant theorem improved the constant from to , with Gaussians as the unique extremizers (Lieb 1990).
Theorem 6 (Convolution theorem and pseudo-symmetry). For , . For , additionally (both convolution and pointwise product defined on ).
The convolution theorem (Exercise 3) makes the Fourier transform an algebra homomorphism from the convolution Banach algebra to the pointwise-product algebra — a Gelfand transform identification. The convolution-product duality on (where both pictures are well-defined) is the master symmetry of the Fourier transform, and underlies the differentiation-multiplication duality of Exercise 4 ( is "convolution with " in some sense; multiplication by becomes "differentiation in ").
Theorem 7 (Fourier transform on tempered distributions; Schwartz 1950). The Fourier transform extends to a continuous linear self-map on the space of tempered distributions, defined by the duality for and .
Schwartz 1950 [Schwartz 1950] extended the Fourier transform from functions to distributions by duality, with — the dual of — as the natural target. The extension subsumes all previous Fourier-transform settings: , , and for as function-valued distributions; and includes singular distributions like the Dirac delta (with , constant) and the constant function (with ). The Fourier transform on is the "right" framework for the Fourier-analytic theory of linear PDEs: solutions of are tempered distributions when the symbol is non-vanishing, and the analysis of pseudodifferential operators and Fourier integral operators (Hörmander 1990) [Hörmander] is built on this foundation.
Theorem 8 (Heat / wave / Schrödinger via Fourier transform). The constant-coefficient linear evolution PDEs on : admit closed-form solutions via the Fourier transform: where is the initial datum and the multiplier is , (for the symmetric initial-velocity-zero problem) or (initial-datum-zero), and .
The Fourier-transform technique reduces each PDE to an ODE in for the Fourier transform (Exercise 5 for heat). Each multiplier has a corresponding inverse-Fourier-transform kernel : the heat kernel , the wave kernel involving spherical means (Kirchhoff formula in dimension three), the Schrödinger kernel . The Fourier-transform technique extends to general constant-coefficient operators via the symbol , and to variable-coefficient operators via pseudodifferential calculus.
Theorem 9 (Poisson summation formula). For (or any in the Wiener algebra with also in ), More generally, for any lattice with dual lattice ,
The Poisson summation formula (Exercise 7) is the master identity of harmonic analysis on lattices, with deep applications: the theta-function functional equation (theta from Poisson on a Gaussian); the Shannon sampling theorem (a band-limited function is determined by its samples at the Nyquist rate); the Selberg trace formula on Riemannian symmetric spaces (a non-abelian generalization, central to representation theory and automorphic forms); the functional equations of -functions in analytic number theory (Hecke 1918, Tate 1950); and the Selberg sieve in analytic number theory. The general form on locally compact abelian groups: for a closed cocompact subgroup with annihilator , the sum of over equals (a constant times) the sum of over — the foundational duality of harmonic analysis on LCA groups.
Theorem 10 (Heisenberg uncertainty principle in sharp form). For with , for any . Equality holds if and only if is a Gaussian wave-packet for some constants .
The Heisenberg uncertainty principle (Exercise 6) is the prototype quantitative time-frequency complementarity statement [Heisenberg 1927]. The sharp constant is achieved by Gaussian wave-packets, the unique minimizers. Translating to standard quantum-mechanical units with momentum , the inequality becomes , the form due to Heisenberg 1927 with the Kennard 1927 sharp constant. Generalizations: the Robertson-Schrödinger uncertainty principle for non-commuting observables ; the entropy-based uncertainty principle of Beckner 1975 / Hirschman 1957; the Cowling-Price 1984 strong uncertainty principle (qualitative localization). The Hardy uncertainty principle (Hardy 1933) gives a sharper version: if and with , then .
Theorem 11 (Paley-Wiener support theorem; Paley-Wiener 1934 AMS Colloq. Publ. 19). A function has Fourier transform supported in if and only if extends to an entire function of exponential type at most , in the sense that .
The Paley-Wiener theorem (Exercise 8) is the central identification of compactly-supported-Fourier-transform -functions with boundary values of entire functions of exponential type — a deep correspondence between analyticity-on-strips in time and frequency-localization. The distributional version (Paley-Wiener-Schwartz; Hörmander 1990 §7.3) extends to tempered distributions: has compact support iff extends to an entire function of exponential type. Generalizations: Paley-Wiener-Cartwright for Fourier-Laplace transforms in several complex variables, Paley-Wiener for entire functions on tube domains , Paley-Wiener for spherical Fourier transforms on Riemannian symmetric spaces (Harish-Chandra).
Synthesis. The Fourier-transform architecture on extends the Fourier-series architecture on by replacing the discrete-frequency spectrum with the continuous-frequency spectrum . The Schwartz space provides the natural test-function class where all Fourier-transform identities hold without integrability concerns, and the Fourier transform is a topological isomorphism of to itself. The Plancherel theorem extends the Fourier transform to a unitary isomorphism of , and the tempered-distribution framework further extends to a continuous self-map of distributions. The Hausdorff-Young inequality interpolates between the and endpoints, capturing the -mapping properties for . The convolution theorem identifies the Fourier transform with an algebra homomorphism, and the differentiation-multiplication duality reduces constant-coefficient linear PDEs to algebraic equations in the Fourier picture — the structural mechanism behind the Fourier-analytic approach to heat, wave, Schrödinger, Klein-Gordon, and Laplace equations.
The pattern recurs through three escalations. First, Fourier's original 1822 [Fourier 1822] heuristic Fourier-transform integrals for the heat equation on the real line, used freely without convergence analysis. Second, the rigorous foundations: Plancherel 1910 [Plancherel 1910] establishing the -isometry; Wiener 1933 [Wiener 1933] introducing the Wiener algebra and the Tauberian theorems; Bochner 1932 [Bochner 1932] developing the Bochner integral framework and the Bochner theorem characterizing Fourier transforms of positive measures. Third, the modern extensions: Schwartz 1950 [Schwartz 1950] introducing tempered distributions; Hörmander 1990 [Hörmander] developing pseudodifferential operators and Fourier integral operators; Beckner 1975 finding the sharp Hausdorff-Young constants; the modern time-frequency analysis (wavelets, Gabor frames, Wigner distributions) extending the Fourier picture to localized time-frequency atoms (Daubechies 1988, Grochenig 2001).
The endpoint is the unified harmonic-analytic framework where Fourier series and Fourier transforms are special cases of the spectral theory on locally compact abelian groups (Pontryagin 1934, Cartan-Godement 1947), and the unitary representation theory of non-abelian groups extends the picture (Mackey 1949, Harish-Chandra 1954). The Fourier transform is the spectral decomposition of under the natural translation-invariant structure, the prototype of the spectral theory for self-adjoint operators (Stone 1932, von Neumann 1932) and of representation-theoretic decompositions on homogeneous spaces.
Full proof set Master
Proposition 1 (Gaussian self-transform). For on , .
Proof. By the product structure of on (separation of variables) and the multiplicative property of the Fourier transform on tensor products, it suffices to prove the case . So consider on . Compute . Complete the square in the exponent: . So The remaining integral is over the real axis. The integrand is entire in , and by Cauchy's theorem the integral over the shifted contour equals the integral over the real axis (the integrand decays as , so the vertical sides at contribute zero). Thus by the standard Gaussian integral with the -normalization. Hence .
Proposition 2 (Dilation rule for Gaussians). For on , .
Proof. Apply the dilation identity (a consequence of the change of variables in the defining integral). For , , so , and
Proposition 3 (Approximate identity property of Gaussians). The family defined above satisfies (i) for all , (ii) , and (iii) for every , as .
Proof. (i) By Proposition 2 with : , but by definition. (ii) Direct from . (iii) For : for . Integrating over the annulus and using the dominated convergence (or direct change of variables): as . (More precisely: as , since and .)
Proposition 4 (Fourier inversion on Schwartz). For , pointwise for every .
Proof. As in the Key Theorem, Step 1: Gaussian-regularize the inverse-Fourier integral by inserting the factor , apply Fubini to interchange integrals over (legal because the regularized integrand is in ), recognize the result as a Gaussian convolution , and pass to the limit using the approximate-identity property (Proposition 3). The pointwise limit on the left is (by DCT, since ); the pointwise limit on the right is (by continuity of at and approximate-identity convergence). Equating limits gives the inversion formula.
Proposition 5 (Plancherel on Schwartz). For , .
Proof. As in the Key Theorem, Step 2: write (conjugate of inversion), substitute into , exchange order of integration by Fubini, and recognize the inner integral as . The result .
Proposition 6 (Density of Schwartz in ). is dense in .
Proof. (smooth compactly supported functions are Schwartz, with all Schwartz seminorms automatically bounded by compactness of support). is dense in — a standard fact: density of in (from outer-regularity of Lebesgue measure plus Urysohn-Tietze extension), then smoothing functions by mollifier convolution. So is dense in as a superset of a dense set.
Proposition 7 (Plancherel theorem, full statement). The Fourier transform extends from to a unitary isomorphism .
Proof. By Proposition 5, is an isometry in the -norm. By Proposition 6, is dense in . So has a unique continuous extension to , by the standard density-extension argument for bounded operators on Banach spaces (using Cauchy-sequence completion). The extension is an isometry, hence injective; its inverse (similarly extended from ) gives surjectivity, and the inversion identity passes to the limit.
Proposition 8 (Convolution theorem). For , .
Proof. As in Exercise 3: write out the defining integral, apply Fubini-Tonelli (justified by absolute integrability of the double integrand, from ), substitute , and recognize the inner integral as .
Proposition 9 (Differentiation-multiplication duality on Schwartz). For and multi-index :
- ,
- .
Proof. As in Exercise 4: integration by parts in the integral defining (boundary terms zero by Schwartz decay) for the first identity, and differentiation under the integral sign for the second identity (justified by Schwartz decay and DCT for the difference quotients).
Proposition 10 (Poisson summation formula). For , .
Proof. As in Exercise 7: define the periodization , compute its Fourier coefficients via interchange of sum and integral, recognize as a smooth -periodic function whose Fourier series converges uniformly to , and evaluate at .
Proposition 11 (Heisenberg uncertainty principle). For with , , with equality iff is Gaussian.
Proof. As in Exercise 6: apply Cauchy-Schwarz to , integrate by parts to obtain , and convert via Plancherel and the differentiation rule (Proposition 9).
Connections Master
Fourier series and the Riemann-Lebesgue lemma
02.10.01. The direct prerequisite. The Fourier transform on is the continuous-frequency limit of Fourier series on the torus as the period : a -periodic function with Fourier coefficients at integer multiples of becomes a function on the line with Fourier-transform values at all real , with the spacing between successive coefficients shrinking to zero. The Riemann-Lebesgue lemma (vanishing of Fourier coefficients on ) carries over directly to the line via the same density-of-step-functions argument.spaces, Hölder, Minkowski, Riesz-Fischer completeness
02.07.06. The direct prerequisite for the -theory and the Hausdorff-Young inequality. Riesz-Fischer completeness of is the structural foundation for the Plancherel extension: the Fourier transform on is an isometry into , and Riesz-Fischer ensures the unique extension to all of remains an isometry. The Hausdorff-Young inequality for uses Hölder's inequality at the and endpoints, interpolated via Riesz-Thorin.Fubini-Tonelli and product measures
02.07.07. The direct prerequisite for the convolution theorem and the Plancherel identity. Fubini-Tonelli is used in essentially every Fourier-analytic computation: the convolution theorem (Proposition 8, Exercise 3); the Plancherel identity (Proposition 5, Key Theorem Step 2); the Fourier inversion formula on Schwartz (Proposition 4, Key Theorem Step 1); and the Poisson summation formula (Proposition 10, Exercise 7). The interchange of sum-and-integral or integral-and-integral that Fubini justifies is the workhorse of the Fourier-analytic computation.Schwartz space and tempered distributions [forward: 02.10.06]. The natural extension. Tempered distributions provide the right framework for the Fourier transform of objects more singular than functions: the Dirac delta has (constant function); the constant function has . The Fourier transform is a continuous linear self-map of , and the duality defines the transform on distributions in terms of its action on test functions.
Heat equation [forward: 02.13.03]. The structural application. The heat equation on becomes the ODE in the Fourier picture (Exercise 5, Theorem 8), solved by . The inverse Fourier transform gives the Gauss-Weierstrass heat-kernel representation .
Wave equation [forward: 02.13.04]. The structural application. The wave equation becomes , solved by . The inverse Fourier transform gives the Kirchhoff formula in dimension three and the d'Alembert formula in dimension one.
Schrödinger equation [forward: chapter 12 quantum mechanics, momentum representation]. The structural application. The free Schrödinger equation becomes in the Fourier picture, with the momentum representation giving the wavefunction as a function of momentum. The Plancherel identity is the conservation of total probability , and the Heisenberg uncertainty principle is the position-momentum complementarity .
Functional analysis [02.11]. The lateral framework. The Plancherel theorem is the prototypical -unitary, and the Fourier-transform diagonalization of the abelian translation group on is the prototype of the spectral theory for self-adjoint operators. The Schwartz space as a Fréchet space, and tempered distributions as its strong dual, fit into the locally-convex-topological-vector-space framework central to functional analysis. The Riesz-Thorin and Marcinkiewicz interpolation theorems behind the Hausdorff-Young inequality are core functional-analytic tools.
Signal processing [lateral]. The applied face. The Fourier transform is the foundational tool of signal processing: digital filters (multiplication by a frequency-domain mask), sampling theorems (Shannon-Nyquist, the discrete-time Fourier transform), spectrograms (windowed Fourier transforms, the short-time Fourier transform), wavelets and time-frequency analysis (Gabor 1946, Daubechies 1988). The fast Fourier transform algorithm (Cooley-Tukey 1965) computes the discrete Fourier transform of samples in operations, the algorithmic workhorse behind essentially all modern digital signal processing.
Historical & philosophical context Master
Joseph Fourier's 1822 Théorie analytique de la chaleur [Fourier 1822] introduced the Fourier integral representation alongside the Fourier series representation as parallel tools for solving the heat equation. The Fourier integral was used by Fourier to handle the heat equation on the real line (a metal bar of infinite length), in contrast to the Fourier-series representation for the finite bar with periodic boundary conditions. Fourier's argument was heuristic: he derived the integral representation as a continuous limit of the series representation, with the integer index replaced by a continuous real variable and the discrete sum replaced by a continuous integral, but did not provide rigorous convergence analysis. The rigorous foundations of the Fourier integral representation were developed over the next century by Cauchy, Dirichlet, Riemann, Lebesgue, and Plancherel.
Augustin-Louis Cauchy's 1816 Théorie de la propagation des ondes à la surface d'un fluide pesant d'une profondeur indéfinie gave the first explicit Fourier-integral solution of a partial differential equation (the linearized water-wave equation), with the explicit calculation of the Fourier integral representation of the initial-value problem. Siméon Denis Poisson's 1820 Mémoire sur la théorie des ondes extended Cauchy's analysis to the spherical wave equation. The Fourier integral was a working tool of mathematical physics by the mid-nineteenth century, with rigorous foundations supplied piecemeal as needed.
Michel Plancherel's 1910 Rendiconti del Circolo Matematico di Palermo paper [Plancherel 1910], titled Contribution à l'étude de la représentation d'une fonction arbitraire par des intégrales définies, established the -isometry property of the Fourier transform that bears his name. Plancherel's argument extended the Parseval identity for Fourier series (Bessel-Parseval, going back to Bessel 1828 and Hilbert 1906) to the Fourier-integral setting, identifying the Fourier transform as a unitary isomorphism of . The original proof was a direct truncation argument: approximate by its restriction to bounded intervals, compute the Fourier transform of the restriction, and pass to the limit using the -norm-preservation. The modern proof via Schwartz-space density (Schwartz 1950) is cleaner and more structural, but Plancherel's original argument is still pedagogically valuable for its direct connection to the Fourier-series Bessel-Parseval setting.
Norbert Wiener's 1933 The Fourier Integral and Certain of its Applications [Wiener 1933] codified the Fourier-integral theory in a single monograph, with applications to the Tauberian theorems (a class of theorems converting asymptotic statements about partial sums to asymptotic statements about averages, with the Fourier transform of as the structural ingredient), the prediction theory of stationary stochastic processes, and the foundations of cybernetics. Wiener's introduction of the Wiener algebra (the image of , with pointwise product structure) was the first algebraic-structural treatment of the Fourier transform.
Salomon Bochner's 1932 Vorlesungen über Fouriersche Integrale [Bochner 1932] developed the Fourier-integral theory for Banach-space-valued functions (Bochner integration), the foundation for the modern operator-valued Fourier-analytic machinery used in spectral theory and the theory of evolution equations. Bochner's 1933 theorem characterizing the Fourier transforms of positive measures (a function on is the Fourier transform of a positive measure iff is continuous, positive-definite, and ) is a central tool in probability theory and in the spectral theory of stationary processes.
Felix Hausdorff's 1923 Mathematische Zeitschrift paper [Hausdorff 1923] and W. H. Young's 1912 Proceedings of the Royal Society paper [Young 1912] established the Hausdorff-Young inequality for via interpolation (Marcel Riesz 1927 supplied the modern Riesz-Thorin interpolation framework). The sharp constants in the Hausdorff-Young inequality were determined by Beckner 1975 Annals of Mathematics 102, 159 and Brascamp-Lieb 1976; the extremizers are Gaussians, a recurring theme in sharp Fourier-analytic inequalities.
Laurent Schwartz's 1950-1951 Théorie des distributions [Schwartz 1950] introduced the test-function-and-distribution framework that became the standard language of modern Fourier analysis. The Schwartz space and the tempered distributions provide the natural setting where the Fourier transform is an isomorphism (of to itself, and of to itself), and where the differentiation-multiplication duality, the convolution theorem, and the Plancherel identity all hold without integrability concerns. Schwartz's work earned him the 1950 Fields Medal and made distribution theory the lingua franca of linear PDE theory.
Werner Heisenberg's 1927 Zeitschrift für Physik paper [Heisenberg 1927] introduced the position-momentum uncertainty principle in quantum mechanics, with a physical-intuition-based derivation. Earle Hesse Kennard's 1927 Zeitschrift für Physik 44, 326 gave the sharp constant and the mathematical formulation; H. P. Robertson's 1929 Physical Review 34, 163 generalized to non-commuting observables. The connection to Fourier analysis is direct: the position and momentum representations of a quantum state are related by the Fourier transform , and the Heisenberg uncertainty principle is the -norm statement on the products of second moments (Exercise 6, Theorem 10).
The Paley-Wiener theorem of 1934 [Schwartz 1950] (Raymond E. A. C. Paley and Norbert Wiener, Fourier Transforms in the Complex Domain, AMS Colloquium Publications 19) established the correspondence between -functions with compactly supported Fourier transform and entire functions of exponential type. This theorem is the analytic origin of the wavelet-and-band-limited-signal theory in signal processing, and was extended by Schwartz to tempered distributions (Paley-Wiener-Schwartz theorem) and by Hörmander to the theory of analytic wave-front sets in microlocal analysis (Hörmander 1990 §7).
The structural arc is a two-hundred-year story: Fourier 1807-1822 (the Fourier integral as a heuristic limit of Fourier series for the heat equation on the real line); Cauchy 1816 and Poisson 1820 (working applications to wave equations); Plancherel 1910 (the -isometry theorem); Wiener 1933 (the Wiener-algebra framework, Tauberian theorems); Bochner 1932 (Bochner integration, Bochner's positive-measure theorem); Young 1912 and Hausdorff 1923 (the Hausdorff-Young inequality, interpolation); Schwartz 1950 (Schwartz space, tempered distributions); Beckner 1975 (sharp constants in Hausdorff-Young); Hörmander 1990 (microlocal analysis, Fourier integral operators). The endpoint is the modern harmonic-analytic framework where the Fourier transform on is a special case of the Plancherel theorem on locally compact abelian groups (Pontryagin 1934, Cartan-Godement 1947), unified with the Fourier-series and discrete-Fourier-transform settings under the umbrella of Pontryagin duality, and extended to non-abelian groups via the representation-theoretic Plancherel formula (Harish-Chandra 1954, Mackey 1949). The Fourier transform on is the prototype of the spectral theory for self-adjoint operators and of the harmonic-analytic decomposition on homogeneous spaces, the framework after which the entire modern theory of pseudodifferential operators, Fourier integral operators, and microlocal analysis is modelled.
Bibliography Master
@book{Fourier1822,
author = {Fourier, Jean-Baptiste Joseph},
title = {Th\'eorie analytique de la chaleur},
publisher = {Firmin Didot, P\`ere et Fils},
address = {Paris},
year = {1822}
}
@article{Plancherel1910,
author = {Plancherel, Michel},
title = {Contribution \`a l'\'etude de la repr\'esentation d'une fonction arbitraire par des int\'egrales d\'efinies},
journal = {Rendiconti del Circolo Matematico di Palermo},
volume = {30},
year = {1910},
pages = {289--335}
}
@book{Wiener1933,
author = {Wiener, Norbert},
title = {The Fourier Integral and Certain of its Applications},
publisher = {Cambridge University Press},
year = {1933}
}
@book{Bochner1932,
author = {Bochner, Salomon},
title = {Vorlesungen \"uber Fouriersche Integrale},
publisher = {Akademische Verlagsgesellschaft},
address = {Leipzig},
year = {1932}
}
@article{Hausdorff1923,
author = {Hausdorff, Felix},
title = {Eine Ausdehnung des {P}arsevalschen {S}atzes \"uber {F}ourierreihen},
journal = {Mathematische Zeitschrift},
volume = {16},
year = {1923},
pages = {163--169}
}
@article{Young1912,
author = {Young, William Henry},
title = {On the multiplication of successions of {F}ourier constants},
journal = {Proceedings of the Royal Society of London A},
volume = {87},
year = {1912},
pages = {331--339}
}
@book{Schwartz1950,
author = {Schwartz, Laurent},
title = {Th\'eorie des distributions, Tomes {I-II}},
publisher = {Hermann},
address = {Paris},
year = {1950--1951}
}
@book{Hormander1990,
author = {H\"ormander, Lars},
title = {The Analysis of Linear Partial Differential Operators {I}},
series = {Grundlehren der mathematischen Wissenschaften 256},
edition = {2},
publisher = {Springer},
year = {1990}
}
@book{SteinShakarchi2003,
author = {Stein, Elias M. and Shakarchi, Rami},
title = {Fourier Analysis: An Introduction},
series = {Princeton Lectures in Analysis, Volume {I}},
publisher = {Princeton University Press},
year = {2003}
}
@book{SteinWeiss1971,
author = {Stein, Elias M. and Weiss, Guido},
title = {Introduction to Fourier Analysis on Euclidean Spaces},
publisher = {Princeton University Press},
year = {1971}
}
@book{PaleyWiener1934,
author = {Paley, Raymond E. A. C. and Wiener, Norbert},
title = {Fourier Transforms in the Complex Domain},
series = {American Mathematical Society Colloquium Publications, Volume 19},
publisher = {American Mathematical Society},
year = {1934}
}
@article{Heisenberg1927,
author = {Heisenberg, Werner},
title = {\"Uber den anschaulichen {I}nhalt der quantentheoretischen {K}inematik und {M}echanik},
journal = {Zeitschrift f\"ur Physik},
volume = {43},
year = {1927},
pages = {172--198}
}
@article{Kennard1927,
author = {Kennard, Earle Hesse},
title = {Zur {Q}uantenmechanik einfacher {B}ewegungstypen},
journal = {Zeitschrift f\"ur Physik},
volume = {44},
year = {1927},
pages = {326--352}
}
@article{Beckner1975,
author = {Beckner, William},
title = {Inequalities in {F}ourier analysis},
journal = {Annals of Mathematics},
volume = {102},
year = {1975},
pages = {159--182}
}
@article{Riesz1927,
author = {Riesz, Marcel},
title = {Sur les maxima des formes bilin\'eaires et sur les fonctionnelles lin\'eaires},
journal = {Acta Mathematica},
volume = {49},
year = {1927},
pages = {465--497}
}
@book{Grafakos2014,
author = {Grafakos, Loukas},
title = {Classical Fourier Analysis},
edition = {3},
series = {Graduate Texts in Mathematics 249},
publisher = {Springer},
year = {2014}
}
@book{ReedSimon1975,
author = {Reed, Michael and Simon, Barry},
title = {Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness},
publisher = {Academic Press},
year = {1975}
}
@book{Folland1999,
author = {Folland, Gerald B.},
title = {Real Analysis: Modern Techniques and Their Applications},
edition = {2},
publisher = {Wiley},
year = {1999}
}