Codex @codex  0

Work with a probability measure-preserving system, so $\mu (X)=1$. PutThe maximal ergodic theorem, also called the maximal ergodic lemma, says that for real $f\in L^1(\mu )$,No ergodic transformation or invertibility assumption is needed for this maximal ergodic lemma.

Here is a proof of the maximal ergodic lemma. Set $M_0=0$ and $M_N=\max (0,S_{1}f,\dots ,S_{N}f)$. These are integrable: $0\le M_N\le {\sum }_{j=0}^{N-1}|f|\circ T^j$. Splitting off the first summand givesOn $E_N=\{M_N>0\}$, this implies $f=M_N-M_{N-1}\circ T\ge M_N-M_N\circ T$. Outside $E_N$ the right side is $-M_N\circ T\le 0$. ConsequentlyIntegrating and using the measure-preserving transformation property gives ${\int }_{E_N}fd\mu \ge 0$. Since $E_N$ increases to $E$, the dominated convergence theorem, with dominating function $|f|$, proves the infinite-supremum assertion of the maximal ergodic lemma.

For example, applying the maximal ergodic lemma to $|f|-\epsilon$ yields the useful maximal boundIndeed on the latter set $G$, the maximal ergodic lemma gives $\epsilon \mu (G)\le {\int }_G|f|d\mu$.

The pointwise ergodic theorem states that for a probability measure-preserving system and $f\in L^1(\mu )$,where $\mathcal{I}$ is the invariant sigma-algebra. The conditional expectation is invariant and has integral $\int fd\mu$. If $T$ is an ergodic transformation, this conditional expectation is the constant $\int fd\mu$. The assertion applies to real or complex integrable functions; it is the Birkhoff ergodic theorem.

For a nonnegative measurable $f$, if $\int fd\mu <\infty$, the pointwise ergodic theorem already proves the required conclusion. For the remaining case, let $f_K=\min (f,K)$, $K=1,2,\dots$. Each $f_K$ 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 $f\ge f_K$, every such $x$ satisfies ${\mathrm{liminf}}_n{A}_{n}f(x)\ge \int f_{K}d\mu$ for all $K$. The monotone convergence theorem gives $\int f_{K}d\mu \uparrow \int fd\mu =+\infty$. Thus the nonnegative ergodic averages with infinite integral tend to $+\infty$, 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 $c>0$, the corresponding constant is $c^{-1}\int fd\mu$.

The Szemerédi theorem says that for every integer $k\ge 2$ and every $\delta >0$, there is $N_0(k,\delta )$ such that, for $N\ge N_0$, every $A\subseteq \{1,\dots ,N\}$ with $|A|\ge \delta N$ contains a nonconstant arithmetic progressionEquivalently, every subset of the positive integers with positive upper asymptotic density contains arithmetic progressions of every finite length. Length one is immediate.

The Furstenberg multiple recurrence theorem states that for every probability measure-preserving system, every measurable $B$ with $\mu (B)>0$, and every integer $k\ge 2$, there is $n\ge 1$ withHere $T^{-jn}B$ means a preimage, so invertibility is unnecessary. The Furstenberg multiple recurrence theorem also does not assume an ergodic transformation.

We prove the implication to the finite Szemerédi theorem by constructing the Furstenberg correspondence principle explicitly. Suppose, to the contrary, that for fixed $k$ and $\delta >0$ there are $N_{\ell }\to \infty$ and $A_{\ell }\subseteq \{1,\dots ,N_{\ell }\}$ with $|A_{\ell }|\ge \delta N_{\ell }$, but with no length-$k$ arithmetic progression of positive common difference. In the binary full shift $\Omega =\{0,1{\}}^{\mathbb{Z}}$, encode $A_{\ell }$ as $x_j^{(\ell )}=1_{A_{\ell }}(j)$, taking all coordinates outside $A_{\ell }$ to be zero. Let $S$ be the left shift, $(S\omega {)}_j={\omega }_{j+1}$, and setThe cylinder set $C$ is a clopen set, and ${\nu }_{\ell }(C)=|A_{\ell }|/N_{\ell }\ge \delta$. The binary full shift is a compact metric space, so compactness of probability measures on a compact metric space gives a subsequence of these empirical measures with weak convergence of probability measures to a Borel probability measure $\nu$.

