Residual contact ideal decomposition from complementary length
ProvedWeierstrassEllipticZeta.residual_contact_ideal_decompositionWrite . Fix arbitrary chart parameters and a chart , with its derivation . For a point and an integer , let
Let be finite. Choose orders with for each , and a polynomial such that
Set
Assume the residual length balance
Then the residual ideal has the exact complementary contact decomposition
Moreover is finite dimensional over and
Formalization Note The scalar length balance is a hypothesis, and only the displayed lower bounds on the vanishing orders of are assumed. The proof obtains finite dimensionality from the complementary contact ideal and its inclusion in , so no separate finite-dimensionality premise is needed. Mathlib's Module.finrank denotes the finite rank used in the balance. The chart and its derivation are exactly those of ProjectiveContactIdeal. Empty sets, zero orders, , and points sharing a first coordinate are allowed. There is no time-presentation, lattice or nonsingularity hypothesis. The result is a local ideal identity and length calculation; it does not assert a global zero estimate.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.RingTheory.Ideal.Quotient.Operations import Mathlib.RingTheory.Ideal.Colon open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.residual_contact_ideal_decomposition (g₂ g₃ : ℂ) (c : Fin 2)
(V : Finset (Fin 4 → ℂ)) (n e : V → ℕ) (he : ∀ v : V, e v ≤ n v)
(p : MvPolynomial (Fin 4) ℂ)
(hvan : ∀ (v : V) (j : ℕ), j < e v →
MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[j] p) = 0) :
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
let R := I.colon {p}
(Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) + ∑ v : V, e v = ∑ v : V, n v) →
R = (⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v - e v)) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) = ∑ v : V, (n v - e v) := by sorry