Dirichlet convolution

In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet, a German mathematician.

Definition

If f and g are two arithmetic functions (i.e. functions from the positive integers to the complex numbers), one defines a new arithmetic function f ∗ g, the Dirichlet convolution of f and g, by

$\begin{align} (f*g)(n) &= \sum_{d\,\mid \,n} f(d)g\left(\frac{n}{d}\right) \\ &= \sum_{ab\,=\,n}f(a)g(b) \end{align}$

where the sum extends over all positive divisors d of n, or equivalently over all distinct pairs (a, b) of positive integers whose product is n.

Properties

The set of arithmetic functions forms a commutative ring, the Dirichlet ring, under pointwise addition (i.e. f + g is defined by (f + g)(n) = f(n) + g(n)) and Dirichlet convolution. The multiplicative identity is the unit function ε defined by ε(n) = 1 if n = 1 and ε(n) = 0 if n > 1. The units (i.e. invertible elements) of this ring are the arithmetic functions f with f(1) ≠ 0.

Specifically, Dirichlet convolution is associative,

(f ∗ g) ∗ h = f ∗ (g ∗ h),

distributes over addition

f ∗ (g + h) = f ∗ g + f ∗ h = (g + h) ∗ f,

is commutative,

f ∗ g = g ∗ f,

and has an identity element,

f ∗ ε = ε ∗ f = f.

Furthermore, for each f for which f(1) ≠ 0 there exists a g such that f ∗ g = ε, called the Dirichlet inverse of f.

The Dirichlet convolution of two multiplicative functions is again multiplicative, and every multiplicative function has a Dirichlet inverse that is also multiplicative. The article on multiplicative functions lists several convolution relations among important multiplicative functions.

Given a completely multiplicative function f, then f(g ∗ h) = (fg) ∗ (fh), where juxtaposition represents pointwise multiplication. The convolution of two completely multiplicative functions is multiplicative, but not necessarily completely multiplicative.

Examples

In these formulas

ε is the multiplicative identity. (I.e. ε(1) = 1, all other values 0.)

1 is the constant function whose value is 1 for all n. (I.e. 1(n) = 1.) Keep in mind that 1 is not the identity.

1_C, where $\scriptstyle C\subset\mathbb{Z}$ is a set is the indicator function. (I.e. 1_C(n) = 1 if n ∈ C, 0 otherwise.)

Id is the identity function whose value is n. (I.e. Id(n) = n.)

Id_k is the kth power function. (I.e. Id_k(n) = n^k.)

The other functions are defined in the article arithmetical function.

• 1 ∗ μ = ε   (the Dirichlet inverse of the constant function 1 is the Möbius function.) This implies
• g = f ∗ 1 if and only if f = g ∗ μ   (the Möbius inversion formula).
• λ ∗ | μ | = ε   where λ is Liouville's function.
• λ ∗ 1 = 1_Sq   where Sq = {1, 4, 9, ...} is the set of squares
• Id_k ∗ (Id_k μ) = ε
• σ_k = Id_k ∗ 1   definition of the divisor function σ_k
• σ = Id ∗ 1   definition of the function σ = σ₁
• d = 1 ∗ 1   definition of the function d(n) = σ₀
• Id_k = σ_k ∗ μ   Möbius inversion of the formulas for σ_k, σ, and d.
• Id = σ ∗ μ
• 1 = d ∗ μ
• d³ ∗ 1 = (d ∗ 1)²
• φ ∗ 1 = Id   This formula is proved in the article Euler's totient function.
• J_k ∗ 1 = Id_k   The Jordan's totient function.
• (Id_sJ_r) ∗ J_s = J_{s + r}
• σ = φ ∗ d   Proof: convolve 1 to both sides of Id = φ ∗ 1.
• Λ ∗ 1 = log   where Λ is von Mangoldt function.

Dirichlet inverse

Given an arithmetic function f its Dirichlet inverse g = f⁻¹ may be calculated recursively (i.e. the value of g(n) is in terms of g(m) for m < n) from the definition of Dirichlet inverse.

For n = 1:

(f ∗ g) (1) = f(1) g(1) = ε(1) = 1, so

g(1) = 1/f(1). This implies that f does not have a Dirichlet inverse if f(1) = 0.

For n = 2

(f ∗ g) (2) = f(1) g(2) + f(2) g(1) = ε(2) = 0,

g(2) = −1/f(1) (f(2) g(1)),

For n = 3

(f ∗ g) (3) = f(1) g(3) + f(3) g(1) = ε(3) = 0,

g(3) = −1/f(1) (f(3) g(1)),

For n = 4

(f ∗ g) (4) = f(1) g(4) + f(2) g(2) + f(4) g(1) = ε(4) = 0,

g(4) = −1/f(1) (f(4) g(1) + f(2) g(2)),

and in general for n > 1,

$g(n) = \frac {-1}{f(1)} \sum_\stackrel{d\,\mid \,n} {d < n} f\left(\frac{n}{d}\right) g(d).$

Since the only division is by f(1) this shows that f has a Dirichlet inverse if and only if f(1) ≠ 0.

Here is a useful table of Dirichlet inverses of common arithmetic functions:

Arithmetic function	Dirichlet inverse
Constant function equal to 1	Möbius function μ
$n^{\alpha}$	$\mu(n) \,n^\alpha$
Liouville's function λ	Absolute value of Möbius function | μ |

Dirichlet series

If f is an arithmetic function, one defines its Dirichlet series generating function by

$DG(f;s) = \sum_{n=1}^\infty \frac{f(n)}{n^s}$

for those complex arguments s for which the series converges (if there are any). The multiplication of Dirichlet series is compatible with Dirichlet convolution in the following sense:

$DG(f;s) DG(g;s) = DG(f*g;s)\,$

for all s for which both series of the left hand side converge, one of them at least converging absolutely (note that simple convergence of both series of the left hand side DOES NOT imply convergence of the right hand side!). This is akin to the convolution theorem if one thinks of Dirichlet series as a Fourier transform.

Related Concepts

The restriction of the divisors in the convolution to unitary, bi-unitary or infinitary divisors defines similar commutative operations which share many features with the Dirichlet convolution (existence of a Möbius inversion, persistence of multiplicativity, definitions of totients, Euler-type product formulas over associated primes, etc.).
Dirichlet convolution is the convolution of the Incidence algebra for the positive integers ordered by divisibility.

External links

• de:Zahlentheoretische Funktion#Faltung