Dirichlet convolution is an operation that takes two arithmetic functions and produces a third arithmetic function. It is defined by summing products of function values over all positive divisors of an integer. If f and g are arithmetic functions, their Dirichlet convolution is denoted by f * g and defined as (f * g)(n) = Σ_{d|n} f(d)g(n/d).
For example, if 1(n) is the constant-one function and id(n) = n is the identity function, then the convolution 1 * 1 gives the divisor-counting function τ(n), because each positive divisor contributes 1 × 1. Similarly, 1 * id gives the sum-of-divisors function σ(n), because the resulting sum adds all positive divisors of n.
Dirichlet convolution has several important algebraic properties. It is commutative, associative, and distributive over addition. Its identity element is the function ε(n), which equals 1 when n = 1 and 0 otherwise. An important result is that the convolution of two multiplicative arithmetic functions is also multiplicative.
The Möbius function is the convolution inverse of the constant-one function. In other words, μ * 1 = ε. This relationship gives an elegant algebraic interpretation of Möbius inversion and makes Dirichlet convolution a central tool in advanced number theory.
Dirichlet Convolution
Dirichlet convolution is a binary operation on arithmetic functions that combines their values over the positive divisors of an integer. It is a fundamental operation in number theory and provides an algebraic framework for Möbius inversion.
| Name | Expression | Description |
|---|---|---|
Dirichlet Convolution | (f * g)(n) = Σ_{d|n} f(d)g(n/d) | The defining formula for the convolution of two arithmetic functions. |
Commutative Property | f * g = g * f | The order of the two functions does not affect their convolution. |
Identity Property | f * ε = ε * f = f | The function ε is the identity element for Dirichlet convolution. |
Möbius Inverse | μ * 1 = ε | The Möbius function is the convolution inverse of the constant-one function. |
Divisor-Counting Function | τ = 1 * 1 | The divisor-counting function is the convolution of the constant-one function with itself. |
Sum-of-Divisors Function | σ = 1 * id | The sum-of-divisors function is the convolution of the constant-one function with the identity function id(n) = n. |
Explanation
Variables
F, g
Arithmetic functions being combined.
N
A positive integer at which the convolution is evaluated.
D
A positive divisor of n.
N/d
The complementary divisor corresponding to d.
Ε
The convolution identity function.
1
The constant-one arithmetic function.
Μ
The Möbius function.
Τ
The divisor-counting function.
Σ
The sum-of-divisors function.
Id
The identity arithmetic function defined by id(n) = n.
Example or application
A worked example has not yet been added.
Definition
For arithmetic functions f and g, their Dirichlet convolution is the arithmetic function defined by (f * g)(n) = Σ_{d|n} f(d)g(n/d), where the sum is taken over all positive divisors of n.
Purpose
The purpose of Dirichlet convolution is to combine arithmetic functions through divisor sums. It provides a convenient algebraic language for expressing divisor identities, studying multiplicative functions, and deriving Möbius inversion.
Importance
It provides a systematic operation for combining arithmetic functions.
It explains many identities involving divisor-counting and divisor-sum functions.
It provides the algebraic foundation of Möbius inversion.
It allows multiplicative functions to be studied through their convolution properties.
It is essential in the study of Dirichlet series.
It is widely used in analytic number theory.
Key Concepts
| Name | Description |
|---|---|
Arithmetic Function | A function defined on the positive integers. |
Dirichlet Convolution | An operation that combines two arithmetic functions through a sum over the positive divisors of n. |
Identity Function for Convolution | The function ε(n), equal to 1 for n = 1 and 0 for n > 1. |
Convolution Inverse | An arithmetic function that combines with another function under convolution to produce the identity function. |
Multiplicative Function | An arithmetic function that preserves multiplication for coprime inputs. |
Divisor Functions | Functions such as τ(n) and σ(n), which can be represented through Dirichlet convolution. |
Characteristics
Dirichlet convolution is defined for arithmetic functions.
It sums products over positive divisors.
It is commutative and associative.
It is distributive over addition of arithmetic functions.
It has an identity element ε.
The convolution of two multiplicative functions is multiplicative.
The Möbius function is the convolution inverse of the constant-one function.
It is closely connected to multiplication of Dirichlet series.
Types
| Name | Description |
|---|---|
Convolution of General Arithmetic Functions | The standard operation applied to any two arithmetic functions. |
Convolution of Multiplicative Functions | A particularly useful case in which the resulting function remains multiplicative. |
Convolution Inverse | An arithmetic function that produces the identity function when convolved with another function. |
Components
| Name | Description |
|---|---|
First Arithmetic Function | The function f whose values appear in the first factor of each product. |
Second Arithmetic Function | The function g whose values appear in the second factor of each product. |
Positive Divisors | The divisors d of n used to construct the convolution sum. |
Complementary Divisor | The value n/d paired with each divisor d. |
Convolution Result | The new arithmetic function f * g produced by the sum. |
Properties
Commutativity: f * g = g * f.
Associativity: (f * g) * h = f * (g * h).
Distributivity: f * (g + h) = f * g + f * h.
Identity: f * ε = f.
The convolution of two multiplicative functions is multiplicative.
Every arithmetic function f with f(1) ≠ 0 has a unique Dirichlet convolution inverse.
The Möbius function is the inverse of the constant-one function.
The divisor-counting function is the convolution of the constant-one function with itself.
Dirichlet convolution corresponds to multiplication of suitable Dirichlet series in their common region of convergence.
Examples
| Title | Problem | Solution | Answer |
|---|---|---|---|
Calculating a Dirichlet Convolution | Let f(n) = 1 and g(n) = n. Calculate (f * g)(6). | The positive divisors of 6 are 1, 2, 3, and 6. Therefore, (f * g)(6) = f(1)g(6) + f(2)g(3) + f(3)g(2) + f(6)g(1). Since f(n) = 1 and g(n) = n, the sum is 6 + 3 + 2 + 1 = 12. | (f * g)(6) = 12, which equals σ(6). |
Divisor-Counting Function | Calculate (1 * 1)(8). | The positive divisors of 8 are 1, 2, 4, and 8. Each divisor contributes 1 × 1 = 1. Thus, the total is 1 + 1 + 1 + 1 = 4. | (1 * 1)(8) = 4 = τ(8). |
Möbius Convolution Identity | Evaluate (μ * 1)(6). | The divisors of 6 are 1, 2, 3, and 6. Their Möbius values are 1, −1, −1, and 1. Since the constant-one function always equals 1, the convolution is 1 − 1 − 1 + 1 = 0. | (μ * 1)(6) = 0 = ε(6). |
Applications
Deriving divisor-counting and divisor-sum identities.
Expressing Möbius inversion algebraically.
Studying multiplicative arithmetic functions.
Analyzing Dirichlet series and the Riemann zeta function.
Developing formulas in analytic number theory.
Calculating convolution inverses of arithmetic functions.
Prerequisites
Arithmetic functions
Positive divisors
Möbius function
Multiplicative functions
Finite sums and basic algebra
Learning Objectives
Define Dirichlet convolution.
Calculate the convolution of two arithmetic functions.
Explain the role of positive divisors in the convolution formula.
State the main algebraic properties of Dirichlet convolution.
Identify the convolution identity function.
Explain why μ * 1 = ε.
Express τ(n) and σ(n) using Dirichlet convolution.
Describe the connection between convolution and Möbius inversion.
Common Mistakes
Summing over numbers that are not divisors of n.
Using d instead of n/d in the second function without making the corresponding change consistently.
Confusing ordinary multiplication of functions with Dirichlet convolution.
Forgetting that the identity function ε is not the constant-one function.
Assuming that the convolution of any two functions is automatically multiplicative.
Ignoring the requirement that arithmetic functions are defined on positive integers.
Practice Questions
Calculate (1 * id)(10).
Calculate (1 * 1)(12) and identify the corresponding arithmetic function.
Verify that (μ * 1)(10) = 0.
State the identity element for Dirichlet convolution.
Prove that Dirichlet convolution is commutative.
Explain why the convolution of two multiplicative functions is multiplicative.
How does Dirichlet convolution provide an algebraic explanation of Möbius inversion?
Key Takeaway
Dirichlet convolution combines arithmetic functions through divisor sums. Its algebraic properties explain important divisor identities and provide the framework for understanding Möbius inversion and many results in analytic number theory.
Related Topics
Multiplicative Arithmetic Functions
Möbius Function
Möbius Inversion Formula
Divisor-Counting Function
Sum-of-Divisors Function
Dirichlet Series
Riemann Zeta Function
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory