Statement

Let TT and let f∈L1(X,μ;R)f\in L^1(X,\mu;\mathbb R). Set

Snf=∑j=0n−1f∘Tj,EN={x:max⁡1≤n≤NSnf(x)>0}.S_nf=\sum_{j=0}^{n-1}f\circ T^j,\qquad E_N=\left\{x:\max_{1\leq n\leq N}S_nf(x)>0\right\}.

The maximal ergodic theorem gives ∫ENf dμ≥0\int_{E_N} f\,d\mu\geq0. The same conclusion holds for E={sup⁡n≥1Snf>0}E=\{\sup_{n\geq1}S_nf>0\}.

Proof of the finite statement

Put MN=max⁡(0,S1f,…,SNf)M_N=\max(0,S_1f,\ldots,S_Nf). On ENE_N, separating the first summand gives MN≤f+MN∘TM_N\leq f+M_N\circ T. Since MN=0M_N=0 off ENE_N and MN≥0M_N\geq0, measure preservation gives

∫ENf dμ≥∫MN dμ−∫ENMN∘T dμ≥0.\int_{E_N}f\,d\mu\geq\int M_N\,d\mu-\int_{E_N}M_N\circ T\,d\mu\geq0.

The infinite statement follows from dominated convergence as ENE_N increases to EE.

Maximal inequality

Apply the theorem to ∣h∣−a|h|-a, for h∈L1h\in L^1 and a>0a>0. With the AnA_n, it gives

μ{sup⁡n≥1An∣h∣>a}≤∥h∥1a.\mu\{\sup_{n\geq1} A_n|h|>a\}\leq\frac{\|h\|_1}{a}.

This controls the set of trajectories with a large averaging error. It is the key estimate for extending pointwise convergence from well-behaved observables to all of L1L^1.

References
  1. Jesse Peterson, Lecture notes on ergodic theory, 2011. §2.5, maximal ergodic inequality.