Birkhoff ergodic theorem Created 2026-09-24 Updated 2026-10-03
For a measure-preserving transformation and , the ergodic averages
converge almost everywhere to , the conditional expectation on the invariant sigma-algebra. The limit has the same integral as .
Chacon transformation 2026-10-05
The standard three-cut Chacon transformation is an invertible measure-preserving transformation built by cutting and stacking with spacer vector at every stage. Cut the current tower into three equal subcolumns, place one spacer above the middle, and stack left to right. With initial width and height one on a unit interval, level counts and widths are and . Tower measure tends to one, using total spacer measure . Tower words obey .
Cutting and stacking 2026-10-05
Cutting and stacking constructs measure-preserving transformations from towers of equal-measure levels. Cut a tower into equal-width subcolumns, add new spacer levels, and stack the resulting columns. Map each level to the one above by a measure-preserving identification; subsequent stages extend the partial map. When uncovered and top-level measures tend to zero, the limiting map is defined modulo null sets.
A probability measure-preserving transformation is strong mixing exactly when for every measurable . The converse follows by applying decay of autocorrelation implies weak convergence of an observable to and then testing against . Diagonal polarization alone controls a sum of the two directed cross-correlations and does not suffice as a proof.
Ergodicity 2026-10-14
A measure-preserving transformation is ergodic when every set in its invariant sigma-algebra has measure zero or full measure. Equivalently, every integrable invariant function is almost everywhere constant.
Ergodic theory Created 2026-09-24 Updated 2026-10-14
Ergodic theory studies the long-time statistical behaviour of measure-preserving transformations.
Let be a measure-preserving transformation of a probability space and an integrable random variable. If the displayed duality holds for every bounded random variable , test it on indicator functions to identify . The measure-preserving transformation gives the same probability distribution to and . The principle of conditional expectation preserving a distribution then forces equality almost surely. This does not require an inverse for or require to be square-integrable.
The join is the common refinement of two measurable partitions, with atoms given by their nonempty intersections. For a measure-preserving transformation, the block partition is .
Maximal ergodic lemma Created 2026-10-05 Updated 2026-10-06
For a measure-preserving transformation and real integrable , let . For the lemma asserts . Passing to the increasing union gives the corresponding infinite-supremum inequality.
Let be a probability space, let be a measure-preserving transformation, and let . The Birkhoff ergodic theorem asserts that
for almost every , where is the invariant sigma-algebra. The limit is integrable, satisfies almost everywhere, and has . On a probability space the convergence also holds in . No invertibility of is required.
If is ergodic, its invariant sigma-algebra is trivial modulo null sets, so its conditional expectation is constant. In that case the concise form is
Outside the countable set of dyadic rational numbers, the binary expansion is unique. Multiplication by two modulo one deletes the first binary digit, so
Let . By part (b), the doubling map is a measure-preserving transformation and is ergodic for Lebesgue measure. Applying the Birkhoff ergodic theorem to this indicator function gives
for almost every . The dyadic rationals have Lebesgue measure zero, so the choice of their two possible binary expansions does not affect the conclusion. Thus the limiting frequency of the digit one is almost everywhere.
A measurable set is invariant when , or modulo a null set in the measure-theoretic version. A measurable function is invariant when , similarly almost everywhere if appropriate. The map is a measure-preserving transformation when for every measurable set. A measure-preserving map is ergodic when every invariant measurable set has measure zero or has null complement. On a finite positive measure space, normalize the measure to obtain the equivalent probability-space definition.
For a probability measure-preserving system, ergodicity means that every measurable set satisfying modulo null sets has measure zero or one. Equivalently, the only invariant functions are almost everywhere constant. The pointwise ergodic theorem states that, for ,
where is the invariant sigma-algebra; on a probability space the convergence also holds in . For an ergodic transformation, the limit is the constant .
For the Gauss continued-fraction map, the Gauss measure is the probability measure
Its density integrates to one and is bounded above and below by positive constants, so it has the same null sets as Lebesgue measure. Apart from countably many endpoints, the inverse branches are , . For a bounded measurable test function , substitution on each branch gives
Thus is a measure-preserving transformation. Its definition at zero and the rational branch endpoints does not affect these identities.
For ergodicity, we give the full shrinking-cylinder argument. A digit cylinder with first partial quotients is an interval , where and is the identity. The continued fraction convergents give
Here after the initial step, and the recurrence makes tend to infinity at least at the Fibonacci rate. Hence the nested cylinders of every irrational point shrink to that point. The bounded distortion of continued-fraction cylinders is uniform: the ratio of the largest to the smallest value of is at most four. Since ranges between and , the density
has maximum-to-minimum ratio at most eight. Consequently every measurable satisfies
The last inequality uses .
Now suppose modulo null sets and . Choose an irrational density point , and let be its successive digit cylinders. The Lebesgue density theorem applies to these intervals even though they need not be centered: an interval of length containing lies in the centered interval of radius , so its relative complement tends to zero. Comparability of the two densities then gives
But invariance gives almost everywhere for each inverse branch of . Pulling the exceptional null sets through is legitimate since has a positive smooth Jacobian on this fixed branch. Thus the distortion estimate with gives
Letting forces . Therefore the Gauss continued-fraction map is ergodic for the Gauss measure.
For an irrational , the successive continued fraction digits satisfy . The event that a digit equals two is the interval , up to null endpoints. Apply the pointwise ergodic theorem to its indicator:
This holds for almost every with respect to both the Gauss measure and Lebesgue measure, since they have the same null sets.
A measure-preserving transformation is a measurable map satisfying for every measurable . An invariant set satisfies (or equality modulo null sets, in the measure-theoretic convention).
Preimages preserve complements and countable unions. Therefore the whole space is invariant, the complement of an invariant set is invariant, and a countable union of invariant sets is invariant. Thus the invariant sets form a -algebra. The same proof works modulo null sets because a countable union of null exceptional sets is null.
Work with a probability measure-preserving system, so . Put
The maximal ergodic theorem, also called the maximal ergodic lemma, says that for real ,
No ergodic transformation or invertibility assumption is needed for this maximal ergodic lemma.
Here is a proof of the maximal ergodic lemma. Set and . These are integrable: . Splitting off the first summand gives
On , this implies . Outside the right side is . Consequently
Integrating and using the measure-preserving transformation property gives . Since increases to , the dominated convergence theorem, with dominating function , proves the infinite-supremum assertion of the maximal ergodic lemma.
For example, applying the maximal ergodic lemma to yields the useful maximal bound
Indeed on the latter set , the maximal ergodic lemma gives .
The pointwise ergodic theorem states that for a probability measure-preserving system and ,
where is the invariant sigma-algebra. The conditional expectation is invariant and has integral . If is an ergodic transformation, this conditional expectation is the constant . The assertion applies to real or complex integrable functions; it is the Birkhoff ergodic theorem.
For a nonnegative measurable , if , the pointwise ergodic theorem already proves the required conclusion. For the remaining case, let , . Each is integrable on the probability measure-preserving system. The pointwise ergodic theorem and ergodic transformation property give, on a single set of full measure obtained by a countable intersection,
Since , every such satisfies for all . The monotone convergence theorem gives . Thus the nonnegative ergodic averages with infinite integral tend to , rather than merely having an unbounded subsequence. Combining the two cases,
Nonnegativity is what makes truncation a lower bound. The probability normalization is also essential to the displayed value: for a finite measure of total mass , the corresponding constant is .
For a probability measure-preserving system, strong mixing means that for every pair of measurable sets ,
A sequence has convergence in density of a sequence to when for each the exceptional set has natural density zero. A weakly mixing measure-preserving transformation has convergence in density of to for every . Equivalently, because these correlations are bounded,
Indeed the mean of the absolute discrepancy is at least times the exceptional frequency, while it is at most plus a uniform bound times that frequency. A signed Cesaro convergence of a sequence without absolute values is insufficient to define weak mixing.
The standard three-cut Chacon map is obtained by cutting and stacking. Start on with normalized Lebesgue measure, an initial tower consisting of , and a reservoir for spacers. At stage , cut every level of the current tower into three equal subintervals, producing three subcolumns. Add one new interval of the same width above the middle subcolumn. Stack the first subcolumn at the bottom, then the middle subcolumn with its spacer, then the third at the top. Define the partial transformation by translation from each level to the next, leaving the current top unmapped. These assignments extend the earlier partial transformation. Repeat indefinitely.
If is the number of levels and their width, then
Hence , , and the stage- tower has measure . The spacers consume total measure , precisely the reservoir. The increasing partial maps give the Chacon map modulo null sets. The tower tops and unused reservoir have measures tending to zero, and the construction yields an invertible measure-preserving transformation. With marking an original level and a spacer, the tower words satisfy and , so the first new word is . This describes the spacer placement without needing a proof of well-definedness. The three-cut convention agrees with the classical constant spacer vector described in Ryzhikov's construction.
For the correlation assertion, take the L2 inner product to be , linear in its first argument, and put . The Koopman operator is an isometry on , even when is not invertible. For the hint gives
To extend rigorously to all test functions, centre the observable: . Invariance of the integral gives . Let
For each fixed , by the same isometry identity. Therefore the limit is zero for every finite linear combination of these orbit vectors. By the Cauchy-Schwarz inequality and , approximation extends this conclusion to every : the approximation error in the correlation is bounded by uniformly in . For , the correlation is identically zero because . The orthogonal decomposition by a closed subspace now gives the result for all . Thus
This is decay of autocorrelation implies weak convergence of an observable; no assumption that is an ergodic transformation, and no invertibility hypothesis was used, and is included.
Finally, strong mixing immediately implies the stated diagonal limit by taking . Conversely, suppose that limit holds for every . Apply the correlation result with and . Its hypothesis is exactly , and its conclusion is
Hence strong mixing is equivalent to diagonal set-correlation criterion for mixing. Using the orbit-span proof avoids an invalid polarization argument that would recover only the sum of the two directed cross-correlations from diagonal correlations.
The Birkhoff ergodic theorem states: for a measure-preserving transformation of a finite measure space and , the averages converge almost everywhere and in to an invariant function . On a probability space,
where is the invariant sigma-algebra modulo null sets. In particular the integral is preserved, and if is ergodic then almost everywhere; for a finite space of nonunit mass, this constant is when .
The maximal ergodic lemma says that for real integrable , with and ,
The same inequality holds on , by taking the increasing limit and dominated convergence. These statements do not require the transformation to be invertible or the space to be ergodic.
Use the probability-system convention . The Birkhoff ergodic theorem, also called the pointwise ergodic theorem, states that for a measure-preserving system and ,
where is the invariant sigma-algebra. The limit is integrable and has the same integral as . On a probability space the convergence also holds in , as in the allowed mean ergodic theorem. If is an ergodic transformation, is trivial modulo null sets, giving
The integer multiplication map on the circle preserves Lebesgue measure: for any integrable on ,
To prove the ergodicity of integer multiplication on the circle, suppose satisfies . Let be its Fourier coefficients in the Fourier basis . Since , the Fourier coefficients of at index are zero if does not divide , and are otherwise. This identity holds for all functions by approximation with trigonometric polynomials and the isometry . Invariance gives
Every nonzero integer can be divided by only finitely often. Thus for every , and completeness of the Fourier basis makes constant almost everywhere. Applying this to the indicator function of an invariant set gives measure zero or one, so
A normal number in base has every word of base- digits occurring with limiting overlapping frequency . Use the expansion that is not eventually equal to when there are two expansions. The word corresponds to the half-open interval
A word starting at position occurs exactly when . The Birkhoff ergodic theorem, applied to , gives frequency almost everywhere. There are countably many pairs , so their full-measure sets have a full-measure intersection. In particular,
These are absolutely normal numbers, so existence follows as well. This interval description also proves normality and equidistribution under integer multiplication: the base- intervals form arbitrarily fine grids, so their frequencies imply the correct frequency for every interval by approximation from inside and outside.
For the growth assertion, put . For every , the Tonelli theorem gives the useful summability bound
Since is a measure-preserving transformation, . The first Borel-Cantelli lemma shows that occurs only finitely often almost everywhere. Intersecting the resulting full-measure sets for proves the linear growth bound for integrable observables, . Multiplication by then gives
The threshold is sharp. For , choose with , and take the Bernoulli shift on with the product measure of independent uniform coordinates. The left shift preserves that measure because it preserves the probability of every finite-coordinate event. Define ; it is integrable because
The variables are independent. For any fixed ,
The probability sum diverges, so the second Borel-Cantelli lemma makes these events occur infinitely often almost surely. Intersecting over positive integer even yields . For , the constant observable already fails to give limit zero. Thus the sharpness of the linear growth bound for integrable observables gives
A probability measure is -invariant when
Equivalently, the pushforward measure satisfies , so is a measure-preserving transformation.