Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

Birkhoff limit for a stationary integrable process

Statement

Assume AC (The Axiom of Choice). Let Y=(Yn)n≥0 be a real-valued strictly stationary process with E∣Y0∣<∞ (Stationary process and canonical path shift), with canonical path law PY and left shift θ. Let I={A:θ−1A=A} be the strictly invariant sigma-algebra on path space (Strict and mod-null invariant sigma-algebras). Then

1n∑k=0n−1Yk ⟶ EPY[z0∣I]∘Φalmost surely and in L1(P),

where Φ(ω)=(Yn(ω))n≥0 and the conditional expectation is that of Conditional expectation given a sigma algebra. If moreover the canonical shift is ergodic (Ergodicity relative to an invariant measure), then the limit is the constant EY0. For complex-valued processes the assertions hold componentwise for real and imaginary parts.

Facts & Assumptions

Given: AC, a real-valued strictly stationary process Y with E∣Y0∣<∞, its canonical path law PY on RN0, and the left shift θ.

[A1]

Every family of nonempty sets has a choice function; AC is assumed and is used exactly through the conditional-expectation identification [F4]. (The Axiom of Choice)

[F1]

PY is the pushforward of P under the coordinate map Φ(ω)=(Yn(ω))n≥0; the left shift θ(z)n=zn+1 preserves PY; the process is ergodic when θ is ergodic for PY. (Stationary process and canonical path shift)

[F2]

I={E:T−1E=E} is the strictly invariant sigma-algebra; a measure-preserving system is ergodic for μ when every E∈I has μ(E)=0 or μ(X∖E)=0. (Strict and mod-null invariant sigma-algebras, Ergodicity relative to an invariant measure)

[F3]

Let μ be sigma-finite, T preserve μ, and f∈L1(μ); then Anf converges μ-almost everywhere to a finite-valued integrable f∗ with f∗∘T=f∗ μ-a.e. (Birkhoff pointwise ergodic theorem)

[F4]

Assume Choice. If μ(X)<∞, T preserves μ, f∈L1(μ) and f∗ is its Birkhoff limit, then ∫Ef∗ dμ=∫Ef dμ for every E∈I, and f∗ has an I-measurable integrable representative, unique up to a.e. equality. (Finite-measure identification of the Birkhoff limit)

[F5]

If μ(X)<∞, T preserves μ and f∈L1(μ) with Birkhoff limit f∗, then ∥Anf−f∗∥1→0. (Ergodic averages converge in Lp on finite-measure spaces)

[F6]

Assume Choice. If T preserves an ergodic measure μ with 0<μ(X)<∞ and f∈L1(μ), then Anf→1μ(X)∫Xf dμ both μ-a.e. and in L1(μ). (Birkhoff ergodic theorem for ergodic finite-measure systems)

[F7]

A conditional-expectation version of an integrable X given a sub-sigma-algebra G is a G-measurable integrable Z with ∫AZ dP=∫AX dP for every A∈G. (Conditional expectation given a sigma algebra)

Proof

Given: AC, a strictly stationary real process Y with E∣Y0∣<∞, canonical path law PY, coordinate map Φ, and left shift θ.

Proof technique: apply Birkhoff, its finite-measure identification and its L1 lemma on canonical path space to the coordinate functional z0, then pull the conclusions back along Φ; handle the ergodic case with the ergodic corollary.

1.1F1given

The coordinate functional f(z):=z0 is measurable on path space and belongs to L1(PY): by [F1] and the change-of-variables identity for the pushforward, ∫RN0∣z0∣ dPY=E∣Y0∣<∞, and PY is a probability, hence finite and sigma-finite.

2.1F3F4F5step 1.1given

Let Anf:=n−1∑k<nf∘θk, so that Anf(z)=n−1∑k<nzk. By [F3]–[F5] applied to the measure-preserving probability system (RN0,PY,θ) and f∈L1(PY) there is f∗∈L1(PY) with: Anf→f∗ PY-almost everywhere; f∗ is I-measurable with ∫Ef∗ dPY=∫Ez0 dPY for every E∈I; and ∥Anf−f∗∥L1(PY)→0.

3.1F7step 2.1given

By [F7] the function f∗ is a conditional-expectation version of z0 given I, that is, f∗=EPY[z0∣I] as an a.e. class; this is the unique a.e. class characterized by I-measurability and the displayed integrals.

3.2F1step 2.1given

Pullback of the L1 statement: for each n, ∫Ω∣1n∑k<nYk−f∗∘Φ∣ dP=∫RN0∣Anf−f∗∣ dPY by the pushforward identity [F1], and the right side tends to 0 by step 2.1.

4.1F1step 3.1given

Pullback of the a.e. statement: Anf∘Φ=1n∑k=0n−1Yk as functions on Ω, and {z:Anf(z)↛f∗(z)} is a PY-null set; by [F1] its preimage under Φ is a P-null set, since P(Φ−1N)=PY(N). Hence 1n∑k<nYk→f∗∘Φ almost surely.

5.1F1F2F6step 4.1step 3.2given

If the canonical shift is ergodic for PY [F1, F2], then [F6] applies with μ=PY and gives Anf→∫z0 dPY=EY0 PY-a.e. and in L1(PY); pulling back as in steps 3.2 and 4.1 gives 1n∑k<nYk→EY0 almost surely and in L1(P).

6.1A1F1F4F6F7step 4.1step 5.1given∎

Boundary and axiom cases: if Y0 is a constant c almost surely then all averages equal c, I-measurability is automatic, and the ergodic conclusion is the same constant; if the process is ergodic but Y0 is integrable with EY0=0 the limit is the constant 0, covered by step 5.1; the a.e. class of the limit is well defined because conditional-expectation versions are unique up to a.e. equality by [F7], and the theorem asserts convergence in two modes, not merely integrability of a limit; complex processes are handled by applying the real assertion to Re⁡Yn and Im⁡Yn, both strictly stationary with finite first absolute moment, and recombining; and AC [A1] is used exactly through the identification [F4] and the uniqueness of the conditional-expectation class in [F7].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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