The 2-fold divisor count as a real divisor sum
Provedgpy_tau_two_eq_sum_one_realnumber-theory
For d at least 1, the 2-fold divisor count of d, as a real number, equals the sum of 1 over the divisors of d. Formalization Note: the 2-fold 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_tau_two_eq_sum_one_real {d : ℕ} (hd : 1 ≤ d) :
(((Fintype.piFinset (fun _ : Fin (2) => Finset.Icc 1 (d))).filter (fun t => ∏ i, t i = (d))).card : ℝ) = ∑ e ∈ Nat.divisors d, (1 : ℝ) := by sorrySource
GPY fourth-order tau-moment bound, formalized from Mathlib (ordered factorizations, divisor reindexing, harmonic bound, and Cauchy-Schwarz)