Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Intuitive explanation of the proof of Monotone Convergence Theorem

Goal (fix this first)

You are given:

You want to prove:

limnXfndλ=Xfdλ.\lim_{n \to \infty} \int_X f_n \, d\lambda = \int_X f \, d\lambda.

This splits into two inequalities:

  1. limfnf \displaystyle \lim \int f_n \le \int f (easy)

  2. flimfn \displaystyle \int f \le \lim \int f_n (hard)

Everything below is about (2).


Step 1 — The easy inequality

Because the sequence is increasing:

fnffor all n.f_n \le f \quad \text{for all } n.

By monotonicity of the integral:

fnf.\int f_n \le \int f.

So the sequence (fn) \left( \int f_n \right) is increasing and bounded above. Hence the limit

L:=limnfnL := \lim_{n \to \infty} \int f_n

exists and satisfies:

Lf.L \le \int f.

This part is straightforward.
Now forget it — the difficulty is the reverse inequality.


Step 2 — Strategy for the hard inequality

You want to prove:

fL.\int f \le L.

Key idea:

Do not compare f f directly to the fn f_n .
Compare simple pieces of f f to the fn f_n .

This works because the Lebesgue integral is defined from below.


Step 3 — Fix a simple function below f f

Take any positive simple function:

φ=j=1kaj1Aj,aj0,φf.\varphi = \sum_{j=1}^k a_j \mathbf{1}_{A_j}, \quad a_j \ge 0, \quad \varphi \le f.

Why this choice?

Because by definition:

f=sup{φ:0φf, φ simple}.\int f = \sup \left\{ \int \varphi : 0 \le \varphi \le f,\ \varphi \text{ simple} \right\}.

So it is enough to prove:

φLfor every such φ.\int \varphi \le L \quad \text{for every such } \varphi.

Step 4 — Why introduce α(0,1) \alpha \in (0,1)

Problem: Even if φ(x)f(x) \varphi(x) \le f(x) , it is not true that

φ(x)fn(x)for some fixed n everywhere.\varphi(x) \le f_n(x) \quad \text{for some fixed } n \text{ everywhere}.

Solution: Relax the comparison.

Instead of forcing:

φfn,\varphi \le f_n,

you try:

αφfn,with α<1.\alpha \varphi \le f_n, \quad \text{with } \alpha < 1.

Why this helps:

For every x x ,

αφ(x)<f(x),\alpha \varphi(x) < f(x),

and since fn(x)f(x) f_n(x) \uparrow f(x) , the inequality

fn(x)αφ(x)f_n(x) \ge \alpha \varphi(x)

will eventually hold.

This is the engine of the proof.


Step 5 — Define the sets En E_n

Define:

En:={xX:αφ(x)fn(x)}.E_n := \{ x \in X : \alpha \varphi(x) \le f_n(x) \}.

Interpretation:

En E_n is the set of points where fn f_n is already large enough.

Key properties:

  1. Measurable — since φ \varphi and fn f_n are measurable.

  2. Increasing — because fnfn+1 f_n \le f_{n+1} .

  3. Exhausts the space:

    EnX.E_n \uparrow X.

Why does EnX E_n \uparrow X ?

Fix xX x \in X .

Thus every point eventually belongs to some En E_n .


Step 6 — Restrict φ \varphi to En E_n

On the set En E_n , we have:

αφfn.\alpha \varphi \le f_n.

Outside En E_n , we do not care.

So we look at:

φ1En.\varphi \mathbf{1}_{E_n}.

Why?


Step 7 — Integrate φ1En \varphi \mathbf{1}_{E_n}

Compute:

φ1En=j=1kajλ(AjEn).\int \varphi \mathbf{1}_{E_n} = \sum_{j=1}^k a_j \lambda(A_j \cap E_n).

Now:

Therefore:

λ(AjEn)λ(Aj),\lambda(A_j \cap E_n) \to \lambda(A_j),

hence:

φ1Enφ.\int \varphi \mathbf{1}_{E_n} \longrightarrow \int \varphi.

Step 8 — The key inequality

On En E_n :

αφfn.\alpha \varphi \le f_n.

Integrate:

αφ1Enfn1Enfn.\alpha \int \varphi \mathbf{1}_{E_n} \le \int f_n \mathbf{1}_{E_n} \le \int f_n.

Let n n \to \infty :

So:

αφL.\alpha \int \varphi \le L.

Since this holds for every α(0,1) \alpha \in (0,1) , let α1 \alpha \to 1 :

φL.\int \varphi \le L.

Step 9 — Final conclusion

You have shown:

φLfor every simple φf.\int \varphi \le L \quad \text{for every simple } \varphi \le f.

Taking the supremum over all such φ \varphi :

fL.\int f \le L.

Combined with the first inequality:

Lf,L \le \int f,

you conclude:

f=limnfn.\int f = \lim_{n \to \infty} \int f_n.

Mental reconstruction checklist (memorize this)

If you remember only this, you can re-prove everything:

  1. Fix a simple φf \varphi \le f

  2. Fix α<1 \alpha < 1

  3. Define En={αφfn} E_n = \{ \alpha \varphi \le f_n \}

  4. Observe EnX E_n \uparrow X

  5. Use continuity of measure on φ1En \varphi \mathbf{1}_{E_n}

  6. Compare αφ \alpha \varphi with fn f_n

  7. Let n n \to \infty , then α1 \alpha \to 1

  8. Take the supremum over φ \varphi

If you can reproduce these steps without notes, you fully own the Monotone Convergence Theorem.