The (k+1)-fold divisor count is at most the k-th power of the 2-fold count
Provedgpy_tupleProdCount_le_tau_two_pownumber-theory
For L at least 1 and any k, the number of ordered factorizations of L into k+1 positive factors is at most the k-th power of the number of ordered factorizations of L into two positive factors, by induction on k using the convolution identity and monotonicity under divisibility. 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_le_tau_two_pow (k : ℕ) {L : ℕ} (hL : 1 ≤ L) :
((Fintype.piFinset (fun _ : Fin (k + 1) => Finset.Icc 1 (L))).filter (fun t => ∏ i, t i = (L))).card ≤ (((Fintype.piFinset (fun _ : Fin (2) => Finset.Icc 1 (L))).filter (fun t => ∏ i, t i = (L))).card) ^ k := by sorrySource
GPY fourth-order tau-moment bound, formalized from Mathlib (ordered factorizations, divisor reindexing, harmonic bound, and Cauchy-Schwarz)