Convergence of Fourier Series

Writing $f(x)\sim\sum_n c_n e^{inx}$ is an act of faith: an infinite sum of smooth waves is claimed to rebuild a function that may be jagged, discontinuous, or merely square-integrable. The convergence question asks when that faith is justified — and its first surprise is that "the series equals $f$ " is not one statement but three inequivalent ones. Pointwise convergence asks whether $S_N(x)\to f(x)$ at each fixed point. Uniform convergence demands the worst-case error $\sup_x|f(x)-S_N(x)|$ vanish — far stronger, forcing $f$ continuous. Mean-square ( $L^2$ ) convergence asks only that the integrated squared error vanish, the gentlest and most universal. The cleanest of these is the Hilbert-space story. Treat $\{e^{inx}/\sqrt{2\pi}\}$ as an orthonormal basis of $L^2[-\pi,\pi]$ ; then $S_N$ is exactly the orthogonal projection of $f$ onto the first $2N+1$ modes, its best $L^2$ approximation. Bessel's inequality saturating into Parseval delivers $L^2$ convergence for any square-integrable $f$ , with no smoothness assumed — the licence physicists use to expand discontinuous potentials, sawtooth drives, and quantum states on a ring without apology. Pointwise and uniform convergence are more delicate, both governed by one object: the Dirichlet kernel $D_N$ , through which $S_N=D_N * f$ . Its mass concentrates at the origin (good — it samples $f$ locally) but it rings with negative lobes (bad — they overshoot near jumps). That sign-changing structure is the exact origin of the Gibbs phenomenon: a permanent $\approx 8.95\%$ overshoot at every discontinuity that no increase of $N$ removes. Averaging replaces $D_N$ with the nonnegative Fejér kernel and cures it.

Key takeaways

A Fourier series can converge in three inequivalent senses — pointwise, uniform, and mean-square ( $L^2$ ) — and which holds is fixed by the smoothness of $f$ .
Mean-square convergence holds for every $f\in L^2$ : the partial sum is the orthogonal projection minimizing the integrated squared error, and Parseval forces $\lVert f-S_N\rVert_2\to0$ .
Under the Dirichlet conditions the series converges pointwise to the midpoint $\tfrac12[f(x^+)+f(x^-)]$ — to $f$ where continuous, splitting the difference at a jump.
Uniform convergence needs continuity plus absolutely summable coefficients; one continuous derivative (piecewise $C^1$ , endpoints matched) suffices.
At a jump the partial sums overshoot by a fixed $\approx 8.95\%$ for all $N$ — the Gibbs phenomenon — because the Dirichlet kernel is not positive.
Cesàro (Fejér) averaging replaces $D_N$ by the nonnegative Fejér kernel, restoring uniform convergence for continuous $f$ and killing Gibbs.
Key idea: convergence is not one question but three — $L^2$ holds universally because $S_N$ is an orthogonal projection, pointwise holds under Dirichlet conditions and returns jump midpoints, uniform needs continuity with summable coefficients; the Dirichlet kernel's failure to be positive produces the universal $\approx 9\%$ Gibbs overshoot.

The core insight

Convergence is not one question but three: $L^2$ convergence holds universally for square-integrable $f$ because the partial sum is an orthogonal projection; pointwise convergence holds under Dirichlet conditions and reproduces jump midpoints; uniform convergence requires continuity and summable coefficients. The Dirichlet kernel's failure to be positive is exactly what produces the universal $\approx 9\%$ Gibbs overshoot at discontinuities.

Where this lives today

The three convergence modes set the ground rules for how modern computation handles sharp features. In numerical spectral methods — workhorses of climate modelling, turbulence, and astrophysics — smooth periodic data gives super-algebraically decaying coefficients and near-exponential accuracy; but the instant a shock appears, coefficients decay only like $1/n$ , Gibbs ringing pollutes the solution, and practitioners deploy spectral filters and Fejér/Cesàro smoothing to restore convergence. In signal and image processing the same $8.95\%$ overshoot appears as ringing around sharp edges in JPEG blocks and, in magnetic-resonance imaging, as parallel bands beside high-contrast boundaries in the truncated Fourier reconstruction of $k$ -space — cured in both by Fejér-type windowing (Lanczos sigma-factors, apodization). And in quantum mechanics on a ring, the completeness of the momentum states $e^{inx}/\sqrt{2\pi}$ — the $L^2$ convergence Parseval guarantees — licenses expanding any normalizable state, cusped or not, so expectation values converge robustly even when the series misbehaves at a point. The frontier Carleson's theorem opened — sharp pointwise convergence in higher dimensions and rougher classes — remains active harmonic analysis today.

