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.
Chacon transformation is ergodic
Statement
Assume AC. The normalized Chacon probability transformation is ergodic.
Facts & Assumptions
Chacon is an invertible probability transformation agreeing on an invariant conull set with all finite partial translations Chacon partial maps extend to an invertible map mod null sets.
Any positive-measure set has arbitrarily late levels of proportion exceeding for each ; the towers exhaust measure one Chacon levels approximate measurable sets.
Ergodicity tests strictly invariant measurable sets Ergodicity relative to an invariant measure.
Assume AC The Axiom of Choice.
At each stage r, the tower is an ordered list of equal-width levels and its partial map translates each level to the next Chacon three cut one spacer towers.
Proof
Given: A strictly invariant measurable set for Chacon with .
Fix . At every sufficiently late stage r, F2 supplies a level J with . Repeatedly composing F5's consecutive partial translations shows that the finite partial map sends level j to level k after iterates whenever . F1 makes the limiting T agree with these arrows on its invariant conull set. Strict invariance implies equality of the measures of E in these levels, since the iterates preserve measure and membership in E. Removing the fixed null complement does not affect these equalities. Hence every level of this tower has E-measure greater than .
Summing over the disjoint levels gives . Letting gives because . Since every is allowed and , . Sets of zero measure already satisfy the alternative. This is ergodicity by F3. AC is inherited from the measure construction and generating-level approximation, with only one finite-stage level needed at a time.
Depends on
Used by
Dependency tree · two levels
19 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
- Katok–Thouvenot rank-one generating partitions paragraph p.697, expanded local ergodicity argument (standard reference, not scraped)
- Sarig Problem 3.8–3.9 p.101 (standard reference, not scraped)