Bounded time coefficients and residual degrees for Bézout certificates
ProvedWeierstrassEllipticZeta.bounded_time_bezout_coefficientsLet , let be an ideal, and let be monic of degree . Fix and set
Assume the exact ideal-membership criterion
Suppose a finite family has coefficient polynomials with
Then there exist univariate polynomials such that, for every ,
and the reduced coefficients preserve the certificate:
For any natural number bounding the total degree of every , the residual also satisfies
Here is natural-number subtraction. One can take to be the remainder of on division by .
Formalization Note The statement is conditional on the monic time presentation and an existing finite Bézout certificate. It imposes no degree bound on the original coefficients, the coordinate polynomials , or the family except when invoking the final residual bound. It permits and . For , monicity gives , all reduced coefficients are zero, and the membership criterion forces . Lean's polynomial degree assigns bottom to zero, so the strict bound remains meaningful; multivariate totalDegree assigns zero to the zero polynomial, which explains the truncated subtraction. In the mission, is the contact length, so these bounds still depend on that length. They do not give the global zero estimate or a bound independent of the chosen contact data.
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.Tactic.Ring open scoped Classical
theorem WeierstrassEllipticZeta.bounded_time_bezout_coefficients
(I : Ideal (MvPolynomial (Fin 4) ℂ)) (d : ℕ) (M : Polynomial ℂ)
(hM : M.Monic) (hdegree : M.degree = (d : ℕ)) (r : Fin 3 → Polynomial ℂ)
(hmem : ∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
(K : ℕ) (f a : Fin K → MvPolynomial (Fin 4) ℂ)
(ha : 1 - ∑ j : Fin K, a j * f j ∈ I) :
∃ b : Fin K → Polynomial ℂ,
(∀ j : Fin K, (b j).degree < (d : ℕ) ∧
(Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (b j)).totalDegree ≤ d - 1 ∧
a j - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b j) ∈ I) ∧
1 - ∑ j : Fin K,
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b j) * f j ∈ I ∧
∀ D : ℕ, (∀ j : Fin K, (f j).totalDegree ≤ D) →
(1 - ∑ j : Fin K,
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b j) * f j).totalDegree ≤ d - 1 + D := by sorry