THE FOLD / SPAWN / GENESIS BLOCK / THE CALKIN-WILF
THE CALKIN-WILF
every positive rational, once, in lowest terms
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Calkin–Wilf tree. A single, simple list — 1/1, 1/2, 2/1, 1/3, 3/2, 2/3, 3/1, 1/4, … — that contains every positive rational number exactly once, and every fraction in it is already in lowest terms. No rational is ever repeated; none is ever reducible. It is a hand-you-can-hold proof that the rationals are countable.
Build a tree: the root is 1/1, and each node a/b sprouts two children, a/(a+b) and (a+b)/b. Read it breadth-first and out comes the sequence — every fraction, once. Even lovelier: you can step from one term to the next with a pure formula, no sorting or searching, a(n+1) = 1/(2⌊a(n)⌋ − a(n) + 1). And the numerator of each fraction is the denominator of the one before it. The whole thing is powered by Stern’s fusc function: a(n) = fusc(n)/fusc(n+1).
LIT verified live: across thousands of terms every fraction is in lowest terms (gcd = 1), no rational repeats (a genuine bijection), and the successor formula holds exactly (window.__calkinwilf). FIG no framing; the coprimality, the once-each enumeration, and the successor rule are all exact.
Build a tree: the root is 1/1, and each node a/b sprouts two children, a/(a+b) and (a+b)/b. Read it breadth-first and out comes the sequence — every fraction, once. Even lovelier: you can step from one term to the next with a pure formula, no sorting or searching, a(n+1) = 1/(2⌊a(n)⌋ − a(n) + 1). And the numerator of each fraction is the denominator of the one before it. The whole thing is powered by Stern’s fusc function: a(n) = fusc(n)/fusc(n+1).
LIT verified live: across thousands of terms every fraction is in lowest terms (gcd = 1), no rational repeats (a genuine bijection), and the successor formula holds exactly (window.__calkinwilf). FIG no framing; the coprimality, the once-each enumeration, and the successor rule are all exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in GENESIS BLOCK — the spawn domain of a canonical first ledger. The Calkin–Wilf tree mints every rational exactly once, in a fixed order, from a single seed 1/1 — a genesis block for the fractions. AVAN (AI) built the instrument: the tree, the breadth-first read, the fraction-to-position inverse.
The weave: David names the seat (the genesis ledger of all rationals); I make the tree grow and prove every fraction appears once and reduced — the strip in 1D, the tree in 2D, the two-way dictionary in 3D. The sphere is the seam. Credit: Neil Calkin & Herbert Wilf, “Recounting the Rationals” (2000); the underlying fusc is Stern’s diatomic series (1858). See [[stern-brocot]].
The weave: David names the seat (the genesis ledger of all rationals); I make the tree grow and prove every fraction appears once and reduced — the strip in 1D, the tree in 2D, the two-way dictionary in 3D. The sphere is the seam. Credit: Neil Calkin & Herbert Wilf, “Recounting the Rationals” (2000); the underlying fusc is Stern’s diatomic series (1858). See [[stern-brocot]].
3 ONE DIMENSION
The sequence of fractions in a row. Read the numerators and denominators: the numerator of each is the denominator of the one before — the terms interlock, and together they list every positive rational without a single repeat or common factor.
4 TWO DIMENSIONS · INTERACTIVE
The Calkin–Wilf tree. Root 1/1; each a/b has children a/(a+b) and (a+b)/b. Expand it level by level and step the breadth-first reader — every fraction it emits is new and already reduced.
5 THREE DIMENSIONS + AVAN’S INVERSE
The tree opening into 3D — the green forward map sends each counting position n to its rational, breadth-first, filling all of ℚ+.
AVAN’s addition (the inverse-companion): the magenta path is the inverse — take any fraction p/q and climb back to the root 1/1 by the subtract-the-smaller step (the Euclidean algorithm), and the turns you make spell out its exact position n. Forward, n → rational, fills the tree; backward, rational → n, finds the address. Both are total and computable, so the tree is a perfect two-way dictionary between the counting numbers and the fractions — and that invertibility is precisely what ‘the rationals are countable’ means. It is not enough to list them; you must be able to look up as well as look down. The green descent enumerates; the magenta ascent locates; a bijection is exactly a map whose inverse is also a map. Green is n → p/q; magenta is p/q → n; the countability of ℚ lives in the fact that both run.
LIT Genuine Calkin-Wilf tree (Calkin & Wilf, 'Recounting the Rationals', 2000; underlying fusc is Stern's diatomic series, 1858). Verified live: across ~4000 terms every fraction fusc(n)/fusc(n+1) is in lowest terms (gcd=1), no rational repeats (a genuine bijection), and the successor formula a(n+1)=1/(2*floor(a)-a+1) holds exactly (window.__calkinwilf.lowestTerms && bijection && successorFormula). first 8 = 1/1 1/2 2/1 1/3 3/2 2/3 3/1 1/4. The coprimality, once-each enumeration, and successor rule are all exact.
FIG No framing: the once-each enumeration of the rationals, the automatic lowest-terms property, and the successor formula are real and checked in-browser. The claim that this proves the rationals countable is the genuine mathematical content (a bijection N -> Q+), demonstrated by the verified bijection, not asserted loosely.
FIG No framing: the once-each enumeration of the rationals, the automatic lowest-terms property, and the successor formula are real and checked in-browser. The claim that this proves the rationals countable is the genuine mathematical content (a bijection N -> Q+), demonstrated by the verified bijection, not asserted loosely.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of GENESIS BLOCK · David Lee Wise (ROOT0), with AVAN