The Riemann–Lebesgue Lemma: Oscillations Kill Integrals
Let be Riemann integrable. Prove that
Can you first prove it for step functions, and then deduce the general case?
Answer: Riemann–Lebesgue Lemma
Key Idea / Intuition
The sine function oscillates faster and faster as , 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 .
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 . By linearity, it suffices to show
Direct computation:
So the result holds for all step functions. ✓
Step 2: Approximate by step functions
Since is Riemann integrable on , for any there exists a step function such that
(This is a standard fact: Riemann integrable functions are exactly those approximable in by step functions.)
Step 3: Triangle inequality and conclusion
Write
For the first term, since :
For the second term, by Step 1 applied to the step function :
so there exists such that for all , this term is also .
Combining: for all ,
Since was arbitrary, the limit is .
Why this is beautiful
The argument is a two-step density trick that appears throughout analysis:
- Prove the result on a dense/approximating class (here: step functions) by direct computation.
- Use a uniform bound (here: ) to transfer the result to the whole space.
This exact pattern also underlies proofs in theory, Fourier analysis, and functional analysis far beyond this specific lemma.
Source: Mathematical folklore / Rudin Principles of Mathematical Analysis