Bounded integer generic combinations nonvanishing on finite sets
ProvedWeierstrassEllipticZeta.finite_family_bounded_generic_nonvanishingcommutative-algebraelliptic-functionstranscendencezero-estimates
Let be a finite subset of , let , and let . Suppose these polynomials have no common zero on : for each , some is nonzero.
Then there exists an integer with
such that the polynomial
is nonzero at every point of . Moreover, for every such that for all , one has .
Here is truncated subtraction in , also for , and total degree of the zero polynomial is zero. Empty finite sets and are included.
The result compresses simultaneous nonvanishing of a finite polynomial family into one combination with constant integer coefficients and an explicit bound on its parameter, while preserving the degree bound.
Preamble
import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.MvPolynomial.Degrees import Mathlib.Algebra.Polynomial.Roots import Mathlib.Data.Complex.Basic open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.finite_family_bounded_generic_nonvanishing
(V : Finset (Fin 4 → ℂ)) (K : ℕ) (f : Fin K → MvPolynomial (Fin 4) ℂ)
(h : ∀ v : V, ∃ j : Fin K, MvPolynomial.eval v.val (f j) ≠ 0) :
∃ a : ℕ, a ≤ V.card * (K - 1) ∧
let q := ∑ j : Fin K, MvPolynomial.C ((a : ℂ) ^ j.val) * f j
(∀ v : V, MvPolynomial.eval v.val q ≠ 0) ∧
∀ D : ℕ, (∀ j : Fin K, (f j).totalDegree ≤ D) → q.totalDegree ≤ D := by sorry
Source
Derived finite-avoidance lemma associated with the differential-polynomial and finite-set setting of Senthil Kumar K (2026), Appendix A and Theorem A.2, https://doi.org/10.1017/S001309152610145X. It is proved here, not quoted from that theorem. For K polynomials with no common zero on a finite set V, an integer a between 0 and |V|*(K-1) makes their combination with coefficients a^j nonzero on all of V, without increasing a common total-degree bound. The proof forms the product over V of the evaluation polynomials in a and uses its degree bound to exclude vanishing at every integer in that range. Mathlib references: Polynomial.eq_zero_of_natDegree_lt_card_of_eval_eq_zero, natDegree_prod_le, natDegree_sum_le_of_forall_le, and MvPolynomial.totalDegree_smul_le. No Prove2Me theorem dependencies.