Alphabeta Math
PropositionStatement: 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.

Integer-base circle maps preserve Lebesgue measure

Statement

Assume countable choice. For every integer b2, the circle map Db is continuous, surjective and non-injective, and preserves Borel Lebesgue probability and its completion.

Facts & Assumptions

[F1]

The b affine branches and Lipschitz bound are explicit. Integer-base maps and b-adic circle intervals.

[F2]

The finite measure generator test applies with the whole space included. Measure preservation can be checked on a generating pi-system.

[F3]

Countable choice gives preservation on the completion. Compositions, iterates and completions preserve invariance.

Proof

Given: Assume countable choice. For every integer b2, the circle map Db is continuous, surjective and non-injective, and preserves Borel Lebesgue probability and its completion.

1.1

For 0a<c1, Db1[a,c)=j=0b1[(a+j)/b,(c+j)/b), with disjoint pieces of length (ca)/b. Thus their total measure is c-a. The empty interval has empty inverse image. The map is Borel measurable by the Lipschitz bound from its definition.

F1F4
2.1

The half-open intervals together with the empty set form a pi-system containing [0,1) and generating the circle Borel sets, as in the circle definition. Its whole-space mass is one, so the finite generator theorem gives Borel preservation; the completion theorem gives completed preservation. Countable choice is inherited by the Lebesgue, dilation and completion suppliers and is assumed here.

step 1.1F1F2F3
3.1

For every y in [0,1), the explicit preimage y/b lies in [0,1) and maps to y, proving surjectivity. The distinct points 0 and 1/b both map to 0, proving non-injectivity. Continuity is the already established inequality d(Dbx,Dby)bd(x,y).

step 2.1F1

Depends on

Used by

Dependency tree · two levels

32 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