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.
An explicit invariant set for a rational rotation
Example
Assume countable choice. If with integers , in lowest terms, then is strictly invariant under and has Lebesgue measure . Thus this rational rotation is not ergodic.
Facts & Assumptions
Circle rotations preserve Lebesgue probability and have measurable inverses. Circle rotations preserve Lebesgue measure.
In a probability system ergodicity requires strict invariant sets to have measure zero or one. Ergodicity relative to an invariant measure.
Verification
Given: Assume countable choice. If with integers , in lowest terms, then is strictly invariant under and has Lebesgue measure . Thus this rational rotation is not ergodic.
Write . For with , one has . The residue map is a permutation, with inverse subtraction of . Thus rotation maps the collection of onto itself and, being bijective, satisfies . The half-open convention makes the formula exact at every included left endpoint and excludes every right endpoint.
The intervals are pairwise disjoint and each has length . Hence . It is Borel, and its complement also has measure . By [F1] the ambient system preserves the probability, so [F2] proves nonergodicity. For , this is simply the identity rotation and . Countable choice is used only for the Lebesgue probability supplied by [F1].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- E–W Proposition 2.16 (standard reference, not scraped)