Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded Bezout certificates for guarded polynomial root avoidance

Proved
TranscendenceTheory.guarded_root_avoidance_bezout

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

algebraelliptic-functionspolynomials

Let KKK be an algebraically closed field and let f,g,h∈K[T]f,g,h\in K[T]f,g,h∈K[T], with n=deg⁡f>0n=\deg f>0n=degf>0. Nonvanishing of hhh at the common roots of fff and ggg is equivalent to a bounded Bézout certificate:

(∀z∈K, f(z)=g(z)=0⟹h(z)≠0)⟺∃A,B,C∈K[T],Af+Bg+Ch=1,deg⁡B<n,deg⁡C<n,deg⁡A≤max⁡{0,deg⁡g,deg⁡h}.\bigl(\forall z\in K,\ f(z)=g(z)=0\Longrightarrow h(z)\ne0\bigr) \quad\Longleftrightarrow\quad \begin{gathered} \exists A,B,C\in K[T],\quad Af+Bg+Ch=1,\\ \deg B<n,\qquad \deg C<n,\qquad \deg A\le\max\{0,\deg g,\deg h\}. \end{gathered}(∀z∈K, f(z)=g(z)=0⟹h(z)=0)⟺∃A,B,C∈K[T],Af+Bg+Ch=1,degB<n,degC<n,degA≤max{0,degg,degh}.​

Zero polynomials are allowed for ggg, hhh, and the certificate coefficients. Repeated roots require no separability assumption. Taking g=0g=0g=0 gives a bounded certificate for nonvanishing at every root of fff; taking ggg to be a product of linear factors restricts the test to a specified finite spectrum.

This equivalence replaces a root-avoidance condition by finitely many coefficient equations with explicit degree bounds.

Formalization Note The statement uses natural degree, which assigns degree zero to the zero polynomial. Since n>0n>0n>0 and the bound for AAA is nonnegative, this gives exactly the displayed certificate bounds.

Preamble
import Mathlib.FieldTheory.IsAlgClosed.Basic
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.Tactic.Ring
Formal statement
theorem TranscendenceTheory.guarded_root_avoidance_bezout
    (K : Type*) [Field K] [IsAlgClosed K]
    (f g h : Polynomial K) (hf : f.natDegree ≠ 0) :
    (∀ z ∈ f.roots, g.eval z = 0 → h.eval z ≠ 0) ↔
      ∃ a b c : Polynomial K,
        a * f + b * g + c * h = 1 ∧
        b.natDegree < f.natDegree ∧ c.natDegree < f.natDegree ∧
        a.natDegree ≤ max g.natDegree h.natDegree := by sorry
Source
Derived bounded univariate Bezout criterion and equivalent reduction of https://prove2.me/theorems/68594e47-28c9-45bd-94ef-d0496f0252cf. Primary sources at Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474: Polynomial.isCoprime_iff_aeval_ne_zero_of_isAlgClosed, line 251, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/FieldTheory/IsAlgClosed/Basic.lean#L251; Polynomial.natDegree_mod_lt, line 423, and root_gcd_iff_root_left_right, lines 475-491, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Polynomial/FieldDivision.lean#L423; EuclideanDomain.gcd_eq_gcd_ab, line 206, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/EuclideanDomain/Basic.lean#L206. 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. This certificate reduction is derived here, not a verbatim theorem from the paper.

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