Support fiber over a product is bounded by the divisor count
Provedgpy_card_filter_tupleSupport_prod_lenumber-theory
The support tuples with a given product D number at most tau_k(D), the number of ordered factorizations of D into k positive factors: such a tuple has all entries between 1 and D, hence is a k-factorization of D.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_card_filter_tupleSupport_prod_le {k R D : ℕ} :
(((Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 R)).filter
(fun d => ∏ i, d i ≤ R)).filter (fun d => ∏ i, d i = D)).card
≤ ((Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 D)).filter
(fun d => ∏ i, d i = D)).card := by sorrySource
GPY Selberg fiber bound for tuple weights, formalized from Mathlib (squarefree products, pairwise coprimality, and fiber counting)