MathLabs
TheoremProved

Birkhoff's pointwise ergodic theorem

Statement

Let TT be a measure-preserving transformation of a probability space (X,F,μ)(X,\mathcal F,\mu) and f∈L1(μ)f\in L^1(\mu). Then the time averages Snf(x)n\frac{S_nf(x)}{n} converge for μ\mu-almost every xx to a TT-invariant limit fˉ(x)\bar f(x) with ∫Xfˉ dμ=∫Xf dμ\int_X \bar f\,d\mu = \int_X f\,d\mu. If moreover TT is ergodic, then fˉ(x)=∫Xf dμ a.e.\bar f(x)=\int_X f\,d\mu\ \text{a.e.} — the time average along a single orbit equals the space average.

Why is it true?

This is the rigorous version of an intuition physicists had used for decades without proof (Boltzmann's ergodic hypothesis in statistical mechanics): to compute the long-run average of some quantity, you can either watch one system evolve for a very long time, or average over a whole ensemble of systems at one instant — and for ergodic systems these two very different-sounding computations give exactly the same answer.

Proof sketch

Step 1 (invariant limsup and liminf). Define f∗(x)=lim sup⁡n→∞Snf(x)nf^*(x)=\limsup_{n\to\infty}\frac{S_nf(x)}{n} and f∗(x)=lim inf⁡n→∞Snf(x)nf_*(x)=\liminf_{n\to\infty}\frac{S_nf(x)}{n}. Since Sn+1f(x)=f(x)+Snf(Tx)S_{n+1}f(x) = f(x) + S_nf(Tx), dividing by n+1n+1 and letting n→∞n\to\infty shows f∗(Tx)=f∗(x)f^*(Tx)=f^*(x) and f∗(Tx)=f∗(x)f_*(Tx)=f_*(x): both are TT-invariant functions.

Step 2 (the maximal ergodic theorem). For λ∈R\lambda\in\mathbb R, let Aλ={x:sup⁡nSnf(x)/n>λ}A_\lambda=\{x: \sup_n S_nf(x)/n>\lambda\} be the set where the running time average ever exceeds λ\lambda. The key technical lemma (proved by considering g=f−λg=f-\lambda and the maximum of the partial sums Mn(x)=max⁡(0,S1g(x),…,Sng(x))M_n(x)=\max(0,S_1g(x),\dots,S_ng(x)), then using Mn(Tx)≥Skg(Tx)M_n(Tx)\ge S_kg(Tx) termwise and integrating over the set where Mn>0M_n>0) gives ∫Aλf dμ≥λ μ(Aλ)\int_{A_\lambda} f\,d\mu \ge \lambda\,\mu(A_\lambda).

Step 3 (squeezing f and f_ together). Suppose for contradiction that f∗>f∗f^*>f_* on a set of positive measure; then there exist rationals α<β\alpha<\beta with E={x:f∗(x)<α<β<f∗(x)}E=\{x: f_*(x)<\alpha<\beta<f^*(x)\} of positive measure. EE is TT-invariant (since f∗,f∗f^*,f_* are), so we may restrict attention to EE. Applying the maximal inequality to f−βf-\beta on EE forces ∫Ef dμ≥βμ(E)\int_E f\,d\mu\ge\beta\mu(E), and applying it to α−f\alpha-f similarly forces ∫Ef dμ≤αμ(E)\int_E f\,d\mu\le\alpha\mu(E); since α<β\alpha<\beta and μ(E)>0\mu(E)>0 these contradict each other. Hence f∗=f∗f^*=f_* almost everywhere, so the limit fˉ(x)=lim⁡nSnf(x)/n\bar f(x)=\lim_n S_nf(x)/n exists a.e. and is TT-invariant.

Step 4 (matching the integrals, and the ergodic case). A dominated-convergence argument (truncating ff and controlling the tails using the maximal inequality again) shows ∫Xfˉ dμ=∫Xf dμ\int_X \bar f\,d\mu = \int_X f\,d\mu. Finally, if TT is ergodic, the TT-invariant function fˉ\bar f must be constant almost everywhere (by the very definition of ergodicity applied to its level sets {fˉ≤c}\{\bar f\le c\}, each of which is TT-invariant and hence has measure 00 or 11); combined with the equality of integrals, that constant must be ∫Xf dμ\int_X f\,d\mu, giving fˉ(x)=∫Xf dμ a.e.\bar f(x)=\int_X f\,d\mu\ \text{a.e.}.

Topics that use this theorem

Step-by-step proofs

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

References

  1. Peter Walters (1982). An Introduction to Ergodic Theory
  2. George D. Birkhoff (1931). Proof of the Ergodic Theorem
  3. John von Neumann (1932). Proof of the Quasi-Ergodic Hypothesis
  4. Hillel Furstenberg (1981). Recurrence in Ergodic Theory and Combinatorial Number Theory