Math 2.0

statement theorem

Dirichlet convolution of multiplicative functions is multiplicative

Statement

Let ff and gg be multiplicative functions. Then their Dirichlet convolution f∗gf * g is a multiplicative function.

Remarks

Let mm and nn be coprime. The proof uses that each divisor of mnmn is a unique product of a divisor of mm and a divisor of nn. With f=idk ⁣:n↦nkf = \mathrm{id}_k \colon n \mapsto n^k and g=1g = \mathbf{1}, the theorem gives the multiplicativity of the divisor function, since σk=idk∗1\sigma_k = \mathrm{id}_k * \mathbf{1}. The Dirichlet inverse of a multiplicative function is also multiplicative.

Explanations

L1 human

Multiplicative functions stay multiplicative when you convolve them. So a new function built from known ones by divisor sums keeps the property, and you can compute it from prime powers.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 8 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Divisors of a natural number definition
  4. Greatest common divisor definition
  5. Dirichlet convolution definition
  6. Coprime integers definition
  7. Multiplicative function definition
  8. Dirichlet convolution of multiplicative functions is multiplicative statement

Sources

  1. Web https://en.wikipedia.org/wiki/Dirichlet_convolution, Properties