Completely multiplicative function

Last updated November 04, 2023

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.

Definition

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$ and $\forall a,b\in {\text{domain}}(f),f(ab)=f(a)(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$ , one can see that both $0$ and $1$ are possibilities for the value of $f(1)$ in the following way: $f(1)=f(1\cdot 1)\iff f(1)=f(1)f(1)\iff f(1)=f(1)^{2}\iff f(1)^{2}-f(1)=0\iff f(1)\left(f(1)-1\right)=0\iff f(1)=0\lor f(1)=1$ .

The definition above can be rephrased using the language of algebra: A completely multiplicative function is a homomorphism from the monoid $(\mathbb {Z} ^{+},\cdot )$ (that is, the positive integers under multiplication) to some other monoid.

Examples

The easiest example of a completely multiplicative function is a monomial with leading coefficient 1: For any particular positive integer n, define f(a) = aⁿ. Then f(bc) = (bc)ⁿ = bⁿcⁿ = f(b)f(c), and f(1) = 1ⁿ = 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.

Properties

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 = p^aq^b ..., then f(n) = f(p)^af(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.

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 \cdot f$ where $\mu$ is the Möbius function.^[2]

Completely multiplicative functions also satisfy a distributive law. If f is completely multiplicative then

$f\cdot (g*h)=(f\cdot g)*(f\cdot h)$

where * represents the Dirichlet product and $\cdot$ represents pointwise multiplication.^[3] One consequence of this is that for any completely multiplicative function f one has

$f*f=\tau \cdot f$

which can be deduced from the above by putting both $g=h=1$ , where $1(n)=1$ is the constant function. Here $\tau$ is the divisor function.

Proof of distributive property

{\begin{aligned}f\cdot \left(g*h\right)(n)&=f(n)\cdot \sum _{d|n}g(d)h\left({\frac {n}{d}}\right)=\\&=\sum _{d|n}f(n)\cdot (g(d)h\left({\frac {n}{d}}\right))=\\&=\sum _{d|n}(f(d)f\left({\frac {n}{d}}\right))\cdot (g(d)h\left({\frac {n}{d}}\right)){\text{ (since }}f{\text{ is completely multiplicative) }}=\\&=\sum _{d|n}(f(d)g(d))\cdot (f\left({\frac {n}{d}}\right)h\left({\frac {n}{d}}\right))\\&=(f\cdot g)*(f\cdot h).\end{aligned}}

Dirichlet series

The L-function of completely (or totally) multiplicative Dirichlet series $a(n)$ satisfies

L(s,a)=\sum _{n=1}^{\infty }{\frac {a(n)}{n^{s}}}=\prod _{p}{\biggl (}1-{\frac {a(p)}{p^{s}}}{\biggr )}^{-1},

which means that the sum all over the natural numbers is equal to the product all over the prime numbers.

Related Research Articles

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n".

In number theory, a multiplicative function is an arithmetic function f(n) of a positive integer n with the property that f(1) = 1 and

The Möbius function $μ (n)$ is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted $μ (x)$ .

In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius.

<span class="mw-page-title-main">Euler's totient function</span> Number of integers coprime to and not exceeding n

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $or, and may also be called Euler's phi function . In other words, it is the number of integers k in the range 1 \leq k \leq n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n .$

In number theory, an additive function is an arithmetic function f(n) of the positive integer variable n such that whenever a and b are coprime, the function applied to the product ab is the sum of the values of the function applied to a and b:

The Liouville lambda function, denoted by λ(n) and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if n is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes.

In mathematics, a generating function is a way of encoding an infinite sequence of numbers by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the formal power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers.

In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for every locally finite partially ordered set and commutative ring with unity. Subalgebras called reduced incidence algebras give a natural construction of various types of generating functions used in combinatorics and number theory.

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.

In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.

In mathematics, a Dirichlet series is any series of the form

In mathematics, the Bell series is a formal power series used to study properties of arithmetical functions. Bell series were introduced and developed by Eric Temple Bell.

In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form

In mathematics, the von Mangoldt function is an arithmetic function named after German mathematician Hans von Mangoldt. It is an example of an important arithmetic function that is neither multiplicative nor additive.

In mathematics, a natural number a is a unitary divisor of a number b if a is a divisor of b and if a and $are coprime, having no common factor other than 1. Equivalently, a divisor a of b is a unitary divisor if and only if every prime factor of a has the same multiplicity in a as it has in b .$

In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.

In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average".

The purpose of this page is to catalog new, interesting, and useful identities related to number-theoretic divisor sums, i.e., sums of an arithmetic function over the divisors of a natural number $, or equivalently the Dirichlet convolution of an arithmetic function with one:$

In analytic number theory, a Dirichlet series, or Dirichlet generating function (DGF), of a sequence is a common way of understanding and summing arithmetic functions in a meaningful way. A little known, or at least often forgotten about, way of expressing formulas for arithmetic functions and their summatory functions is to perform an integral transform that inverts the operation of forming the DGF of a sequence. This inversion is analogous to performing an inverse Z-transform to the generating function of a sequence to express formulas for the series coefficients of a given ordinary generating function.

References

↑ Apostol, Tom (1976). Introduction to Analytic Number Theory . Springer. pp. 30. ISBN 0-387-90163-9.
↑ Apostol, p. 36
↑ Apostol pg. 49

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Apostol, Tom (1976). Introduction to Analytic Number Theory . Springer. pp. 30. ISBN 0-387-90163-9.

[2] Apostol, p. 36

[3] Apostol pg. 49

[1]

[2]

[3]