Fourier Series — Advanced Treatment — Mathematics

⚡ Key Takeaways

Fourier series represent a periodic function $f$ as an infinite sum of sines and cosines (equivalently, complex exponentials). Key result: under mild conditions, $f(x) = \sum_{n} c_n e^{inx}$ where the coefficients $c_n$ are integrals of $f$ against $e^{-inx}$ , and convergence holds in the $L^2$ sense (Parseval) and pointwise where $f$ is nice. Applies to signal processing, PDEs (heat/wave), harmonic analysis, number theory. Originated with Joseph Fourier (1807–1822) studying heat conduction; rigorous foundations by Dirichlet, Riemann, Lebesgue, Fejér, Carleson.

💡 The Core Insight

The complex exponentials $\{e_n(x) = e^{inx}\}_{n\in\mathbb{Z}}$ form a complete orthonormal basis of the Hilbert space $L^2[-\pi,\pi]$ (normalized by $\tfrac{1}{2\pi}\int$ ). Expanding $f$ in this basis is exactly projecting a vector onto orthonormal axes — except the space is infinite-dimensional. Everything else (decay of coefficients $\leftrightarrow$ smoothness, Parseval $\leftrightarrow$ Pythagoras, convolution $\leftrightarrow$ multiplication) follows from this single geometric fact.

DefinitionFourier Coefficients and Series

Let $f:\mathbb{R}\to\mathbb{C}$ be $2\pi$ -periodic and integrable on $[-\pi,\pi]$ . Its complex Fourier coefficients are

1

\quad \hat{f}(n) = c_n = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(x)\, e^{-inx}\, dx, \qquad n\in\mathbb{Z}.

Derivation hint: project $f$ onto $e_n$ using the inner product $\langle f,g\rangle = \frac{1}{2\pi}\int_{-\pi}^{\pi} f\bar g\,dx$ ; orthonormality $\langle e_m,e_n\rangle=\delta_{mn}$ isolates the $n$ -th coefficient. The Fourier series of $f$ is the formal sum

2

\quad f(x) \sim \sum_{n=-\infty}^{\infty} c_n\, e^{inx}.

Derivation hint: the symbol $\sim$ ("is associated with") avoids asserting convergence until proven; it becomes $=$ under conditions specified below. The real form uses $a_n,b_n$ :

3

\quad f(x) \sim \frac{a_0}{2} + \sum_{n=1}^{\infty}\left( a_n\cos nx + b_n\sin nx\right),

4

\quad a_n = \frac{1}{\pi}\int_{-\pi}^{\pi} f(x)\cos nx\, dx,\qquad b_n = \frac{1}{\pi}\int_{-\pi}^{\pi} f(x)\sin nx\, dx.

Derivation hint: substitute $e^{\pm inx}=\cos nx \pm i\sin nx$ into [2]; collect terms to get $a_n = c_n + c_{-n}$ , $b_n = i(c_n - c_{-n})$ .

Symbols: $c_n,\hat f(n)$ = complex coefficient; $a_n,b_n$ = real cosine/sine coefficients; $n$ = harmonic index (frequency); $e^{inx}$ = the $n$ -th harmonic of angular frequency $n$ .

DefinitionPartial Sums and Dirichlet Kernel

The $N$ -th partial sum and its integral representation are

5

\quad S_N f(x) = \sum_{n=-N}^{N} c_n e^{inx} = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(x-t)\, D_N(t)\, dt,

where the Dirichlet kernel is

6

\quad D_N(t) = \sum_{n=-N}^{N} e^{int} = \frac{\sin\!\big((N+\tfrac12)t\big)}{\sin(t/2)}.

Derivation hint: insert [1] into the sum [5], swap sum and integral, recognize $\sum e^{in(x-t)} = D_N(x-t)$ ; the closed form is a geometric series $\sum_{-N}^{N} r^n$ with $r=e^{it}$ .

TheoremParseval / Plancherel Identity