For every continuous $h$ on the full shift,Passing to the weak limit shows that $\nu$ is an invariant measure for the continuous left shift. Thus $(\Omega ,\mathcal{B},\nu ,S)$ is a probability measure-preserving system. Since the indicator function of $C$ is continuous, $\nu (C)\ge \delta$.

Apply the Furstenberg multiple recurrence theorem to $C$. For some $n\ge 1$, the clopen sethas $\nu (D)>0$. Its continuous indicator function gives ${\nu }_{\ell }(D)\to \nu (D)>0$. For large $\ell$, at least one $S^a{x}^{(\ell )}$ in the defining empirical measure therefore belongs to $D$. The choice of left shift impliesso $a,a+n,\dots ,a+(k-1)n$ lies in $A_{\ell }$. This contradicts the assumed absence of arithmetic progressions and proves the finite Szemerédi theorem. Applying the finite Szemerédi theorem on intervals where an infinite set has density bounded below proves the stated upper asymptotic density formulation.

For multiple recurrence for circle rotations, write $\mathbb{T}=\mathbb{R}/\mathbb{Z}$ and $R_{\alpha }x=x+\alpha$, with normalized Lebesgue measure $m$, which is the Haar measure of the circle group. Fix a measurable $B\subseteq \mathbb{T}$ with $m(B)>0$ and $k\ge 2$. If $\alpha$ is rational, there is $q\ge 1$ with $R_{\alpha }^q$ the identity, and $n=q$ gives an intersection of measure $m(B)$.

For irrational $\alpha$, the pigeonhole principle applied to $0,\alpha ,\dots ,Q\alpha$ in $Q$ equal arcs gives $1\le n\le Q$ with $\Vert n\alpha {\Vert }_{\mathbb{T}}\le 1/Q$. In particular there are arbitrarily small nonzero returns to zero for the irrational rotation of the circle.

We also need translation continuity in L1 on the circle. Given a measurable $B$, approximate its indicator function in the L1 norm by a continuous $g$ on the circle group. Such approximation follows from regularity of Lebesgue measure, or approximation by finite unions of intervals. Translation invariance and uniform continuity givewhere the approximation error is first made arbitrarily small. Equivalently, $m(B△(B-t))\to 0$.

Choose a return time $n\ge 1$ so small modulo one that for each $1\le j<k$,This is possible because multiplication by each fixed $j$ is continuous on the circle group and translation continuity in L1 on the circle applies to the finitely many translates. The union bound now givesThis proves the Furstenberg multiple recurrence theorem for every circle rotation with its normalized Lebesgue measure, including both rational and irrational angles.

For a probability measure-preserving system, strong mixing means that for every pair of measurable sets $A,B$,A sequence $a_n$ has convergence in density of a sequence to $a$ when for each $\epsilon >0$ the exceptional set $\{n:|a_n-a|\ge \epsilon \}$ has natural density zero. A weakly mixing measure-preserving transformation has convergence in density of $\mu (T^{-n}A\cap B)$ to $\mu (A)\mu (B)$ for every $A,B$. Equivalently, because these correlations are bounded,Indeed the mean of the absolute discrepancy is at least $\epsilon$ times the exceptional frequency, while it is at most $\epsilon$ 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 $[0,1)$ with normalized Lebesgue measure, an initial tower consisting of $[0,2/3)$, and a reservoir $[2/3,1)$ for spacers. At stage $j$, 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 $h_j$ is the number of levels and $w_j$ their width, thenHence $h_j=(3^{j+1}-1)/2$, $w_j=2/3^{j+1}$, and the stage-$j$ tower has measure $1-3^{-j-1}$. The spacers consume total measure ${\sum }_{j\ge 0}{w}_{j+1}=1/3$, 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 $0$ marking an original level and $1$ a spacer, the tower words satisfy $W_0=0$ and $W_{j+1}=W_j{W}_{j}1W_j$, so the first new word is $0010$. This describes the spacer placement without needing a proof of well-definedness. The three-cut convention agrees with the classical constant spacer vector $(0,1,0)$ described in Ryzhikov's construction.

