Fourier Analysis

Fourier analysis is the study of how general functions can be represented and approximated by superpositions of basic oscillatory functions — the trigonometric functions $\sin (n\omega t)$, $\cos (n\omega t)$, or equivalently complex exponentials $e^{in\omega t}$. For periodic functions this yields the Fourier series; for functions on the whole line it yields the Fourier transform. The subject matters because differentiation and convolution become multiplication in the frequency domain, turning hard differential and integral equations into algebra. A surprising fact: the partial sums of a Fourier series of a discontinuous function overshoot the jump by a fixed ~9% no matter how many terms you add — the Gibbs phenomenon — showing that convergence of Fourier series is subtler than it first appears.

The Core Insight

The sines and cosines form an orthogonal basis for a space of functions. Just as a vector in ${\mathbb{R}}^3$ is reconstructed from its components along orthogonal axes, a function is reconstructed from its "components" along each frequency. Each Fourier coefficient is an inner product — a projection of the function onto a single pure tone. The entire theory is linear algebra in an infinite-dimensional inner-product space.

Formal Statement

Fourier Series — Trigonometric Form

Let $f$ be a real function of period $2L$ that is (absolutely) integrable over one period. Its Fourier series is

with coefficients

Here:

• $f$ — the function being analyzed;
• $L$ — half-period (period is $2L$);
• $a_n,b_n$ — Fourier coefficients (amplitudes of each harmonic);
• $n$ — harmonic number (integer $\ge 0$);
• the symbol $\sim$ means "has the Fourier series," reserved because equality requires convergence hypotheses.

Fourier Series — Complex Form

Using Euler's formula $e^{i\theta }=\cos \theta +i\sin \theta$, the series collapses to

The exponentials $\{e^{in\pi x/L}{\}}_{n\in \mathbb{Z}}$ satisfy the orthogonality relation ${\int }_{-L}^L{e}^{in\pi x/L}\overline{e^{im\pi x/L}}dx=2L{\delta }_{nm}$.

Fourier Transform

For a function $f:\mathbb{R}\to \mathbb{C}$ that is absolutely integrable ($f\in L^1(\mathbb{R})$), the Fourier transform and its inverse are

Here $\xi$ is frequency. (Conventions vary: some authors use angular frequency $\omega =2\pi \xi$ and place factors of $1/\sqrt{2\pi }$ or $1/(2\pi )$; the $e^{-2\pi i\xi x}$ convention keeps the transform pair perfectly symmetric.)

Dirichlet's Pointwise Convergence Theorem

If $f$ is periodic, piecewise continuous, and has a left and right derivative at a point $x_0$ (e.g. $f$ is piecewise smooth), then the Fourier series converges at $x_0$ to the average of the one-sided limits:

At points of continuity the right side equals $f(x_0)$.

Plancherel / Parseval

The Fourier transform preserves the $L^2$ norm (energy):

and for Fourier series, $\frac{1}{2L}{\int }_{-L}^L|f{|}^{2}dx=\sum _{n=-\infty }^{\infty }|c_n{|}^2$.

Why It Holds / Derivation

Deriving the Coefficient Formulas via Orthogonality

1. Assume a representation. Suppose $f(x)=\frac{a_0}{2}+{\sum }_{n\ge 1}[a_n\cos \frac{n\pi x}{L}+b_n\sin \frac{n\pi x}{L}]$ with convergence good enough to integrate term by term.

1. Establish orthogonality. For integers $m,n\ge 1$:

1. Mixed and constant terms. ${\int }_{-L}^L\cos \frac{n\pi x}{L}\sin \frac{m\pi x}{L}dx=0$ for all $n,m$ (odd integrand symmetry), and ${\int }_{-L}^{L}1\cdot \cos \frac{n\pi x}{L}dx=0$ for $n\ge 1$.

1. Project. To extract $a_m$ ($m\ge 1$), multiply both sides by $\cos \frac{m\pi x}{L}$ and integrate over $[-L,L]$. By steps 2–3 every term vanishes except $a_m\int {\cos }^2=a_{m}L$, giving $a_m=\frac{1}{L}{\int }_{-L}^{L}f\cos \frac{m\pi x}{L}dx$, matching [2].

