The 1-fold divisor count of D is 1
Provedgpy_tupleProdCount_one_eq_onenumber-theory
For D at least 1, the number of ordered factorizations of D into a single positive factor is 1, since the only 1-tuple with product D is (D) itself. 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_tupleProdCount_one_eq_one {D : ℕ} (hD : 1 ≤ D) :
((Fintype.piFinset (fun _ : Fin (1) => Finset.Icc 1 (D))).filter (fun t => ∏ i, t i = (D))).card = 1 := by sorrySource
GPY fourth-order tau-moment bound, formalized from Mathlib (ordered factorizations, divisor reindexing, harmonic bound, and Cauchy-Schwarz)