Mobius-weighted divisor sum as Euler product over prime factors (squarefree case)
Provedgpy_sum_mu_mul_prodnumber-theory
Let f be a multiplicative arithmetic function and n a squarefree natural number. Then the sum over divisors d of n of mu(d) * f(d) equals the product over the prime factors p of n of (1 - f(p)). This is the finite local-factor identity at one prime set: for squarefree n, the Mobius-weighted divisor sum factors over the primes dividing n.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_sum_mu_mul_prod {f : ArithmeticFunction ℝ}
(hf : f.IsMultiplicative) {n : ℕ} (hn : Squarefree n) :
∑ d ∈ n.divisors, (ArithmeticFunction.moebius d : ℝ) * f d
= ∏ p ∈ n.primeFactors, (1 - f p) := by sorrySource
GPY monomial-sum evaluation: the finite local-factor identity for multiplicative arithmetic functions at squarefree n