Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded integer generic combinations nonvanishing on finite sets

Proved
WeierstrassEllipticZeta.finite_family_bounded_generic_nonvanishing

by tomasz · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutative-algebraelliptic-functionstranscendencezero-estimates

Let VVV be a finite subset of C4\mathbb C^4C4, let K∈NK\in\mathbb NK∈N, and let f0,…,fK−1∈C[x0,x1,x2,x3]f_0,\ldots,f_{K-1}\in\mathbb C[x_0,x_1,x_2,x_3]f0​,…,fK−1​∈C[x0​,x1​,x2​,x3​]. Suppose these polynomials have no common zero on VVV: for each v∈Vv\in Vv∈V, some fj(v)f_j(v)fj​(v) is nonzero.

Then there exists an integer aaa with

0≤a≤∣V∣(K−1)0\leq a\leq |V|(K-1)0≤a≤∣V∣(K−1)

such that the polynomial

q=∑j=0K−1ajfjq=\sum_{j=0}^{K-1}a^j f_jq=j=0∑K−1​ajfj​

is nonzero at every point of VVV. Moreover, for every D∈ND\in\mathbb ND∈N such that deg⁡totfj≤D\deg_{\rm tot}f_j\leq Ddegtot​fj​≤D for all jjj, one has deg⁡totq≤D\deg_{\rm tot}q\leq Ddegtot​q≤D.

Here K−1K-1K−1 is truncated subtraction in N\mathbb NN, a0=1a^0=1a0=1 also for a=0a=0a=0, and total degree of the zero polynomial is zero. Empty finite sets and K=0K=0K=0 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me