The Ring of Arithmetic Functions

The ring $(A,+,*)$ is the algebraic backbone underlying Möbius inversion: since $\mathbf{1}$ (the constant function $\mathbf{1}(n)=1$) satisfies $\mathbf{1}(1)=1\neq 0$, it is a unit, and its inverse is exactly The Mobius Function $\mu$, satisfying $\mathbf{1} * \mu = \varepsilon$. This single ring fact — that $\mu$ is the convolution inverse of $\mathbf{1}$ — is the entire content of Möbius inversion, foreshadowing how identities like $F = \mathbf{1} * f$ can be "solved" for $f$ as $f = \mu * F$. Beyond pure number theory, this convolution structure recurs in analytic number theory via Dirichlet series, where $(A,*)$ corresponds to formal multiplication of series $\sum f(n)n^{-s}$; the Riemann zeta function $\zeta(s) = \sum n^{-s}$ corresponds to $\mathbf{1}$, and $1/\zeta(s) = \sum \mu(n) n^{-s}$ is exactly the statement $\mathbf{1}^{-1} = \mu$ translated into analytic language. In combinatorics, the same convolution appears as the incidence algebra of the divisor poset, generalized by Rota to arbitrary locally finite posets — the arithmetic-function ring is the special case of the divisibility poset on $\mathbb{Z}_{\ge1}$. In cryptography and computational number theory, fast computation of multiplicative functions (Euler's totient, sum-of-divisors) via convolution identities underlies efficient algorithms for RSA-adjacent computations and sieve methods. In algebra, the ring of arithmetic functions is a standard example of an integral domain that is not a field, useful for illustrating unit groups and zero-divisor-free rings in a concrete, computable setting, connecting to the broader theory of Dirichlet Convolution as an instance of convolution algebras.

Ask the tutor: How does the identity $\mathbf{1}^{-1} = \mu$ proved here directly yield the Möbius inversion formula?

Think of an arithmetic function $f$ as an infinite table of numbers, one entry $f(1), f(2), f(3),\dots$ for each positive integer. Addition is entrywise, exactly like adding two vectors or two sequences: nothing about the multiplicative structure of the index $n$ is used. But Dirichlet convolution is different in a crucial way — to compute $(f*g)(n)$, you must know the factorization structure of $n$, because you sum over pairs $(d, n/d)$ with $d n/d = n$. This is why convolution "sees" primes and divisors while pointwise multiplication does not. A good mental picture is a divisor lattice. For $n=12$, the divisors are $1,2,3,4,6,12$, and $(f*g)(12)$ pairs each divisor $d$ with its complementary divisor $12/d$: $(1,12), (2,6), (3,4), (4,3), (6,2), (12,1)$. The sum $\sum f(d)g(12/d)$ walks across this lattice symmetrically. This is exactly why convolution is commutative — swapping $f$ and $g$ just relabels which factor in each pair is "$f$'s divisor" versus "$g$'s divisor," and the same six pairs get hit either way. The identity element $\varepsilon$ works like a Kronecker delta sitting at $n=1$: convolving with $\varepsilon$ contributes only the term $d=1$ (giving $f(n)\cdot\varepsilon(1)\cdot$ nothing else, since every other term has $\varepsilon(n/d)=0$ unless $n/d=1$). So $\varepsilon$ silently "does nothing," just as $1$ does nothing under ordinary multiplication.

Example 1: Inverting $f(n) = n$ (i.e. computing $\mathrm{Id}^{-1}$) at $n = 12$. Let $\mathrm{Id}(n) = n$. Since $\mathrm{Id}(1) = 1 \ne 0$, Part 6 guarantees an inverse $g := \mathrm{Id}^{-1}$ exists and is computed recursively:

We build up $g$ on the divisors of $12$: $1,2,3,4,6,12$. $g(2)$: divisors $d<2$ of $2$ are $\{1\}$. Recursion: $g(2) = -\sum_{d\mid 2, d<2} \mathrm{Id}(2/d) g(d) = -\mathrm{Id}(2)g(1) = -2\cdot 1 = -2$. $g(3)$: divisors $d<3$ of $3$: $\{1\}$. $g(3) = -\mathrm{Id}(3)g(1) = -3$. $g(4)$: divisors $d<4$ of $4$: $\{1,2\}$. $g(4) = -\big[\mathrm{Id}(4)g(1) + \mathrm{Id}(2)g(2)\big] = -\big[4\cdot 1 + 2\cdot(-2)\big] = -(4-4) = 0$. $g(6)$: divisors $d<6$ of $6$: $\{1,2,3\}$. $g(6) = -\big[\mathrm{Id}(6)g(1)+\mathrm{Id}(3)g(2)+\mathrm{Id}(2)g(3)\big] = -\big[6(1) + 3(-2) + 2(-3)\big] = -(6-6-6)=6$. $g(12)$: divisors $d<12$ of $12$: $\{1,2,3,4,6\}$. We need $\mathrm{Id}(12/d)$ for each:

Plug in numbers: $\mathrm{Id}(12)=12,\ g(1)=1$; $\mathrm{Id}(6)=6,\ g(2)=-2$; $\mathrm{Id}(4)=4,\ g(3)=-3$; $\mathrm{Id}(3)=3,\ g(4)=0$; $\mathrm{Id}(2)=2,\ g(6)=6$. So:

Check. In fact one can recognize $g = \mu \cdot \mathrm{Id}$ pointwise — i.e. $g(n) = n\mu(n)$ — because $\mathrm{Id} = \mathbf{1} * \phi$ (Euler's identity $\sum_{d\mid n}\phi(d) = n$) is closely related to known convolution facts, but let us verify $g(n) = n\mu(n)$ directly from our computed values: $g(1)=1=1\cdot\mu(1)$, $g(2)=-2=2\mu(2)=2(-1)$, $g(3) = -3 = 3\mu(3) = 3(-1)$, $g(4) = 0 = 4\mu(4) = 4\cdot 0$ (since $4=2^2$ is not squarefree), $g(6) = 6 = 6\mu(6) = 6\cdot 1$ (since $6=2\cdot3$, $\mu(6)=1$), $g(12) = 0 = 12\mu(12) = 12\cdot 0$ (since $12 = 2^2\cdot 3$ is not squarefree). Every value matches, confirming $\mathrm{Id}^{-1}(n) = n\mu(n)$ and giving a fully independent numerical check of our recursive computation via The Mobius Function.

Example 2: Verifying associativity numerically for $f(n) = d(n)$ (number of divisors), $g = \mu$, $h(n) = n$, at $n = 6$. We check $((f*g)*h)(6) = (f*(g*h))(6)$ directly, to see the associativity proof "in action" rather than trust it abstractly. Data. $d(1)=1,d(2)=2,d(3)=2,d(6)=4$. $\mu(1)=1,\mu(2)=-1,\mu(3)=-1,\mu(6)=1$. $\mathrm{Id}(n)=n$. Step A: compute $(f*g)(n) = (d*\mu)(n)$ for $n=1,2,3,6$.

(This matches the classical identity $d * \mu = \mathbf{1}$... actually let's not assert unproven identities; we simply use these as raw numbers.) Step B: compute $((f*g)*h)(6) = ((d*\mu)*\mathrm{Id})(6)$.

Step C: compute $(g*h)(n) = (\mu * \mathrm{Id})(n)$ for $n = 1,2,3,6$.

Step D: compute $(f*(g*h))(6) = (d*(\mu*\mathrm{Id}))(6)$.

Both computations give $12$, confirming $((d*\mu)*\mathrm{Id})(6) = (d*(\mu*\mathrm{Id}))(6) = 12$, exactly as the associativity theorem (Part 2) predicts — and this matches the triple-sum formula $S(6) = \sum_{abc=6} d(a)\mu(b)c$, which the reader may check directly enumerates the eight ordered triples $(a,b,c)$ with $abc=6$ (namely permutations arising from $6=1\cdot1\cdot6, 1\cdot2\cdot3,1\cdot3\cdot2,1\cdot6\cdot1,2\cdot1\cdot3,2\cdot3\cdot1,3\cdot1\cdot2,3\cdot2\cdot1,6\cdot1\cdot1$, ten triples in total since $6$ has three distinct prime-power patterns) and sums to $12$.