Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sparse Bezout certificates with bounded time coefficients

Proved
WeierstrassEllipticZeta.triangular_sparse_bezout_certificate

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let A=C[x0,x1,x2,x3]A=\mathbb C[x_0,x_1,x_2,x_3]A=C[x0​,x1​,x2​,x3​], let I⊆AI\subseteq AI⊆A be an ideal, and let M∈C[t]M\in\mathbb C[t]M∈C[t] be monic. Choose r1,r2,r3∈C[t]r_1,r_2,r_3\in\mathbb C[t]r1​,r2​,r3​∈C[t] and set ϕ(f)=f(t,r1(t),r2(t),r3(t))\phi(f)=f(t,r_1(t),r_2(t),r_3(t))ϕ(f)=f(t,r1​(t),r2​(t),r3​(t)). Assume that f∈If\in If∈I if and only if M∣ϕ(f)M\mid\phi(f)M∣ϕ(f) for every f∈Af\in Af∈A. Write E(b)=b(x0)E(b)=b(x_0)E(b)=b(x0​) and d=deg⁡Md=\deg Md=degM.

Given a sequence p0,p1,…p_0,p_1,\ldotsp0​,p1​,… in AAA, put Js=I+(p0,…,ps−1)J_s=I+(p_0,\ldots,p_{s-1})Js​=I+(p0​,…,ps−1​). Suppose Jn=AJ_n=AJn​=A, and let T={j<n:pj∉Jj}T=\{j<n:p_j\notin J_j\}T={j<n:pj​∈/Jj​} be the indices of equations that changed the ideal when first adjoined. Then ∣T∣≤d|T|\leq d∣T∣≤d, and there exist polynomials bj∈C[t]b_j\in\mathbb C[t]bj​∈C[t], indexed by j∈Tj\in Tj∈T, such that

deg⁡bj<d,deg⁡totE(bj)≤d−1,1−∑j∈TE(bj)pj∈I.\deg b_j<d,\qquad \deg_{\rm tot}E(b_j)\leq d-1,\qquad 1-\sum_{j\in T}E(b_j)p_j\in I.degbj​<d,degtot​E(bj​)≤d−1,1−j∈T∑​E(bj​)pj​∈I.

For these same coefficients, whenever D∈ND\in\mathbb ND∈N bounds the total degree of every retained pjp_jpj​, one has

deg⁡tot(1−∑j∈TE(bj)pj)≤(d−1)+D.\deg_{\rm tot}\left(1-\sum_{j\in T}E(b_j)p_j\right)\leq(d-1)+D.degtot​​1−j∈T∑​E(bj​)pj​​≤(d−1)+D.

Here d−1d-1d−1 denotes truncated subtraction in N\mathbb NN, and the ordinary polynomial degree of zero is −∞-\infty−∞; total degree of the zero multivariate polynomial is zero. The assertion includes the empty prefix and M=1M=1M=1.

This gives a certificate of the unit ideal modulo III whose number of terms and coefficient degrees are both bounded by the initial time relation.

Preamble
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Algebra.MvPolynomial.Degrees
import Mathlib.Algebra.Polynomial.AlgebraMap
import Mathlib.Algebra.Polynomial.Div
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.Ideal.Operations
import Mathlib.Data.Fin.Tuple.Basic
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Range
import Mathlib.Data.Fintype.EquivFin

open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.triangular_sparse_bezout_certificate
    (I : Ideal (MvPolynomial (Fin 4) ℂ)) (M : Polynomial ℂ)
    (r : Fin 3 → Polynomial ℂ) (hM : M.Monic)
    (hI : ∀ f : MvPolynomial (Fin 4) ℂ,
      f ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f)
    (p : ℕ → MvPolynomial (Fin 4) ℂ) (n : ℕ)
    (htop : I ⊔ Ideal.span (Set.range (fun i : Fin n => p i.val)) = ⊤) :
    let T := (Finset.range n).filter (fun j =>
      p j ∉ (I ⊔ Ideal.span (Set.range (fun i : Fin j => p i.val))))
    T.card ≤ M.natDegree ∧
    ∃ b : T → Polynomial ℂ,
      (∀ j : T, (b j).degree < (M.natDegree : ℕ) ∧
        (Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (b j)).totalDegree ≤
          M.natDegree - 1) ∧
      1 - ∑ j : T, Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b j) * p j.val ∈ I ∧
      ∀ D : ℕ, (∀ j : T, (p j.val).totalDegree ≤ D) →
        (1 - ∑ j : T, Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b j) * p j.val).totalDegree ≤
          M.natDegree - 1 + D := by sorry
Source
Derived commutative-algebra certificate associated with Senthil Kumar K (2026), Appendix A and Theorem A.2, https://doi.org/10.1017/S001309152610145X. This lemma is proved here under an explicit triangular presentation; it is not quoted from the article. If a prefix generates the unit ideal modulo I, retain the equations that changed each preceding ideal. There are at most deg M such indices, and 1 has a certificate modulo I using only them with univariate time coefficients of degree below deg M. If the retained equations have total degree at most D, the certificate residual has total degree at most deg M-1+D. Reuses the Proved sparse-prefix and bounded-time coefficient lemmas; primary Mathlib tools include Ideal.mem_span_range_iff_exists_fun, Submodule.mem_sup and Fintype.sum_equiv.

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