Reciprocal power moments of the 2-fold divisor count
Provedgpy_sum_tau_pow_div_lenumber-theory
For Q at least 1 and any r, the sum over d between 1 and Q of the r-th power of the 2-fold divisor count of d divided by d is at most (1 + log Q)^(2^r), by induction on r using submultiplicativity and the divisor reindexing; the recursion U_{r+1} at most U_r^2 is what produces the exponent 2^r. Formalization Note: the divisor count is written out in Mathlib terms as the cardinality of the filtered tuple set, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_sum_tau_pow_div_le (r : ℕ) {Q : ℕ} (hQ : 1 ≤ Q) :
∑ d ∈ Finset.Icc 1 Q, (((Fintype.piFinset (fun _ : Fin (2) => Finset.Icc 1 (d))).filter (fun t => ∏ i, t i = (d))).card : ℝ) ^ r / (d : ℝ)
≤ (1 + Real.log (Q : ℝ)) ^ (2 ^ r) := by sorrySource
GPY fourth-order tau-moment bound, formalized from Mathlib (ordered factorizations, divisor reindexing, harmonic bound, and Cauchy-Schwarz)