Bounded integer selection of a nonzero resultant from a finite family
ProvedTranscendenceTheory.bounded_resultant_family_selectioncommutative-algebraelliptic-functionspolynomials
Let be a nonzero polynomial in , and embed its coefficient ring into a characteristic-zero field in which splits. Let be bivariate polynomials. Suppose that every root of in is avoided by at least one member of the family, that every has degree at most in , and that its coefficients have degree at most in .
There is a natural number
such that
has nonzero resultant with . Moreover, still has degree at most in , and every coefficient of has degree at most in . 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.