THE FOLD / SPAWN / CHECKPOINT ZERO / THE MOBIUS
THE MOBIUS
the sign of the primes that un-mixes divisor sums
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Möbius function μ(n). A sign that reads a number’s prime skeleton. μ(1) = 1. If n is a product of k distinct primes, μ(n) = (−1)k. If any prime is repeated (a square divides n), μ(n) = 0. So μ(6) = +1, μ(30) = −1, μ(12) = 0.
Its power is one identity: Σd|n μ(d) = [n = 1] — the μ-values over the divisors of any n > 1 cancel to zero. That drives Möbius inversion: if g is the ‘divisor sum’ of f (g(n) = Σd|n f(d)), then f is recovered exactly by f(n) = Σd|n μ(d) g(n/d). Inclusion-exclusion crystallised into a single sign. It even links every arithmetic function: φ(n) = Σd|n μ(d)·(n/d), and Σμ(n)/ns = 1/ζ(s).
LIT verified live: Σd|nμ(d) = [n=1] for all n, Möbius inversion recovers an arbitrary f from its divisor sum, and φ(n) = Σμ(d)(n/d) (window.__mobius.sumIdentity && inversion && phiIdentity). μ(1..12) = 1,−1,−1,0,−1,1,−1,0,0,1,−1,0. FIG no framing; the identity, the inversion, and the φ link are exact.
Its power is one identity: Σd|n μ(d) = [n = 1] — the μ-values over the divisors of any n > 1 cancel to zero. That drives Möbius inversion: if g is the ‘divisor sum’ of f (g(n) = Σd|n f(d)), then f is recovered exactly by f(n) = Σd|n μ(d) g(n/d). Inclusion-exclusion crystallised into a single sign. It even links every arithmetic function: φ(n) = Σd|n μ(d)·(n/d), and Σμ(n)/ns = 1/ζ(s).
LIT verified live: Σd|nμ(d) = [n=1] for all n, Möbius inversion recovers an arbitrary f from its divisor sum, and φ(n) = Σμ(d)(n/d) (window.__mobius.sumIdentity && inversion && phiIdentity). μ(1..12) = 1,−1,−1,0,−1,1,−1,0,0,1,−1,0. FIG no framing; the identity, the inversion, and the φ link are exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in CHECKPOINT ZERO, right beside THE TOTIENT — the spawn domain of numbers read through their structure. μ and φ are the two great arithmetic functions, and Möbius inversion is the bridge that turns one into the other. AVAN (AI) built the instrument: the μ sign, the cancelling divisor sum, the inversion, the φ identity.
The weave: David places it next to its twin; I make the sign visible and the un-mixing checkable — the μ strip in 1D, the divisor cancellation and inversion in 2D, the sign-ring in 3D. The sphere is the seam. Credit: August Ferdinand Möbius (1832); the connection to ζ via Riemann.
The weave: David places it next to its twin; I make the sign visible and the un-mixing checkable — the μ strip in 1D, the divisor cancellation and inversion in 2D, the sign-ring in 3D. The sphere is the seam. Credit: August Ferdinand Möbius (1832); the connection to ζ via Riemann.
3 ONE DIMENSION
The Möbius function along the integers: +1 for an even number of distinct primes, −1 for odd, 0 whenever a prime repeats. A jagged ±1 fingerprint of how each number is built from primes.
4 TWO DIMENSIONS · INTERACTIVE
Pick n and see its divisors with their μ values — for n > 1 they sum to exactly 0. Then watch Möbius inversion: a function’s divisor sums are un-mixed back into the original values, μ supplying the exact cancelling weights.
5 THREE DIMENSIONS + AVAN’S INVERSE
The integers on a turning ring, coloured by μ — green +1, dark 0, and the −1s.
AVAN’s addition (the inverse-companion): the magenta are the −1 values — and μ is, quite literally, an inverse operator. Summing a function over the divisors of n entangles its values: g(n) blends f across every divisor, a forward, mixing operation. Möbius inversion is the exact undo — μ is precisely the set of ±1, 0 weights that disentangle the blend and pull f back out of g. The inverse of ‘sum over divisors’ is ‘μ-weighted sum over divisors’, and μ exists because the divisor-sum is invertible: it is inclusion-exclusion, distilled to a single sign function, the primes’ own ±1 fingerprint that unmixes any sum built on them. The green is the sign along the numbers; the magenta is the −1s doing the cancelling that makes the inverse exact.
LIT Genuine Mobius function and inversion (August Mobius, 1832). Verified live: sum over d|n of mu(d) equals [n==1] for all n, Mobius inversion recovers an arbitrary function f from its divisor sum g, and phi(n) = sum over d|n of mu(d)*(n/d) (window.__mobius.sumIdentity && inversion && phiIdentity, all true). mu(1..12) = 1,-1,-1,0,-1,1,-1,0,0,1,-1,0. The identity, the inversion, and the phi link are exact.
FIG No metaphor is doing the work: the mu sign rule, the cancelling divisor-sum identity, Mobius inversion, and the phi identity are all real and checked exhaustively. mu is genuinely the inverse of the divisor-sum operation (inclusion-exclusion as a sign function), the dual of the totient beside it.
FIG No metaphor is doing the work: the mu sign rule, the cancelling divisor-sum identity, Mobius inversion, and the phi identity are all real and checked exhaustively. mu is genuinely the inverse of the divisor-sum operation (inclusion-exclusion as a sign function), the dual of the totient beside it.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of CHECKPOINT ZERO · David Lee Wise (ROOT0), with AVAN