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 is an ergodic probability-preserving transformation and , then on is ergodic for .
Facts & Assumptions
The induced transformation preserves its probability measure. Induced transformations preserve restricted finite measure.
Positive sets in an ergodic probability system have conull forward entrance sets. Positive sets sweep out ergodic probability systems.
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 is an ergodic probability-preserving transformation and , then on is ergodic for .
Let . 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 . On U let . The fibers are measurable.
Take any finite real measurable f on the core with everywhere. Define for and otherwise. The measurable q-fibers make F measurable. If , then , hence F(Tx)=F(x). If , then : before the first return there is no E visit, and the first return is in the core. Therefore . On , both x and Tx are outside U and F is zero.
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 -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.
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
- Sarig Theorem 1.7(2), pp.28–29 (standard reference, not scraped)