For the correlation assertion, take the L2 inner product to be $⟨u,v⟩=\int u\overline{v}d\mu$, linear in its first argument, and put $U=U_T$. The Koopman operator is an isometry on $L^2$, even when $T$ is not invertible. For $n\ge k$ the hint givesTo extend rigorously to all test functions, centre the observable: $v=f-a1$. Invariance of the integral gives $⟨U^{n}v,v⟩=⟨U^{n}f,f⟩-|a{|}^2\to 0$. LetFor each fixed $k$, $⟨U^{n}v,U^{k}v⟩\to 0$ 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 $\Vert U^{n}v{\Vert }_2=\Vert v{\Vert }_2$, approximation extends this conclusion to every $g\in M$: the approximation error in the correlation is bounded by $\Vert v{\Vert }_2\Vert g-g_0{\Vert }_2$ uniformly in $n$. For $g\in M^{\perp }$, the correlation is identically zero because $U^{n}v\in M$. The orthogonal decomposition by a closed subspace now gives the result for all $g\in L^2$. ThusThis is decay of autocorrelation implies weak convergence of an observable; no assumption that $T$ is an ergodic transformation, and no invertibility hypothesis was used, and $a=0$ is included.

Finally, strong mixing immediately implies the stated diagonal limit by taking $B=A$. Conversely, suppose that limit holds for every $A$. Apply the correlation result with $f=1_A$ and $g=1_B$. Its hypothesis is exactly $⟨U^n{1}_A,1_A⟩\to \mu (A{)}^2$, and its conclusion isHence 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.

On a probability measure-preserving system, for a finite measurable partition $\xi =\{A_1,\dots ,A_r\}$, the entropy of a finite measurable partition isUse natural logarithms, so information entropy is measured in nats; another fixed logarithm base rescales all answers. The join of measurable partitions is their common refinement, and write ${\xi }_a^b={\bigvee }_{j=a}^b{T}^{-j}\xi$, with an empty join the trivial partition. The entropy rate of a measurable partition and Kolmogorov-Sinai entropy are respectivelyThe block entropies form a subadditive sequence, so the first limit exists by the Fekete lemma. For finite partitions the conditional entropy of finite measurable partitions is $H(\eta \mid \zeta )=H(\eta \vee \zeta )-H(\zeta )$.

Put $c_0=H(\xi )$ and $c_k=H(\xi \mid {\xi }_1^k)$ for $k\ge 1$. The chain rule for information entropy, applied from the last coordinate backwards, and measure preservation giveThe second equality uses invariance of the joint partition atom probabilities under the common pullback $T^{-j}$; invertibility is unnecessary. Since conditioning reduces entropy, $c_k$ decreases to a nonnegative limit $c$. The Cesaro convergence of a sequence of this convergent sequence has the same limit. ThereforeEquivalently $h_{\mu }(T,\xi )=H_{\mu }(\xi \mid {\mathcal{F}}_1)$, where ${\mathcal{F}}_1=\sigma ({\bigvee }_{j\ge 1}{T}^{-j}\xi )$. Here conditional entropy of a countable measurable partition conditioned on a sigma-algebra is computed using conditional partition atom probabilities; the martingale convergence theorem gives continuity under increasing conditioning sigma-algebras. This is the infinite-future formula for partition entropy rate.

