Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Ergodic averages converge in Lp on finite-measure spaces

Statement

Let μ(X)<∞, let T preserve μ, let 1≤p<∞, and let f∈Lp(μ) be real or complex valued. If f∗ is its Birkhoff limit, then f∗∈Lp(μ) and

∥Anf−f∗∥p⟶0.

No L∞ convergence is asserted.

Facts & Assumptions

Given: The finite measure space, T, p, f, and f∗ in the Statement.

[F1]
[F2]

On finite measure spaces, a.e. convergence implies convergence in measure, and convergence in measure plus uniform integrability gives L1 convergence (On a finite measure space, almost-everywhere convergence implies convergence in measure, Vitali convergence theorem on finite and sigma-finite measure spaces).

[F3]

Markov's inequality, dominated convergence, and Fatou's lemma have their usual integral forms (Chebyshev-Markov inequality for the integral, Dominated convergence, Fatou's lemma).

[F4]

A bounded function on a finite measure space belongs to every finite Lp (Finite-measure Lr includes into Lp for p<r).

Proof

technique · cases $p=1$ and $1<p<\infty$
1.1assume-case poneF1F3

Assume p=1. Put En,M={∣Anf∣>M}. Contractivity and Markov give μ(En,M)≤∥f∥1/M. For K>0, split f=fK+rK by radial clipping, so ∣fK∣≤K and ∣rK∣=(∣f∣−K)+. Pointwise, ∣Anf∣≤An∣f∣≤K+An∣rK∣. Consequently ∫En,M∣Anf∣ dμ≤K∥f∥1M+∥rK∥1, where invariance gives ∫An∣rK∣=∥rK∥1.

1.2assume-case pgreatF3F4

Now assume 1<p<∞. Let fm=f1{∣f∣≤m}. Then fm is bounded and belongs to Lp by [F4], while dominated convergence applied to ∣f−fm∣p gives ∥f−fm∥p→0.

2.1F3step 1.1

As K→∞, ∣rK∣↓0 and is dominated by ∣f∣, so its integral tends to zero. Choose K and then M in step 1.1; the bound is uniform in n and proves uniform integrability of (Anf). For complex f, it also proves uniform integrability of the real and imaginary parts because each component modulus is bounded by ∣Anf∣.

2.2F1F3F4step 1.2

Let fm∗ be the Birkhoff limit of fm. For fixed m, both ∣Anfm∣ and ∣fm∗∣ are bounded by m. Their pointwise difference tends to zero a.e.; dominated convergence on the finite measure space therefore gives ∥Anfm−fm∗∥p→0.

3.1F1F2step 2.1cases: p-one

By [F1] the averages converge a.e., hence by [F2] in measure. Vitali applied to the real and imaginary parts gives L1 convergence to their corresponding components of f∗. The complex triangle inequality combines the two component conclusions.

4.1F1F3step 1.2step 2.2cases-exhaustive∎

Since An(f−fm)→f∗−fm∗ a.e., Fatou and contractivity imply ∥f∗−fm∗∥p≤lim inf⁡n∥An(f−fm)∥p≤∥f−fm∥p. Thus f∗∈Lp, and lim sup⁡n∥Anf−f∗∥p≤2∥f−fm∥p. Letting m→∞ proves the claim. The two cases exhaust 1≤p<∞; the proof never supplies uniform-norm convergence.

Depends on

Used by

Dependency tree · two levels

56 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources