🧮 Brain Teaser

The Riemann–Lebesgue Lemma: Oscillations Kill Integrals

Let f:[0,2π]Rf : [0, 2\pi] \to \mathbb{R} be Riemann integrable. Prove that

limn02πf(x)sin(nx)dx=0.\lim_{n \to \infty} \int_0^{2\pi} f(x) \sin(nx)\, dx = 0.

Can you first prove it for step functions, and then deduce the general case?

Fourier analysisapproximation argumentRiemann integraloscillatory integrals

Answer: Riemann–Lebesgue Lemma

Key Idea / Intuition

The sine function sin(nx)\sin(nx) oscillates faster and faster as nn \to \infty, alternating between positive and negative with increasing frequency. Over each half-period, positive and negative contributions nearly cancel. For a nearly-constant (step) function, the cancellation is exact in the limit. For a general integrable function, we approximate by step functions and use the fact that the error can be made small uniformly in nn.

This is a beautiful approximation argument: prove the result for a dense class, then use a uniform bound to pass to the limit.


Formal Proof / Solution

Step 1: Prove it for step functions

A step function is a finite linear combination of indicator functions 1[a,b]\mathbf{1}_{[a,b]}. By linearity, it suffices to show

absin(nx)dx0as n.\int_a^b \sin(nx)\, dx \to 0 \quad \text{as } n \to \infty.

Direct computation:

absin(nx)dx=[cos(nx)n]ab=cos(na)cos(nb)n2n0.\int_a^b \sin(nx)\, dx = \left[-\frac{\cos(nx)}{n}\right]_a^b = \frac{\cos(na) - \cos(nb)}{n} \leq \frac{2}{n} \to 0.

So the result holds for all step functions. ✓


Step 2: Approximate ff by step functions

Since ff is Riemann integrable on [0,2π][0, 2\pi], for any ε>0\varepsilon > 0 there exists a step function gg such that

02πf(x)g(x)dx<ε.\int_0^{2\pi} |f(x) - g(x)|\, dx < \varepsilon.

(This is a standard fact: Riemann integrable functions are exactly those approximable in L1L^1 by step functions.)


Step 3: Triangle inequality and conclusion

Write

02πf(x)sin(nx)dx02π(f(x)g(x))sin(nx)dx+02πg(x)sin(nx)dx.\left|\int_0^{2\pi} f(x)\sin(nx)\, dx\right| \leq \left|\int_0^{2\pi} (f(x) - g(x))\sin(nx)\, dx\right| + \left|\int_0^{2\pi} g(x)\sin(nx)\, dx\right|.

For the first term, since sin(nx)1|\sin(nx)| \leq 1:

02π(f(x)g(x))sin(nx)dx02πf(x)g(x)dx<ε.\left|\int_0^{2\pi} (f(x) - g(x))\sin(nx)\, dx\right| \leq \int_0^{2\pi} |f(x) - g(x)|\, dx < \varepsilon.

For the second term, by Step 1 applied to the step function gg:

02πg(x)sin(nx)dx0as n,\left|\int_0^{2\pi} g(x)\sin(nx)\, dx\right| \to 0 \quad \text{as } n \to \infty,

so there exists NN such that for all n>Nn > N, this term is also <ε< \varepsilon.

Combining: for all n>Nn > N,

02πf(x)sin(nx)dx<2ε.\left|\int_0^{2\pi} f(x)\sin(nx)\, dx\right| < 2\varepsilon.

Since ε>0\varepsilon > 0 was arbitrary, the limit is 00. \blacksquare


Why this is beautiful

The argument is a two-step density trick that appears throughout analysis:

  1. Prove the result on a dense/approximating class (here: step functions) by direct computation.
  2. Use a uniform bound (here: sin(nx)1|\sin(nx)| \leq 1) to transfer the result to the whole space.

This exact pattern also underlies proofs in LpL^p theory, Fourier analysis, and functional analysis far beyond this specific lemma.

Source: Mathematical folklore / Rudin Principles of Mathematical Analysis

Type: analysisSource: Mathematical folklore / Rudin Principles of Mathematical AnalysisEdit on GitHub ↗