Explicit gcd recurrence for triangular ideal prefixes
ProvedWeierstrassEllipticZeta.triangular_prefix_gcd_recurrencecommutative-algebraelliptic-functionstranscendencezero-estimates
Let and let be the substitution , . Suppose is monic and is an ideal with . For any sequence in , define
For every , is monic and divides , and . The quotient is finite dimensional with . Also and , with
The assertion includes the empty prefix and the unit ideal.
Preamble
import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Data.Complex.Basic import Mathlib.RingTheory.AdjoinRoot import Mathlib.RingTheory.Ideal.Quotient.Operations
Formal statement
theorem WeierstrassEllipticZeta.triangular_prefix_gcd_recurrence
(I : Ideal (MvPolynomial (Fin 4) ℂ)) (M : Polynomial ℂ)
(r : Fin 3 → Polynomial ℂ) (hM : M.Monic)
(hI : ∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f)
(p : ℕ → MvPolynomial (Fin 4) ℂ) :
let G : ℕ → Polynomial ℂ := Nat.rec M (fun s g =>
gcd g (MvPolynomial.aeval (Fin.cons Polynomial.X r) (p s)))
G 0 = M ∧
(∀ s : ℕ, G (s + 1) = gcd (G s)
(MvPolynomial.aeval (Fin.cons Polynomial.X r) (p s))) ∧
∀ s : ℕ,
let J := I ⊔ Ideal.span (Set.range (fun i : Fin s => p i.val))
(G s).Monic ∧ G s ∣ M ∧
(∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ J ↔ G s ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = (G s).natDegree ∧
G (s + 1) ∣ G s ∧ (G (s + 1)).natDegree ≤ (G s).natDegree ∧
(G (s + 1) = G s ↔ p s ∈ J) ∧
((G (s + 1)).natDegree < (G s).natDegree ↔ p s ∉ J) ∧
(Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸
(I ⊔ Ideal.span (Set.range (fun i : Fin (s + 1) => p i.val)))) <
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ↔ p s ∉ J) := by sorry
Source
Derived commutative-algebra construction associated with Senthil Kumar K (2026), Appendix A and Theorem A.2, https://doi.org/10.1017/S001309152610145X. This recurrence is derived here, not quoted from the article. Starting from a monic triangular time relation M and a sequence p_s, define G_0=M and G_(s+1)=gcd(G_s,phi(p_s)). The theorem proves at every prefix that G_s is monic, divides M, gives the exact membership criterion and quotient dimension, and strictly drops in degree and quotient dimension exactly when the next equation is absent. Reuses the Proved canonical update and hypersurface intersection length theorems.