The physical picture

Picture $L^2[-\pi,\pi]$ as an infinite-dimensional Euclidean space in which the modes $e^{inx}$ are orthogonal axes. The partial sum $S_N$ keeps the first $2N+1$ coordinates of $f$ ; dropping the rest can only push you away from $f$ , so the truncation is the closest point in the subspace — the geometric content of least squares. $L^2$ convergence just says the leftover coordinates carry vanishing energy, and no smoothness is needed because a projection is defined for any vector. Pointwise behaviour, by contrast, is a tug-of-war inside the Dirichlet kernel between localization and oscillation. As $N$ grows, $D_N$ piles its mass into an ever-narrower spike at the origin — which lets $S_N=D_N * f$ read off the local value of $f$ — but the same kernel rings with alternating positive and negative lobes. Those negative lobes are the villain: near a jump they reach across the discontinuity and pull the partial sum past its target. The first figure shows exactly this overshoot for a square wave, pinning the peak to a number independent of $N$ .

Figure

Partial sum S₈ of the square wave sgn(x) built from 15 harmonics: near the jump at x = 0 the sum overshoots to 1.1790 = (2/π)Si(π), a fixed 8.95% of the full jump, and raising N never lowers that peak — the spike only slides toward the discontinuity while the sum settles to the midpoint value 0 at x = 0

Averaging successive partial sums smears out those rings. The Cesàro mean $\sigma_N=\tfrac1{N+1}(S_0+\cdots+S_N)$ convolves against the Fejér kernel, a perfect square and therefore never negative — an honest average that cannot overshoot. The price is a slightly slower approach; the reward is uniform convergence for any continuous periodic $f$ . The second figure sets the two kernels side by side: the single structural difference — sign — decides everything.

Figure

The Dirichlet kernel D₅ (blue) peaks at 2N+1 = 11 at the origin but swings negative to about −2.46 in its side lobes — those sign-changing lobes are what overshoot near a jump — while the Fejér kernel F₅ (green) peaks at N+1 = 6 and stays nonnegative everywhere, which is why Cesàro averaging converges uniformly and never produces Gibbs ringing

The core equations

The whole theory hangs on truncation to $2N+1$ modes. Start with the partial sum and its coefficients, the raw material every convergence statement is about.

S_N(x)=\sum_{n=-N}^{N} c_n\,e^{inx},\qquad c_n=\frac{1}{2\pi}\int_{-\pi}^{\pi} f(x)\,e^{-inx}\,\mathrm{d}x \qquad (1)

where: $S_N$ — symmetric partial sum keeping modes $|n|\le N$ ; $c_n$ — complex Fourier coefficient of $f$ ; $f$ — the $2\pi$ -periodic function. Reading: $S_N$ is the projection onto a $(2N+1)$ -dimensional space, and convergence is the question of what happens as that dimension grows. Because $S_N$ is a finite sum of exponentials added under one integral, it has a closed-form convolution representation. The geometric series of modes collapses to the Dirichlet kernel, the central object of pointwise theory.

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

where: $D_N$ — convolution kernel of the partial-sum operator; $t$ — shift variable $t=x-y$ . Reading: $D_N$ has unit mass and a central peak of height $2N+1$ , but it is not nonnegative — its sign-changing side lobes seed the Gibbs phenomenon. The kernel earns its name through the convolution identity: truncating $f$ is the same as smearing it against $D_N$ over one period — the bridge from algebra (a finite sum) to analysis (a local average).

S_N(x)=\frac{1}{2\pi}\int_{-\pi}^{\pi} f(y)\,D_N(x-y)\,\mathrm{d}y=(D_N * f)(x) \qquad (3)

where: $*$ — periodic convolution over one period. Reading: pointwise convergence at $x$ becomes a question of how the mass of $D_N$ concentrates near $t=0$ — the Dirichlet theorem is a statement about an approximate identity that unfortunately rings. The $L^2$ story bypasses the kernel and is far cleaner. Among all trigonometric polynomials of degree $\le N$ , the Fourier partial sum uniquely minimizes the mean-square error — the defining property of an orthogonal projection.

