Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generated
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.

Triangular averages of finite-past information converge to the infinite-past average

Statement

If nonnegative integrable-envelope functions gk converge μ-almost everywhere to g, proves the triangular averages of (gk−g)∘Tk tend to zero μ-almost everywhere and in L1(μ) on a finite measure-preserving system.

Facts & Assumptions

Given: A finite-measure-preserving system (Ω,F,μ,T), with μ(Ω)<∞, and finite-valued measurable functions gj≥0 with gj→g μ-almost everywhere and G:=sup⁡jgj∈L1(μ).

[F1]

Birkhoff pointwise ergodic theorem: time averages of an integrable function in a measure-preserving system converge almost surely to an integrable limit.

[F2]

Ergodic averages converge in Lp on finite-measure spaces: on a finite-measure space, the time averages converge in L1 to their Birkhoff limit.

[F3]

Measure-preserving transformations and systems: μ(T−1E)=μ(E), so every Ti preserves μ.

[F4]

Dominated convergence: pointwise convergence under an integrable envelope implies convergence of integrals.

[F5]

Integral invariance under measure-preserving maps: if T preserves μ and f≥0 is measurable, then ∫f∘T dμ=∫f dμ, including infinite values.

[F6]

The modulus of an integral is bounded by the integral of the modulus: for every f∈L1(μ), ∣∫f dμ∣≤∫∣f∣ dμ.

[F7]

The Lebesgue integral is linear on L1(μ): the integral is linear on L1(μ).

Proof

Given: The hypotheses and [F1]–[F7].

1.1F4givenalgebra

For each K, put UK=sup⁡j≥K∣gj−g∣. Then UK↓0 μ-almost everywhere and 0≤UK≤2G almost everywhere, since g≤G as a pointwise limit. Dominated convergence [F4] gives ∫UK dμ→0.

1.2F3F4F5F7givenalgebra

Since gi→g almost everywhere and ∣gi−g∣≤2G, [F4] gives ∫∣gi−g∣ dμ→0. By [F3, F5], ∫∣gi−g∣∘Ti dμ=∫∣gi−g∣ dμ, so linearity [F7] makes the integral of the absolute triangular error n−1∑i<n∫∣gi−g∣ dμ→0 by Cesaro averaging. Thus the error tends to zero in L1(μ).

2.1F1F2F3F5F6F7step 1.1

Fix K. For i≥K, ∣gi−g∣≤UK. Hence for n>K, the average of ∣gi−g∣∘Ti is bounded by the first K terms divided by n, plus n−1∑i=Kn−1UK∘Ti. The first part tends to zero almost everywhere. By [F1], the second part converges almost everywhere to the Birkhoff limit UK∗; by [F2], the averages converge to UK∗ in L1(μ). By [F3, F5, F7], every average has integral ∫UK dμ. Thus [F6] and the L1 convergence give ∣∫UK dμ−∫UK∗ dμ∣≤∥AnUK−UK∗∥1→0. Therefore UK∗∈L1(μ) and ∫UK∗ dμ=∫UK dμ.

3.1F4step 1.1step 2.1algebra

Apply step 2.1 to every integer K on the intersection of the resulting countably many full-measure sets. The limsup of the left side is at most UK∗ for each K. Since UK decreases pointwise, the averages and their limits UK∗ decrease almost everywhere. They are nonnegative and bounded by the integrable U1∗; dominated convergence [F4] gives ∫inf⁡KUK∗ dμ=lim⁡K∫UK∗ dμ=lim⁡K∫UK dμ=0. Thus inf⁡KUK∗=0 almost everywhere, and the limsup is zero. Therefore n−1∑i<n∣gi−g∣(Tiω)→0 almost everywhere.

4.1F1F2step 3.1step 1.2algebra∎

By [F1]–[F2], the Birkhoff averages of g converge almost everywhere and in L1(μ) to their Birkhoff limit. Steps 3.1 and 1.2 show the triangular averages differ from these averages by quantities tending to zero almost everywhere and in L1(μ), respectively. Hence both modes of convergence hold with the same limit.

Depends on

Used by

Dependency tree · two levels

29 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