Additive function

In number theory, an additive function is an arithmetic function f(n) of the positive integer n such that whenever a and b are coprime, the function of the product is the sum of the functions:[1]

f(ab) = f(a) + f(b).

For the algebraic meaning, see Additive map.

Completely additive

An additive function f(n) is said to be completely additive if f(ab) = f(a) + f(b) holds for all positive integers a and b, even when they are not coprime. Totally additive is also used in this sense by analogy with totally multiplicative functions. If f is a completely additive function then f(1) = 0.

Every completely additive function is additive, but not vice versa.

Examples

Example of arithmetic functions which are completely additive are:

• The restriction of the logarithmic function to N.
• The multiplicity of a prime factor p in n, that is the largest exponent m for which p^m divides n.
• a₀(n) - the sum of primes dividing n counting multiplicity, sometimes called sopfr(n), the potency of n or the integer logarithm of n (sequence A001414 in the OEIS). For example:

a₀(4) = 2 + 2 = 4

a₀(20) = a₀(2² · 5) = 2 + 2+ 5 = 9

a₀(27) = 3 + 3 + 3 = 9

a₀(144) = a₀(2⁴ · 3²) = a₀(2⁴) + a₀(3²) = 8 + 6 = 14

a₀(2,000) = a₀(2⁴ · 5³) = a₀(2⁴) + a₀(5³) = 8 + 15 = 23

a₀(2,003) = 2003

a₀(54,032,858,972,279) = 1240658

a₀(54,032,858,972,302) = 1780417

a₀(20,802,650,704,327,415) = 1240681

• The function Ω(n), defined as the total number of prime factors of n, counting multiple factors multiple times, sometimes called the "Big Omega function" (sequence A001222 in the OEIS). For example;

Ω(1) = 0, since 1 has no prime factors

Ω(4) = 2

Ω(16) = Ω(2·2·2·2) = 4

Ω(20) = Ω(2·2·5) = 3

Ω(27) = Ω(3·3·3) = 3

Ω(144) = Ω(2⁴ · 3²) = Ω(2⁴) + Ω(3²) = 4 + 2 = 6

Ω(2,000) = Ω(2⁴ · 5³) = Ω(2⁴) + Ω(5³) = 4 + 3 = 7

Ω(2,001) = 3

Ω(2,002) = 4

Ω(2,003) = 1

Ω(54,032,858,972,279) = 3

Ω(54,032,858,972,302) = 6

Ω(20,802,650,704,327,415) = 7

Example of arithmetic functions which are additive but not completely additive are:

• ω(n), defined as the total number of different prime factors of n (sequence A001221 in the OEIS). For example:

ω(4) = 1

ω(16) = ω(2⁴) = 1

ω(20) = ω(2² · 5) = 2

ω(27) = ω(3³) = 1

ω(144) = ω(2⁴ · 3²) = ω(2⁴) + ω(3²) = 1 + 1 = 2

ω(2,000) = ω(2⁴ · 5³) = ω(2⁴) + ω(5³) = 1 + 1 = 2

ω(2,001) = 3

ω(2,002) = 4

ω(2,003) = 1

ω(54,032,858,972,279) = 3

ω(54,032,858,972,302) = 5

ω(20,802,650,704,327,415) = 5

• a₁(n) - the sum of the distinct primes dividing n, sometimes called sopf(n) (sequence A008472 in the OEIS). For example:

a₁(1) = 0

a₁(4) = 2

a₁(20) = 2 + 5 = 7

a₁(27) = 3

a₁(144) = a₁(2⁴ · 3²) = a₁(2⁴) + a₁(3²) = 2 + 3 = 5

a₁(2,000) = a₁(2⁴ · 5³) = a₁(2⁴) + a₁(5³) = 2 + 5 = 7

a₁(2,001) = 55

a₁(2,002) = 33

a₁(2,003) = 2003

a₁(54,032,858,972,279) = 1238665