\lVert f-S_N\rVert_2^2 = \int_{-\pi}^{\pi}|f-S_N|^2\,\mathrm{d}x \le \int_{-\pi}^{\pi}|f-g|^2\,\mathrm{d}x \qquad (4)

where: $g$ — any trigonometric polynomial of degree $\le N$ ; $\lVert\cdot\rVert_2$ — the $L^2$ norm on the period. Reading: no other $2N+1$ coefficients beat the Fourier ones in the energy norm, so $L^2$ convergence follows the moment the modes are complete — no smoothness required. Completeness turns that inequality into an equality. Bessel says the mode energies never exceed the total; Parseval says they account for all of it — precisely the statement that the residual $\lVert f-S_N\rVert_2\to0$ .

2\pi\sum_{n=-\infty}^{\infty}|c_n|^2 = \int_{-\pi}^{\pi}|f(x)|^2\,\mathrm{d}x \qquad (5)

where: $\sum|c_n|^2$ — total energy carried by the modes. Reading: equality (Parseval), not mere inequality (Bessel), is equivalent to mean-square convergence, and it is the completeness of $\{e^{inx}\}$ in $L^2[-\pi,\pi]$ that supplies it. To repair the sign-changing defect of $D_N$ , average the partial sums. The Cesàro mean convolves against the Fejér kernel, which telescopes into a perfect square and is therefore manifestly nonnegative.

F_N(t)=\frac{1}{N+1}\sum_{k=0}^{N}D_k(t)=\frac{1}{N+1}\left(\frac{\sin\!\big(\tfrac{(N+1)t}{2}\big)}{\sin(t/2)}\right)^{\!2}\ge 0 \qquad (6)

where: $F_N$ — averaged kernel for the Cesàro means $\sigma_N=F_N * f$ . Reading: a nonnegative unit-mass kernel is an honest average, so $\sigma_N$ can never overshoot — Fejér's theorem gives uniform convergence for continuous $f$ . The universal overshoot at a jump is a single definite integral, not a numerical accident — its value comes from the sine integral $\mathrm{Si}(\pi)$ and is independent of the function and of $N$ .

\text{overshoot fraction}=\frac{1}{\pi}\int_0^{\pi}\frac{\sin t}{t}\,\mathrm{d}t-\frac12=\frac{\mathrm{Si}(\pi)}{\pi}-\frac12\approx 0.08949 \qquad (7)

where: $\mathrm{Si}(\pi)=\int_0^\pi(\sin t/t)\,\mathrm{d}t\approx 1.85194$ — the sine integral at $\pi$ . Reading: the partial sums overshoot each jump by $\approx8.95\%$ forever; the number is a property of the Dirichlet kernel, so it appears for every function with a discontinuity. Finally, the original (non-averaged) series converges uniformly when the coefficients are absolutely summable — which one continuous derivative guarantees.

f\ \text{cts and piecewise }C^1,\ f(-\pi)=f(\pi)\ \Rightarrow\ \sum_n|c_n|<\infty \qquad (8)

where: $c_n=O(1/n^2)$ -summable — the decay forced by one integration by parts. Reading: absolute summability plus the Weierstrass M-test gives $\sup_x|f-S_N|\to0$ ; continuity is necessary, since a uniform limit of continuous partial sums is continuous — a jump can never be approached uniformly.

Derivation APointwise convergence at a jump and the Dirichlet theorem

The goal is to prove the single most quoted fact about Fourier series: at a jump the partial sums converge not to either one-sided value but to their average $\tfrac12[f(x^+)+f(x^-)]$ , and to $f(x)$ where $f$ is continuous. The strategy uses the convolution $S_N=D_N * f$ , the exact half-period normalization of the Dirichlet kernel, and the Riemann–Lebesgue lemma to kill the remaining oscillatory integral. Assume $f$ satisfies the Dirichlet conditions — piecewise continuous with finitely many extrema — and has one-sided limits $f(x^\pm)$ at the point $x$ .

Step 1. Normalize the kernel. Because every mode except $n=0$ integrates to zero over a period, and $D_N$ is even, the kernel splits its unit mass evenly across the two half-periods:

