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.
Every integer-base circle map is strongly mixing
Statement
Assume countable choice. For every integer and every pair of Borel or completed Lebesgue measurable circle sets A,B, . Thus is strongly mixing for either measure.
Facts & Assumptions
D_b preserves either probability measure. Integer-base circle maps preserve Lebesgue measure.
Strong mixing follows from correlations on a generating pi-system containing X. Mixing is checkable on a generating pi-system.
Every completed set differs from a Borel set within a Borel null set. The completion domain and proposed completed set function of a measure space.
Proof
Given: Assume countable choice. For every integer and every pair of Borel or completed Lebesgue measurable circle sets A,B, . Thus is strongly mixing for either measure.
The b-adic intervals at all depths, together with the empty set, form a pi-system: two such intervals are nested or disjoint, and depth zero is X. They generate the circle Borel sets. Indeed every ordinary open interval in (0,1) is the union of the b-adic cells whose closures lie within it; the cell containing any specified interior point has arbitrarily small diameter. The endpoint zero is the intersection of over r, so relative interval-open sets are generated as well. Conversely each cell is Borel. The countable family of cells permits these unions in the generated sigma-algebra.
Let and . For , the interval I contains exactly depth-n cells. On each such cell, the inverse image under of J is a half-open interval of length . Hence . The same equality holds when either set is empty. The generator theorem proves Borel strong mixing.
For completed A,B take Borel A_0,B_0 and Borel null sets Z_A,Z_B containing their respective symmetric differences. For every n, , a completed null set by preservation. Thus the correlation and both marginal measures agree with those for A_0,B_0. The Borel limit proves the completed limit. Countable choice is inherited from the measure and completion suppliers; only finitely many representatives are selected here.
Depends on
Used by
- Doubling is strongly mixing for Lebesgue measure Proposition
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
- Sarig Proposition 1.5 p.9, b-adic branch-count generalization (standard reference, not scraped)