Math 2.0

Number theory Proof

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

  1. Let ff and gg be multiplicative functions, and let h=f∗gh = f * g be their Dirichlet convolution.
  2. First, 11 is the only positive divisor of 11, so h(1)=f(1)g(1)=1⋅1=1h(1) = f(1) g(1) = 1 \cdot 1 = 1.
  3. Now let mm and nn be coprime positive integers. We show h(mn)=h(m)h(n)h(mn) = h(m) h(n).
  4. Since gcd⁡(m,n)=1\gcd(m, n) = 1, no prime divides both mm and nn. For a prime pp, let νp\nu_p be the p-adic valuation.
  5. Let PP be the set of pairs (d1,d2)(d_1, d_2) with d1∣md_1 \mid m and d2∣nd_2 \mid n. Define Φ(d1,d2)=d1d2\Phi(d_1, d_2) = d_1 d_2. Then d1d2d_1 d_2 divides mnmn, so Φ\Phi maps PP to the divisors of mnmn.
  6. Φ\Phi is onto. Let d∣mnd \mid mn. Put d1=∏p∣mpνp(d)d_1 = \prod_{p \mid m} p^{\nu_p(d)} and d2=∏p∣npνp(d)d_2 = \prod_{p \mid n} p^{\nu_p(d)}, products over primes.
  7. Every prime factor pp of dd divides mnmn, hence mm or nn, but not both. So d=d1d2d = d_1 d_2 by the fundamental theorem of arithmetic.
  8. For p∣mp \mid m we have νp(d)≤νp(mn)=νp(m)+νp(n)=νp(m)\nu_p(d) \le \nu_p(mn) = \nu_p(m) + \nu_p(n) = \nu_p(m), by the valuation of a product. Hence d1∣md_1 \mid m, and in the same way d2∣nd_2 \mid n.
  9. Φ\Phi is one-to-one. Let d=d1d2d = d_1 d_2 with (d1,d2)∈P(d_1, d_2) \in P, and let p∣mp \mid m. Then p∤d2p \nmid d_2, since d2∣nd_2 \mid n. So νp(d1)=νp(d)\nu_p(d_1) = \nu_p(d).
  10. All prime factors of d1d_1 divide mm. So step 9 gives d1=∏p∣mpνp(d)d_1 = \prod_{p \mid m} p^{\nu_p(d)}, which depends only on dd. Similarly d2d_2 depends only on dd.
  11. For (d1,d2)∈P(d_1, d_2) \in P, a common divisor of d1d_1 and d2d_2 divides mm and nn, hence divides 11. So d1d_1 and d2d_2 are coprime.
  12. In the same way m/d1m / d_1 divides mm and n/d2n / d_2 divides nn, so they are coprime. Also mn/(d1d2)=(m/d1)(n/d2)mn / (d_1 d_2) = (m/d_1)(n/d_2).
  13. By steps 5 to 10, we can sum over PP instead of over the divisors of mnmn: h(mn)=∑(d1,d2)∈Pf(d1d2) g ⁣(md1⋅nd2).h(mn) = \sum_{(d_1, d_2) \in P} f(d_1 d_2) \, g\!\left(\frac{m}{d_1} \cdot \frac{n}{d_2}\right).
  14. By steps 11 and 12 and the multiplicativity of ff and gg, each term equals f(d1)g(m/d1)⋅f(d2)g(n/d2)f(d_1) g(m/d_1) \cdot f(d_2) g(n/d_2).
  15. The sum over PP of these products splits as a product of two sums: h(mn)=(∑d1∣mf(d1)g(m/d1))(∑d2∣nf(d2)g(n/d2))=h(m)h(n).h(mn) = \Bigl(\sum_{d_1 \mid m} f(d_1) g(m/d_1)\Bigr) \Bigl(\sum_{d_2 \mid n} f(d_2) g(n/d_2)\Bigr) = h(m) h(n).
  16. With step 2, this shows that f∗gf * g is multiplicative.

Idea

When mm and nn are coprime, each divisor of mnmn splits in exactly one way into a divisor of mm times a divisor of nn. The two pieces are coprime, so ff and gg 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.

  1. Arithmetic function definition
  2. Definition by recursion concept
  3. Divisibility definition
  4. Mathematical induction concept
  5. Natural numbers object
  6. Peano axioms concept
  7. Divisors of a natural number definition
  8. Greatest common divisor definition
  9. Prime number definition
  10. Successor function definition
  11. Dirichlet convolution definition
  12. Coprime integers definition
  13. P-adic valuation definition
  14. Prime factorization definition
  15. Addition of natural numbers definition
  16. The successor function is injective statement
  17. Zero is not a successor statement
  18. Multiplicative function definition
  19. Proof of the commutativity of addition by induction proof
  20. Order on the natural numbers definition
  21. Commutativity of addition statement
  22. Proof of strong induction from ordinary induction proof
  23. Strong induction statement
  24. Proof of the well-ordering principle from strong induction proof
  25. Well-ordering principle statement
  26. Proof of the division algorithm proof
  27. Proof of the existence of a prime divisor proof
  28. Division algorithm statement
  29. Existence of a prime divisor statement
  30. Proof of Bézout's identity proof
  31. Proof of the existence of prime factorization proof
  32. Bézout's identity statement
  33. Existence of prime factorization statement
  34. Proof of the generalized Euclid's lemma proof
  35. Generalized Euclid's lemma statement
  36. Proof of Euclid's lemma proof
  37. Euclid's lemma statement
  38. Proof of the fundamental theorem of arithmetic proof
  39. Proof that the p-adic valuation of a product is the sum of the valuations proof
  40. Fundamental theorem of arithmetic statement
  41. P-adic valuation of a product statement
  42. Proof that the Dirichlet convolution of multiplicative functions is multiplicative proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Multiplicative_function, Convolution
About this page
TagWM67ZQYNWZ
URIm2://WM67ZQYNWZ
Kindproof
WritingW0 stub
MSC11A25
ProvesDirichlet convolution of multiplicative functions is multiplicative
UsesMultiplicative function, Dirichlet convolution, Divisors of a natural number, Coprime integers, Fundamental theorem of arithmetic, P-adic valuation, P-adic valuation of a product
Changed4 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.