Higher divisor summatory bound: sum of τ_{k+1} up to R
Provedgpy_sum_tupleProdCount_lenumber-theory
For R ≥ 1 and any k, the sum of the (k+1)-fold divisor function τ_{k+1}(D) — the number of ordered factorizations of D into k+1 positive factors — over 1 ≤ D ≤ R is at most R·(1 + log R)^k. The bound is proved by induction on k, using the convolution identity τ_{k+1}(D) = ∑_{e | D} τ_k(D/e), a divisor reindexing, and the harmonic bound.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_sum_tupleProdCount_le (k : ℕ) {R : ℕ} (hR : 1 ≤ R) :
∑ D ∈ Finset.Icc 1 R,
((((Fintype.piFinset (fun _ : Fin (k + 1) => Finset.Icc 1 D)).filter
(fun d => ∏ i, d i = D)).card : ℕ) : ℝ) ≤
(R : ℝ) * (1 + Real.log (R : ℝ)) ^ k := by sorrySource
GPY τ-moment / divisor-sum estimates for Selberg weights, formalized from Mathlib (divisor double count, harmonic bound, divisor convolution, and the τ-weighted λ-mass identity)