Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sparse generators and colength bound for triangular ideal prefixes

Proved
WeierstrassEllipticZeta.triangular_prefix_effective_equations

by tomasz · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutative-algebraelliptic-functionstranscendencezero-estimates

Let A=C[x0,x1,x2,x3]A=\mathbb C[x_0,x_1,x_2,x_3]A=C[x0​,x1​,x2​,x3​], let I⊆AI\subseteq AI⊆A be an ideal, and let M∈C[T]M\in\mathbb C[T]M∈C[T] be monic. Let r1,r2,r3∈C[T]r_1,r_2,r_3\in\mathbb C[T]r1​,r2​,r3​∈C[T] and put ϕ(f)=f(T,r1(T),r2(T),r3(T))\phi(f)=f(T,r_1(T),r_2(T),r_3(T))ϕ(f)=f(T,r1​(T),r2​(T),r3​(T)). Assume that, for every f∈Af\in Af∈A, membership f∈If\in If∈I is equivalent to M∣ϕ(f)M\mid\phi(f)M∣ϕ(f).

For any sequence p0,p1,…p_0,p_1,\ldotsp0​,p1​,… in AAA, define

Js=I+(p0,…,ps−1),Tn={i<n:pi∉Ji}.J_s=I+(p_0,\ldots,p_{s-1}),\qquad T_n=\{i<n:p_i\notin J_i\}.Js​=I+(p0​,…,ps−1​),Tn​={i<n:pi​∈/Ji​}.

Then, for every n≥0n\geq0n≥0,

Jn=I+(pi:i∈Tn),∣Tn∣+dim⁡C(A/Jn)≤deg⁡M.J_n=I+(p_i:i\in T_n),\qquad |T_n|+\dim_{\mathbb C}(A/J_n)\leq\deg M.Jn​=I+(pi​:i∈Tn​),∣Tn​∣+dimC​(A/Jn​)≤degM.

Thus the equations that change the ideal when first adjoined suffice to generate every prefix modulo III. 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me