Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 partial sums, time averages, and the invariant L2 subspace

Definition

Let (X,A,μ,T) be a measure-preserving system (Measure-preserving transformations and systems), and put T0=idX and Tk+1=TTk. For a finite-valued measurable real or complex representative f and an integer n1, its ergodic partial sum and ergodic time average are

Snf:=k=0n1fTk,Anf:=1nSnf.

These are initially pointwise formulas for a chosen representative. The companion proposition Ergodic averages are measurable, representative independent, and Lp contractive proves that, when f represents an element of Lp(μ), the formulas are independent of the representative and define Lp classes. Thus the notation does not hide a simultaneous choice of representatives.

Using the complex-L2 convention of Complex Lp classes and Euclidean test-function conventions, define the invariant L2 subspace

M:={[g]L2(μ;C):[gT]=[g]}={[g]:gT=g μ-a.e.}.

This is the fixed space of composition by T. Membership in M means invariance almost everywhere; it does not mean that g is constant. The strict and modulo-null invariant-set conventions are those of Strict and mod-null invariant sigma-algebras.

Depends on

Used by

Dependency tree · two levels

27 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