Dirichlet Convolution

In mathematics, Dirichlet convolution (or divisor convolution) is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet.

Definition

If $f , g : \mathbb\to\mathbb$ are two arithmetic functions, their Dirichlet convolution $f*g$ is a new arithmetic function defined by:

:$(f*g)(n) \ =\ \sum_ f(d)\,g\!\left(\frac\right) \ =\ \sum_\!f(a)\,g(b),$

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$.

This product occurs naturally in the study of Dirichlet series such as the Riemann zeta function. It describes the multiplication of two Dirichlet series in terms of their coefficients:
:$\left(\sum_\frac\right) \left(\sum_\frac\right) \ = \ \left(\sum_\frac\right).$

Properties

The set of arithmetic functions forms a commutative ring, the , with addition given by pointwise addition and multiplication by Dirichlet convolution. The multiplicative identity is the unit function $\varepsilon$ defined by $\varepsilon(n)=1$ if $n=1$ and $0$ otherwise. The units (invertible elements) of this ring are the arithmetic functions $f$ with $f(1) \neq 0$.

Specifically, Dirichlet convolution is associative,
:$(f * g) * h = f * (g * h),$
distributive over addition
:$f * (g + h) = f * g + f * h$,
commutative,
:$f * g = g * f$,
and has an identity element,
: $f * \varepsilon$ = $\varepsilon * f = f$.
Furthermore, for each function $f$ having $f(1) \neq 0$, there exists another arithmetic function $f^$ satisfying $f * f^ = \varepsilon$, called the of $f$.

The Dirichlet convolution of two multiplicative functions is again multiplicative, and every not constantly zero multiplicative function has a Dirichlet inverse which is also multiplicative. In other words, multiplicative functions form a subgroup of the group of invertible elements of the Dirichlet ring. Beware however that the sum of two multiplicative functions is not multiplicative (since $(f+g)(1)=f(1)+g(1)=2 \neq 1$), so the subset of multiplicative functions is not a subring of the Dirichlet ring. The article on multiplicative functions lists several convolution relations among important multiplicative functions.

Another operation on arithmetic functions is pointwise multiplication: $fg$ is defined by $(fg)(n)=f(n)g(n)$. Given a completely multiplicative function $h$, pointwise multiplication by $h$ distributes over Dirichlet convolution: $(f * g)h = (fh) * (gh)$. The convolution of two completely multiplicative functions is multiplicative, but not necessarily completely multiplicative.

Properties and examples

In these formulas, we use the following arithmetical functions:
* $\varepsilon$ is the multiplicative identity: $\varepsilon(1) = 1$, otherwise 0 ($\varepsilon(n)=\lfloor \tfrac1n \rfloor$).
* $1$ is the constant function with value 1: $1(n) = 1$ for all $n$. Keep in mind that $1$ is not the identity. (Some authors denote this as $\zeta$ because the associated Dirichlet series is the Riemann zeta function.)
* $1_C$ for $C \subset \mathbb$ is a set indicator function: $1_C(n) = 1$ iff $n \in C$, otherwise 0.
*$\text$ is the identity function with value ''n'': $\text(n) = n$.
*$\text_k$ is the ''k''th power function: $\text_k(n)=n^k$.

The following relations hold:

* $1 * \mu = \varepsilon$, the Dirichlet inverse of the constant function $1$ is the Möbius function (see proof). Hence:
*$g = f * 1$ if and only if $f = g * \mu$, the Möbius inversion formula.
*$\sigma_k = \text_k * 1$, the kth-power-of-divisors sum function ''σ''_''k''.
*$\sigma = \text * 1$, the sum-of-divisors function .
*$\tau = 1 * 1$ , the number-of-divisors function .
*$\text_k = \sigma_k * \mu$,  by Möbius inversion of the formulas for ''σ''_''k'', ''σ'', and ''τ''.
*$\text = \sigma * \mu$
*$1 = \tau * \mu$
*$\phi * 1 = \text$ , proved under Euler's totient function.
*$\phi = \text * \mu$ , by Möbius inversion.
*$\sigma = \phi * \tau$  , from convolving 1 on both sides of $\phi * 1 = \text$.
*$\lambda * , \mu, = \varepsilon$  where ''λ'' is Liouville's function.
*$\text * \phi = P$, where $P$ is Pillai's arithmetical function, also known as the gcd-sum function.
*$\lambda * 1 = 1_$ where Sq = is the set of squares.
*$\text_k * (\text_k \mu) = \varepsilon$
*$\tau^3 * 1 = (\tau * 1)^2$
*$J_k * 1 = \text_k$, Jordan's totient function.
*$(\text_s J_r) * J_s = J_$
*$\Lambda * 1 = \log$, where $\Lambda$ is von Mangoldt's function.
*$, \mu, \ast 1 = 2^,$ where $\omega(n)$ is the prime omega function counting ''distinct'' prime factors of ''n''.
*$\Omega \ast \mu = 1_$, the characteristic function of the prime powers.
*$\omega \ast \mu = 1_$ where $1_(n) \mapsto \$ is the characteristic function of the primes.

