Math 2.0

Dynamical systems and ergodic theory Ergodic theory Theorem

Maximal ergodic theorem

Builds on Measure-preserving transformationProbability spaceIntegrable functionBirkhoff sum and average

Statement

Let (X,𝒜,μ)(X, \mathcal{A}, \mu) be a probability space, let T ⁣:X→XT \colon X \to X be a measure-preserving transformation, and let f ⁣:X→ℝf \colon X \to \R be integrable. For n≥1n \ge 1 let Snf=∑k=0n−1f∘TkS_n f = \sum_{k=0}^{n-1} f \circ T^k be the Birkhoff sums of ff, and let E={x∈X:sup⁡n≥1Snf(x)>0}.E = \set{x \in X : \sup_{n \ge 1} S_n f(x) > 0}. Then ∫Ef dμ≥0.\int_E f \, d\mu \ge 0.

Remarks

Proof idea, after Garsia: let FN=max⁡(0,S1f,…,SNf)F_N = \max(0, S_1 f, \dots, S_N f). For 1≤n≤N1 \le n \le N one has Snf≤f+FN∘TS_n f \le f + F_N \circ T, so FN≤f+FN∘TF_N \le f + F_N \circ T on the set EN={FN>0}E_N = \set{F_N > 0}. Integrating over ENE_N and using FN≥0F_N \ge 0 and the invariance of μ\mu gives ∫ENf dμ≥∫XFN dμ−∫XFN∘T dμ=0\int_{E_N} f \, d\mu \ge \int_X F_N \, d\mu - \int_X F_N \circ T \, d\mu = 0. The sets ENE_N increase to EE, and dominated convergence finishes the proof.

Applied to f−λf - \lambda for a real number λ>0\lambda > 0, it gives the maximal inequality λ μ({x:sup⁡n≥11nSnf(x)>λ})≤∫X∣f∣ dμ.\lambda \, \mu\left(\set{x : \sup_{n \ge 1} \tfrac{1}{n} S_n f(x) > \lambda}\right) \le \int_X \abs{f} \, d\mu. The inequality ∫Ef dμ≥0\int_E f \, d\mu \ge 0 holds, with the same proof, for a measure-preserving map of any measure space and any integrable ff.

Example: if f≥0f \ge 0 is not almost everywhere 00, then E={x:f(Tk(x))>0 for some k≥0}E = \set{x : f(T^k(x)) > 0 \text{ for some } k \ge 0}, and the conclusion ∫Ef dμ≥0\int_E f \, d\mu \ge 0 is clear; the content of the theorem lies in functions of both signs.

Going deeper

For a student

This is the key lemma in the standard proof of Birkhoff's pointwise ergodic theorem. Through the maximal inequality, it controls the supremum of all Birkhoff averages at once. This control is what is needed to pass from a dense class of functions to all integrable functions. It plays the same role as the Hardy–Littlewood maximal inequality in the proof of the Lebesgue differentiation theorem.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Birkhoff sum and average concept
  2. Integrable function concept
  3. Measure-preserving transformation concept
  4. Probability space concept
  5. Maximal ergodic theorem statement

Where this leads

5 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Maximal_ergodic_theorem
About this page
TagV7PA1V3N0K
URIm2://V7PA1V3N0K
Kindstatement, theorem
WritingW0 stub
MSC37A30, 28D05
StatusThis copy of the site has no build data. Run m2 status V7PA1V3N0K.
AboutBirkhoff sum and average, Measure-preserving transformation
UsesMeasure-preserving transformation, Probability space, Integrable function, Birkhoff sum and average
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by