1. The constant. Integrating [1] directly gives ${\int }_{-L}^{L}fdx=a_{0}L$, i.e. $a_0=\frac{1}{L}{\int }_{-L}^{L}fdx$ — which is exactly [2] with $n=0$, justifying the $a_0/2$ convention.

1. Best approximation property. Among all trigonometric polynomials of degree $\le N$, these coefficients minimize the mean-square error ${\int }_{-L}^L|f-P_N{|}^2$. This is the projection theorem in the Hilbert space $L^2[-L,L]$: the Fourier partial sum is the orthogonal projection of $f$ onto the span of the first $2N+1$ harmonics. $■$

Joseph Fourier | 1768–1830

Jean-Baptiste Joseph Fourier was a French mathematician and physicist, orphaned young, who trained at the École Normale, accompanied Napoleon to Egypt, and later served as prefect of Isère. While studying heat conduction he made the audacious claim (in his 1807 memoir, expanded in Théorie analytique de la chaleur, 1822) that any function — even one with corners or jumps — could be written as a trigonometric series. The leading mathematicians of the day, including Lagrange and Laplace, were skeptical, and rigorous justification took another century. Fourier is also credited with an early recognition of the greenhouse effect.

Building Intuition

Think of a function as a musical chord and Fourier analysis as the ear (or a prism). The chord is a single complicated pressure wave; your ear decomposes it into pure tones with definite pitches and loudnesses. The Fourier coefficient $c_n$ is "how much of pitch $n$" is present and "with what phase." Two complementary viewpoints:

• Geometric: the harmonics are perpendicular coordinate axes in an infinite-dimensional space. $c_n$ is the shadow of $f$ on the $n$-th axis. Parseval [6] is the Pythagorean theorem: total energy = sum of squared components.
• Dynamical: $e^{in\omega t}$ are the eigenfunctions of $\frac{d}{dt}$. Decomposing $f$ into them diagonalizes differentiation, which is why Fourier methods crush linear differential equations: each frequency evolves independently.

Square wave (gold) and its Fourier partial sums — note the Gibbs overshoot near the jumps

Worked Examples

Fourier Series of a Square Wave

1. Since $f$ is odd, all $a_n=0$ (cosines are even). Only $b_n$ survive.
2. Compute $b_n=\frac{1}{\pi }{\int }_{-\pi }^{\pi }f(x)\sin (nx)dx=\frac{2}{\pi }{\int }_0^{\pi }\sin (nx)dx$ (even integrand).
3. ${\int }_0^{\pi }\sin (nx)dx=\frac{1-\cos (n\pi )}{n}=\frac{1-(-1{)}^n}{n}$.
4. So $b_n=\frac{2}{\pi }\cdot \frac{1-(-1{)}^n}{n}$: this is $0$ for even $n$ and $\frac{4}{\pi n}$ for odd $n$.

Fourier Transform of a Gaussian

1. $\hat{f}(\xi )={\int }_{-\infty }^{\infty }{e}^{-\pi x^2}{e}^{-2\pi i\xi x}dx$.
2. Complete the square in the exponent: $-\pi x^2-2\pi i\xi x=-\pi (x+i\xi {)}^2-\pi {\xi }^2$.
3. Factor out $e^{-\pi {\xi }^2}$: $\hat{f}(\xi )=e^{-\pi {\xi }^2}{\int }_{-\infty }^{\infty }{e}^{-\pi (x+i\xi {)}^2}dx$.
4. The remaining integral equals ${\int }_{-\infty }^{\infty }{e}^{-\pi u^2}du=1$ (contour shift / Gaussian integral).

Common Misconceptions

Define $f$ on $[-\pi ,\pi ]$ by $f(x)={\sum }_{k=1}^{\infty }\frac{\sin (2^{k}x)}{k^2}$-type lacunary constructions, or more simply consider the Weierstrass-style nowhere-differentiable function. Its Fourier coefficients decay like $1/k^2$ along sparse frequencies, the series converges uniformly (so $f$ is continuous), yet $f$ is nowhere differentiable. Conclusion: a uniformly convergent, perfectly continuous Fourier series can represent a function with no derivative anywhere — slow decay of coefficients ⟺ rough function.

Connections

Fourier analysis sits at a crossroads:

