Birkhoff’s pointwise ergodic theorem
Identify almost-everywhere time averages with conditional expectations on invariant information, rather than assuming a global constant.
On this page
The question for today
What you’ll understand
- State Birkhoff's probability-preserving L1 theorem precisely.
- Identify the limit using the invariant sigma-algebra.
- Compute different time averages on separate finite invariant components.
Recurrence says that a trajectory returns, while an ergodic theorem asks how often it visits and how observations average over time. Birkhoff's theorem supplies an almost-everywhere limit for every integrable observable in a probability-preserving system. The limit need not be the observable's global mean. It is the conditional expectation given invariant information, and becomes a constant only when the system is ergodic. This distinction turns the phrase time average equals space average into an exact theorem with identifiable hypotheses.
Average an observable along one forward orbit
For an integrable real or complex observable, average its values at the first N nonnegative iterates, starting at time zero. Birkhoff's theorem says these averages converge almost everywhere and in L1 on a probability-preserving system. No inverse transformation or independence assumption is needed for this forward theorem. Integrability is essential to this stated version: merely being measurable does not control rare large observations. The exceptional null set can depend on the observable, so convergence for each integrable function is not automatically a simultaneous assertion about all functions on every point.
The limiting function is invariant up to null sets. One intuition is that shifting the starting position changes only the first and last terms of a long average. Turning that intuition into a pointwise proof for an unbounded integrable function requires control of those boundary terms and a maximal argument; it is not justified simply by saying two terms divided by N vanish. We invoke the full pointwise theorem and use exact periodic examples to inspect what its invariant limit means.
Invariant information survives averaging
An event is invariant modulo null sets when pulling it back by T changes it only on a null set. These events form the invariant sigma-algebra. Its measurable observables cannot change along typical trajectories, so averaging cannot remove their component information. The theorem identifies the time-average limit by integrating it against every invariant event: its integral there equals the original observable's integral. These are exactly the defining identities for conditional expectation on the invariant sigma-algebra.
Ergodicity means every invariant event has probability zero or one. Then every integrable invariant function is almost surely constant, and its preserved integral forces that constant to be the global mean. If ergodicity fails, different invariant regions can have different means, even when all orbits are perfectly periodic and every average converges. A global distribution over starting states mixes these regions; a single trajectory retains the information specifying its own region and generally cannot reproduce the mixture's average.
Frequencies are averages of indicators
For the indicator of an event, the time average is its empirical visit frequency. In an ergodic probability system, that frequency equals the event's probability for almost every starting state. In a nonergodic system it equals the invariant conditional probability of the event, which can vary across components. This is much stronger than infinitely many returns, but still gives no general finite-N convergence rate. Very slow averages are compatible with the qualitative theorem.
The finite-probability setting must remain explicit. A finite nonzero invariant measure can be normalized before applying the theorem, while an infinite measure cannot be normalized this way. In infinite-measure dynamics one needs other formulations and sometimes different normalizations, rather than a conditional probability expectation copied from the probability case. Similarly, pointwise convergence of orbit averages should not be confused with convergence of distributions or with decorrelation: an ergodic periodic cycle has correct time averages and nevertheless retains periodic correlations forever.
Work it through
Two invariant component averages
Use uniform probability on six residues, , and observable values . Find the pointwise limit and the eight-term average starting at zero.
On the even cycle the values are , with mean two. On the odd cycle they are , with mean one. Thus the invariant conditional expectation is two on even states and one on odd states.
The global mean is . It differs from both component limits because the uniform law assigns probability one half to each cycle.
Starting at zero, eight observations contain two complete cycles plus the values two and five. Their sum is , giving average . The periodic remainder vanishes after division by N, so the limit is two.
Every orbit average converges, but the limit is component dependent. Birkhoff predicts the invariant conditional mean, not the global three-halves mean on each trajectory.
The living notebook
Explore the model
Interactive lab · modular
Average only what the selected orbit visits
Pause and Reset; set both , predicting the even orbit from zero and average two for the worked observable. Reset and set both ; predict orbit , whose observable values two and four average three. Use Step to verify the residue lists and calculate the observable averages on paper. The instrument does not accept arbitrary observable values or prove Birkhoff convergence. Changing controls retains time; Reset clears both parameters and time.
- Residue r0
- 0
- Orbit period · m/gcd(m,a)
- 12
- Distinct residues visited
- 1 of 12
Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA time average uses the invariant region reached by the orbit, which can change when the transformation changes.
Pause & reason
Check your understanding
Your turn
Try it yourself
On one uniform five-cycle with , let . Find the long-time average and the seven-term average starting from zero. State what changes if the space also contains another disjoint cycle with a different observable mean.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
A complete cycle contributes five to the sum; only the partial final cycle produces a finite-time discrepancy.
Compare with the solution
The single cycle is ergodic and its mean is one. Seven observations starting from zero sum to , so the finite average is and its limit is one. Adding a positive-mass disjoint cycle destroys whole-space ergodicity if both cycles retain positive mass. The limit on each cycle remains its own mean, and the invariant conditional expectation records those separate values.
Keep the idea
Take it with you
- Birkhoff applies to integrable forward observables on probability-preserving systems.
- The general limit is a conditional invariant expectation.
- Ergodicity makes the limit the global mean, with no universal convergence rate.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.