Absolutely normal number 2026-10-05
An absolutely normal number is a normal number in every integer base . The Birkhoff ergodic theorem and ergodicity of integer multiplication on the circle, followed by a countable intersection of full-measure sets, show that almost every real number is absolutely normal.
Apply the Birkhoff ergodic theorem to a countable generating algebra, and disintegrate the resulting common full-measure convergence set over the invariant sigma-algebra. The orbit limits on a fiber are its conditional masses. Applying the theorem to that invariant component shows its invariant projection is constant on all generating indicators, hence on all functions by density. This proves ergodicity without an uncountable intersection of null sets.
A stationary path law is ergodic when every time-shift-invariant event has probability zero or one. The Birkhoff ergodic theorem then identifies integrable time averages with deterministic ensemble expectations. A shared random scale multiplying iid noise gives a stationary counterexample: it is uncorrelated across distinct times, but the path retains information about the random scale.
Everywhere interval frequency under an irrational rotation Created 2026-09-24 Updated 2026-09-28
Every orbit of an irrational rotation of the circle visits a half-open interval with limiting frequency equal to its length. One proof sandwiches the orbit of an arbitrary point between inner and outer intervals along a nearby orbit for which the Birkhoff ergodic theorem holds.
On a finite measure space, the convergence in the Birkhoff ergodic theorem also holds in . Prove it first for bounded truncations by the dominated convergence theorem, then use the contraction and Fatou lemma to remove the truncation.
Use probability measure-preserving systems: is measurable and . Its invariant sigma-algebra is
Ergodicity means that every invariant measurable set has measure zero or one:
Equivalently, every invariant measurable function is constant almost everywhere. Indeed all rational sublevel sets of a real invariant function belong to , so the zero-or-one alternative forces its distribution to concentrate at one value. Apply this to real and imaginary parts for complex functions. Conversely, an invariant set has an invariant indicator, so the function criterion implies the set criterion. This is the invariant-function characterization of ergodicity.
For an irrational rotation of the circle, with , an invariant has Fourier coefficients satisfying
For the multiplier is nonzero. Completeness of the Fourier series basis therefore makes constant. Apply this to an invariant indicator to prove the irrational rotation is ergodic. A second example is the cyclic permutation of points with equal masses: a nonempty invariant set contains the whole cycle and hence has measure one.
The identity on with Lebesgue measure is not ergodic, since is invariant and has measure . Nor is rotation by on the circle: the set
is invariant and has measure . These examples also show why preservation of measure does not imply ergodicity.
Let be the Koopman operator, , and set
The Von Neumann mean ergodic theorem says that, for , these Cesaro averages converge in to the orthogonal projection onto the invariant functions:
For an invertible system, is a unitary operator. The Hilbert-space theorem states more generally that the Cesaro averages of any unitary operator converge strongly to its fixed-space projection.
Here is the requested invertible-case proof. Since ,
Thus the orthogonal decomposition for unitary ergodic averages is
On the first summand, . On a vector , telescoping gives
Because , approximation extends this convergence to the closure of the range. The orthogonal decomposition now proves the theorem for every . An invariant function is -measurable, and an -measurable function is invariant by approximation with indicators; hence the projection is the stated conditional expectation.
In an ergodic system, invariant functions are constants by the criterion already proved. Their orthogonal projection is obtained by taking the inner product with , whose norm is one. Therefore the ergodic limit is the space average:
The Birkhoff ergodic theorem states that, for ,
The limit is invariant, integrable, and has the same integral as . On a probability space convergence also holds in . In an ergodic system the limit is almost everywhere.
For the topological sharpening, take a continuous map on a compact metric space. Unique ergodicity means there is exactly one invariant Borel probability measure . The uniform ergodic convergence for uniquely ergodic systems says that every continuous real or complex satisfies
Thus convergence holds at every point and uniformly in that point. The continuity, compactness and continuous-observable hypotheses belong to this theorem; it is not a claim of uniform convergence for all measurable functions.
Use a standard Borel probability space so that conditional measures can be realized by measures. The disintegration theorem for a probability measure states the following. For a measurable map between standard Borel spaces and , there is a measurable probability kernel , unique for -almost every , such that
Measurability means is measurable for every Borel set . More generally
for integrable , with equality of the last expression almost everywhere. The are the conditional measures of a factor. This also defines conditional measures for a countably generated sub-sigma-algebra, or a measurable partition represented by such a map. Sigma-algebras are considered modulo null sets where necessary.
For an invariant probability measure, disintegrate over the invariant sigma-algebra . On a standard probability space it can be represented, modulo null sets, by a countably generated measurable factor . One justification for this countability is the separability of : a countable dense family of -measurable functions generates modulo null sets. The resulting conditional measures are the ergodic components:
Their invariance is one of the permitted facts. It remains to prove that almost every component is ergodic, rather than simply invariant.
Choose a countable generating algebra generating the Borel sigma-algebra of . Apply the Birkhoff ergodic theorem simultaneously to its indicators. For -almost every and all ,
Disintegration transfers this common full-measure set to -almost every , for -almost every . On that fiber the conditional expectation is constant and equals . Thus, simultaneously for every ,
Fix such a , for which is also invariant. Applying the Birkhoff ergodic theorem to the system with measure identifies these limits with
Finite linear combinations of the algebra's indicators are dense in , by the Monotone class theorem. Since conditional expectation is an contraction, its projection onto invariant functions consequently sends every function to its constant integral. In particular, for any -invariant set ,
and so . This proves almost every component is ergodic. The countable-test proof of ergodicity of conditional components avoids taking an invalid intersection of uncountably many full-measure sets.
For rotation by , take the quotient map . Its fibers are exactly the five-point orbits. The ergodic components of a rational circle rotation are therefore
Equivalently the component through is . To check the disintegration, for bounded measurable use the change of variables on the five consecutive fifth-intervals:
The rotation cyclically permutes the five atoms, preserving their equal masses. A set invariant modulo must contain all or none of this finite orbit, since every atom has positive mass. Thus each is ergodic. Finally, the invariant sigma-algebra is the pullback under : a function invariant under translation by is constant on each orbit and is a measurable function of . This confirms that these are the conditional measures over , not merely some decomposition into invariant measures.
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 .
A continuous transformation of a compact metric space is uniquely ergodic when there is exactly one -invariant Borel probability measure on . We use the usual compact-space convention for unique ergodicity; the compactness and continuity hypotheses matter in the assertion about all starting points.
Let on the circle group, with irrational. Normalized Lebesgue measure is invariant under this irrational rotation of the circle. If is any invariant Borel probability measure, define its Fourier coefficients by . Invariance gives
For , irrationality makes , so ; also . These are the Fourier coefficients of . Hence and have the same integrals against every trigonometric polynomial. Such polynomials are uniformly dense in the continuous functions by the Stone-Weierstrass theorem, so the measures agree on every continuous test function and therefore agree as Borel measures. Thus
For the general uniquely ergodic system, fix and form the empirical measures
On a compact metric space, the Borel probability measures are compact for weak convergence of probability measures. Any subsequential limit is invariant: for every continuous ,
Here is bounded and is continuous, so the identity passes to the limit. Uniqueness of the invariant Borel probability measure gives . Every subsequential limit is therefore , and compactness implies convergence of the entire sequence. Testing against proves
In fact this proves uniform ergodic convergence for uniquely ergodic systems: if convergence were not uniform in , choose and where the discrepancy stays above a fixed positive number. The same compactness and telescoping argument applied to forces a subsequence to converge to , a contradiction. This also makes clear why an almost-everywhere Birkhoff ergodic theorem alone would not establish the requested everywhere assertion. Without the compact-space hypothesis the assertion need not hold: on the discrete space , set and . The only invariant probability is , but the continuous bounded function which is zero at and one on the integer orbit has orbit average one there.
For the decimal application put . This is irrational: if with positive integers , then , contradicting unique prime factorization. Writing with and gives . Its leading decimal digit is seven exactly when
The half-open upper endpoint correctly excludes powers whose leading digit is eight, including .
The indicator of is not continuous, so an extra step is needed. For any , choose continuous functions on the circle with and , by tapering in small neighbourhoods of the two endpoints. Applying the everywhere averaging result to these functions traps the lower and upper limits of the interval frequency between their integrals. Letting proves everywhere interval frequency under an irrational rotation. Consequently
This is the leading-seven case of Benford frequencies for powers of an integer.
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
Let denote the join of measurable partitions recording the first observations, and set , with . The entropy of a countable measurable partition is , using natural logarithms and . Null atoms can be discarded. Throughout, is a probability measure.
The stronger property needed for monotonicity of normalized block entropy is that its increments decrease. Define
Since conditioning reduces entropy, . The conditional entropy chain rule and measure preservation give
It follows that , and consequently
This uses stationarity as well as the entropy chain rule; subadditivity alone would not establish monotonicity of every successive ratio.
The entropy rate of a measurable partition and the Kolmogorov-Sinai entropy are, respectively,
One may equivalently take the supremum over countable finite-entropy measurable partitions.
The Shannon-McMillan-Breiman theorem states that for a countable measurable partition with , the normalized information
converges almost everywhere and in to a invariant function with integral . Here is the atom containing . If is an ergodic transformation, then almost everywhere. We prove the general form, including an explicit formula for its limit.
Let be the sigma-algebra generated by , let be trivial, and put . For every atom , the probabilities
form a bounded conditional-expectation martingale. The Martingale convergence theorem gives almost everywhere and in . Each of these probabilities is positive almost everywhere on : for example, integrating over the measurable set gives zero. Countability of lets us choose a common full-measure set for every atom.
The conditional information functions
therefore converge almost everywhere to . We need an integrable bound on this sequence; convergence of the probabilities alone would not supply one after taking logarithms. The allowed maximal inequality for conditional information functions gives, for ,
Combining this with the bound by and the tail integral formula for moments yields
Thus , and the dominated convergence theorem gives in . In particular,
because is the average of the decreasing sequence .
The information chain rule, applied from the final observation backwards, gives the exact identity
Indeed, the symbol at time is conditioned on times ; pulling that conditional probability back by gives . Measure preservation is sufficient for this pullback identity.
We now prove the required triangular ergodic averaging lemma in this instance. Put . Then almost everywhere, , and . Split the difference between the displayed triangular sum and . Terms whose index is at least are bounded by . The remaining terms are at most
After division by , each of these finitely many end terms tends to zero almost everywhere by the linear growth bound for integrable observables proved in Question 1. Applying the Birkhoff ergodic theorem to , for every fixed , therefore gives
These conditional expectations decrease to zero almost everywhere: they decrease, and their integrals tend to zero. Letting , then applying the Birkhoff ergodic theorem to , proves
For convergence, measure preservation gives the direct estimate
Combine this with convergence of the ergodic averages of . Finally, . In the ergodic case the invariant sigma-algebra is trivial, completing the familiar form of the theorem: