Sparse generators and colength bound for triangular ideal prefixes
ProvedWeierstrassEllipticZeta.triangular_prefix_effective_equationscommutative-algebraelliptic-functionstranscendencezero-estimates
Let , let be an ideal, and let be monic. Let and put . Assume that, for every , membership is equivalent to .
For any sequence in , define
Then, for every ,
Thus the equations that change the ideal when first adjoined suffice to generate every prefix modulo . Their number is bounded by the loss of quotient dimension. 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 import Mathlib.Data.Fin.Tuple.Basic import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Range open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.triangular_prefix_effective_equations
(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 J := fun s : ℕ => I ⊔ Ideal.span (Set.range (fun i : Fin s => p i.val))
∀ n : ℕ,
let T := (Finset.range n).filter (fun i => p i ∉ J i)
J n = I ⊔ Ideal.span (p '' (T : Set ℕ)) ∧
T.card + Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J n) ≤ M.natDegree := by sorry
Source
Derived commutative-algebra lemma associated with Senthil Kumar K (2026), Appendix A and Theorem A.2, https://doi.org/10.1017/S001309152610145X. This sparse-prefix lemma is derived here, not quoted from the article. Given a monic triangular time relation M and equations p_i, retain precisely those indices i at which p_i is absent from the preceding prefix ideal J_i. The retained equations generate each J_n modulo the original ideal, and their number plus the quotient dimension at n is at most deg M. The proof reuses the Proved prefix gcd recurrence; its supporting canonical update and hypersurface intersection length proofs are included in local kernel replay.