\frac{1}{2\pi}\int_{-\pi}^{\pi} D_N(t)\,\mathrm{d}t=1,\qquad \frac{1}{2\pi}\int_0^{\pi}D_N=\frac{1}{2\pi}\int_{-\pi}^0 D_N=\tfrac12.

Why: these half-masses are the weights on the two one-sided limits, so the midpoint is baked into the kernel before any function is chosen.

Step 2. Subtract the target and split. Using the half-masses to write $\tfrac12[f(x^+)+f(x^-)]$ as a kernel integral, the error becomes

S_N(x)-\tfrac12[f(x^+)+f(x^-)]=\frac{1}{2\pi}\int_0^{\pi}\big[f(x-t)-f(x^-)\big]D_N(t)\,\mathrm{d}t+\text{(mirror }t\to-t\text{ term)}.

Why: subtracting the one-sided limit makes the integrand vanish at $t=0$ , exactly where the kernel concentrates — taming a badly-peaked integral.

Step 3. Extract a bounded, integrable factor. Write $D_N(t)=\sin((N+\tfrac12)t)/\sin(t/2)$ and absorb the denominator:

g(t):=\frac{f(x-t)-f(x^-)}{\sin(t/2)}\in L^1[0,\pi].

Why: piecewise $C^1$ makes the numerator $O(t)$ , cancelling $\sin(t/2)\sim t/2$ , so $g$ is integrable — the hypothesis is used here and nowhere else.

Step 4. Apply Riemann–Lebesgue. What remains is a Fourier-type coefficient of the integrable function $g$ :

\int_0^{\pi} g(t)\,\sin\!\big((N+\tfrac12)t\big)\,\mathrm{d}t\longrightarrow 0\quad(N\to\infty).

Why: Riemann–Lebesgue says the oscillatory integral of any $L^1$ function vanishes as the frequency grows — rapid sign changes average the smooth factor to nothing.

Step 5. Conclude. Both halves vanish, so $S_N(x)\to\tfrac12[f(x^+)+f(x^-)]$ ; where $f$ is continuous this collapses to $f(x)$ . Why: this is the Dirichlet theorem — convergence to $f$ where continuous, to the average of the two sides at a jump.

Go deeper · Derivation B · 1 minThe Gibbs overshoot for a square wave

Derivation BThe Gibbs overshoot for a square wave

The goal is to compute the exact limiting height of the overshoot near a jump and show it is a fixed fraction of the jump, independent of $N$ — the quantitative heart of the Gibbs phenomenon. The plan is concrete: take the odd square wave $f(x)=\operatorname{sgn}(x)$ on $(-\pi,\pi)$ , which jumps by $2$ at the origin, write its partial sum, locate the first maximum of $S_N$ to the right of the jump, and evaluate the sum there as a Riemann sum converging to $\mathrm{Si}(\pi)$ . The punchline is a pure number, $\tfrac2\pi\mathrm{Si}(\pi)\approx1.1790$ , that no refinement of $N$ can beat down.

Step 1. Write the series. By oddness only sine harmonics survive, and only the odd ones:

S_N(x)=\frac{4}{\pi}\sum_{k=0}^{N}\frac{\sin\!\big((2k+1)x\big)}{2k+1}.

Why: the square wave's symmetry kills even $n$ , leaving a clean sum we can differentiate in closed form.

Step 2. Locate the first peak. Differentiating collapses the cosine sum to a single ratio:

S_N'(x)=\frac{4}{\pi}\sum_{k=0}^{N}\cos\!\big((2k+1)x\big)=\frac{2}{\pi}\frac{\sin\!\big(2(N+1)x\big)}{\sin x}=0,

whose first positive zero is $x_N=\dfrac{\pi}{2(N+1)}$ . Why: the peak of the overshoot sits at $x_N$ , and $x_N\to0$ as $N\to\infty$ — the spike migrates toward the discontinuity rather than shrinking.

Step 3. Convert the sum to an integral. Evaluating at $x_N$ and recognizing a Riemann sum with spacing $2/(2N+1)$ ,

S_N(x_N)=\frac{2}{\pi}\int_0^{2(N+1)x_N}\frac{\sin u}{u}\,\mathrm{d}u+o(1)=\frac{2}{\pi}\int_0^{\pi}\frac{\sin u}{u}\,\mathrm{d}u.

Why: the upper limit $2(N+1)x_N=\pi$ is fixed by the peak location, so the sum limits to the sine integral evaluated exactly at $\pi$ .

