The ergodic theorem

In this section we will prove the pointwise ergodic theorem for ergodic transformations. A crucial ingredient in its proof is the maximal ergodic theorem, which is concerned with the maximum value Mf(x)=sup{1Nn=0N1f(Tnx):NN} of the ergodic averages of a function f:XR.

Theorem (Maximal ergodic theorem)

Let (X,B,μ) be a probability space. Fix a measure-preserving map T:XX and fix f:XR measurable and integrable. Then 1{Mf>λ}(fλ)dμ0 for every λR.

Proof:

Fix λR. We will first prove this in the case that f is bounded, say |f(x)|K for all xX. Fix RN and write Mf,R(x)=max{1Nn=0N1f(Tnx):1NR} for all xX. Put E(R)={xX:Mf,R(x)λ} and let us analyse for each xX the sum n=0P11E(R)(Tnx)(f(Tnx)λ) for PN which we imagine is much larger than N. Whenever Tn(x) is outside E(R) the summand has the value zero. If Tj(x) is not in E(R) and Tj+1(x) is in E(R) then we must have f(Tj+1x)++f(Tj+rx)rλ for some 1rR by definition of Mf,R. But this means that the portion n=j+1j+r1E(R)(Tnx)(f(Tnx)λ) of the above sum is non-negative. Indeed 1E(R)(x)(f(x)λ)f(x)λ holds for all xX because points x outwith E(R) satisfy f(x)λ.

The long sum n=0P11E(R)(Tnx)(f(Tnx)λ) is therefore no smaller than n=PRP11E(R)(Tnx)(f(Tnx)λ) because any good portion has length at most R and any full portion has a non-negative summation. Now |n=PRP11E(R)(Tnx)(f(Tnx)λ)|R(K+λ) so n=0P11E(R)(Tnx)(f(Tnx)λ)R(K+λ) and we can integrate both sides to get R(K+λ)P1E(R)(fλ)dμ because μ is T invariant. Dividing by P and noting that PN was arbitrary gives 01E(R)(fλ)dμ and we may then apply the dominated convergence theorem to take the limit as R obtaining 01{Mf>λ}(fλ)dμ as desired.

It remains to deduce the result without the assumption that f is bounded. Given any measurable and integrable function f:XR define for each KN the function ϕK=f1Q(K) where Q(K)={xX:|f(x)|K}. The sequence ϕK(x) converges pointwise to f(x) and one can apply the dominated convergence theorem to finish.

Theorem (Pointwise ergodic theorem)

Let (X,B,μ) be a probability space. Fix a measure-preserving map T:XX that is ergodic. For every measurable and integrable function f:XR there is a set ΩB with μ(Ω)=1 and limN1Nn=0N1f(Tn(x))=fdμ for all xΩ.

Proof:

Fix f:XR measurable and integrable. Since we do not know whether the limit of the sequence N1Nn=0N1f(Tn(x)) exists we will work with its limits superior and inferior. Our goal is to prove for every kN that the set B(k)={xX:lim supN1Nn=0N1f(Tnx)>fdμ+1k} has zero measure. Indeed, if that is the case then μ(XkNB(k))=1 and we have lim supN1Nn=0N1f(Tn(x))fdμ for almost every xX. Repeating the above argument with f in place of f then gives fdμlim infN1Nn=0N1f(Tn(x)) for almost every xX as well and concludes the proof.

Fix kN and suppose that B(k) has positive measure. The set B(k) is T invariant. Indeed |1Nn=0N1f(Tnx)1Nn=0N1f(Tn(Tx))||f(x)|+|f(TNx)|N so it suffices to prove that {xX:|f(TNx)|N0} has zero measure. Fix ϵ>0. The set A(N)={xX:|f(TNx)|Nϵ} has measure equal to that of {xX:|f(x)|Nϵ} because μ is T invariant. But N=1ϵμ(A(N))|f|dμ so the set of points x that belong to infinitely many of the sets A(N) has zero measure by the Borel-Cantelli lemma. In other words, almost every xX has the property that |f(TNx)|N0 and therefore μ(B(k)T1B(k))=0 holds. Ergodicity then forces μ(B(k))=1.

We are looking for a contradiction to μ(B(k))=1. The crucial quantity to consider is the maximum value Mf(x)=sup{1Nn=0N1f(Tnx):NN} of the ergodic averages. Note that B(k){xX:Mf(x)fdμ+1k} because the supremum of the values of a sequence cannot be smaller than its limit superior. Thus the set C(k)={xX:Mf(x)fdμ+1k} also has μ(C(k))=1. The crucial ingredient now is the inequality 1C(k)(ffdμ1k)dμ0 which is a special case of the maximal ergodic theorem. If we have this inequality then, as C(k) has full measure, we conclude that 0ffdμ1kdμ=1k which is the desired contradiction.