The Kolmogorov-Sinai generator theorem states that if a finite or countable measurable partition $\eta$ has finite entropy of a countable measurable partition and its iterates generate the whole completed sigma-algebra modulo null sets, then $h_{\mu }(T)=h_{\mu }(T,\eta )$. For an invertible system, generating means $\sigma ({\bigvee }_{j\in \mathbb{Z}}{T}^{-j}\eta )=\mathcal{B}$ modulo null sets. For a noninvertible system a one-sided generator, using $j\ge 0$, suffices. The two-sided and one-sided versions must not be confused.

For a Bernoulli shift with discrete symbol probabilities $(p_i)$, the coordinate-zero measurable partition has independent coordinate iterates. ThusFor a finite alphabet the coordinate partition is a generator of finite entropy of a finite measurable partition; on the two-sided sequence space use all integer coordinate iterates, and on the one-sided space use the nonnegative ones. The Kolmogorov-Sinai generator theorem proves the displayed answer in both cases. The same calculation applies to countably many symbols when their Shannon entropy is finite, using the countable finite-entropy version of the theorem. If the Shannon entropy is infinite, merge all but the first $r$ symbols into one cell. These finite coordinate partitions have entropy rate $-{\sum }_{i\le r}{p}_i\log p_i-p_{>r}\log p_{>r}\to \infty$, so the system entropy is infinite. Zero-probability symbols contribute zero. In particular a fair $r$-symbol shift has entropy $\log r$.

For the final assertion, let ${\mathcal{F}}_0=\sigma ({\bigvee }_{j\ge 0}{T}^{-j}\xi )$ and complete it modulo null sets. The approximation property forces ${\mathcal{F}}_0=\mathcal{B}$ modulo null sets. Indeed for each $A\in \mathcal{B}$, choose approximating sets from finite blocks with error tending to zero. Their indicators approach $1_A$ in $L^2$, and $L^2({\mathcal{F}}_0)$ is a closed vector subspace, so $A$ is ${\mathcal{F}}_0$-measurable modulo a null set.

Invertibility now gives ${\mathcal{F}}_1=T^{-1}{\mathcal{F}}_0=T^{-1}\mathcal{B}=\mathcal{B}$ modulo null sets. In particular the present partition $\xi$ is measurable with respect to its entire future, so $H(\xi \mid {\mathcal{F}}_1)=0$. The infinite-future formula gives $h_{\mu }(T,\xi )=0$. Since the given one-sided generator is also a two-sided generator, the Kolmogorov-Sinai generator theorem finishes the proof:This is finite one-sided generator of an invertible system forces zero entropy. Invertibility is essential: a fair binary one-sided Bernoulli shift has a finite one-sided generator and Kolmogorov-Sinai entropy $\log 2$.

For a probability measure-preserving system, the hypothesis is completely positive entropy: every finite measurable partition with positive static entropy of a finite measurable partition has positive entropy rate of a measurable partition. Fix a finite partition $\xi$ and putAll sigma-algebras are interpreted modulo null sets. We will prove that every finite partition $\alpha$ measurable with respect to this tail sigma-algebra of a measurable partition has $h_{\mu }(T,\alpha )=0$. Applying this to a binary partition will force the required triviality. This proves the needed direction of the Tail characterization of the Pinsker sigma-algebra directly, including noninvertible transformations.

Write $h=h_{\mu }(T,\xi )$. The infinite-future entropy formula and the backwards chain rule for information entropy give, for every $L\ge 1$, the block conditional entropy given the infinite future identityEach term equals $h$ by invariance of the joint probabilities under a common pullback and continuity of conditional entropy under increasing finite future blocks. Invertibility is not needed for this identity.

