Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded Bezout certificates descend along any field extension

Proved
TranscendenceTheory.bounded_bezout_field_descent

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

algebraelliptic-functionspolynomials

Let L/KL/KL/K be any field extension, with coefficient embedding ι:K↪L\iota:K\hookrightarrow Lι:K↪L. Let f,g,h∈K[Y]f,g,h\in K[Y]f,g,h∈K[Y] and let a,b,ca,b,ca,b,c be natural numbers. Write δ(P)\delta(P)δ(P) for natural degree, so that δ(0)=0\delta(0)=0δ(0)=0.

A Bézout certificate with these prescribed degree bounds exists over LLL if and only if one exists over KKK:

∃U,V,W∈L[Y],Uι∗f+Vι∗g+Wι∗h=1,δ(V)<b,δ(W)<c,δ(U)≤a\begin{aligned} &\exists U,V,W\in L[Y],\quad U\iota_*f+V\iota_*g+W\iota_*h=1,\\ &\hspace{35mm}\delta(V)<b,\quad\delta(W)<c,\quad\delta(U)\le a \end{aligned}​∃U,V,W∈L[Y],Uι∗​f+Vι∗​g+Wι∗​h=1,δ(V)<b,δ(W)<c,δ(U)≤a​

is equivalent to

∃u,v,w∈K[Y],uf+vg+wh=1,δ(v)<b,δ(w)<c,δ(u)≤a.\begin{aligned} &\exists u,v,w\in K[Y],\quad uf+vg+wh=1,\\ &\hspace{35mm}\delta(v)<b,\quad\delta(w)<c,\quad\delta(u)\le a. \end{aligned}​∃u,v,w∈K[Y],uf+vg+wh=1,δ(v)<b,δ(w)<c,δ(u)≤a.​

There is no algebraicity, finite-dimensionality, characteristic, or algebraic-closedness assumption on the extension. The polynomials may be zero. If b=0b=0b=0 or c=0c=0c=0, both bounded existence assertions are false under the stated natural-degree convention.

This result permits bounded polynomial certificates obtained over an algebraic closure to be sought over the original coefficient field, with exactly the same degree limits.

Preamble
import Mathlib.Algebra.Polynomial.Module.Basic
import Mathlib.Algebra.Polynomial.Degree.Lemmas
import Mathlib.LinearAlgebra.Dual.Lemmas
Formal statement
theorem TranscendenceTheory.bounded_bezout_field_descent
    (K L : Type*) [Field K] [Field L] [Algebra K L]
    (f g h : Polynomial K) (a b c : ℕ) :
    (∃ u v w : Polynomial L,
      u * f.map (algebraMap K L) + v * g.map (algebraMap K L) +
          w * h.map (algebraMap K L) = 1 ∧
      v.natDegree < b ∧ w.natDegree < c ∧ u.natDegree ≤ a) ↔
    (∃ u v w : Polynomial K,
      u * f + v * g + w * h = 1 ∧
      v.natDegree < b ∧ w.natDegree < c ∧ u.natDegree ≤ a) := by sorry
Source
Derived degree-preserving field descent and equivalent reduction of https://prove2.me/theorems/cf950c6d-5cac-4881-ba87-355667b6efe6. Primary sources at Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474: PolynomialModule.equivPolynomial and PolynomialModule.map, lines 260-317, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Polynomial/Module/Basic.lean#L260; Module.Projective.exists_dual_eq_one, line 213, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/LinearAlgebra/Dual/Lemmas.lean#L213; Polynomial.natDegree_le_iff_coeff_eq_zero, line 78, and natDegree_map_eq_of_injective, line 293, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Polynomial/Degree/Lemmas.lean#L78. 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 descent 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