This last identity shows that the prime-counting function is given by the summatory function

:$\pi(x) = \sum_ (\omega \ast \mu)(n) = \sum_^ \omega(d) M\left(\left\lfloor \frac \right\rfloor\right)$

where $M(x)$ is the Mertens function and $\omega$ is the distinct prime factor counting function from above. This expansion follows from the identity for the sums over Dirichlet convolutions given on the divisor sum identities page (a standard trick for these sums).

Dirichlet inverse

Examples

Given an arithmetic function $f$ its Dirichlet inverse $g = f^$ may be calculated recursively: the value of $g(n)$ is in terms of $g(m)$ for m.

For $n=1$:
:$(f * g) (1) = f(1) g(1) = \varepsilon(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) = \varepsilon(2) = 0$,
:$g(2) = -(f(2) g(1))/f(1)$,

For $n=3$:
: $(f * g) (3) = f(1) g(3) + f(3) g(1) = \varepsilon(3) = 0$,
: $g(3) = -(f(3) g(1))/f(1)$,

For $n=4$:
: $(f * g) (4) = f(1) g(4) + f(2) g(2) + f(4) g(1) = \varepsilon(4) = 0$,
: $g(4) = -(f(4) g(1) + f(2) g(2))/f(1)$,

and in general for $n>1$,

:$g(n) \ =\ \frac \mathop_ f\left(\frac\right) g(d).$

Properties

The following properties of the Dirichlet inverse hold:Again see Apostol Chapter 2 and the exercises at the end of the chapter.

* The function ''f'' has a Dirichlet inverse if and only if .
* The Dirichlet inverse of a multiplicative function is again multiplicative.
* The Dirichlet inverse of a Dirichlet convolution is the convolution of the inverses of each function: $(f \ast g)^ = f^ \ast g^$.
* A multiplicative function ''f'' is completely multiplicative if and only if $f^(n) = \mu(n) f(n)$.
* If ''f'' is completely multiplicative then $(f \cdot g)^ = f \cdot g^$ whenever $g(1) \neq 0$ and where $\cdot$ denotes pointwise multiplication of functions.

Other formulas

An exact, non-recursive formula for the Dirichlet inverse of any arithmetic function ''f'' is given in Divisor sum identities. A more partition theoretic expression for the Dirichlet inverse of ''f'' is given by

:$f^(n) = \sum_^ \left\.$
The following formula provides a compact way of expressing the Dirichlet inverse of an invertible arithmetic function ''f'' :

$f^=\sum_^\frac$

where the expression $(f(1)\varepsilon-f)^$ stands for the arithmetic function $f(1)\varepsilon-f$ convoluted with itself ''k'' times. Notice that, for a fixed positive integer $n$, if $k>\Omega(n)$ then $(f(1)\varepsilon-f)^(n)=0$ , this is because $f(1)\varepsilon(1) - f(1) = 0$ and every way of expressing ''n'' as a product of ''k'' positive integers must include a 1, so the series on the right hand side converges for every fixed positive integer ''n.''

Dirichlet series

If ''f'' is an arithmetic function, the Dirichlet series generating function is defined by

:$DG(f;s) = \sum_^\infty \frac$

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 a special case of the convolution multiplication for the incidence algebra of a poset, in this case the poset of positive integers ordered by divisibility.

The Dirichlet hyperbola method computes the summation of a convolution in terms of its functions and their summation functions.

See also

* Arithmetic function
* Divisor sum identities
* Möbius inversion formula

References

*
*
*
*
*
*
*
*
*
*
*

External links

*

{{Peter Gustav Lejeune Dirichlet

Arithmetic functions
Bilinear maps

de:Zahlentheoretische Funktion#Faltung