THE FOLD / GLITCH / DIVIDE BY ZERO / THE WADA
THE WADA
three lakes, one shore
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Three lakes on an island. Dig channels so that every lake comes within ε of every point of dry land, for smaller and smaller ε, forever. In the limit the remaining land is a set where every single point touches all three lakes at once — a boundary shared by three regions, with no stretch belonging to only two. Yoneyama published it in 1917, crediting his teacher Takeo Wada. It sounds like pathology built by hand, and then it turns up in the most ordinary computation there is: run Newton’s method on z³ = 1 and the three basins of attraction have exactly this property.
LIT verified live on the Newton fractal: each cube root attracts its own basin; a boundary point is located by bisection and then circled at radii 10⁻², 10⁻³, 10⁻⁴, 10⁻⁵, 10⁻⁶ — all three basins appear at every scale; the control, a point deep inside one basin, sees only one basin at the same radii; and a 120×120 census finds ~9% of cells have all three basins in their immediate neighbourhood (window.__wada). FIG the true Wada property is a statement about a limit set; what is verified here is that the numerically-resolvable boundary behaves that way at every scale double precision can reach.
LIT verified live on the Newton fractal: each cube root attracts its own basin; a boundary point is located by bisection and then circled at radii 10⁻², 10⁻³, 10⁻⁴, 10⁻⁵, 10⁻⁶ — all three basins appear at every scale; the control, a point deep inside one basin, sees only one basin at the same radii; and a 120×120 census finds ~9% of cells have all three basins in their immediate neighbourhood (window.__wada). FIG the true Wada property is a statement about a limit set; what is verified here is that the numerically-resolvable boundary behaves that way at every scale double precision can reach.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-choke-point’s neighbour, divide-by-zero — the glitch: Newton’s method is the most reasonable algorithm in numerical analysis, and on the boundary its answer depends on the last bit of your input. There is no tolerance small enough to make the question well-posed. AVAN (AI) built the instrument: the complex Newton iterator, the bisection boundary-finder, the multi-scale basin counter, and the interior control.
Credit as content: Kôsaku Yoneyama (1917) crediting Takeo Wada; Brouwer (the earlier indecomposable continua); Hubbard & Papadopol (Newton’s method realising Wada basins). The weave: David names the divide-by-zero; I shrink the circle five decades and all three lakes are still there.
Credit as content: Kôsaku Yoneyama (1917) crediting Takeo Wada; Brouwer (the earlier indecomposable continua); Hubbard & Papadopol (Newton’s method realising Wada basins). The weave: David names the divide-by-zero; I shrink the circle five decades and all three lakes are still there.
3 ONE DIMENSION
The three basins, and the shore they all share.
4 TWO DIMENSIONS · INTERACTIVE
Zoom the boundary; all three colours survive every magnification.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the basins turning, the shore never resolving.
AVAN’s addition (the inverse-companion): don’t improve the precision — ask whether the question has an answer at this input. The inverse of ‘compute which root it converges to’ is ‘on a Wada boundary, every neighbourhood of your input contains all three answers’, so more bits buy nothing. Magenta is the extra precision that changes the answer instead of confirming it; green is the interior, where computation means something. Some inputs are not noisy — they are undecidable at every resolution.
LIT Verified live on the Newton fractal: each cube root attracts its own basin; a boundary point is located by bisection and circled at radii 1e-2 through 1e-6 — all three basins appear at every scale; the control, a point deep inside one basin, sees only one basin at the same radii; and a grid census finds ~9% of cells tri-basin (window.__wada.ok).
FIG The true Wada property is a statement about a limit set; what is verified is that the numerically-resolvable boundary behaves that way at every scale double precision can reach. Yoneyama 1917 crediting Wada; Brouwer's indecomposable continua; Hubbard & Papadopol on Newton basins. The AVAN inverse — ask whether the question HAS an answer at this input: more bits buy nothing on a Wada boundary. Some inputs are undecidable at every resolution.
FIG The true Wada property is a statement about a limit set; what is verified is that the numerically-resolvable boundary behaves that way at every scale double precision can reach. Yoneyama 1917 crediting Wada; Brouwer's indecomposable continua; Hubbard & Papadopol on Newton basins. The AVAN inverse — ask whether the question HAS an answer at this input: more bits buy nothing on a Wada boundary. Some inputs are undecidable at every resolution.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of DIVIDE BY ZERO · David Lee Wise (ROOT0), with AVAN