Multiplicative functions form abelian group under Dirichlet product

From Number

Statement

Suppose N is the set of natural numbers and R is a commutative unital ring. Let M be the set of all multiplicative functions from N to R, i.e., all the functions f:NR satisfying the following:

  • f(1)=1,
  • f(mn)=f(m)f(n) whenever m,n are relatively prime.

Consider the Dirichlet product, a binary operation defined on functions from N to R:

(f*g)(n)=d|nf(d)g(n/d).

Then, M forms an abelian group under the Dirichlet product, with multiplicative identity given by the function I that takes the value 1 at 1 and 0 elsewhere.

Proof

Closure under Dirichlet product

We first need to show that the Dirichlet product is a well-defined binary operation on multiplicative functions; in other words, that a Dirichlet product of multiplicative functions is multiplicative.

Given: Multiplicative functions f,g.

To prove: f*g is multiplicative.

Proof: Suppose m and n are relatively prime natural numbers. Consider:

(f*g)(mn)=d|mnf(d)g(mn/d).

Given any divisor d of mn, d can be expressed uniquely as d1d2, where d1|m and d2|n. Conversely, given d1|m and d2|n, d1d2|mn. Thus, we have:

(f*g)(mn)=d1|md2|nf(d1d2)g((mn)/(d1d2)).

Next, since d1 and d2 are relatively prime and m/d1 and n/d2 are also relatively prime, and f and g are multiplicative:

(f*g)(mn)=d1|md2|nf(d1)f(d2)g(m/d1)g(n/d2).

Next, we rearrange:

(f*g)(mn)=(d1|mf(d1)g(m/d1))(d2|nf(d2)g(n/d2)).

Thus:

(f*g)(mn)=(f*g)(m)(f*g)(n).

Associativity and commutativity

These follow from the fact that the Dirichlet product is associative and commutative for all functions:

Identity element

This follows from the fact that the function I is an identity element for the Dirichlet product for all functions: Identity element for Dirichlet product is indicator function for one.

Inverses

Given a multiplicative function f, the inverse of f can be defined inductively as follows:

g(1)=1,g(n)=d|n,1d<ng(d)f(n/d).

Since f(1)=1, this clearly satisfies:

g(1)f(1)=1,d|ng(d)f(n/d)=0n>1.

Thus, g*f=I. Since the multiplication is commutative, g is a two-sided inverse for f.

Next, we need to verify that g is multiplicative. Fill this in later