Divisor summatory bound: sum of τ up to R
Provedgpy_sum_tau_lenumber-theory
For R ≥ 1, the sum of the divisor-count function τ(D) over 1 ≤ D ≤ R is at most R·(1 + log R). The bound is proved by double counting: summing τ(D) over D ≤ R counts pairs (d, D) with d dividing D, which regroups as the sum over d ≤ R of the number of multiples of d up to R, combined with the harmonic bound ∑_{d ≤ R} 1/d ≤ 1 + log R.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_sum_tau_le {R : ℕ} (hR : 1 ≤ R) :
(∑ D ∈ Finset.Icc 1 R, ((Nat.divisors D).card : ℝ)) ≤
(R : ℝ) * (1 + Real.log (R : ℝ)) := 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)