THE FOLD / GRIND / BACKPROP / THE HURWITZ
THE HURWITZ
the worst any irrational can be approximated
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Hurwitz’s theorem is the sharp law of rational approximation: for every irrational α, there are infinitely many fractions p/q with |α − p/q| < 1/(√5 · q2) — and the constant √5 cannot be improved. The convergents of a number’s continued fraction achieve this. The hardest number to approximate is the golden ratio φ = [1; 1, 1, 1, …]: its approximation constant |φ − p/q|·q2 converges to exactly 1/√5, the worst case, because its continued fraction is all 1s. Any number with larger partial quotients (like √2) is easier to approximate.
LIT verified live: the continued-fraction convergents of φ give an approximation constant → 1/√5 ≈ 0.4472 (the Hurwitz maximum), while √2’s is smaller (≈ 0.3536); and the Hurwitz bound is met infinitely often by the convergents (window.__hurwitz). FIG no framing; exact convergent arithmetic vs the 1/(√5 q2) bound.
LIT verified live: the continued-fraction convergents of φ give an approximation constant → 1/√5 ≈ 0.4472 (the Hurwitz maximum), while √2’s is smaller (≈ 0.3536); and the Hurwitz bound is met infinitely often by the convergents (window.__hurwitz). FIG no framing; exact convergent arithmetic vs the 1/(√5 q2) bound.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at backprop — the continued-fraction convergents grind ever closer to α, and the best rate any irrational allows is capped by √5, hit only by the golden ratio. AVAN (AI) built the instrument: the convergent recurrence, the approximation constant |α − p/q|·q2, and the check that φ is worst and the bound holds infinitely.
Credit as content: Adolf Hurwitz (1891). The weave: David names backprop; I fold the continued fraction into convergents, measure how closely each approximates α relative to 1/q2, and confirm the golden ratio’s constant lands on 1/√5 — the sharpest the theorem allows — while easier numbers beat it.
Credit as content: Adolf Hurwitz (1891). The weave: David names backprop; I fold the continued fraction into convergents, measure how closely each approximates α relative to 1/q2, and confirm the golden ratio’s constant lands on 1/√5 — the sharpest the theorem allows — while easier numbers beat it.
3 ONE DIMENSION
φ = [1;1,1,1,…], convergents 1, 2, 3/2, 5/3, 8/5, 13/8, … (Fibonacci ratios). |φ − p/q|·q2 → 1/√5 ≈ 0.4472 — the worst-approximable number, so √5 is optimal.
4 TWO DIMENSIONS · INTERACTIVE
Convergents of α and their approximation constants against 1/√5; φ the worst, others better; checked.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: a sharp ceiling on approximation.
AVAN’s addition (the inverse-companion): don’t just approximate α — ask how well any irrational can be approximated, and find a universal ceiling 1/√5, touched only by the golden ratio. The inverse of ‘find good rationals for α’ is ‘the best possible rate is √5, and φ is the hardest case.’ Magenta is an easily-approximated number; green is the golden ratio at the 1/√5 ceiling. The worst case sets the law.
LIT Genuine Hurwitz's theorem (Adolf Hurwitz, 1891). Verified live: the continued-fraction convergents of φ give an approximation constant |φ − p/q|·q² → 1/√5 (window.__hurwitz.phiToRoot5), √2's constant is strictly smaller (better-approximable, window.__hurwitz.sqrt2Better), and the Hurwitz bound 1/(√5 q²) is met infinitely often by the convergents (window.__hurwitz.holdInfinitely).
FIG No framing: the convergent recurrence, the |α − p/q|·q² approximation constant, and the check that φ is worst and the bound holds infinitely all run in-browser with exact convergent arithmetic (small indices to stay in exact-integer float range). The AVAN inverse is honest — asking the best rate ANY irrational can be approximated (a universal ceiling 1/√5 touched only by φ) rather than approximating a fixed α is Hurwitz's content; magenta is an easily-approximated number, green the golden ratio at the ceiling. The worst case sets the law.
FIG No framing: the convergent recurrence, the |α − p/q|·q² approximation constant, and the check that φ is worst and the bound holds infinitely all run in-browser with exact convergent arithmetic (small indices to stay in exact-integer float range). The AVAN inverse is honest — asking the best rate ANY irrational can be approximated (a universal ceiling 1/√5 touched only by φ) rather than approximating a fixed α is Hurwitz's content; magenta is an easily-approximated number, green the golden ratio at the ceiling. The worst case sets the law.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of BACKPROP · David Lee Wise (ROOT0), with AVAN