Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 b2 and every pair of Borel or completed Lebesgue measurable circle sets A,B, λ(ADbnB)λ(A)λ(B). Thus Db is strongly mixing for either measure.

Facts & Assumptions

[F1]

D_b preserves either probability measure. Integer-base circle maps preserve Lebesgue measure.

[F2]

Strong mixing follows from correlations on a generating pi-system containing X. Mixing is checkable on a generating pi-system.

[F3]

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 b2 and every pair of Borel or completed Lebesgue measurable circle sets A,B, λ(ADbnB)λ(A)λ(B). Thus Db is strongly mixing for either measure.

1.1

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 [0,br) 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.

F1
2.1

Let I=Ir,k and J=Is,l. For nr, the interval I contains exactly bnr depth-n cells. On each such cell, the inverse image under Dbn of J is a half-open interval of length b(n+s). Hence λ(IDbnJ)=bnrb(n+s)=brbs=λ(I)λ(J). The same equality holds when either set is empty. The generator theorem proves Borel strong mixing.

step 1.1F1F2algebra
3.1

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, (ADbnB)(A0DbnB0)ZADbnZB, 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.

step 2.1F1F3

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