🧮 Brain Teaser

The Fourier Series That Oversteps Its Bounds

Let f:[0,2π]→Rf: [0, 2\pi] \to \mathbb{R} be a continuous, 2π2\pi-periodic function. Suppose that all of its Fourier coefficients vanish: f^(n)=12π∫02πf(x) e−inx dx=0for all n∈Z.\hat{f}(n) = \frac{1}{2\pi}\int_0^{2\pi} f(x)\, e^{-inx}\, dx = 0 \quad \text{for all } n \in \mathbb{Z}.

Prove that f≡0f \equiv 0.

(No advanced machinery allowed — no L2L^2 completeness, no Plancherel. Use only the tools of basic analysis.)

Fourier seriesWeierstrass approximationorthogonalitydensity argumentcontinuous functions

Answer: Vanishing Fourier Coefficients Force Zero

Key Idea / Intuition

The key insight is a two-step bootstrap: trigonometric polynomials are dense in continuous functions (Weierstrass's theorem), so if ff is orthogonal to every complex exponential einxe^{inx}, it is orthogonal to every trig polynomial, and hence to itself — which forces ∥f∥2=0\|f\|^2 = 0.

More concretely, the Weierstrass approximation theorem for trig polynomials says we can find pn→fp_n \to f uniformly. Since ∫f⋅eikx=0\int f \cdot e^{ikx} = 0 for all kk, we get ∫f⋅pn=0\int f \cdot p_n = 0 for all nn. Passing to the limit gives ∫f⋅f=0\int f \cdot f = 0.


Formal Proof / Solution

Step 1: Orthogonality extends to all trig polynomials.

A trigonometric polynomial is any finite linear combination T(x)=∑∣k∣≤Nckeikx.T(x) = \sum_{|k| \le N} c_k e^{ikx}. By linearity of the integral and the hypothesis f^(k)=0\hat{f}(k) = 0 for all kk: ∫02πf(x) T(x) dx=∑∣k∣≤Ncˉk∫02πf(x) eikx dx=∑∣k∣≤Ncˉk⋅2π f^(−k)‾=0.\int_0^{2\pi} f(x)\, T(x)\, dx = \sum_{|k|\le N} \bar{c}_k \int_0^{2\pi} f(x)\, e^{ikx}\, dx = \sum_{|k|\le N} \bar{c}_k \cdot 2\pi\, \overline{\hat{f}(-k)} = 0.

Wait — more cleanly: ∫02πf(x) eikx dx=2π f^(−k)=0\int_0^{2\pi} f(x)\, e^{ikx}\,dx = 2\pi\,\widehat{f}(-k) = 0, so indeed ∫f⋅T=0\int f \cdot T = 0 for every trig polynomial TT.

Step 2: Approximate f‾\overline{f} uniformly by trig polynomials.

By the Weierstrass theorem for trigonometric polynomials (which follows from the ordinary polynomial version via x↦eixx \mapsto e^{ix}, or from Fejér's theorem on Cesàro means of the Fourier series of continuous functions):

For any ε>0\varepsilon > 0, there exists a trig polynomial TεT_\varepsilon such that ∥Tε−f‾∥∞<ε.\|T_\varepsilon - \overline{f}\|_\infty < \varepsilon.

Step 3: Conclude f≡0f \equiv 0.

Consider ∫02π∣f(x)∣2 dx=∫02πf(x) f(x)‾ dx.\int_0^{2\pi} |f(x)|^2\, dx = \int_0^{2\pi} f(x)\, \overline{f(x)}\, dx.

Write f‾=Tε+(f‾−Tε)\overline{f} = T_\varepsilon + (\overline{f} - T_\varepsilon). Then: ∫02πf(x) f(x)‾ dx=∫02πf(x) Tε(x) dx⏟= 0 by Step 1+∫02πf(x) (f(x)‾−Tε(x)) dx.\int_0^{2\pi} f(x)\,\overline{f(x)}\,dx = \underbrace{\int_0^{2\pi} f(x)\,T_\varepsilon(x)\,dx}_{=\,0 \text{ by Step 1}} + \int_0^{2\pi} f(x)\,(\overline{f(x)} - T_\varepsilon(x))\,dx.

The error term satisfies: ∣∫02πf(x) (f(x)‾−Tε(x)) dx∣≤∥f∥∞⋅∥f‾−Tε∥∞⋅2π<∥f∥∞⋅ε⋅2π.\left|\int_0^{2\pi} f(x)\,(\overline{f(x)} - T_\varepsilon(x))\,dx\right| \le \|f\|_\infty \cdot \|\overline{f} - T_\varepsilon\|_\infty \cdot 2\pi < \|f\|_\infty \cdot \varepsilon \cdot 2\pi.

Since ε>0\varepsilon > 0 is arbitrary: ∫02π∣f(x)∣2 dx=0.\int_0^{2\pi} |f(x)|^2\, dx = 0.

Since ∣f∣2|f|^2 is continuous and non-negative, this forces f≡0f \equiv 0. ■\blacksquare


Why this is the "right" proof: It reveals that the true reason is density, not Hilbert space abstraction. The continuous functions are a metric space; the trig polynomials are a dense subspace; and the linear functional T↦∫fTT \mapsto \int fT is bounded and zero on a dense set, hence zero everywhere — including when T=f‾T = \overline{f}.

Type: analysisEdit on GitHub ↗