Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded integer selection of a nonzero resultant from a finite family

Proved
TranscendenceTheory.bounded_resultant_family_selection

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

commutative-algebraelliptic-functionspolynomials

Let FFF be a nonzero polynomial in C[X][Y]\mathbb C[X][Y]C[X][Y], and embed its coefficient ring into a characteristic-zero field LLL in which FFF splits. Let H0,…,Hk−1H_0,\ldots,H_{k-1}H0​,…,Hk−1​ be bivariate polynomials. Suppose that every root of FFF in LLL is avoided by at least one member of the family, that every HjH_jHj​ has degree at most sss in YYY, and that its coefficients have degree at most bbb in XXX.

There is a natural number

0≤t≤(deg⁡YF)(k−1)0\le t\le (\deg_Y F)(k-1)0≤t≤(degY​F)(k−1)

such that

Q(X,Y)=∑j=0k−1tjHj(X,Y)Q(X,Y)=\sum_{j=0}^{k-1}t^jH_j(X,Y)Q(X,Y)=j=0∑k−1​tjHj​(X,Y)

has nonzero resultant with FFF. Moreover, QQQ still has degree at most sss in YYY, and every coefficient of QQQ has degree at most bbb in XXX. The subtraction in the bound is truncated natural subtraction, so the assertion includes an empty family when its hypotheses permit one.

Preamble
import Mathlib.RingTheory.Polynomial.Resultant.Basic
import Mathlib.Data.Complex.Basic

noncomputable section
open Polynomial
open scoped Classical
Formal statement
theorem TranscendenceTheory.bounded_resultant_family_selection
    (L : Type*) [Field L] [CharZero L]
    (φ : Polynomial ℂ →+* L) (hφ : Function.Injective φ)
    (F : Polynomial (Polynomial ℂ)) (k b s : ℕ)
    (H : Fin k → Polynomial (Polynomial ℂ))
    (hF : F ≠ 0) (hsplit : (F.map φ).Splits)
    (hroots : ∀ z ∈ (F.map φ).roots, ∃ j, (H j).eval₂ φ z ≠ 0)
    (hdegree : ∀ j, (H j).natDegree ≤ s)
    (hcoeff : ∀ j i, ((H j).coeff i).natDegree ≤ b) :
    ∃ a : ℕ, a ≤ F.natDegree * (k - 1) ∧
      let Q := ∑ j : Fin k, (a ^ j.val) • H j
      F.resultant Q ≠ 0 ∧ Q.natDegree ≤ s ∧
        ∀ i, (Q.coeff i).natDegree ≤ b := by sorry
Source
Derived bounded-selection step for https://prove2.me/theorems/e228afdd-f183-4b04-ba4d-f76d7e7f01da. Mission context: Senthil Kumar K (2026), Algebraic independence of values of Weierstrass elliptic and zeta functions, Appendix A.2, Theorem A.3 and Proposition A.1; https://doi.org/10.1017/S001309152610145X. The selection lemma is a derived algebraic tool, not a claim to complete the paper zero estimate. Primary Lean sources: Mathlib Algebra/Polynomial/Roots.lean (root counts), RingTheory/Polynomial/Resultant/Basic.lean (product formula and Bezout identity), and Algebra/Polynomial/Degree/Operations.lean, revision 0df444a360eaa60ab8c11dca51a86af692955474. A finite family avoiding the roots of the first relation gives one resultant certificate with no increase in either polynomial degree bound.

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