Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Canonical base-b expansions and normal numbers

Definition

Fix an integer b2. For x[0,1), its canonical base-b digits are

dj(b)(x)=bDbj1x{0,,b1},j1,

where Db(x)={bx} is the integer-base circle map from Integer-base maps and b-adic circle intervals and the floor is supplied by Integer part: for every real x there is exactly one integer m with mx<m+1. Thus

Dbjx=bDbj1xdj(b)(x).

Iterating this recurrence gives

x=j=1ndj(b)(x)bj+bnDbnx.

Since 0Dbnx<1, the remainder tends to zero. Hence the digit string represents x:

x=0.d1(b)(x)d2(b)(x)b=j=1dj(b)(x)bj.

At a b-adic rational the recurrence chooses the expansion that eventually has only zero digits, called the terminating expansion. Equivalently, the canonical expansion is the expansion that is not eventually equal to b1. Indeed, an eventually-(b1) tail represents the same number as incrementing the last preceding digit and then appending zeros; conversely, if the greedy digits were all b1 after some place, the displayed remainder identity would force the corresponding iterate DbNx to be 1, contrary to DbNx[0,1).

For a word w=(w1,,w){0,,b1} and n1, write

Nn(w,x)=#{0k<n:(dk+1(b)(x),,dk+(b)(x))=w}.

The number x is normal in base b if, for every length 1 and every such word w,

Nn(w,x)nb.

It is normal if it is normal in every integer base b2.

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