An arithmetic function is a multiplicative function when and for all coprime integers , meaning their greatest common divisor is . The condition excludes the identically zero function. This definition makes no assertion about a pair whose greatest common divisor exceeds . [ref]
For the divisor function, the integer divisors of are , those of are , and those of are . Hence
Here and are coprime integers. In contrast, , because the integer divisors of are . Thus the divisor function is a multiplicative function but not a completely multiplicative function.
The practical gain is that prime factorization reduces all values to values at prime powers. For distinct prime numbers and positive exponents ,
For instance, since and are coprime integers; replacing by additionally requires a completely multiplicative function. The short proof repeatedly applies the defining rule to prime powers belonging to different prime numbers, which are coprime integers.
For an arithmetic function, multiplicativity means and whenever are positive coprime integers. It allows values of an arithmetic function to be assembled from its values on prime powers, as explained under multiplicative function.
An arithmetic function is a completely multiplicative function when and for every pair of positive integers . In particular for every prime number and every nonnegative exponent . Both the constant-one arithmetic function and the identity arithmetic function are completely multiplicative functions: and . The divisor function fails this stronger condition at .
The divisor sum of an arithmetic function assigns to each positive integer the sum
Only positive integer divisors are included, so . The weights can count the integer divisors, measure their sizes, or record other arithmetic information: the constant-one arithmetic function gives the divisor function, whereas the identity arithmetic function gives the sum-of-divisors function.
Here is the mechanism. For positive coprime integers , every positive integer divisor of has a unique form with and ; moreover, are coprime integers. Thus a multiplicative function satisfies
At a prime power, the divisor sum becomes . This turns a calculation over many integer divisors into short local calculations at prime powers.
The sum-of-divisors function adds all positive integer divisors of a positive integer, including the number itself:
It is the divisor sum of the identity arithmetic function , so under Dirichlet convolution. Both factors are multiplicative functions, hence so is the sum-of-divisors function. The notation distinguishes it from other weighted divisor sums. [ref]
For a prime number and a nonnegative exponent , the positive integer divisors of the prime power are precisely . Their finite geometric series gives
For example, . For a prime factorization with distinct prime numbers and positive exponents , multiplicativity gives
For , this is an empty product, equal to . [ref]
The distributive property makes the formula especially beautiful: choosing one term from each factor produces each positive integer divisor exactly once, by the fundamental theorem of arithmetic. For , the choices form a three-by-two grid with entries , where and . Adding its rows gives
The divisor function counts six cells; the sum-of-divisors function adds their six values. Once the prime factorization is known, the product formula avoids testing every candidate integer divisor. Shared prime factors require care: , so the sum-of-divisors function is not a completely multiplicative function.
Figure 1.
The sum-of-divisors function for : each grid entry is a positive integer divisor, and the weighted total is
. Details.
Subtracting the number itself gives the proper-divisor sum . Comparing with distinguishes perfect numbers, deficient numbers, and abundant numbers. For , ; for , . Both are perfect numbers. The calculation makes a deficient number, while makes an abundant number. These comparisons turn the sizes of integer divisors into a classification of positive integers. [ref]
Figure 2.
The proper-divisor sum for : perfect numbers lie on , deficient numbers below it, and abundant numbers above it
. Details.
This connection is ancient: Euclid's Elements, Book IX, Proposition 36, constructs a perfect number by multiplying the last term of by their sum, when that sum is a prime number. In modern notation, put and , with and a prime number. The sum-of-divisors function proves the construction immediately:
Consequently the proper-divisor sum is . Taking produces the perfect numbers . [ref]
The proper-divisor sum, or aliquot sum, adds the positive proper divisors:
In particular , an empty sum. Removing from the sum-of-divisors function is essential: , but its proper-divisor sum is .
For multiplicative functions bounded in modulus by one, their pretentious distance up to is
It compares their values on prime numbers, weighting smaller primes more heavily. It need not be a metric: values away from primes are invisible, and can be positive when . For unit-modulus prime values it has the precise prime-restriction metric for pretentious distance interpretation.[ref]
Let , and let be a normalized multiplicative arithmetic function supported on squarefree integers, with . Form the finite measure using Dirac measures. Under the transform convention , its Euler product is . Expanding its logarithmic modulus, and replacing the damped prime weights by up to with Mertens first theorem, gives the displayed absolute bound, uniformly in real . Hence forces . The distance expression still defines a nonnegative pretentious score for prime values bounded by one; its actual metric interpretation uses unit-modulus values.
Because , the squared pretentious distance from one to the Möbius function is twice the reciprocal-prime sum. The Mertens second theorem therefore gives . In particular the distance diverges, illustrating that a multiplicative function can be far from the constant function even though both have unit-modulus prime values.
For unit-modulus prime values, pretentious distance is the Euclidean metric on the finite vectors . On whole arithmetic functions it is only a pseudometric: it sees neither values on prime powers nor primes above the cutoff. Even for every cutoff, the functions one and have distance zero but differ on nonsquarefree integers. The norm representation proves the triangle inequality and identifies exactly the quotient on which separation holds.
For multiplicative functions bounded in modulus by one, the pretentious distance satisfies
Here products mean pointwise products of arithmetic functions. For complex numbers of modulus at most one, write and . The bounds and give
Apply this with and at each prime , divide by , and use the triangle inequality for the resulting finite Euclidean norm. This proves the displayed product inequality.[ref]
An Archimedean character on the positive integers is the completely multiplicative function
Its modulus is one. The identity proves complete multiplicativity, while gives the constant-one arithmetic function. These functions form the comparison family in Halász theorem: a large mean of a bounded multiplicative function can arise when its prime values resemble those of one such character.
For an arithmetic function that is multiplicative and satisfies , define
One form of Halász theorem gives, for ,
Thus a large mean requires small pretentious distance from some Archimedean character. The parameter range matters: minimizes over a bounded interval of real numbers , and the final term accounts for that cutoff.[ref]
The Möbius function stays far in pretentious distance from every Archimedean character. One useful uniform form is
This follows by estimating the prime sum .

Articles by others on the same topic (0)

There are currently no matching articles.