The 2-fold divisor count is submultiplicative
Provedgpy_tupleProdCount_two_submulnumber-theory
For any d and m, the number of ordered factorizations of d times m into two positive factors is at most the product of the corresponding counts for d and for m, by the gcd-splitting injection. Formalization Note: the divisor counts are written out in Mathlib terms as cardinalities of filtered tuple sets, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_tupleProdCount_two_submul {d m : ℕ} :
((Fintype.piFinset (fun _ : Fin (2) => Finset.Icc 1 (d * m))).filter (fun t => ∏ i, t i = (d * m))).card ≤ ((Fintype.piFinset (fun _ : Fin (2) => Finset.Icc 1 (d))).filter (fun t => ∏ i, t i = (d))).card * ((Fintype.piFinset (fun _ : Fin (2) => Finset.Icc 1 (m))).filter (fun t => ∏ i, t i = (m))).card := by sorrySource
GPY fourth-order tau-moment bound, formalized from Mathlib (ordered factorizations, divisor reindexing, harmonic bound, and Cauchy-Schwarz)