In number theory, functions of positive integers which respect products are important and are called completely multiplicative functions or totally multiplicative functions. A weaker condition is also important, respecting only products of coprime numbers, and such functions are called multiplicative functions. Outside of number theory, the term "multiplicative function" is often taken to be synonymous with "completely multiplicative function" as defined in this article.
A completely multiplicative function (or totally multiplicative function) is an arithmetic function (that is, a function whose domain is the natural numbers), such that f(1) = 1 and f(ab) = f(a)f(b) holds for all positive integers a and b.[1]
In logic notation:
f(1)=1
\foralla,b\indomain(f),f(ab)=f(a)f(b)
Without the requirement that f(1) = 1, one could still have f(1) = 0, but then f(a) = 0 for all positive integers a, so this is not a very strong restriction. If one did not fix
f(1)=1
0
1
f(1)
(Z+, ⋅ )
The easiest example of a completely multiplicative function is a monomial with leading coefficient 1: For any particular positive integer n, define f(a) = an. Then f(bc) = (bc)n = bncn = f(b)f(c), and f(1) = 1n = 1.
The Liouville function is a non-trivial example of a completely multiplicative function as are Dirichlet characters, the Jacobi symbol and the Legendre symbol.
A completely multiplicative function is completely determined by its values at the prime numbers, a consequence of the fundamental theorem of arithmetic. Thus, if n is a product of powers of distinct primes, say n = pa qb ..., then f(n) = f(p)a f(q)b ...
While the Dirichlet convolution of two multiplicative functions is multiplicative, the Dirichlet convolution of two completely multiplicative functions need not be completely multiplicative. Arithmetic functions which can be written as the Dirichlet convolution of two completely multiplicative functions are said to be quadratics or specially multiplicative multiplicative functions. They are rational arithmetic functions of order (2, 0) and obey the Busche-Ramanujan identity.
There are a variety of statements about a function which are equivalent to it being completely multiplicative. For example, if a function f is multiplicative then it is completely multiplicative if and only if its Dirichlet inverse is
\mu ⋅ f
\mu
Completely multiplicative functions also satisfy a distributive law. If f is completely multiplicative then
f ⋅ (g*h)=(f ⋅ g)*(f ⋅ h)
where * represents the Dirichlet product and
⋅
f*f=\tau ⋅ f
which can be deduced from the above by putting both
g=h=1
1(n)=1
\tau
\begin{align} f ⋅ \left(g*h\right)(n)&=f(n) ⋅ \sumd|ng(d)h\left(
| n | |
| d |
\right)=\\ &=\sumd|nf(n) ⋅ (g(d)h\left(
| n | |
| d |
\right))=\\ &=\sumd|n(f(d)f\left(
| n | |
| d |
\right)) ⋅ (g(d)h\left(
| n | |
| d |
\right))(sincefiscompletelymultiplicative)=\\ &=\sumd|n(f(d)g(d)) ⋅ (f\left(
| n | |
| d |
\right)h\left(
| n | |
| d |
\right))\\ &=(f ⋅ g)*(f ⋅ h). \end{align}
a(n)
| infty | |
| L(s,a)=\sum | |
| n=1 |
| a(n) | |
| ns |
| =\prod | ||||
|
r)-1,