◀ THE FOLD0ROOT.AI // WORLD II · BOSS · SUDDEN DEATH◆ .dlw.fold
THE FOLD / BOSS / SUDDEN DEATH / THE ZOLOTAREV

THE ZOLOTAREV

a coin-flip sign hidden in modular multiplication
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Zolotarev’s lemma ties two seemingly unrelated worlds together: for an odd prime p and a number a not divisible by p, the Legendre symbol (a/p) — which is +1 if a is a quadratic residue mod p and −1 if not — equals the sign of the permutation that multiplication by a induces on {1, 2, …, p−1}. In other words, whether a has a square root mod p is exactly whether the shuffle x → a·x mod p is an even or odd permutation. Number theory and permutation parity turn out to be the same coin flip.

LIT verified live: for every odd prime p < 80 and every a in 1…p−1, the sign of the permutation x → a·x mod p (from its cycle structure) equals the Legendre symbol (a/p) computed by Euler’s criterion (window.__zolotarev). FIG no framing; permutation parity vs modular exponentiation.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at sudden-death — one bit decides everything: even or odd, residue or not, +1 or −1. The shuffle’s parity and the square-root question are the same sudden-death coin. AVAN (AI) built the instrument: the multiplication permutation, its sign from cycle counts, the Legendre symbol via a(p−1)/2, and their exact match.

Credit as content: Yegor Ivanovich Zolotarev (1872). The weave: David names sudden-death; I shuffle the residues by multiplying by a, read off the permutation’s sign from its cycles, and confirm it equals whether a is a quadratic residue mod p — parity and residue, one and the same.
3 ONE DIMENSION
Mod 7, x→3x: 1→3→2→6→4→5→1 (one 6-cycle) — odd permutation, sign −1. And (3/7) = −1 (3 is a non-residue mod 7). Same answer.
4 TWO DIMENSIONS · INTERACTIVE
The permutation x→a·x mod p as cycles, its sign, and the Legendre symbol; the equality checked over all primes.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: a residue question answered by a shuffle.
AVAN’s addition (the inverse-companion): decide whether a is a quadratic residue mod p not by exponentiating, but by asking whether multiplying by a shuffles the residues evenly or oddly. The inverse of ‘compute a(p−1)/2’ is ‘count the cycles of x→ax and read the parity.’ Magenta is the Euler-criterion exponentiation; green is the permutation-parity answer. Residue as parity.
LIT Genuine Zolotarev's lemma (Yegor Ivanovich Zolotarev, 1872). Verified live: for every odd prime p from 3 to 79 and every a in 1…p−1, the sign of the permutation x → a·x mod p — computed as (−1)^((p−1) − #cycles) — equals the Legendre symbol (a/p) computed by Euler's criterion (window.__zolotarev.matches).

FIG No framing: the multiplication permutation, its sign from cycle counts, and the Legendre symbol via modular exponentiation all run in-browser and agree exactly. The AVAN inverse is honest — deciding quadratic residuacity by the parity of the shuffle x→ax (rather than by exponentiating a^((p−1)/2)) is a genuine reframing; magenta is the Euler-criterion exponentiation, green the permutation-parity answer. Residue as parity.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of SUDDEN DEATH · David Lee Wise (ROOT0), with AVAN