Arithmetic Functions - Foundations

Arithmetic functions form the foundation of analytic number theory, encoding number-theoretic information in functions that can be analyzed using techniques from complex analysis and harmonic analysis.

DefinitionArithmetic Function

An arithmetic function is any function $f: \mathbb{N} \to \mathbb{C}$ that assigns a complex value to each positive integer. When $f$ takes only real values, it is called a real-valued arithmetic function.

An arithmetic function $f$ is called multiplicative if:

$f(1) = 1$
$f(mn) = f(m)f(n)$ whenever $\gcd(m,n) = 1$

It is called completely multiplicative if $f(mn) = f(m)f(n)$ for all $m, n \in \mathbb{N}$ .

ExampleClassical Arithmetic Functions

The following are fundamental arithmetic functions:

Identity function: $\text{id}(n) = n$ , completely multiplicative
Constant function: $1(n) = 1$ for all $n$ , completely multiplicative
Euler's totient function: $\varphi(n)$ counts integers $1 \leq k \leq n$ with $\gcd(k,n) = 1$
Divisor function: $\sigma_k(n) = \sum_{d|n} d^k$ , where $\sigma_0(n) = \tau(n)$ counts divisors
Möbius function: $\mu(n) = \begin{cases} 1 & \text{if } n=1 \\ (-1)^k & \text{if } n \text{ is a product of } k \text{ distinct primes} \\ 0 & \text{if } n \text{ has a squared prime factor} \end{cases}$

DefinitionDirichlet Convolution

For arithmetic functions $f$ and $g$ , their Dirichlet convolution is defined as:

(f * g)(n) = \sum_{d|n} f(d)g(n/d) = \sum_{ab=n} f(a)g(b)

This operation is commutative, associative, and has the identity element $\delta(n) = \begin{cases} 1 & \text{if } n=1 \\ 0 & \text{otherwise} \end{cases}$ .

Dirichlet convolution transforms the set of arithmetic functions into a commutative ring. The multiplicative functions form a subgroup under this operation, and understanding this algebraic structure is essential for analyzing more complex number-theoretic questions.

Remark

The Möbius function serves as the inverse of the constant function $1$ under Dirichlet convolution: $\mu * 1 = \delta$ . This fundamental identity leads to the Möbius inversion formula, which allows us to invert summatory relations over divisors.

The study of arithmetic functions connects discrete number theory with continuous analysis. By encoding arithmetic data in functions, we can apply powerful analytical techniques such as generating functions, complex integration, and asymptotic methods to extract information about the distribution of prime numbers and other arithmetic objects.