Theorems · Theorem · number theory
ArithmeticFunction.IsMultiplicative.multiplicative_factorization
∀ {R : Type u_1} [inst : CommMonoidWithZero R] (f : ArithmeticFunction R),
f.IsMultiplicative → ∀ {n : ℕ}, n ≠ 0 → f n = n.factorization.prod fun p k => f (p ^ k)For any multiplicative function f and any n > 0,
we can evaluate f n by evaluating f at p ^ k over the factorization of n
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoidWithZero
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- CommMonoidWithZerostatement and proof · cited by 913
- ArithmeticFunctionstatement and proof · cited by 290
- Finsupp.prodstatement · cited by 231
- Nat.factorizationstatement · cited by 215
- ArithmeticFunction.IsMultiplicativestatement and proof · cited by 45
- Nat.multiplicative_factorizationproof · cited by 3
Cited by6
Results whose statement or proof uses this declaration.
- ArithmeticFunction.IsMultiplicative.lcm_apply_mul_gcd_applyproof · cited by 2
- Nat.sum_divisorsproof · cited by 0
- ArithmeticFunction.IsMultiplicative.eq_iff_eq_on_prime_powersproof · cited by 0
- DirichletCharacter.zetaMul_nonnegproof · cited by 0
- Nat.card_divisorsproof · cited by 0