Fix $\epsilon >0$. Since $\alpha$ is ${\mathcal{F}}_0$-measurable and finite, the martingale convergence theorem and continuity of finite-partition conditional entropy allow an $r\ge 0$ withTo see the continuity explicitly, for each partition atom $A$ of $\alpha$ the conditional probabilities $\mathbb{E}[1_A\mid \sigma ({\xi }_0^r)]$ tend to $1_A$ almost everywhere; apply dominated convergence theorem to the bounded continuous function $-t\log t$ on $[0,1]$ and sum over the finitely many partition atoms.

For $n\ge 1$ set $\gamma ={\alpha }_0^{n-1}$, $L=n+r$, and $\beta ={\xi }_0^{L-1}$. The conditional entropy of finite measurable partitions satisfiesThe second inequality uses conditioning reduces entropy, since $\beta$ refines each block $T^{-j}{\xi }_0^r$; the final equality uses measure preservation.

Moreover $\gamma$ is ${\mathcal{F}}_L$-measurable. For each $j\ge 0$, tail measurability gives $\alpha$ measurable with respect to ${\mathcal{F}}_L$, hence $T^{-j}\alpha$ measurable with respect to $T^{-j}{\mathcal{F}}_L={\mathcal{F}}_{L+j}\subseteq {\mathcal{F}}_L$. Thus conditioning reduces entropy and the displayed block identity implyUse the symmetric entropy identity $H(\gamma )=H(\beta )-H(\beta \mid \gamma )+H(\gamma \mid \beta )$ to obtainThe fraction on the right tends to zero: $r$ is fixed and $H({\xi }_0^{n+r-1})/(n+r)\to h$ by the definition of entropy rate of a measurable partition. Taking $n\to \infty$ and then $\epsilon \downarrow 0$ gives

Now let $A\in \mathcal{T}(\xi )$ and take $\alpha =\{A,X\setminus A\}$. If $0<\mu (A)<1$, its binary entropy is $-\mu (A)\log \mu (A)-(1-\mu (A))\log (1-\mu (A))>0$, while its entropy rate is zero, contradicting completely positive entropy. ThereforeSince $\xi$ was arbitrary, every finite-partition tail is trivial. The argument needs only that $\xi$ is finite and the measure is a probability; it does not assume a finite generator, finite total system entropy, or invertibility.

Use the probability-system convention $\mu (X)=1$. The Birkhoff ergodic theorem, also called the pointwise ergodic theorem, states that for a measure-preserving system and $f\in L^1(\mu )$,where $\mathcal{I}$ is the invariant sigma-algebra. The limit is integrable and has the same integral as $f$. On a probability space the convergence also holds in $L^1$, as in the allowed mean ergodic theorem. If $T$ is an ergodic transformation, $\mathcal{I}$ is trivial modulo null sets, giving

The integer multiplication map on the circle preserves Lebesgue measure: for any integrable $g$ on $[0,1)$,To prove the ergodicity of integer multiplication on the circle, suppose $u\in L^2(m)$ satisfies $u\circ T_K=u$. Let $c_j$ be its Fourier coefficients in the Fourier basis $e_j(x)=e^{2\pi ijx}$. Since $e_j\circ T_K=e_{Kj}$, the Fourier coefficients of $u\circ T_K$ at index $j$ are zero if $K$ does not divide $j$, and are $c_{j/K}$ otherwise. This identity holds for all $L^2$ functions by approximation with trigonometric polynomials and the isometry $u\mapsto u\circ T_K$. Invariance givesEvery nonzero integer $j$ can be divided by $K$ only finitely often. Thus $c_j=0$ for every $j\ne 0$, and completeness of the Fourier basis makes $u$ constant almost everywhere. Applying this to the indicator function of an invariant set gives measure zero or one, so

