Explicit lengths and stopping criterion for derivative intersections
ProvedWeierstrassEllipticZeta.derivative_intersection_length_profileLet , 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
Fix and a natural number . Suppose every point of has a nonzero jet below this cutoff:
Then there are natural numbers such that
For every integer , put
The quotient is finite-dimensional over , and its exact dimension is
Its zero-quotient criterion is
In particular, whenever .
Formalization Note The same first nonzero orders work for every positive . All contact and time-substitution hypotheses above are retained explicitly. Natural-number subtraction in Lean means . Zero contact orders and empty are included. If is nonempty, the nonzero-jet hypothesis excludes the zero polynomial and forces ; for empty , is allowed. The displayed profile concerns ; the no-equation case is with the previously proved contact length. The upper cutoff is supplied, not estimated here. The theorem is a local exact length calculation and does not bound the cutoff in terms of degree or prove the global algebraic-group obstruction.
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.derivative_intersection_length_profile
(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) ℂ) (B : ℕ)
(hB : ∀ v : V, ∃ j < B,
MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[j] p) ≠ 0) :
∃ t : V → ℕ,
(∀ v : V, t v < B ∧
MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[t v] p) ≠ 0 ∧
∀ j < t v, MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[j] p) = 0) ∧
∀ s : ℕ, 0 < s →
let I := ⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
let J := I ⊔ Ideal.span (Set.range (fun i : Fin s =>
(extensionChartDerivation g₂ g₃ c)^[i.val] p))
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) =
∑ v : V, min (n v) (t v + 1 - s) ∧
(J = ⊤ ↔ ∀ v : V, n v = 0 ∨ t v < s) ∧
(B ≤ s → J = ⊤) := by sorry