Proof that the Dirichlet convolution of multiplicative functions is multiplicative
Builds on Multiplicative functionDirichlet convolutionDivisors of a natural numberCoprime integersFundamental theorem of arithmeticP-adic valuationP-adic valuation of a product
Proof
- Let and be multiplicative functions, and let be their Dirichlet convolution.
- First, is the only positive divisor of , so .
- Now let and be coprime positive integers. We show .
- Since , no prime divides both and . For a prime , let be the p-adic valuation.
- Let be the set of pairs with and . Define . Then divides , so maps to the divisors of .
- is onto. Let . Put and , products over primes.
- Every prime factor of divides , hence or , but not both. So by the fundamental theorem of arithmetic.
- For we have , by the valuation of a product. Hence , and in the same way .
- is one-to-one. Let with , and let . Then , since . So .
- All prime factors of divide . So step 9 gives , which depends only on . Similarly depends only on .
- For , a common divisor of and divides and , hence divides . So and are coprime.
- In the same way divides and divides , so they are coprime. Also .
- By steps 5 to 10, we can sum over instead of over the divisors of :
- By steps 11 and 12 and the multiplicativity of and , each term equals .
- The sum over of these products splits as a product of two sums:
- With step 2, this shows that is multiplicative.
Idea
When and are coprime, each divisor of splits in exactly one way into a divisor of times a divisor of . The two pieces are coprime, so and split over them. The double sum then factors into the product of the two convolutions.
Reading path
To understand this page from the ground up, read these 42 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof of Euclid's lemma, Proof of strong induction from ordinary induction, Proof that the p-adic valuation of a product is the sum of the valuations, Proof of the fundamental theorem of arithmetic, Proof of the existence of prime factorization, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the existence of a prime divisor.
- Arithmetic function definition
- Definition by recursion concept
- Divisibility definition
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Divisors of a natural number definition
- Greatest common divisor definition
- Prime number definition
- Successor function definition
- Dirichlet convolution definition
- Coprime integers definition
- P-adic valuation definition
- Prime factorization definition
- Addition of natural numbers definition
- The successor function is injective statement
- Zero is not a successor statement
- Multiplicative function definition
- Proof of the commutativity of addition by induction proof
- Order on the natural numbers definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Strong induction statement
- Proof of the well-ordering principle from strong induction proof
- Well-ordering principle statement
- Proof of the division algorithm proof
- Proof of the existence of a prime divisor proof
- Division algorithm statement
- Existence of a prime divisor statement
- Proof of Bézout's identity proof
- Proof of the existence of prime factorization proof
- Bézout's identity statement
- Existence of prime factorization statement
- Proof of the generalized Euclid's lemma proof
- Generalized Euclid's lemma statement
- Proof of Euclid's lemma proof
- Euclid's lemma statement
- Proof of the fundamental theorem of arithmetic proof
- Proof that the p-adic valuation of a product is the sum of the valuations proof
- Fundamental theorem of arithmetic statement
- P-adic valuation of a product statement
- Proof that the Dirichlet convolution of multiplicative functions is multiplicative proof
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | WM67ZQYNWZ |
|---|---|
| URI | m2://WM67ZQYNWZ |
| Kind | proof |
| Writing | W0 stub |
| MSC | 11A25 |
| Proves | Dirichlet convolution of multiplicative functions is multiplicative |
| Uses | Multiplicative function, Dirichlet convolution, Divisors of a natural number, Coprime integers, Fundamental theorem of arithmetic, P-adic valuation, P-adic valuation of a product |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.