Step 4. Put in the number. With $\mathrm{Si}(\pi)\approx1.85194$ ,

\max_x S_N(x)\xrightarrow{N\to\infty}\frac{2}{\pi}\,\mathrm{Si}(\pi)\approx\frac{2}{\pi}(1.85194)\approx 1.1790.

Why: the target on the right is $1$ , so the overshoot $\approx0.1790$ is $0.1790/2\approx0.0895$ — about $8.95\%$ of the full jump of $2$ , the universal Gibbs constant.

Step 5. Persistence. The peak height $1.1790$ is independent of $N$ ; only its location $x_N\to0$ moves inward. Why: "just add more terms" fails — extra harmonics narrow the spike but never lower it, so ringing must be cured by smoothing, not resolution.

Go deeper · Derivation C · 1 minUniform convergence from coefficient decay

Derivation CUniform convergence from coefficient decay

The goal is a clean, checkable sufficient condition for the original series to converge uniformly, and to show one continuous derivative already delivers it. The route is three standard estimates: integrate by parts once to relate the coefficients of $f$ to those of $f'$ , bound the latter with Bessel's inequality, then use Cauchy–Schwarz against $\sum 1/n^2$ to prove the $c_n$ are absolutely summable — at which point the Weierstrass M-test finishes. Assume $f$ is continuous, $2\pi$ -periodic, and piecewise $C^1$ , so $f'$ is bounded and square-integrable.

Step 1. Integrate by parts. The boundary terms cancel by continuity and periodicity, leaving

c_n=\frac{1}{2\pi}\int_{-\pi}^{\pi}f\,e^{-inx}\,\mathrm{d}x=\frac{1}{2\pi\,in}\int_{-\pi}^{\pi}f'\,e^{-inx}\,\mathrm{d}x=\frac{c_n^{(1)}}{in},

where $c_n^{(1)}$ are the coefficients of $f'$ . Why: each derivative pulls out a factor $1/n$ , converting smoothness of $f$ into decay of $c_n$ — one derivative buys one power of $1/n$ .

Step 2. Bound the derivative's coefficients. Since $f'\in L^2$ , Bessel's inequality caps their total energy:

\sum_n|c_n^{(1)}|^2\le\frac{1}{2\pi}\lVert f'\rVert_2^2<\infty.

Why: this is the only place the size of $f'$ enters — through the same energy inequality that underlies $L^2$ convergence.

Step 3. Cauchy–Schwarz. Split $|c_n|=|c_n^{(1)}|/|n|$ and apply:

\sum_{n\ne0}|c_n|=\sum_{n\ne0}\frac{|c_n^{(1)}|}{|n|}\le\Big(\sum_{n\ne0}\tfrac{1}{n^2}\Big)^{1/2}\Big(\sum_{n}|c_n^{(1)}|^2\Big)^{1/2}<\infty,

using $\sum_{n\ne0}1/n^2=\pi^2/3$ . Why: pairing $1/n$ decay against the finite derivative energy is what makes the coefficients absolutely summable — neither factor alone suffices.

Step 4. Weierstrass M-test. Since $|c_n e^{inx}|=|c_n|$ and $\sum|c_n|<\infty$ , the series converges uniformly to a continuous limit, equal to $f$ by $L^2$ uniqueness. Why: a uniform limit of continuous terms is continuous, confirming that a discontinuous $f$ could never be reached uniformly.

Limiting cases

The mode of convergence is decided by the regularity class of $f$ ; sharpen or coarsen the smoothness and you slide between the rows.

Case	Result	Meaning
$f\in L^2$ only	$\lVert f-S_N\rVert_2\to0$	Mean-square convergence always holds; no pointwise statement is guaranteed.
Dirichlet conditions	$S_N(x)\to\tfrac12[f(x^+)+f(x^-)]$	Pointwise convergence to the midpoint at jumps, to $f(x)$ where continuous.
$f$ continuous, $\sum\|c_n\|<\infty$	$\sup_x\|f(x)-S_N(x)\|\to0$	Uniform convergence; holds e.g. for continuous piecewise- $C^1$ periodic $f$ .
Jump of size $\Delta$	overshoot $\to\Delta\big(\tfrac1\pi\!\int_0^\pi\!\tfrac{\sin t}{t}\mathrm{d}t-\tfrac12\big)\approx0.0895\,\Delta$	Gibbs phenomenon — a fixed fractional overshoot, independent of $N$ .
Cesàro means $\sigma_N$	$\sigma_N(x)\to f(x)$ uniformly ( $f$ cont.)	Fejér's theorem: averaging restores uniform convergence and kills Gibbs.
Smooth ( $C^\infty$ ) periodic $f$	$c_n=O(n^{-k})$ for all $k$	Coefficients decay faster than any power; spectral (super-algebraic) convergence.

Common trapMore terms will eventually smooth out the overshoot at a jump

It will not — this is the most common misconception about Fourier series, and it is exactly backwards. Increasing $N$ makes the Gibbs spike narrower but never shorter: for a unit-amplitude square wave the peak converges to $\tfrac2\pi\mathrm{Si}(\pi)\approx1.1790$ , an $\approx8.95\%$ overshoot locked in for every finite $N$ . The reason is structural — the overshoot lives in the Dirichlet kernel's sign-changing side lobes, which compress but never vanish. Two traps ride along. First, do not conflate the three modes: a series can converge to $f$ in $L^2$ while overshooting at every $N$ near a jump, so $L^2$ convergence implies neither uniform nor everywhere-pointwise convergence. Second, at a jump the pointwise limit is the midpoint $\tfrac12[f(x^+)+f(x^-)]$ , generally different from whatever value $f$ was assigned there. The cure for ringing is smoothing — Cesàro/Fejér averaging or a Lanczos window — a nonnegative kernel that cannot overshoot.

Worked examples

1 · The Gibbs overshoot of a square wave (fully worked)

The odd square wave $f(x)=\operatorname{sgn}(x)$ on $(-\pi,\pi)$ jumps from $-1$ to $+1$ at the origin. Compute the limiting height of the first peak of $S_N$ to the right of the jump, and express the overshoot as a percentage of the jump.

Step 1. Write the partial sum. Only odd sine harmonics survive: $S_N(x)=\dfrac4\pi\sum_{k=0}^{N}\dfrac{\sin((2k+1)x)}{2k+1}$ , with first maximum right of the jump at $x_N=\dfrac{\pi}{2(N+1)}$ .

Step 2. Take the limit. Evaluating at $x_N$ turns the sum into a Riemann sum with upper limit exactly $\pi$ : $S_N(x_N)\to\dfrac2\pi\displaystyle\int_0^\pi\dfrac{\sin u}{u}\,\mathrm{d}u=\dfrac2\pi\mathrm{Si}(\pi)$ .

Step 3. Put in the number. With $\mathrm{Si}(\pi)=1.85194$ , the peak is $\dfrac2\pi(1.85194)=\mathbf{1.1790}$ ; the target on the right is $1$ , so the overshoot is $0.1790$ .

Step 4. As a fraction of the jump. The full jump is $\Delta=2$ , so the overshoot is $0.1790/2=\mathbf{0.0895}$ — $\approx8.95\%$ of the jump, the universal constant $\mathrm{Si}(\pi)/\pi-\tfrac12$ . Peak $S_N\to1.1790$ ; the $\approx8.95\%$ overshoot does not shrink as $N\to\infty$ — only the spike narrows.

2 · The sawtooth, its jump value, and the Basel sum via Parseval

Take $f(x)=x$ on $(-\pi,\pi)$ , extended $2\pi$ -periodically (a sawtooth). Find its Fourier series, check the value the series returns at the jump $x=\pi$ , and use Parseval's identity to evaluate $\sum_{n=1}^\infty 1/n^2$ .

Step 1. Compute the coefficients. The function is odd, so only sine terms appear: $b_n=\dfrac1\pi\displaystyle\int_{-\pi}^{\pi}x\sin(nx)\,\mathrm{d}x=\dfrac{2(-1)^{n+1}}{n}$ by parts, giving $f(x)=2\displaystyle\sum_{n=1}^\infty\dfrac{(-1)^{n+1}}{n}\sin(nx)$ .

Step 2. Test the jump. At $x=\pi$ the periodic extension leaps from $f(\pi^-)=\pi$ to $f(\pi^+)=-\pi$ . Every term $\sin(n\pi)=0$ , so the series returns $\mathbf{0}$ — the midpoint $\tfrac12[\pi+(-\pi)]=0$ predicted by the Dirichlet theorem, not either one-sided value.

