Theorem 6.5 (Monotone Convergence Theorem — Levi). If 0≤f1≤f2≤⋯ are measurable and fn→f pointwise, then:
limn→∞∫fndμ=∫fdμ
Proof sketch. Let s be a simple function with s≤f. Define En={x:fn(x)≥(1−ε)s(x)}. Then En↗X and ∫fndμ≥(1−ε)∫sdμ for large n. Take sup over s and let ε→0. ■
Theorem 6.6 (Fatou’s Lemma). If fn≥0 are measurable, then:
∫liminfn→∞fndμ≤liminfn→∞∫fndμ
Proof. Define gn=infk≥nfk. Then 0≤g1≤g2≤⋯ and gn→liminffn. By monotone convergence:
∫liminffndμ=limn→∞∫gndμ≤liminfn→∞∫fndμ
■
Theorem 6.7 (Dominated Convergence Theorem). If fn→f a.e. and there exists g∈L1(μ) with ∣fn∣≤g a.e. for all n, then:
limn→∞∫fndμ=∫fdμ
Proof sketch. Apply Fatou’s lemma to g+fn and g−fn:
Solution. For each x∈[0,1], (1−x2/n)n→e−x2 as n→∞. Since 0≤(1−x2/n)n≤1 for all n and x, we can apply the dominated convergence theorem with g(x)=1∈L1([0,1]):
The three convergence theorems are related: DCT follows from Fatou, and Fatou follows from MCT. Together they form the backbone of Lebesgue integration theory.
Applying DCT without a dominating function. If ∣fn∣≤g fails for some n, the limit may not pass through the integral. Fix: Always verify existence of g∈L1 dominating all fn almost everywhere.
Confusing pointwise and uniform convergence. DCT only requires a.e. pointwise convergence, not uniform. Fix: The theorem is powerful precisely because it relaxes the uniform-convergence requirement of Riemann integration.
Assuming monotone convergence needs boundedness. MCT requires only monotonicity and non-negativity; the limit may be infinite. Fix: If ∫fn diverges, the theorem correctly gives ∫f=∞.
Forgetting the non-negativity in Fatou. Without fn≥0, the inequality ∫liminffn≤liminf∫fn can fail. Fix: Apply Fatou to fn+g with g integrable, then subtract.
Fourier series: DCT justifies term-by-term integration of Fourier series, allowing computation of coefficients by integrating the series.
Probability theory: Markov’s and Chebyshev’s inequalities are essential for proving laws of large numbers and concentration bounds.
Lp spaces: MCT and DCT are used to prove completeness of Lp spaces and to exchange limits with norms.
Fubini’s theorem: Tonelli’s theorem (MCT for non-negative functions) and Fubini’s theorem (DCT for integrable functions) justify swapping the order of integration.
Problem. Evaluate limn→∞∫0πnsin(nx)dx using the dominated convergence theorem.
Solution. Let fn(x)=sin(nx)/n. For each x∈[0,π], ∣fn(x)∣≤1/n→0, so fn→0 pointwise. Also ∣fn(x)∣≤1 for all n and x, and g(x)=1 is integrable on [0,π]. By DCT:
limn→∞∫0πnsin(nx)dx=∫0π0dx=0
We can verify directly: ∫0πsin(nx)dx=[−cos(nx)/n]0π=(1−(−1)n)/n, so the integral is 0 for even n and 2/n2 for odd n, both vanishing as n→∞.