Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Four bounded generators and derivative lists for intermediate ideals

Proved
WeierstrassEllipticZeta.intermediate_ideal_four_generators

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let A=C[t,x1,x2,x3]A=\mathbb C[t,x_1,x_2,x_3]A=C[t,x1​,x2​,x3​], and let M,g,r1,r2,r3∈C[t]M,g,r_1,r_2,r_3\in\mathbb C[t]M,g,r1​,r2​,r3​∈C[t]. Suppose ideals I,J⊆AI,J\subseteq AI,J⊆A satisfy

I=(M(t),x1−r1(t),x2−r2(t),x3−r3(t)),J=I+(g(t)).I=(M(t),x_1-r_1(t),x_2-r_2(t),x_3-r_3(t)),\qquad J=I+(g(t)).I=(M(t),x1​−r1​(t),x2​−r2​(t),x3​−r3​(t)),J=I+(g(t)).

Assume g∣Mg\mid Mg∣M. Fix a nonnegative integer ddd such that ggg and all three rir_iri​ have degree at most ddd. Let DDD be a complex-linear derivation of AAA satisfying

deg⁡(Dkp)≤deg⁡p+k(p∈A, k∈N),\deg(D^k p)\leq\deg p+k\qquad(p\in A,\ k\in\mathbb N),deg(Dkp)≤degp+k(p∈A, k∈N),

where multivariate degrees in these bounds are total degrees, with zero assigned total degree zero.

Define f0=g(t)f_0=g(t)f0​=g(t) and fi=xi−ri(t)f_i=x_i-r_i(t)fi​=xi​−ri​(t) for 1≤i≤31\leq i\leq31≤i≤3. Then

J=(f0,f1,f2,f3),deg⁡fi≤max⁡(1,d).J=(f_0,f_1,f_2,f_3),\qquad \deg f_i\leq\max(1,d).J=(f0​,f1​,f2​,f3​),degfi​≤max(1,d).

For every k∈Nk\in\mathbb Nk∈N, all 4(k+1)4(k+1)4(k+1) entries in the derivative list also satisfy

deg⁡(Djfi)≤max⁡(1,d)+k(0≤j≤k, 0≤i≤3).\deg(D^j f_i)\leq\max(1,d)+k \qquad(0\leq j\leq k,\ 0\leq i\leq3).deg(Djfi​)≤max(1,d)+k(0≤j≤k, 0≤i≤3).

This gives explicit bounded generators for an ideal presented by adding a divisor of its time relation, and bounds the finite derivative lists used to enlarge it. The list is not asserted to be minimal or independent.

Preamble
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Algebra.MvPolynomial.Degrees
import Mathlib.Algebra.Polynomial.AlgebraMap
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.Derivation.Basic
import Mathlib.RingTheory.Ideal.Span

open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.intermediate_ideal_four_generators
    (I J : Ideal (MvPolynomial (Fin 4) ℂ)) (M g : Polynomial ℂ)
    (r : Fin 3 → Polynomial ℂ) (d : ℕ)
    (hI : I = Ideal.span (insert (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) M)
      (Set.range (fun i : Fin 3 => MvPolynomial.X i.succ -
        Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (r i)))))
    (hJ : J = I ⊔ Ideal.span {Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g})
    (hdiv : g ∣ M) (hg : g.natDegree ≤ d)
    (hr : ∀ i : Fin 3, (r i).natDegree ≤ d)
    (D : Derivation ℂ (MvPolynomial (Fin 4) ℂ) (MvPolynomial (Fin 4) ℂ))
    (hD : ∀ (p : MvPolynomial (Fin 4) ℂ) (k : ℕ),
      (D^[k] p).totalDegree ≤ p.totalDegree + k) :
    let f : Fin 4 → MvPolynomial (Fin 4) ℂ :=
      Fin.cons (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g)
        (fun i : Fin 3 => MvPolynomial.X i.succ -
          Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (r i))
    J = Ideal.span (Set.range f) ∧
      (∀ i : Fin 4, (f i).totalDegree ≤ max 1 d) ∧
      (∀ (k : ℕ) (i : Fin (k + 1) × Fin 4),
        (D^[i.1.val] (f i.2)).totalDegree ≤ max 1 d + k) := by sorry
Source
Derived generator calculation for the differential polynomial-ring method associated with Senthil Kumar K (2026), Appendix A introductory paragraphs and Theorem A.2, https://doi.org/10.1017/S001309152610145X. This exact four-generator statement is derived here, not quoted from the article. If I has a triangular presentation using a time polynomial M and three coordinate relations, J=I+(g(t)), and g divides M, then J is generated by g(t) and the same three coordinate relations. Degree bounds on g and the coordinate polynomials give bounds on all four generators. An explicit linear degree-growth hypothesis on a derivation gives bounds on every entry in its finite derivative lists. The proof imports only Mathlib and makes no minimality or coefficient-degree assertion.

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