A normal number in base $K$ has every word $w=(w_1,\dots ,w_r)$ of $r$ base-$K$ digits occurring with limiting overlapping frequency $K^{-r}$. Use the expansion that is not eventually equal to $K-1$ when there are two expansions. The word $w$ corresponds to the half-open intervalA word starting at position $n+1$ occurs exactly when $T_K^{n}x\in I_w$. The Birkhoff ergodic theorem, applied to $1_{I_w}$, gives frequency $m(I_w)=K^{-r}$ almost everywhere. There are countably many pairs $(K,w)$, 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-$K$ 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 $g=|f|$. For every $\epsilon >0$, the Tonelli theorem gives the useful summability boundSince $T$ is a measure-preserving transformation, $\mu (g\circ T^n>\epsilon n)=\mu (g>\epsilon n)$. The first Borel-Cantelli lemma shows that $g(T^{n}x)>\epsilon n$ occurs only finitely often almost everywhere. Intersecting the resulting full-measure sets for $\epsilon =1,1/2,1/3,\dots$ proves the linear growth bound for integrable observables, $f(T^{n}x)/n\to 0$. Multiplication by $n^{1-a}\le 1$ then gives

The threshold is sharp. For $0<a<1$, choose $p$ with $1<p<1/a$, and take the Bernoulli shift on $X=(0,1{)}^{\mathbb{Z}}$ 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 $f(x)=x_0^{-1/p}$; it is integrable becauseThe variables $f(T^{n}x)=x_n^{-1/p}$ are independent. For any fixed $M\ge 1$,The probability sum diverges, so the second Borel-Cantelli lemma makes these events occur infinitely often almost surely. Intersecting over positive integer $M$ even yields ${\mathrm{limsup}}_{n}f(T^{n}x)/n^a=\infty$. For $a\le 0$, the constant observable $f=1$ already fails to give limit zero. Thus the sharpness of the linear growth bound for integrable observables gives

In a finite measure-preserving system, almost every point of every measurable set $A$ returns to $A$ infinitely often. The points of $A$ that never return form a wandering set: all its inverse images are pairwise disjoint and have equal measure, so that set must be null.

For a probability measure-preserving system and a countable measurable partition $\xi$ of finite entropy, $-n^{-1}\log \mu ({\xi }_0^{n-1}(x))$ converges almost everywhere and in $L^1$ to an invariant function whose integral is $h_{\mu }(T,\xi )$. For an ergodic transformation, the limit is the constant $h_{\mu }(T,\xi )$. In general it is $\mathbb{E}[I_{\mu }(\xi \mid {\bigvee }_{j=1}^{\infty }{T}^{-j}\xi )\mid \mathcal{I}]$. The martingale convergence theorem, maximal inequality for conditional information functions, and triangular ergodic averaging lemma prove this directly, without invertibility.

The finite positive measure representing an observable's autocorrelation sequence by the Bochner–Herglotz theorem. For a probability measure-preserving system, the Koopman operator is an isometry, so its forward autocorrelations, extended by complex conjugation to negative indices, form a positive-definite function on $\mathbb{Z}$. The measure has mass $\Vert f{\Vert }_2^2$, and its atoms are squared norms of projections onto Koopman operator eigenspaces, including for noninvertible transformations.

A probability measure-preserving system has the SZ property at level $k$ if the displayed lower limit is positive for every measurable set $A$ of positive measure. This convention counts $k$ nonzero shifts, hence progressions of length $k+1$. The Furstenberg correspondence principle turns this property at all levels into the Szemerédi theorem. A compact measure-preserving system has the property because syndetic near returns of an almost periodic observable applied to an indicator give uniformly positive multiple intersections at bounded-gap times.

Suppose $f_k\to f$ almost everywhere and ${\sup }_k|f_k|\in L^1$ in a probability measure-preserving system. Thenalmost everywhere and in $L^1$, where $\mathcal{I}$ is the invariant sigma-algebra. For the almost-everywhere assertion, bound the terms with index at least $M$ by ${\sup }_{k\ge M}|f_k-f|$, apply the Birkhoff ergodic theorem, and then let $M\to \infty$. The finitely many remaining end terms vanish by the linear growth bound for integrable observables.