For $f\in L^2[-\pi,\pi]$ ,

7

\quad \frac{1}{2\pi}\int_{-\pi}^{\pi}|f(x)|^2\,dx = \sum_{n=-\infty}^{\infty}|c_n|^2.

Derivation hint: this is the Pythagorean theorem in $L^2$ ; completeness of $\{e_n\}$ upgrades Bessel's inequality $\sum|c_n|^2 \le \|f\|^2$ to equality. In particular the map $f\mapsto(c_n)$ is an isometry $L^2[-\pi,\pi]\to \ell^2(\mathbb{Z})$ , and $S_N f \to f$ in $L^2$ -norm for every square-integrable $f$ .

TheoremDirichlet Pointwise Convergence

If $f$ is $2\pi$ -periodic, piecewise continuous, and has left/right derivatives at $x_0$ , then

8

\quad \lim_{N\to\infty} S_N f(x_0) = \frac{f(x_0^+) + f(x_0^-)}{2}.

Derivation hint: write $S_N f(x_0) - \frac{f(x_0^+)+f(x_0^-)}{2}$ as an integral against $D_N$ ; split into $[-\delta,\delta]$ and the rest; apply the Riemann–Lebesgue lemma after dividing by $\sin(t/2)$ (the local-integrability "Dini condition" makes the quotient integrable). At points of continuity this gives $S_N f(x_0)\to f(x_0)$ .

ProofOrthogonality and the Coefficient Formula

Step 1 — Inner product and orthonormality. Define $\langle f,g\rangle = \frac{1}{2\pi}\int_{-\pi}^{\pi} f\bar g\,dx$ . Compute for $m\ne n$ :

\langle e_m, e_n\rangle = \frac{1}{2\pi}\int_{-\pi}^{\pi} e^{i(m-n)x}dx = \frac{1}{2\pi}\cdot\frac{e^{i(m-n)x}}{i(m-n)}\Big|_{-\pi}^{\pi} = 0,

since $e^{i(m-n)\pi}=e^{-i(m-n)\pi}$ . For $m=n$ the integrand is $1$ , giving $\langle e_n,e_n\rangle=1$ . Thus $\langle e_m,e_n\rangle = \delta_{mn}$ .

Step 2 — Extract coefficients. Assuming $f=\sum_k c_k e_k$ converges nicely, take inner product with $e_n$ :

\langle f, e_n\rangle = \sum_k c_k\langle e_k, e_n\rangle = c_n.

Expanding $\langle f,e_n\rangle = \frac{1}{2\pi}\int f e^{-inx}dx$ recovers [1].

Step 3 — Bessel's inequality. For any $N$ , the projection $S_N f$ is the closest point in $\mathrm{span}\{e_{-N},\dots,e_N\}$ to $f$ . Since $f - S_N f \perp e_n$ for $|n|\le N$ :

\|f\|^2 = \|S_N f\|^2 + \|f - S_N f\|^2 \ge \|S_N f\|^2 = \sum_{|n|\le N}|c_n|^2.

Letting $N\to\infty$ : $\sum|c_n|^2 \le \|f\|^2 < \infty$ . Hence $c_n\to 0$ (Riemann–Lebesgue).

