MathLabs
TheoremProved

The Monotone Convergence Theorem

Statement

Let (fn)(f_n) be measurable functions with 0≤f1≤f2≤⋯0 \le f_1 \le f_2 \le \cdots pointwise almost everywhere, and let f=lim⁡n→∞fnf = \lim_{n\to\infty} f_n pointwise almost everywhere. Then lim⁡n→∞∫fn dμ=∫f dμ\lim_{n\to\infty} \int f_n\,d\mu = \int f\,d\mu.

Why is it true?

Since the fnf_n only grow, no 'area' is ever lost or double-counted as nn increases; stacking their simple-function approximations, the total accumulated area converges exactly to the area under the limit ff.

Proof sketch

Since ∫fn dμ\int f_n\,d\mu is a nondecreasing sequence of extended reals (as fnf_n increases), the limit L:=lim⁡n→∞∫fn dμL := \lim_{n\to\infty}\int f_n\,d\mu exists in [0,∞][0,\infty]. Since fn≤ff_n \le f for every nn, monotonicity of the integral gives ∫fn dμ≤∫f dμ\int f_n\,d\mu \le \int f\,d\mu for every nn, hence L≤∫f dμL \le \int f\,d\mu.

For the reverse inequality, fix any simple measurable function ss with 0≤s≤f0 \le s \le f and fix a constant c∈(0,1)c \in (0,1). Define En={x:fn(x)≥c s(x)}E_n = \{x : f_n(x) \ge c\,s(x)\}. Because fnf_n increases to f≥sf \ge s pointwise, the sets EnE_n increase and their union is (almost) all of XX: for a.e. xx with s(x)=0s(x)=0 this is automatic, and for a.e. xx with s(x)>0s(x)>0, eventually fn(x)>c s(x)f_n(x) > c\,s(x) since fn(x)→f(x)≥s(x)>c s(x)f_n(x)\to f(x) \ge s(x) > c\,s(x).

Writing s=∑kck1Eks = \sum_k c_k \mathbf{1}_{E_k}, we get ∫fn dμ≥∫Enfn dμ≥c∫Ens dμ=c∑kck μ(Ek∩En)\int f_n\,d\mu \ge \int_{E_n} f_n\,d\mu \ge c\int_{E_n} s\,d\mu = c\sum_k c_k\,\mu(E_k \cap E_n). By countable additivity (continuity of measure from below, since EnE_n increases to XX), μ(Ek∩En)→μ(Ek)\mu(E_k \cap E_n) \to \mu(E_k) as n→∞n\to\infty, so letting n→∞n\to\infty gives L≥c∑kck μ(Ek)=c∫s dμL \ge c\sum_k c_k\,\mu(E_k) = c\int s\,d\mu.

Letting c→1c \to 1 gives L≥∫s dμL \ge \int s\,d\mu for every simple s≤fs \le f, and taking the supremum over all such ss (the very definition of ∫f dμ\int f\,d\mu) gives L≥∫f dμL \ge \int f\,d\mu. Combined with L≤∫f dμL \le \int f\,d\mu from above, we conclude L=∫f dμL = \int f\,d\mu.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Gerald B. Folland (1999). Real Analysis: Modern Techniques and Their Applications
  2. Donald L. Cohn (2013). Measure Theory
  3. Hong Wang, Joshua Zahl (2025). Volume estimates for unions of convex sets, and the Kakeya set conjecture in three dimensions · arXiv:2502.17655 [preprint, not peer-reviewed]