Step 3. Set up Parseval. In real form $\dfrac1\pi\displaystyle\int_{-\pi}^{\pi}f^2\,\mathrm{d}x=\sum b_n^2$ , with left side $\dfrac1\pi\cdot\dfrac{2\pi^3}{3}=\dfrac{2\pi^2}{3}$ .

Step 4. Solve for the sum. The right side is $\sum b_n^2=4\sum 1/n^2$ , so $4\sum\dfrac1{n^2}=\dfrac{2\pi^2}{3}$ , hence $\displaystyle\sum_{n=1}^\infty\dfrac1{n^2}=\dfrac{\pi^2}{6}$ . The series returns the midpoint $0$ at the jump, and Parseval hands back the Basel sum $\sum 1/n^2=\pi^2/6\approx1.6449$ — a convergence identity turned into a number.

Physics of the portrait

Convergence of Fourier series is where a physicist's cheerful formula collided with a mathematician's demand for proof — and the collision built modern analysis. The names form a relay across two centuries.

Origins · 1 minPeter Gustav Lejeune Dirichlet and how this was discovered

Peter Gustav Lejeune Dirichlet

1805–1859, German mathematician · the first rigorous convergence theorem for Fourier series

When Joseph Fourier claimed in 1807 that any function could be written as a trigonometric series, the leading analysts — Lagrange among them — refused to believe it: Fourier offered no proof and his examples strained credulity. The gap stood two decades until Peter Gustav Lejeune Dirichlet, then twenty-four, published in 1829 the first theorem saying precisely when the series converges and to what: for a piecewise-monotone function with finitely many discontinuities, the partial sums converge to $f(x)$ where it is continuous and to the midpoint $\tfrac12[f(x^+)+f(x^-)]$ at a jump. Those are the Dirichlet conditions, and the kernel at the heart of his proof — the sign-changing $D_N(t)=\sin((N+\tfrac12)t)/\sin(t/2)$ — bears his name. His work forced mathematicians to say what a "function" even was, seeding Riemann's and later Lebesgue's theories of integration. The story kept generating surprises: in 1848 Wilbraham noticed, and in 1899 J. Willard Gibbs re-derived, the permanent $\approx9\%$ overshoot; in 1900 Fejér showed averaging recovers uniform convergence and erases it; in 1926 Kolmogorov built an $L^1$ function whose series diverges everywhere; and only in 1966 did Lennart Carleson prove that every $f\in L^2$ converges pointwise almost everywhere — the deepest word on the question Dirichlet opened.

History

1807

— Fourier claims any periodic function is a sum of sines and cosines

1829

— Dirichlet proves the first rigorous convergence theorem and states the Dirichlet conditions

1848

— Wilbraham first notices the overshoot near a jump

1899

— Gibbs analyses the permanent overshoot, later named the Gibbs phenomenon

1900

— Fejér shows Cesàro averaging gives uniform convergence for continuous functions

1926

— Kolmogorov constructs an L¹ function whose Fourier series diverges everywhere

1966

— Carleson proves almost-everywhere pointwise convergence for every L² function

Going further

Texts. Stone & Goldbart, Mathematics for Physics, ch. on Fourier series and Hilbert space · Arfken & Weber, Mathematical Methods for Physicists, Fourier-series chapter · Riley, Hobson & Bence, Mathematical Methods for Physics and Engineering · Körner, Fourier Analysis (Cambridge) · Stein & Shakarchi, Fourier Analysis: An Introduction. Key numerical anchors for this article: the Dirichlet kernel satisfies $\tfrac1{2\pi}\int_0^\pi D_N=\tfrac12$ ; the Fejér kernel is a perfect square and hence nonnegative; the Gibbs constant is $\tfrac2\pi\mathrm{Si}(\pi)\approx1.17898$ with $\mathrm{Si}(\pi)\approx1.85194$ , giving overshoot $\approx0.08949$ ; the sawtooth coefficients are $b_n=2(-1)^{n+1}/n$ , the series returns midpoint $0$ at $x=\pi$ , and Parseval yields $\sum 1/n^2=\pi^2/6$ .

Prerequisites. Fourier Series and Periodic Functions · Parseval's and Plancherel's Theorems · The Dirac Delta Function. Leads to. The Fourier Transform · Theory of Distributions · Tempered Distributions and the Fourier Transform.

