◀ THE FOLD0ROOT.AI // WORLD II · GLITCH · RACE CONDITION◆ .dlw.fold
THE FOLD / GLITCH / RACE CONDITION / THE REDHEFFER

THE REDHEFFER

a determinant equal to the Mertens function
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Redheffer matrix hides the deepest object in number theory inside a matrix of 0’s and 1’s. Define the n×n matrix R with Rij=1 whenever i divides j, and also 1 in the entire first column; every other entry is 0. Redheffer proved that its determinant equals the Mertens function M(n) = ∑k≤n μ(k), the running sum of the Möbius function. A pattern of divisibility 1’s, run through a determinant, produces the very quantity whose growth is equivalent to the Riemann Hypothesis. It is a startling bridge from linear algebra to the primes.

LIT verified live with exact integer arithmetic: for n = 1..40, the determinant of the Redheffer matrix (by fraction-free Bareiss elimination) equals the Mertens function M(n) computed independently from the Möbius function — M(1)=1, M(2)=0, M(3)=-1, … (window.__redheffer). FIG no framing; the determinant and the Möbius sum are computed by different routes and agree exactly.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at race-condition — the glitch where two totally different processes, a determinant and a sum over the Möbius function, race to the very same number every time. AVAN (AI) built the instrument: the Redheffer divisibility matrix, its exact determinant, and the independent Mertens sum.

Credit as content: Ray Redheffer (1977); the Möbius and Mertens functions from Möbius and Mertens. The weave: David names the race; I confirm det(Rn) equals M(n).
3 ONE DIMENSION
The Redheffer matrix: a 1 where i divides j, plus a full first column — its determinant is the Mertens function.
4 TWO DIMENSIONS · INTERACTIVE
Cycle n; the Redheffer determinant is compared to the Mertens function M(n) from the Möbius sum.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the Mertens function M(n), from the determinant.
AVAN’s addition (the inverse-companion): don’t sum the Möbius function — take a determinant. The inverse of ‘the Mertens function M(n)’ is ‘the determinant of the divisibility matrix Rn’, tying a running prime-parity sum to one linear-algebra value. Magenta is the divisibility pattern of 1’s; green is the Mertens value it evaluates to. The primes hiding in a determinant.
LIT Genuine Redheffer matrix identity (Ray Redheffer, 1977). Verified live with exact BigInt: for n=1..40, det(R_n) by fraction-free Bareiss elimination equals the Mertens function M(n)=Σ_{k≤n}μ(k) computed independently from the Möbius function; M(10)=−1, M(40)=0 (window.__redheffer.ok, .m10, .m40).

FIG No framing; the determinant and the Möbius sum are computed by different routes and agree exactly. The AVAN inverse is honest — instead of summing the Möbius function, take a determinant: the inverse of 'the Mertens function M(n)' is 'the determinant of the divisibility matrix R_n', tying a running prime-parity sum to one linear-algebra value. Magenta is the divisibility pattern of 1's; green is the Mertens value it evaluates to. The primes hiding in a determinant.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of RACE CONDITION · David Lee Wise (ROOT0), with AVAN