Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Borel's normal number theorem

Statement

Assume the Axiom of Countable Choice. Lebesgue-almost every x[0,1) is normal in every integer base b2.

Facts & Assumptions

Given: Countable choice and Lebesgue probability on [0,1).

[F1]

For every b2, Db is strongly mixing, hence ergodic, and preserves Lebesgue probability (Every integer-base circle map is strongly mixing, Mixing implies weak mixing, which implies ergodicity).

[F2]

Birkhoff gives an integrable, invariant almost-everywhere limit for the averages of each L1 observable (Birkhoff pointwise ergodic theorem), and in an ergodic probability system every finite invariant measurable function is constant almost everywhere (Equivalent invariant-set and invariant-function criteria for ergodicity).

[F3]

Integrals are unchanged by a measure-preserving map (Integral invariance under measure-preserving maps), and dominated convergence passes the integral through an almost-everywhere bounded limit (Dominated convergence).

[F5]

Word occurrences agree with visits to their half-open orbit cylinder away from a countable null endpoint set (Base-b digit cylinders are orbit cylinders).

[F6]

A countable union of null measurable sets is null (Finite and countable subadditivity of measures).

Proof

technique · Birkhoff on every digit cylinder, followed by a countable intersection
1.1

Fix b2, 1, and w{0,,b1}. Put m=r=1wrbr, Iw=[m/b,(m+1)/b), and fw=1Iw. Then 0fw1 and fwdλ=b.

F4construct
2.1

By [F1] and [F2], Anfw converges almost everywhere to an invariant function Fw, and Fw=cw almost everywhere for some constant cw. Because 0Anfw1, [F3] and invariance of the integral give cw=Fwdλ=limnAnfwdλ=fwdλ=b.

F1F2F3step 1.1
3.1

For xEb, [F5] identifies Anfw(x) with Nn(w,x)/n. Thus outside the union of Eb and the exceptional set from step 2.1, the word w has limiting frequency b.

F5step 2.1
4.1

The triples (b,,w) form a countable family: b and range over integers and, for each pair, there are only b words. By [F6], the union of their null exceptional sets and the countable endpoint sets Eb is null. Every point outside that union satisfies step 3.1 for every base and word, hence is normal. Countable choice is inherited from [F1], [F4], and [F5]; the indexing and cylinders are explicit.

F5F6step 3.1

Depends on

Used by

Dependency tree · two levels

58 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