Fatou's Lemma

lean4-proofanalysisvisualizationmeasure-theory
lim infnfndμlim infnfndμ\int \liminf_{n} f_n \, d\mu \leq \liminf_{n} \int f_n \, d\mu

Fatou's lemma is one of the foundational inequalities in measure theory. It gives a lower bound on what integrals can do in the limit — and its power lies in requiring no domination hypothesis at all, only nonnegativity.

Statement

Let (X,M,μ)(X, \mathcal{M}, \mu) be a measure space and (fn)(f_n) a sequence of nonneg­ative measurable functions fn:X[0,]f_n : X \to [0,\infty]. Then

Xlim infnfndμ    lim infnXfndμ.\int_X \liminf_{n \to \infty} f_n \, d\mu \;\leq\; \liminf_{n \to \infty} \int_X f_n \, d\mu.

The inequality can be strict, and no condition on convergence of the fnf_n is assumed.

Visualization

Canonical example: fn=n1[0,1/n]f_n = n \cdot \mathbf{1}_{[0,1/n]} on [0,1][0,1] with Lebesgue measure.

nnfndλ\int f_n \, d\lambdapointwise lim inf\liminf
111=11 \cdot 1 = 100 everywhere
2212=12 \cdot \tfrac{1}{2} = 100
5515=15 \cdot \tfrac{1}{5} = 100
1010110=110 \cdot \tfrac{1}{10} = 100
1001001100=1100 \cdot \tfrac{1}{100} = 100

Each fnf_n is a rectangle of area 11, but the rectangle shrinks to a point: fn(x)0f_n(x) \to 0 for every fixed x>0x > 0 (and for x=0x = 0 the sequence fn(0)=nf_n(0) = n \to \infty, so the liminf at 00 is \infty — irrelevant, as it is a single point).

Therefore lim infnfn=0\liminf_n f_n = 0 a.e., giving

lim infnfndλ=0    1=lim infnfndλ.\int \liminf_n f_n \, d\lambda = 0 \;\leq\; 1 = \liminf_n \int f_n \, d\lambda.

This shows Fatou's inequality is strict here: mass escapes to zero width but nonzero height.

height
  |
n |   ##
  |   ##
  |   ##
  |   ##
  +---------> x
      0  1/n

As nn \to \infty the spike travels left and collapses, but each spike carries exactly area 11.

Proof Sketch

  1. Define gn=infknfkg_n = \inf_{k \geq n} f_k. Each gng_n is measurable, gnfng_n \leq f_n, and gnlim infnfng_n \nearrow \liminf_n f_n.

  2. By monotonicity of integration: gnfn\int g_n \leq \int f_n, hence gninfknfk\int g_n \leq \inf_{k \geq n} \int f_k.

  3. By the Monotone Convergence TheoremMonotone Convergence Theoremf monotone,  supnf(n)<    f(n)supnf(n)f \text{ monotone},\; \sup_n f(n) < \infty \implies f(n) \to \sup_n f(n)A bounded monotone sequence of reals always converges — the supremum is the limitRead more → applied to (gn)(g_n):

lim infnfn=limngn=limngn=lim infngnlim infnfn.\int \liminf_n f_n = \int \lim_n g_n = \lim_n \int g_n = \liminf_n \int g_n \leq \liminf_n \int f_n.

Connections

Fatou's lemma is the missing piece that turns the Monotone Convergence TheoremMonotone Convergence Theoremf monotone,  supnf(n)<    f(n)supnf(n)f \text{ monotone},\; \sup_n f(n) < \infty \implies f(n) \to \sup_n f(n)A bounded monotone sequence of reals always converges — the supremum is the limitRead more → into the Dominated Convergence TheoremDominated Convergence Theoremfnf a.e.,  fngL1fnff_n \to f \text{ a.e.},\; |f_n| \leq g \in L^1 \Rightarrow \int f_n \to \int fPointwise convergence plus a uniform integrable dominating bound lets you pass the limit inside the integralRead more →: DCT applies Fatou twice (to fnf_n and to gfng - f_n) to sandwich the limit. It also appears in the proof of completeness of L1L^1 spaces, and in probability when proving lower semicontinuity of expected values.

Lean4 Proof

import Mathlib.MeasureTheory.Integral.Lebesgue.Add

open MeasureTheory Filter

/-- Fatou's lemma for the lower Lebesgue integral. -/
theorem fatou {α : Type*} {m : MeasurableSpace α} {μ : Measure α}
    {f :   α  0∞} (hf :  n, Measurable (f n)) :
    ∫⁻ x, liminf (fun n => f n x) atTop ∂μ 
    liminf (fun n => ∫⁻ x, f n x ∂μ) atTop :=
  lintegral_liminf_le hf