Jet vanishing and quotient length determine a contact intersection ideal
ProvedWeierstrassEllipticZeta.finite_contact_ideal_rigidityLet , 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 . Assume its exact membership property, for all :
Let be any finite set. Choose natural numbers for each , and a finite family . Put
Suppose the added equations have the indicated common jets:
If is finite-dimensional over and
then the ideal itself is exactly
Formalization Note The exact contact membership criterion above is an explicit hypothesis. The proof uses the already proved dimension formula for intersections of these contact ideals. The quotient dimension of and its finite dimensionality are assumptions, as is the vanishing of the added equations; the conclusion is equality of ideals. No time-substitution presentation or injectivity of first coordinates is required. Points in can share a first coordinate and need not lie on the chart cubic. Empty , , zero contact orders and zero or repeated equations are allowed. The zero-order contact ideal and the empty intersection are the whole ring. For positive residual orders, the existing contact-ideal structure theorem identifies the factors as primary ideals supported at their respective points. This local rigidity statement supplies no global degree estimate or algebraic-group compatibility.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.RingTheory.Ideal.Quotient.Operations open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.finite_contact_ideal_rigidity
(g₂ g₃ : ℂ) (c : Fin 2)
(hcontact : ∀ (v : Fin 4 → ℂ) (n : ℕ) (p : MvPolynomial (Fin 4) ℂ),
p ∈ extensionChartContactIdeal g₂ g₃ c v n ↔
∀ k < n, MvPolynomial.eval v ((extensionChartDerivation g₂ g₃ c)^[k] p) = 0)
(V : Finset (Fin 4 → ℂ)) (n e : V → ℕ) (he : ∀ v : V, e v ≤ n v)
(K : ℕ) (f : Fin K → MvPolynomial (Fin 4) ℂ)
(hvan : ∀ (v : V) (i : Fin K) (j : ℕ), j < e v →
MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[j] (f i)) = 0)
(hfinite : FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸
((⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)) ⊔ Ideal.span (Set.range f))))
(hlen : Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸
((⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)) ⊔ Ideal.span (Set.range f))) =
∑ v : V, e v) :
(⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)) ⊔ Ideal.span (Set.range f) =
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (e v) := by sorry