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

Inducing an ergodic system gives an ergodic system

Statement

If T is an ergodic probability-preserving transformation and μ(E)>0, then TE on E is ergodic for μE.

Facts & Assumptions

[F1]

The induced transformation preserves its probability measure. Induced transformations preserve restricted finite measure.

[F2]

Positive sets in an ergodic probability system have conull forward entrance sets. Positive sets sweep out ergodic probability systems.

[F3]

An everywhere invariant finite real measurable function is a.e. constant, and this property characterizes ergodicity. Equivalent invariant-set and invariant-function criteria for ergodicity.

Proof

Given: If T is an ergodic probability-preserving transformation and μ(E)>0, then TE on E is ergodic for μE.

1.1

Let U=n0TnE. It is measurable and conull by positive-set sweep-out. It is strictly invariant: if Tx eventually enters the core then x does; if x eventually enters at a positive time then Tx does, while if x is already in the core, its next positive return belongs to the core. Thus T1U=U. On U let q(x)=min{n0:TnxE}. The fibers {q=n}=TnEj<nTjE are measurable.

F1F2
2.1

Take any finite real measurable f on the core with fTE=f everywhere. Define F(x)=f(Tq(x)x) for xU and F(x)=0 otherwise. The measurable q-fibers make F measurable. If xUE, then q(Tx)=q(x)1, hence F(Tx)=F(x). If xE, then q(Tx)=rE(x)1: before the first return there is no E visit, and the first return is in the core. Therefore F(Tx)=f(TEx)=f(x)=F(x). On XU, both x and Tx are outside U and F is zero.

step 1.1F1
3.1

Ergodicity of T and the everywhere invariant-function criterion give a constant c with F=c almost everywhere. Since F=f on the core, f=c for μE-almost every point there. The same criterion applied to the probability-preserving T_E now proves its ergodicity. Working with everywhere invariant functions avoids choosing representatives for almost-everywhere invariance.

step 2.1F1F3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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