• It is infinite-dimensional Linear Algebra: coefficients are inner products onto an orthonormal basis, and Parseval is the Pythagorean theorem in Hilbert Space.
• It is the natural tool for Partial Differential Equations — separation of variables in the heat, wave, and Laplace equations produces exactly these trigonometric eigenfunctions.
• The Fourier transform turns Convolution into pointwise multiplication, the foundation of Linear Time-Invariant Systems.
• It generalizes to the Laplace Transform (complex frequencies), the Discrete Fourier Transform / Fast Fourier Transform (finite data), and abstract Harmonic Analysis on groups.
• In Quantum Mechanics the position and momentum representations of a state are a Fourier transform pair, making [9]'s Gaussian trade-off literally Heisenberg's uncertainty.

Real-World Applications

1. JPEG / MP3 / video codecs — the Discrete Cosine Transform (a Fourier relative) concentrates image/audio energy in few coefficients; discarding small ones compresses files with little perceptual loss.
2. MRI (Magnetic Resonance Imaging) — the scanner directly measures Fourier coefficients ("k-space"); an inverse FFT reconstructs the image.
3. Audio engineering — spectrograms, equalizers, pitch detection, and noise removal all operate by transforming to the frequency domain, editing amplitudes, and transforming back.
4. Telecommunications (OFDM) — Wi-Fi, 4G/5G, and DSL split data across many orthogonal subcarriers using the FFT/IFFT, robust against multipath interference.
5. Crystallography — X-ray diffraction patterns are essentially the Fourier transform of electron density; inverting them reveals atomic structure (how DNA's helix was found).
6. Numerical PDE solvers (spectral methods) — fluid dynamics and weather models represent fields in Fourier modes, achieving exponential accuracy for smooth solutions.
7. Heat & vibration analysis — engineers decompose temperature or structural responses into modes to predict resonance and thermal evolution, exactly Fourier's original heat problem.

Historical Development

• 1748 — Euler relates trigonometric series to the vibrating string problem; debate with d'Alembert and Daniel Bernoulli over which functions a string's shape can take.
• 1807 — Fourier submits his memoir on heat to the French Academy, claiming arbitrary functions expand in trigonometric series; the committee (Lagrange, Laplace, Legendre) withholds full approval.
• 1822 — Fourier publishes Théorie analytique de la chaleur, establishing the method despite incomplete rigor.
• 1829 — Dirichlet gives the first rigorous convergence theorem for piecewise-monotone functions ([5]).
• 1854 — Riemann, in his habilitation, develops the Riemann integral partly to clarify which functions have Fourier series, and constructs the Riemann–Lebesgue ideas.
• 1873 — du Bois-Reymond exhibits a continuous function whose Fourier series diverges at a point, ending hopes for universal pointwise convergence.
• 1899 — Gibbs (after Wilbraham, 1848) explains the persistent overshoot at jumps — the Gibbs phenomenon.
• 1902–1910 — Lebesgue's integration theory and the Riesz–Fischer theorem put $L^2$ convergence on solid ground; Plancherel proves [6] for the transform.
• 1965 / 1966 — Cooley & Tukey publish the Fast Fourier Transform (FFT), reducing the DFT cost from $O(N^2)$ to $O(N\log N)$; Carleson proves a.e. convergence of $L^2$ Fourier series.

Subtleties & Limits

Several boundaries of the classical theory remain delicate or active:

• Multidimensional convergence: in ${\mathbb{R}}^d$ the order of summation matters; the "ball multiplier" problem (Fefferman, 1971) showed that spherical partial sums need not converge in $L^p$ for $p\ne 2$ when $d\ge 2$ — a counterintuitive failure absent in one dimension.
• Pointwise convergence at the edge of integrability: Kolmogorov (1923) built an $L^1$ function whose Fourier series diverges everywhere. The exact boundary between Carleson's a.e.-convergence ($L^2$) and total divergence ($L^1$) is governed by subtle conditions (e.g. $L\log L$ classes).
• Restriction & Kakeya: modern harmonic analysis ties Fourier restriction estimates to the Kakeya conjecture, with open problems linking geometry, number theory, and PDE that drive contemporary research (work of Bourgain, Tao, and others).
• Uncertainty limits: a function and its transform cannot both be sharply localized; the precise extremal trade-offs (Beurling–Malliavin, Hardy's theorem) remain a refined area.

See Also