Summing tau_k over divisors gives tau_{k+1}
Provedgpy_sum_tupleProdCount_divisorsnumber-theory
Summing the k-fold divisor function tau_k(D) over the divisors D of L gives tau_{k+1}(L), via the convolution identity for tau and the divisor involution D ↦ L / D.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_sum_tupleProdCount_divisors {k L : ℕ} (hL : L ≠ 0) :
∑ D ∈ L.divisors,
((Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 D)).filter
(fun d => ∏ i, d i = D)).card
= ((Fintype.piFinset (fun _ : Fin (k + 1) => Finset.Icc 1 L)).filter
(fun d => ∏ i, d i = L)).card := by sorrySource
GPY Selberg fiber bound for tuple weights, formalized from Mathlib (squarefree products, pairwise coprimality, and fiber counting)