Sparse Bezout certificates with bounded time coefficients
ProvedWeierstrassEllipticZeta.triangular_sparse_bezout_certificatecommutative-algebraelliptic-functionstranscendencezero-estimates
Let , let be an ideal, and let be monic. Choose and set . Assume that if and only if for every . Write and .
Given a sequence in , put . Suppose , and let be the indices of equations that changed the ideal when first adjoined. Then , and there exist polynomials , indexed by , such that
For these same coefficients, whenever bounds the total degree of every retained , one has
Here denotes truncated subtraction in , and the ordinary polynomial degree of zero is ; total degree of the zero multivariate polynomial is zero. The assertion includes the empty prefix and .
This gives a certificate of the unit ideal modulo 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.