Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Equivalent invariant-set and invariant-function criteria for ergodicity

Statement

For a measure-preserving probability system the following are equivalent: (i) ergodicity; (ii) every EI is null or conull; (iii) every measurable real-valued function satisfying fT=f everywhere is constant a.e.; (iv) every measurable real-valued function satisfying fT=f a.e. is constant a.e. Replacing real-valued by complex-valued in either (iii) or (iv) gives equivalent conditions. All functions take finite values.

Facts & Assumptions

[F1]

Ergodicity means every strictly invariant measurable set is null or conull Ergodicity relative to an invariant measure.

[F2]

A modulo-null invariant measurable set has a strict invariant representative modulo a measurable null set Mod-null invariant sets have strict representatives.

[F3]

Inverse images of Borel sets under measurable real functions are measurable A measurable function between measurable spaces.

[F4]

Countable unions of null sets are null Finite and countable subadditivity of measures.

[F5]

A complex function is measurable when its real and imaginary components are measurable Complex Lp classes and Euclidean test-function conventions.

[F6]

Every real number lies in a unique interval [k,k+1) with integer k; applying this to n times the value gives the partition used below Integer part: for every real x there is exactly one integer m with mx<m+1.

[F7]

For every positive real epsilon some positive integer n satisfies 1/n<epsilon For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε.

Proof

Given: The objects and hypotheses in the statement.

1.1

If the system is ergodic, a set in I has by F2 a strict invariant representative differing by a null set, hence has measure zero or one. Conversely (ii) applies to strictly invariant sets. Thus (i) and (ii) are equivalent.

F1F2
2.1

Assume (ii) and let f:XR be measurable and a.e. invariant. For n1, kZ, let En,k=f1([k/n,(k+1)/n)). Measurability follows from F3. Its pullback differs from it only where fTf, so it is in I. For each n these fibers partition X. Their measures are zero or one; countable subadditivity excludes all zero, and disjointness and total mass one exclude two fibers of measure one. There is therefore a unique k(n) with μ(En,k(n))=1.

F3F4step 1.1givenF6
3.1

The set Y=n1En,k(n) is conull by countable subadditivity. It is nonempty since μ(Y)=1. Fix one x0Y. For any xY, f(x)f(x0)<1/n for every n, so f(x)=f(x0) by the Archimedean property of the real numbers. Thus (ii) implies (iv). The uniquely determined k(n) require no countable choice.

F4step 2.1F7
4.1

For a complex a.e. invariant f, its real and imaginary parts are measurable and a.e. invariant by F5. Apply the preceding argument to both, and intersect the two conull sets; f is constant there. This proves both real and complex versions of (iv), and each implies the corresponding version of (iii).

F5step 3.1
5.1

If either version of (iii) holds and E is strictly invariant, then 1E is an everywhere invariant measurable function. A constant indicator on a conull nonempty set must have constant value zero or one, so E is null or conull. Thus (iii) implies (i). Also (iv) directly implies (ii) by the same argument applied to an indicator invariant a.e. All listed implications are now closed.

F1step 4.1given

Depends on

Used by

Dependency tree · two levels

48 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