THE FOLD / RESPAWN / THE RESURRECT / THE ARNOLD-CAT
THE ARNOLD-CAT
scramble an image to noise — it returns exactly
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Arnold’s cat map sends each pixel (x, y) of an N×N image to ((2x+y) mod N, (x+y) mod N). Apply it to a picture — Vladimir Arnold used a cat’s face — and it stretches and folds the image into total noise within a few steps, a textbook chaotic, mixing map.
But here is the twist: because the map is a bijection on a finite grid, it never loses a pixel, so after a finite number of steps it must return exactly to the original image, cat and all. This is Poincaré recurrence made concrete and fast. The return period depends on N in a wild, number-theoretic way — N = 101 comes back after just 25 steps, N = 50 after 150, with no simple formula. Chaos and perfect predictability living in the very same map: it scrambles like noise, then reassembles like clockwork.
LIT verified live: the period computed as the order of the matrix [[2,1],[1,1]] mod N matches the period found by actually scrambling a labelled grid until it returns, for many N (window.__arnoldcat). FIG no framing; the recurrence and every period are exact, cross-checked two ways.
But here is the twist: because the map is a bijection on a finite grid, it never loses a pixel, so after a finite number of steps it must return exactly to the original image, cat and all. This is Poincaré recurrence made concrete and fast. The return period depends on N in a wild, number-theoretic way — N = 101 comes back after just 25 steps, N = 50 after 150, with no simple formula. Chaos and perfect predictability living in the very same map: it scrambles like noise, then reassembles like clockwork.
LIT verified live: the period computed as the order of the matrix [[2,1],[1,1]] mod N matches the period found by actually scrambling a labelled grid until it returns, for many N (window.__arnoldcat). FIG no framing; the recurrence and every period are exact, cross-checked two ways.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in THE RESURRECT — the respawn domain of what comes back from apparent death. The cat map is resurrection as theorem: the image is torn into noise and then, at a fixed step, springs back whole. AVAN (AI) built the instrument: the pixel scrambler, the two-way period check, the reversible-permutation inverse.
The weave: David names the seat (scrambled, then resurrected); I make a picture dissolve into chaos and return exactly, and count the step it does — the period in 1D, the live scramble in 2D, the reversible inverse in 3D. The sphere is the seam. Credit: Vladimir I. Arnold (1960s, the cat demonstration); Henri Poincaré’s recurrence theorem.
The weave: David names the seat (scrambled, then resurrected); I make a picture dissolve into chaos and return exactly, and count the step it does — the period in 1D, the live scramble in 2D, the reversible inverse in 3D. The sphere is the seam. Credit: Vladimir I. Arnold (1960s, the cat demonstration); Henri Poincaré’s recurrence theorem.
3 ONE DIMENSION
The return period as a function of grid size N — a jagged, unpredictable curve. Nearby N give wildly different periods; there is no smooth law, only the number theory of the matrix’s order modulo N.
4 TWO DIMENSIONS · INTERACTIVE
A structured image on an N×N grid. Step the cat map and watch it shear into noise — then keep going and watch it reassemble exactly at the return step. The counter tracks the step against the known period.
5 THREE DIMENSIONS + AVAN’S INVERSE
The map as a torus that stretches then folds — the green forward step: shear the square, wrap it back, mixing the picture toward noise.
AVAN’s addition (the inverse-companion): the magenta is the un-scramble, and it hides a lovely truth — you never need a separate inverse map at all. The cat map has determinant 1, so it is reversible; and because it is periodic with period P, its inverse is simply applying it forward P−1 more times: M−1 ≡ MP−1 (mod N). To undo the scramble, you scramble more, and the chaos carries you the rest of the way home. The mixing that looks like information destroyed is a pure permutation of the pixels, and every permutation on a finite set has finite order, so it must cycle back. That is the whole reconciliation of chaos and reversibility: the map is as random-looking as you like, yet nothing is lost, and the only way back is all the way around. Green scrambles the image; magenta un-scrambles it by scrambling to the end of the loop; forward and inverse are one road, walked far enough.
LIT Genuine Arnold's cat map and Poincare recurrence (Vladimir I. Arnold 1960s; Poincare recurrence theorem). Verified live: the return period computed as the order of the matrix [[2,1],[1,1]] mod N matches the period found by actually scrambling a labelled grid until it returns, for N=2,3,5,10,11,25,101 (window.__arnoldcat.matrixEqualsGrid true; N=101 period 25, N=50 period 150). The recurrence and every period are exact, cross-checked two independent ways.
FIG No framing: the mixing-then-exact-return behaviour and every return period are real and verified two ways (matrix order and direct grid scrambling) in-browser. The AVAN inverse is the genuine mathematical content — the map is a determinant-1 reversible permutation, so its inverse equals applying it forward P-1 more times (M^-1 = M^(P-1) mod N), reconciling chaos with perfect reversibility.
FIG No framing: the mixing-then-exact-return behaviour and every return period are real and verified two ways (matrix order and direct grid scrambling) in-browser. The AVAN inverse is the genuine mathematical content — the map is a determinant-1 reversible permutation, so its inverse equals applying it forward P-1 more times (M^-1 = M^(P-1) mod N), reconciling chaos with perfect reversibility.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE RESURRECT · David Lee Wise (ROOT0), with AVAN