The 2-fold divisor count is the divisor count
Provedgpy_tupleProdCount_two_eq_cardnumber-theory
For D at least 1, the number of ordered factorizations of D into two positive factors equals the number of 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_tupleProdCount_two_eq_card {D : ℕ} (hD : 1 ≤ D) :
((Fintype.piFinset (fun _ : Fin (2) => Finset.Icc 1 (D))).filter (fun t => ∏ i, t i = (D))).card = (Nat.divisors D).card := by sorrySource
GPY fourth-order tau-moment bound, formalized from Mathlib (ordered factorizations, divisor reindexing, harmonic bound, and Cauchy-Schwarz)