Dirichlet Convolution

Number Theory · Axiom Academy

An algebraic operation on arithmetic functions with remarkable properties 1. Definition of Dirichlet Convolution Given two arithmetic functions f and g , their Dirichlet convolution ( f * g ) is a new arithmetic function defined by: The sum is taken over all positive divisors d of n . This operation elegantly combines the values of f and g at complementary divisor pairs. Dirichlet convolution is associative , meaning the order of operations doesn't matter when convolving three functions: This property is crucial because it allows us to work with chains of convolutions without worrying about parentheses. It also means that arithmetic functions under Dirichlet convolution form a semigroup . The unit function ε (epsilon) serves as the identity element for Dirichlet convolution: For any arithmetic function f , we have: This means ε acts like the number "1" does for multiplication. With both associativity and identity, the set of arithmetic functions forms a monoid under Dirichlet convolution. 4. The Mobius Function as Inverse of 1 The constant function 1 (where 1(n) = 1 for all n) has an inverse under Dirichlet convolution: the famous Mobius function μ : The Mobius function is defined as: where ω(n) is the number of distinct prime factors of n.

This is the written version of the interactive lesson above. See the full Number Theory course.