Ergodic theory (source code)

= Ergodic theory
{wiki}

<Ergodic theory> studies the long-time statistical behavior of <measure-preserving systems>. A point follows a deterministic orbit $x,Tx,T^2x,\ldots$, while an <invariant measure> describes how an ensemble of points is distributed. For an integrable observable $f$ on a <probability space>, the basic question is what the time averages
$$
A_Nf(x)=\frac1N\sum_{j=0}^{N-1}f(T^jx)
$$
reveal about the spatial average $\int f\,d\mu$. The <Birkhoff ergodic theorem> gives almost-everywhere convergence; <ergodicity> makes the limit the same spatial average for almost every starting point.<254A: Topics in Ergodic Theory by Terence Tao>[Lecture9, Theorems2–3, pointwise averages and ergodicity]{ref}

For example, let $X=\{0,1\}$ with equal probabilities and $T$ exchange the two points. For $f(x)=x$, every orbit average tends to $1/2$, and the system is <ergodic>. Yet it is not <strong mixing>: with $A=\{0\}$, $\mu(T^{-n}A\cap A)$ alternates between $1/2$ and zero rather than tending to $\mu(A)^2=1/4$. Thus agreement of long-time averages does not require loss of every time correlation.

The <Koopman operator> translates these questions into <linear operator> language, and <entropy rate of a measurable partition> quantifies how much information an orbit reveals per step. <Poincaré recurrence theorem> concerns returns of individual trajectories, while <Furstenberg multiple recurrence theorem> connects simultaneous returns to <arithmetic progressions>. These are distinct ways of extracting structure from a deterministic evolution.