Divisor reindexing for a summand depending on D
Provedgpy_sum_divisors_sum_reindexnumber-theory
Summing G(D) over e dividing D and D between 1 and R is the same as summing G(e times m) over m between 1 and R/e and e between 1 and R. This is a variant of the divisor reindexing for a summand depending on D itself. Formalization Note: the statement uses only Mathlib terms.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_sum_divisors_sum_reindex (G : ℕ → ℝ) (R : ℕ) :
∑ D ∈ Finset.Icc 1 R, ∑ e ∈ Nat.divisors D, G D
= ∑ e ∈ Finset.Icc 1 R, ∑ m ∈ Finset.Icc 1 (R / e), G (e * m) := by sorrySource
GPY fourth-order tau-moment bound, formalized from Mathlib (ordered factorizations, divisor reindexing, harmonic bound, and Cauchy-Schwarz)