Bézout certificates in finite elliptic-extension contact quotients
ProvedWeierstrassEllipticZeta.elliptic_extension_finite_contact_bezout_certificateFix complex numbers , one of the two elliptic-extension charts, and a finite set of affine points in . Write . Assign each a natural contact order , let be its chart contact ideal, and put
Assume two established properties of the contact ideals. First, if is the kernel of evaluation at , then
Second, every family admits a simultaneous representative: there exists such that for every .
Let be a finite family. Assume that at each point of positive contact order, at least one of these polynomials is nonzero:
Then there are polynomials satisfying the finite Bézout certificate
Moreover,
Thus these equations generate the unit ideal in the contact quotient: after imposing all of them, no contact contribution remains, including nilpotent multiplicity.
Formalization Note The power containment and simultaneous-representative property are explicit hypotheses, both supplied by the proved contact-ideal structure. Distinct time coordinates are not required. The contact orders may vary and may be zero; no nonvanishing condition is imposed at order zero. Empty point sets and empty polynomial families are covered whenever the displayed hypotheses hold. The result asserts existence of polynomial coefficients, with no degree bound on those coefficients. In the mission reduction, the family consists of the derivatives of the normalized polynomial of orders strictly below the existing cutoff . This is a finite contact-algebra certificate, not the global quantitative zero estimate.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal import Mathlib.Algebra.Ring.GeomSum import Mathlib.RingTheory.Ideal.Operations import Mathlib.Tactic.Ring open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.elliptic_extension_finite_contact_bezout_certificate
(g₂ g₃ : ℂ) (c : Fin 2) (V : Finset (Fin 4 → ℂ)) (n : V → ℕ)
(hpower : ∀ v : V, RingHom.ker (MvPolynomial.eval v.val) ^ n v ≤
extensionChartContactIdeal g₂ g₃ c v.val (n v))
(hcrt : ∀ p : V → MvPolynomial (Fin 4) ℂ,
∃ q : MvPolynomial (Fin 4) ℂ, ∀ v : V,
q - p v ∈ extensionChartContactIdeal g₂ g₃ c v.val (n v))
(K : ℕ) (f : Fin K → MvPolynomial (Fin 4) ℂ)
(hnonzero : ∀ v : V, 0 < n v → ∃ j : Fin K, MvPolynomial.eval v.val (f j) ≠ 0) :
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
∃ a : Fin K → MvPolynomial (Fin 4) ℂ,
1 - ∑ j : Fin K, a j * f j ∈ I ∧ I ⊔ Ideal.span (Set.range f) = ⊤ := by sorry