Fourier Transform
The Fourier Transform decomposes a function of time (or space) into the frequencies that compose it. Result: any sufficiently well-behaved function can be written as a continuous superposition of complex exponentials , with weights . Applies across signal processing, PDEs, quantum mechanics, optics, and probability. Introduced by Joseph Fourier (1807–1822) for heat conduction; generalized through the 19th–20th centuries.
Complex exponentials are the eigenfunctions of differentiation and translation. Because , expressing any function as a sum of these exponentials diagonalizes calculus operators. The Fourier Transform is simply the change of basis that performs this diagonalization, replacing the operator with multiplication by .
Formal Statement
For an absolutely integrable function , the Fourier Transform is
Derivation hint: project onto the frequency mode via the (continuous) inner product ; the negative sign comes from the complex conjugate in the inner product. The Inverse Fourier Transform reconstructs :
Derivation hint: substitute [1] into the right side and use , the Fourier representation of the Dirac delta.
Symbols:
- — time (or space) variable, units e.g. seconds.
- — angular frequency, units radians/second; sometimes where is ordinary frequency in Hz.
- — imaginary unit, .
- — complex amplitude (magnitude = strength, phase = timing) of frequency .
- The factor is a normalization convention; other conventions split it as on each transform.
The placement of and the sign in the exponent vary by textbook and field. Three common conventions: with on the inverse (used here); the symmetric version; and the "ordinary frequency" form with no prefactor at all. Always check the convention before quoting a formula.
If then exists, is bounded (), is continuous, and vanishes at infinity (Riemann–Lebesgue lemma). If in addition and are both in , the inversion formula [2] holds at every point of continuity of . On the transform extends to a unitary isomorphism (Plancherel's theorem).
The Fourier Transform preserves energy up to a constant:
Derivation hint: write , insert the inverse transform for , swap order of integration, and apply the delta-function identity; set .
Why It Holds / Derivation
We show that applying then the inverse formula recovers .
Step 1. Start from the candidate reconstruction and substitute definition [1]:
Derivation hint: just plug [1] into [2], renaming the dummy integration variable inside.
Step 2. Interchange the order of integration (justified for via Fubini after regularization):
Derivation hint: collect the -dependent factors and pull out of the inner integral.
Step 3. Recognize the inner integral as the Dirac delta:
Derivation hint: this is the Fourier representation of ; rigorously interpret it as a limit of Gaussians as .
Step 4. The sifting property of collapses the integral:
Derivation hint: is zero except at , where it picks out exactly. Thus inversion holds.
∎Jean-Baptiste Joseph Fourier accompanied Napoleon to Egypt, governed the Isère department, and in his 1822 Théorie analytique de la chaleur argued — against fierce skepticism from Lagrange and Laplace — that an arbitrary function could be represented as a sum of sines and cosines. His claim that even discontinuous functions had such expansions was not fully rigorous but proved revolutionary, forcing mathematicians to sharpen the very definitions of "function," "integral," and "convergence" for the next century.
Building Intuition
Think of a musical chord recorded as a single wiggling pressure curve . Your ear hears distinct notes; the Fourier Transform is the mathematical "ear" that reads off the amplitude and phase of each pure tone . The integral [1] works like a resonance detector: multiplying by and integrating gives a large result only when actually contains oscillation at frequency — at other frequencies the product oscillates and averages to near zero. The magnitude tells you "how loud" each frequency is; the phase tells you "when" it peaks.
Worked Examples
Given: for and otherwise, with s.
Step 1. Apply definition [1]:
Derivation hint: the integrand is a single exponential; integrate directly over the finite support.
Step 2. Evaluate the bracket:
Derivation hint: use and cancel the .
Step 3. Substitute :
Answer:
The DC value equals the pulse's total area, as expected.
Given: for , for , with decay rate .
Step 1. Apply [1] over the support :
Derivation hint: combine exponents into a single complex rate .
Step 2. Integrate (converges since kills the upper limit):
Derivation hint: at the exponential vanishes; at it equals 1.
Step 3. Power spectrum (Lorentzian) at :
Answer:
The half-width of the spectral peak equals the decay rate — fast decay gives a broad line.
Common Misconceptions
- "The transform always exists." False for functions not in or in the classical sense; constants, , and require the distributional (tempered) Fourier Transform.
- "Magnitude is all that matters." The phase carries crucial information — swapping the phases of two images (keeping magnitudes) makes each picture look like the other. Phase encodes where features sit.
- " is its own inverse." Not quite: (a reflection and scaling), so . Eigenvalues of are times constants.
- Forgetting the when mixing conventions corrupts Parseval-type computations.
The constant function is not in , so integral [1] does not converge in the ordinary sense. Yet within tempered distributions one finds : a constant in time is "all DC," a single spike at . This shows the naïve integral definition is insufficient and motivates the distributional extension.
Connections
The Fourier Transform sits at the center of a web of related tools. For periodic functions it specializes to the Fourier Series, where the continuous integral becomes a discrete sum over harmonics. For sampled, finite data it becomes the Discrete Fourier Transform, computed efficiently by the Fast Fourier Transform. Generalizing the exponent to a full complex frequency yields the Laplace Transform, better suited to initial-value problems with growth. The transform's deep structure — a unitary change of basis on — connects it to Hilbert Spaces and the Spectral Theorem. The convolution theorem links it to Convolution and to Probability Theory via characteristic functions.
Real-World Applications
Historical Development
Subtleties & Limits
Pointwise convergence of Fourier series for general continuous functions resisted proof until Carleson's theorem (1966) showed convergence almost everywhere for functions — a notoriously deep result, with the analogous question for answered negatively by Kolmogorov's 1923 everywhere-divergent example. The uncertainty principle sets a hard limit: a function and its transform cannot both be sharply localized (), with equality only for Gaussians. In applications, the phase retrieval problem — recovering a signal from alone, as in crystallography — is generally ill-posed and remains an active research area. Time-frequency localization is addressed by extensions such as the Wavelet Transform and the short-time Fourier transform.
See Also
Fourier Series · Discrete Fourier Transform · Fast Fourier Transform · Laplace Transform · Convolution · Dirac Delta Function · Hilbert Spaces · Spectral Theorem · Wavelet Transform · Uncertainty Principle