Ask the tutor: Ask me to show, term by term, how the Gibbs peak stays at 8.95% while the spike narrows — or to walk the sawtooth's Parseval identity all the way to the Basel sum π²/6.

What is the difference between pointwise, uniform, and mean-square convergence?

They differ in what must go to zero. Pointwise convergence asks that $S_N(x)\to f(x)$ at each fixed $x$ separately — the rate may vary wildly across points. Uniform convergence is stronger: the single worst-case error $\sup_x|f(x)-S_N(x)|$ must vanish, so one $N$ works everywhere at once, forcing the limit (and hence $f$ ) to be continuous. Mean-square convergence is different in kind: only the integrated squared error $\int|f-S_N|^2$ must vanish, so the series can misbehave on a small set and still converge. For Fourier series, $L^2$ is the most universal, uniform the most demanding, and pointwise sits between under the Dirichlet conditions.

Why is the Dirichlet kernel the source of all the trouble at jumps?

Because $S_N=D_N * f$ is a local average of $f$ weighted by $D_N$ , and $D_N$ is not a well-behaved average. A good approximate identity is a narrow, nonnegative bump of unit mass; convolving against it reads off the local value of $f$ . The Dirichlet kernel has the narrow central bump and unit mass, but its side lobes alternate in sign. Near a jump those negative lobes reach across the discontinuity and subtract a piece of the far side, pushing the average past the target — that is the Gibbs overshoot. Everything good (localization) and everything bad (overshoot) come from the same closed form $\sin((N+\tfrac12)t)/\sin(t/2)$ .

If the Gibbs overshoot never goes away, is the Fourier series wrong at a jump?

No — it is converging, just not uniformly. At the jump the series converges pointwise to the midpoint $\tfrac12[f(x^+)+f(x^-)]$ , a perfectly definite value. The overshoot lives at the moving peak $x_N=\pi/2(N+1)$ , which slides toward the discontinuity as $N$ grows; at any fixed point away from the jump the series converges normally. And in $L^2$ it converges to $f$ exactly, because the overshoot occupies an ever-shrinking interval of vanishing energy. So nothing is "wrong": only uniform convergence fails, which no series of continuous functions could achieve across a genuine discontinuity.

When can I safely differentiate a Fourier series term by term?

Only when the differentiated series still converges, which needs more smoothness than the original. Differentiating multiplies each coefficient by $in$ , so coefficients decay one power of $n$ slower — a $1/n^2$ series becomes a $1/n$ series, which can diverge. The safe rule: if $f$ is continuous, periodic, and piecewise $C^1$ , you may differentiate term by term to get $f'$ wherever $f'$ is continuous. If $f$ has a jump, term-by-term differentiation converges only as a distribution, where the derivative of the jump is a Dirac delta — one of the bridges into the theory of distributions.

Does the Fejér (Cesàro) method make the original convergence questions obsolete?

No, it trades one property for another. Fejér's theorem is remarkably robust — uniform convergence for every continuous periodic function, with no extra smoothness and no Gibbs overshoot, which raw partial sums cannot promise. But the Cesàro means $\sigma_N$ are averages, so they blur genuine features: near a sharp transition they converge more slowly than a partial sum, and they are not the best $L^2$ approximation of degree $N$ the way $S_N$ is. So you choose by need: raw partial sums for best mean-square accuracy on smooth data, Fejér/Lanczos smoothing when a jump would otherwise ring. Knowing which kernel you convolve against tells you which behaviour to expect.

Why does Parseval's identity, a statement about energy, pin down the value of a number like Σ1/n²?

Because Parseval is an exact energy balance between two representations of one function — the physical-space integral $\int|f|^2$ and the mode sum $\sum|c_n|^2$ — and for a specific $f$ both sides are computable numbers. Take the sawtooth $f(x)=x$ : the energy $\tfrac1\pi\int_{-\pi}^\pi x^2\,\mathrm{d}x=2\pi^2/3$ is elementary, while the mode side is $\sum b_n^2=4\sum 1/n^2$ since $b_n=2(-1)^{n+1}/n$ . Equating solves for $\sum 1/n^2=\pi^2/6$ . The mechanism is completeness: only because the modes capture all the energy (equality, not inequality) are the two computations forced to agree, turning a convergence theorem into an arithmetic identity.