Four bounded generators and derivative lists for intermediate ideals
ProvedWeierstrassEllipticZeta.intermediate_ideal_four_generatorscommutative-algebraelliptic-functionstranscendencezero-estimates
Let , and let . Suppose ideals satisfy
Assume . Fix a nonnegative integer such that and all three have degree at most . Let be a complex-linear derivation of satisfying
where multivariate degrees in these bounds are total degrees, with zero assigned total degree zero.
Define and for . Then
For every , all entries in the derivative list also satisfy
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.