Local vanishing multiplicities in elliptic-extension contact intersections
ProvedWeierstrassEllipticZeta.elliptic_extension_local_intersection_multiplicitiesFix complex numbers and one of the two elliptic-extension charts. Let be its polynomial derivation on , so . For an affine point and a natural number , let be the chart contact ideal. Assume its exact jet-membership criterion:
Let be a finite set of affine points whose time coordinates are pairwise distinct, and assign each a natural contact order . Put
Fix three polynomials and write . Assume
Then, for every , there are natural numbers with such that, for every integer ,
and
Thus is precisely the vanishing order detected by the available jets, truncated at . Combined with the established gcd-degree formula for , this expresses the intersection length as the sum of the local truncated vanishing orders.
Formalization Note The explicit assumptions are exact contact membership, distinct time coordinates, and the exact divisibility presentation. There is no degree restriction on or the coordinate polynomials and no nonvanishing assumption on . Empty point sets and zero contact orders are allowed. If , the formula still gives . In Lean the degree is Polynomial.natDegree. The proof uses root multiplicities of the nonzero gcd, avoiding the convention that the root multiplicity of the zero polynomial is zero. The bound and prefix-vanishing equivalence specify the local order without introducing an infinity-valued definition. This is a local multiplicity calculation, not a proof of the global zero 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 open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.elliptic_extension_local_intersection_multiplicities
(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) :
∀ p : MvPolynomial (Fin 4) ℂ, ∃ e : V → ℕ,
(∀ v : V, e v ≤ n v ∧ ∀ k ≤ n v,
k ≤ e v ↔ ∀ j < k,
MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[j] p) = 0) ∧
(gcd (∏ v : V, (Polynomial.X - Polynomial.C (v.val 0)) ^ n v)
(MvPolynomial.aeval (Fin.cons Polynomial.X r) p)).natDegree = ∑ v : V, e v := by sorry