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.
Induced transformations preserve restricted finite measure
Statement
For a finite measure-preserving system and a measurable with , its induced transformation on preserves both and . Neither invertibility nor ergodicity is required.
Facts & Assumptions
Return fibers and induced inverse images are measurable. First-return time and induced map are measurable.
The recurrent core is conull in E, and T_E is its self-map. First-return times and induced transformations.
Pullback by T preserves the original measure. Compositions, iterates and completions preserve invariance.
Additivity splits measurable sets into disjoint pieces. Measures on sigma-algebras.
Increasing unions of partial first-return sets have the supremum of their measures. Continuity from below for measures.
Proof
Given: For a finite measure-preserving system and a measurable with , its induced transformation on preserves both and . Neither invertibility nor ergodicity is required.
Fix a trace set ; it is ambient measurable. Write and . Pulling B back once and splitting at E gives . Pulling back and splitting at E gives . Thus for each , .
The H_n are disjoint first-return pieces. Each differs from by a subset of the measurable null set ; these differences are themselves measurable. Consequently the finite-sum identity implies . Passing to the increasing union gives .
Apply the same inequality to . Since maps its entire domain to itself, . All measures here are finite, so gives the reverse inequality. Equality follows for every B; division by proves invariance of .
Depends on
Used by
Dependency tree · two levels
22 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(1), p.28 (standard reference, not scraped)