a₁(54,032,858,972,302) = 1780410

a₁(20,802,650,704,327,415) = 1238677

Multiplicative functions

From any additive function f(n) it is easy to create a related multiplicative function g(n) i.e. with the property that whenever a and b are coprime we have:

g(ab) = g(a) × g(b).

One such example is g(n) = 2^f(n).

Summatory functions

Given an additive function ${\displaystyle f}$, let its summatory function be defined by ${\displaystyle {\mathcal {M}}_{f}(x):=\sum _{n\leq x}f(n)}$. The average of ${\displaystyle f}$ is given exactly as

${\displaystyle {\mathcal {M}}_{f}(x)=\sum _{p^{\alpha }\leq x}f(p^{\alpha })\left(\left\lfloor {\frac {x}{p^{\alpha }}}\right\rfloor -\left\lfloor {\frac {x}{p^{\alpha +1}}}\right\rfloor \right).}$

The summatory functions over ${\displaystyle f}$ can be expanded as ${\displaystyle {\mathcal {M}}_{f}(x)=xE(x)+O({\sqrt {x}}\cdot D(x))}$ where

${\displaystyle {\begin{aligned}E(x)&=\sum _{p^{\alpha }\leq x}f(p^{\alpha })p^{-\alpha }(1-p^{-1})\\D^{2}(x)&=\sum _{p^{\alpha }\leq x}|f(p^{\alpha })|^{2}p^{-\alpha }.\end{aligned}}}$

The average of the function ${\displaystyle f^{2}}$ is also expressed by these functions as

${\displaystyle {\mathcal {M}}_{f^{2}}(x)=xE^{2}(x)+O(xD^{2}(x)).}$

There is always an absolute constant ${\displaystyle C_{f}>0}$ such that for all natural numbers ${\displaystyle x\geq 1}$,

${\displaystyle \sum _{n\leq x}|f(n)-E(x)|^{2}\leq C_{f}\cdot xD^{2}(x).}$

Let

${\displaystyle \nu (x;z):={\frac {1}{x}}\#\left\{n\leq x:{\frac {f(n)-A(x)}{B(x)}}\leq z\right\}.}$

Suppose that ${\displaystyle f}$ is an additive function with ${\displaystyle -1\leq f(p^{\alpha })=f(p)\leq 1}$ such that as ${\displaystyle x\rightarrow \infty }$,

${\displaystyle B(x)=\sum _{p\leq x}f^{2}(p)/p\rightarrow \infty .}$

Then ${\displaystyle \nu (x;z)\sim G(z)}$ where ${\displaystyle G(z)}$ is the Gaussian distribution function

${\displaystyle G(z)={\frac {1}{\sqrt {2\pi }}}\int _{-\infty }^{z}e^{-t^{2}/2}dt.}$

Examples of this result related to the prime omega function and the numbers of prime divisors of shifted primes include the following for fixed ${\displaystyle z\in \mathbb {R} }$ where the relations hold for ${\displaystyle x\gg 1}$:

${\displaystyle \#\{n\leq x:\omega (n)-\log \log x\leq z(\log \log x)^{1/2}\}\sim xG(z),}$

${\displaystyle \#\{p\leq x:\omega (p+1)-\log \log x\leq z(\log \log x)^{1/2}\}\sim \pi (x)G(z).}$

See also

• Sigma additivity
• Prime omega function
• Multiplicative function
• Arithmetic function

References

1. Erdös, P., and M. Kac. On the Gaussian Law of Errors in the Theory of Additive Functions. Proc Natl Acad Sci USA. 1939 April; 25(4): 206–207. online

Further reading

• Janko Bračič, Kolobar aritmetičnih funkcij (Ring of arithmetical functions), (Obzornik mat, fiz. 49 (2002) 4, pp. 97–108) (MSC (2000) 11A25)
• Iwaniec and Kowalski, Analytic number theory, AMS (2004).