Ergodicity

We are studying measurable and mesaure preserving maps T:XX where (X,B,μ) is a fixed probability space. At the end of the last section we proved the Poincaré recurrence theorem. It tells us that whenever μ(B)>0 one has μ(B(Tn)1(B))>0 for some nN.

Invariant subsets

It is then reasonable to ask the following question: given disjoint sets A,BB with μ(A)>0 and μ(B)>0 do we always have μ(A(Tn)1B)>0 for some nN?

Let us imagine for the moment that the answer is "no". It must then be the case that the set A(nN(Tn)1B) has zero measure. Now the set C=nN(Tn)1B satisfies T1(C)C. Since μ(T1(C))=C we see that Y=jN(Tj)1C=jNn>j(Tn)1(B) has positive measure equal to μ(C). Moreover, if xY then T(x)Y as well. We therefore have within X a set Y of positive measure but not full measure that the dynamics never escapes. We could therefore study dynamics on Y in isolation.

It is therefore necessary, if the answer to the above question is "yes", for almost all points in X to go "almost everywhere" in the sense that they visit every set of positive measure. This amounts to indecomposability in the sense that X cannot be broken up into pieces that are themselves measure-preserving systems.

Just as one first works, for example, with group representations that are irreducible, we will prefer to avoid the situation where our dynamical system has intermediate invariant subsystems. This leads us to the following definition.

Definition (Ergodicity)

A measure-preserving transformation T on a probability space (X,B,μ) is ergodic if μ(B)>0μ(nN(Tn)1B)=1 for every BB.

It is convenient to rephrase the definition in the following form.

Theorem

A measure-preserving transformation T on a probability space (X,B,μ) is ergodic if and only if B=T1(B)μ(B){0,1} for every BB.

Irrational rotations

Fix α irrational. Take X=[0,1) and define T(x)=x+αmod1 for all x[0,1). Write λ for the restriction of Lebesgue measure to [0,1). We will prove that (X,B,λ,T) is ergodic.

Theorem

The system (X,B,λ,T) is ergodic.

Proof:

Fix BB with T1(B)=B and λ(B)>0. First we check that λ(IB)=λ(B)λ(I) for every interval I=[a,b). But λ(IB)=1I1Bdλ=1Nn=1N1IT1Bdλ=limN1Nn=1N1I(Tnx)1B(x)dλ(x)=λ(I)λ(B) by the dominated convergence theorem and the uniform distribution theorem.

Now define ν(E)=λ(BE)λ(B) for all EB. This is a measure on B and, by the previous paragraph, we have ν(I)=λ(I) for all intervals I=[a,b). But then the π−λ theorem tells us that ν=λ. Thus λ(B)=ν(B)=λ(B)λ(B)=1 as desired.

Full shifts

Take X={0,1}N and let T:XX be the shift map. Put μ=12δa+12δb where a=00000000000000b=11111111111111 are the constant sequences in X. With respect to μ the map T measure-preserving because T(a)=a and T(b)=b. However, it is not ergodic. Indeed, the sets [0] and [1] are T invariant but both have measure 0<12<1.

Next, let us look at the measures μp for 0p1 fixed. Let BB be a T-invariant set. We have μ(B[1])=limN1Nn=1Nμ(B(Tn)1[1])=limN1B1Nn=1N1(Tn)1[1]dμ=1B1NlimNn=1N1(Tn)1[1]dμ=p1Bdμ=μ([1])μ(B) by the strong law of large numbers and the dominated convergence theorem. In fact, by a strengthening of the strong law of large numbers it is the case that μ(BC)=μ(B)μ(C) for every cylinder set C. It is therefore the case that the measure ν(C)=ν(BC)ν(B) agrees with μp on every cylinder set. The π-𝜆 theorem then guarantees μp=ν so μp(B)=1.