MathLabs
TheoremProved

Poincaré's recurrence theorem

Statement

Let TT be a measure-preserving transformation of a probability (or more generally finite-measure) space (X,F,μ)(X,\mathcal F,\mu) and let A∈FA\in\mathcal F with μ(A)>0\mu(A)>0. Then almost every point of AA returns to AA infinitely often: for almost every x∈Ax\in A, Tnx∈AT^nx\in A for infinitely many n≥1n\ge1.

Why is it true?

If space is finite and nothing is ever destroyed (measure-preservation), a region cannot keep sending points off to entirely new, never-before-visited territory forever — eventually the system has to start revisiting where it has already been, simply because there is nowhere new left to put the returning measure.

Proof sketch

Step 1 (points that never return). Let A0={x∈A:Tnx∉A ∀n≥1}A_0=\{x\in A: T^nx\notin A\ \forall n\ge1\} be the points of AA that never come back to AA. The sets A0,T−1A0,T−2A0,…A_0, T^{-1}A_0, T^{-2}A_0,\dots are pairwise disjoint: if x∈T−iA0∩T−jA0x\in T^{-i}A_0\cap T^{-j}A_0 with i<ji<j, then Tix∈A0T^ix\in A_0 but also Tjx=Tj−i(Tix)∈AT^j x = T^{j-i}(T^ix) \in A with j−i≥1j-i\ge1, contradicting that Tix∈A0T^ix\in A_0 never returns to AA. So T−iA0∩T−jA0=∅ (i≠j)T^{-i}A_0 \cap T^{-j}A_0=\varnothing\ (i\ne j).

Step 2 (the never-return set has measure zero). Since TT is measure-preserving, μ(A0)=μ(T−iA0)\mu(A_0)=\mu(T^{-i}A_0) for every ii. If μ(A0)>0\mu(A_0)>0, the countably many pairwise disjoint sets T−iA0T^{-i}A_0 (i=0,1,2,…i=0,1,2,\dots) would all have this same positive measure, so their union would have infinite total measure — impossible since μ(X)<∞\mu(X)<\infty (indeed μ(X)=1\mu(X)=1). Hence μ(A0)=0\mu(A_0)=0.

Step 3 (finitely-often visitors also have measure zero). Let B={x∈A:x returns to A only finitely often}B=\{x\in A: x\ \text{returns to}\ A\ \text{only finitely often}\}. Writing BB as a countable union over kk of (essentially) the never-return set of TkAT^kA under the shifted dynamics, B=⋃k≥0T−k{x∈TkA:x never returns to TkA}B=\bigcup_{k\ge0} T^{-k}\{x\in T^kA: x\ \text{never returns to}\ T^kA\}, each term has measure zero by exactly the Step 1–2 argument applied to TkAT^kA in place of AA (using μ(TkA)=μ(A)\mu(T^kA)=\mu(A)). By countable subadditivity, μ(B)=0\mu(B)=0.

Step 4 (conclusion). Every x∈A∖Bx\in A\setminus B (which has full measure in AA, since μ(B)=0\mu(B)=0) returns to AA infinitely often by definition of BB. This is exactly the statement of the theorem.

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