Effective polynomial saturation and length of finite contact ideals
ProvedWeierstrassEllipticZeta.finite_contact_saturation_lengthLet , let , and choose either of the elliptic-extension chart derivations
Write . For each and , let be the chart contact ideal generated by polynomials whose first -jets vanish at .
Let be finite, let , and set
For a polynomial , choose any with for all . Define if and otherwise. Write and . Then
Moreover, the saturated quotient is finite dimensional over and
Thus saturation removes precisely the components on which vanishes and retains the full contact orders at every other point. Every exponent at least the largest contact order gives the same ideal. This provides a finite algebraic way to restrict the contact scheme to the locus , while retaining its exact length.
Formalization Note The theorem is unconditional for the defined chart derivations and contact ideals, apart from the displayed exponent bound. Empty , zero orders and the zero polynomial are included. Order-zero factors are the whole ring; an empty intersection is the whole ring and has quotient length zero. No first-coordinate injectivity, time-presentation, finite-dimensionality or nonsingularity hypothesis is assumed. The formal statement expresses the saturation equality by an equivalence for each polynomial , without introducing a separate saturation definition. In Lean, I.colon {p ^ N} denotes the colon by the singleton element . Chart indices 0 and 1 correspond to the homogeneous-coordinate charts and . This is a finite-contact calculation, without a global algebraic-group estimate.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal import Mathlib.RingTheory.Ideal.Colon import Mathlib.RingTheory.Ideal.IsPrimary import Mathlib.RingTheory.Ideal.Quotient.Basic import Mathlib.LinearAlgebra.FiniteDimensional.Defs open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.finite_contact_saturation_length (g₂ g₃ : ℂ) (c : Fin 2)
(V : Finset (Fin 4 → ℂ)) (n : V → ℕ) (p : MvPolynomial (Fin 4) ℂ)
(N : ℕ) (hN : ∀ v : V, n v ≤ N) :
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
let e : V → ℕ := fun v => if MvPolynomial.eval v.val p = 0 then 0 else n v
let J : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (e v)
I.colon {p ^ N} = J ∧
(∀ q : MvPolynomial (Fin 4) ℂ, (∃ r : ℕ, q * p ^ r ∈ I) ↔ q ∈ J) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ I.colon {p ^ N}) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I.colon {p ^ N}) = ∑ v : V, e v := by sorry