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.

Doubling preserves Lebesgue measure

Statement

Assume countable choice. The doubling map D(x)={2x} is a continuous, surjective, non-injective transformation preserving Borel Lebesgue probability on the circle and its completion.

Facts & Assumptions

[F1]

The preservation theorem applies to every integer b>=2. Integer-base circle maps preserve Lebesgue measure.

[F2]

The stable doubling map has the fractional-part formula. The circle, rotations and the doubling map.

Proof

Given: Assume countable choice. The doubling map D(x)={2x} is a continuous, surjective, non-injective transformation preserving Borel Lebesgue probability on the circle and its completion.

1.1

By the definitions, D=D2. Since 2 is an allowed integer base, the base-map theorem proves preservation on both sigma-algebras and continuity. Its countable-choice measure and completion hypothesis is the assumption here.

F1F2
2.1

Explicitly D1[a,c)=[a/2,c/2)[(a+1)/2,(c+1)/2) for 0a<c1; the two pieces have total length c-a. For each y, y/2 is a preimage, while D(0)=D(1/2)=0 exhibits failure of injectivity. These branch identities also show why preservation concerns inverse images.

step 1.1F2

Depends on

Used by

Dependency tree · two levels

18 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