Finite contact intersection length as a sum of common jet orders
ProvedWeierstrassEllipticZeta.finite_contact_jet_intersection_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 . Assume its exact membership property, for all :
Let be finite with distinct first coordinates , and choose nonnegative integers . Put
Fix three polynomials and assume the time-substitution presentation
For every natural number and every finite family , set
Then is finite-dimensional over . There exist integers such that, for each and ,
and
Formalization Note This is a conditional finite-contact algebra lemma. The contact membership property and the time-substitution presentation are explicit hypotheses; no geometric presentation is silently assumed. The chart labels are Lean's , corresponding to the and homogeneous-coordinate charts. The integers are the common jet-vanishing orders truncated at . The theorem includes empty , zero , zero or repeated equations, and . For the joint vanishing condition is vacuous and . It gives an exact local length formula, with no bound on the number of strict differentiation stages and no global subgroup or degree estimate.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal import Mathlib.Algebra.Polynomial.Derivation import Mathlib.Algebra.Polynomial.Taylor import Mathlib.Algebra.Polynomial.Splits import Mathlib.RingTheory.Polynomial.Content import Mathlib.Tactic.FinCases import Mathlib.RingTheory.AdjoinRoot import Mathlib.RingTheory.PrincipalIdealDomain import Mathlib.RingTheory.Ideal.Quotient.Operations open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.finite_contact_jet_intersection_length
(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 → ℂ))
(hV : Function.Injective (fun v : V => v.val 0)) (n : V → ℕ)
(r : Fin 3 → Polynomial ℂ)
(hmem : ∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ (⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)) ↔
(∏ v : V, (Polynomial.X - Polynomial.C (v.val 0)) ^ n v) ∣
MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
(K : ℕ) (f : Fin K → MvPolynomial (Fin 4) ℂ) :
let I := ⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
let J := I ⊔ Ideal.span (Set.range f)
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
∃ e : V → ℕ,
(∀ v : V, e v ≤ n v ∧ ∀ k ≤ n v,
k ≤ e v ↔ ∀ i : Fin K, ∀ j < k,
MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[j] (f i)) = 0) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = ∑ v : V, e v := by sorry