Step 4 — Completeness $\Rightarrow$ Parseval. The key analytic input is that trigonometric polynomials are dense in $L^2$ (proved via Fejér's theorem, below). Density forces $\|f - S_N f\|\to 0$ , so Bessel becomes equality [7]. $\blacksquare$

∎

ProofFejér's Theorem — Cesàro Sums Always Work

The Dirichlet kernel is not positive and not an approximate identity, which is why $S_N f$ can misbehave. The fix: average.

Step 1 — Cesàro means. Define $\sigma_N f = \frac{1}{N+1}\sum_{k=0}^{N} S_k f = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(x-t)\,K_N(t)\,dt$ , where the Fejér kernel is

9

\quad K_N(t) = \frac{1}{N+1}\sum_{k=0}^{N} D_k(t) = \frac{1}{N+1}\left(\frac{\sin((N+1)t/2)}{\sin(t/2)}\right)^2 \ge 0.

Derivation hint: sum the Dirichlet closed forms using the telescoping identity $\sum_k \sin((k+\frac12)t) = \frac{\sin^2((N+1)t/2)}{\sin(t/2)}$ ; positivity is the crucial gain over $D_N$ .

Step 2 — Approximate identity properties. $K_N\ge 0$ , $\frac{1}{2\pi}\int K_N = 1$ , and $K_N$ concentrates at $0$ . For continuous $f$ , $\sigma_N f \to f$ uniformly.

Step 3 — Consequence. Trigonometric polynomials (the $\sigma_N f$ ) approximate every continuous function uniformly, hence are dense in $L^2$ , completing Step 4 of the previous proof. $\blacksquare$

∎

JF

Joseph Fourier

1768–1830

A French mathematician and physicist who accompanied Napoleon to Egypt and later served as prefect of Isère. In his 1807 memoir and 1822 treatise Théorie analytique de la chaleur, Fourier made the audacious claim that any function — even discontinuous ones with corners — could be written as a sum of sines and cosines, in order to solve the heat equation. His contemporaries (Lagrange, Laplace) objected strenuously; the claim was too broad and his arguments non-rigorous. The 19th century vindicated his physical instinct while sharpening exactly which functions and what kind of convergence. Fourier also discovered the greenhouse effect.

🧠 Intuition

Think of a periodic signal as a musical chord. The Fourier coefficients are the recipe: how much of each pure tone (pitch $n$ ) is present, and with what phase. Three guiding pictures: 1. Geometry: $L^2$ is an infinite-dimensional space with perpendicular axes $e_n$ . Computing $c_n$ is dropping a perpendicular onto axis $n$ ; Parseval is "length² = sum of squared components." 2. Smoothness $\leftrightarrow$ decay: A smooth function is built mostly from low frequencies, so $c_n$ decays fast. Each derivative multiplies $c_n$ by $in$ , so $f\in C^k \Rightarrow c_n = o(n^{-k})$ . Conversely, jumps force slow $\sim 1/n$ decay. 3. Why averaging (Fejér) helps: $S_N$ can overshoot near jumps (Gibbs) because $D_N$ has large negative lobes that "ring." The Fejér kernel $K_N$ is a positive bump — a blunt, honest averaging instrument — so it never overshoots and always converges for continuous data.

Figure

Dirichlet kernel

D_5

vs. Fejér kernel

K_5

: the negative lobes of

D_N

cause Gibbs ringing;

K_N\ge 0

does not.

ExampleSquare Wave — Coefficients, Sum, and Gibbs

Given: the odd $2\pi$ -periodic square wave $f(x) = \mathrm{sgn}(\sin x)$ , i.e. $f(x)=+1$ on $(0,\pi)$ , $-1$ on $(-\pi,0)$ .

Step 1 — Symmetry. $f$ is odd $\Rightarrow a_n = 0$ for all $n$ , and we need only $b_n$ .

Step 2 — Compute $b_n$ .

b_n = \frac{1}{\pi}\int_{-\pi}^{\pi} f\sin nx\,dx = \frac{2}{\pi}\int_{0}^{\pi}\sin nx\,dx = \frac{2}{\pi}\cdot\frac{1-\cos n\pi}{n} = \frac{2}{\pi}\cdot\frac{1-(-1)^n}{n}.

So $b_n = 0$ for even $n$ , and $b_n = \dfrac{4}{\pi n}$ for odd $n$ .

Step 3 — Series.

\boxed{\,f(x) = \frac{4}{\pi}\sum_{k=0}^{\infty}\frac{\sin\big((2k+1)x\big)}{2k+1} = \frac{4}{\pi}\left(\sin x + \tfrac{1}{3}\sin 3x + \tfrac{1}{5}\sin 5x + \cdots\right)\,}

Step 4 — Check at $x=\pi/2$ : the series gives $\frac{4}{\pi}(1 - \tfrac13 + \tfrac15 - \cdots) = \frac{4}{\pi}\cdot\frac{\pi}{4} = 1 = f(\pi/2).$ ✓ (Leibniz series for $\pi/4$ .)

Step 5 — Parseval check: $\frac{1}{2\pi}\int|f|^2 = 1$ and $\sum|c_n|^2 = \tfrac12\sum b_n^2 = \tfrac12\cdot\frac{16}{\pi^2}\sum_{\text{odd}}\frac1{n^2} = \frac{8}{\pi^2}\cdot\frac{\pi^2}{8} = 1.$ ✓

Gibbs: near the jump, $S_N$ overshoots $f$ by $\approx 8.95\%$ of the jump height (a fixed $\approx 0.0895\times 2$ ) regardless of $N$ .

ExampleParabola — Solving for

\zeta(2)

Given: $f(x) = x^2$ on $[-\pi,\pi]$ , extended $2\pi$ -periodically (even function).

Step 1 — $a_0$ : $a_0 = \frac{1}{\pi}\int_{-\pi}^{\pi}x^2\,dx = \frac{1}{\pi}\cdot\frac{2\pi^3}{3} = \frac{2\pi^2}{3}.$

Step 2 — $a_n$ ( $n\ge1$ ): integrate by parts twice,

a_n = \frac{2}{\pi}\int_0^{\pi}x^2\cos nx\,dx = \frac{2}{\pi}\cdot\frac{2\pi(-1)^n}{n^2} = \frac{4(-1)^n}{n^2}.

( $b_n = 0$ by evenness.)

Step 3 — Series:

\boxed{\,x^2 = \frac{\pi^2}{3} + 4\sum_{n=1}^{\infty}\frac{(-1)^n}{n^2}\cos nx\,}

Step 4 — Evaluate at $x=\pi$ (a continuity point of the periodic extension, value $\pi^2$ ):

\pi^2 = \frac{\pi^2}{3} + 4\sum_{n=1}^{\infty}\frac{(-1)^n(-1)^n}{n^2} = \frac{\pi^2}{3} + 4\sum_{n=1}^{\infty}\frac{1}{n^2}.

Solving: $\sum_{n=1}^\infty \frac{1}{n^2} = \dfrac{\pi^2}{6}$ — the Basel problem, units dimensionless. ✓

Step 5 — Evaluate at $x=0$ : $0 = \frac{\pi^2}{3} + 4\sum\frac{(-1)^n}{n^2}$ gives $\sum\frac{(-1)^{n-1}}{n^2} = \frac{\pi^2}{12}$ .

⚠️ Common mistake

"Fourier series of a continuous function converges to it everywhere." False. Du Bois-Reymond (1873) constructed a continuous periodic function whose Fourier series diverges at a point. Continuity alone is not enough for pointwise convergence of $S_N$ . What is guaranteed: (a) Cesàro sums $\sigma_N f$ converge uniformly (Fejér); (b) $S_N f \to f$ in $L^2$ ; (c) $S_N f\to f$ almost everywhere (Carleson). Pointwise everywhere needs extra regularity (Dini/Dirichlet conditions or bounded variation).

⚠️ Common mistake

"You can differentiate a Fourier series term by term." Not always. Term-by-term differentiation multiplies $c_n$ by $in$ , which may destroy convergence. The square wave's series converges, but differentiating gives $\frac{4}{\pi}\sum\cos((2k+1)x)$ which diverges (its "sum" is a Dirac comb, a distribution). Term-by-term integration is much safer — it divides by $n$ and improves convergence.

CounterexampleA continuous function whose series diverges at 0

One classical construction (lacunary, Fejér–Lebesgue style): build

g(x) = \sum_{k=1}^{\infty} \frac{1}{k^2}\, T_{n_k}(x), \qquad T_n(x) = \sum_{j=1}^{n}\frac{\sin jx}{j}\cdot(\text{suitable shift}),

with rapidly increasing $n_k$ . Each block $T_{n_k}$ is a trigonometric polynomial whose partial sums grow like $\log n_k$ at $x=0$ . Choosing $n_k$ so that $\frac{\log n_k}{k^2}\to\infty$ along a subsequence makes $S_N g(0)$ unbounded, while the $\frac{1}{k^2}$ weights keep $g$ uniformly convergent, hence continuous. Moral: uniform convergence of the function's defining series does not control the Dirichlet partial sums.

connection

Fourier series is the periodic/discrete-spectrum member of a family:

<a class="wiki-link" href="/wiki/fourier-transform">Fourier Transform</a> — the non-periodic limit ( $L\to\infty$ ): sums over $n$ become integrals over continuous frequency $\xi$ .
Hilbert Space — Parseval is the abstract Pythagorean theorem; $\{e_n\}$ is the canonical complete orthonormal basis, prototype for general orthonormal expansions.
<a class="wiki-link" href="/wiki/math-diffeq-sturm-liouville-theory">Sturm–Liouville Theory</a> — sines/cosines are eigenfunctions of $-d^2/dx^2$ with periodic boundary conditions; general SL problems give other orthogonal bases (Legendre, Bessel).
Convolution Theorem — convolution on the circle becomes pointwise multiplication of coefficients: $\widehat{f*g}(n) = \hat f(n)\hat g(n)$ .
<a class="wiki-link" href="/wiki/distribution-theory">Distribution Theory</a> — the Dirac comb and termwise-differentiated series live here; $\sum e^{inx} = 2\pi\sum_k\delta(x-2\pi k)$ .
Discrete Fourier Transform — sampling Fourier series at $N$ points gives the DFT, computed by the FFT.

🔬 Where this appears

⏳ History

- 1748 — Euler & d'Alembert: the vibrating string controversy; trigonometric sums appear but their generality is fiercely disputed.

- 1753 — Daniel Bernoulli: claims all string motions are superpositions of harmonics; Euler and d'Alembert reject the universality of the claim.

- 1807 — Fourier: submits his memoir on heat to the French Academy; the committee (Lagrange, Laplace) is skeptical of the convergence claims.

- 1822 — Fourier: publishes Théorie analytique de la chaleur, the foundational text.

- 1829 — Dirichlet: gives the first rigorous convergence theorem (Dirichlet conditions), founding modern analysis of the question.

- 1854 — Riemann: his Habilitationsschrift on trigonometric series introduces the Riemann integral to handle Fourier coefficients rigorously.

- 1873 — du Bois-Reymond: continuous function with divergent Fourier series — convergence is genuinely subtle.

- 1900–1906 — Fejér & Lebesgue: Fejér's Cesàro-summability theorem (1900) and Lebesgue integration (1902) place the theory on firm modern footing; Bessel/Parseval completed.

- 1966 — Carleson: proves

L^2

functions converge a.e. (extended to

L^p

,

p>1

, by Hunt 1968), resolving the Lusin conjecture.

open-problem

Convergence at the boundary of $L^1$ . Carleson's theorem fails for $L^1$ : Kolmogorov (1923) built an $L^1$ function whose Fourier series diverges everywhere. The precise frontier — exactly which integrability/regularity conditions force a.e. convergence — involves subtle maximal-function estimates (the Carleson operator) whose sharp constants and multidimensional analogues remain active research. In several variables, the order of summation matters enormously: spherical vs. rectangular partial sums behave very differently, and sharp convergence results for Bochner–Riesz means in dimension $\ge 2$ are connected to deep open problems in harmonic analysis (the Bochner–Riesz and restriction conjectures), which intertwine with the Kakeya problem and remain unsolved.

Fourier Series — Advanced Treatment

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also