Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Four triangular ideal generators from unique bounded time representatives

Proved
WeierstrassEllipticZeta.time_normal_form_triangular_generators

by tomasz · Sep 8, 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 ι:C[T]→A\iota:\mathbb C[T]\to Aι:C[T]→A send TTT to ttt. Fix an ideal I⊆AI\subseteq AI⊆A, an integer d≥0d\ge0d≥0, and a monic polynomial M∈C[T]M\in\mathbb C[T]M∈C[T] of degree ddd, with ι(M)∈I\iota(M)\in Iι(M)∈I.

Suppose that every polynomial residue class modulo III has a unique time-polynomial representative of degree less than ddd: for every p∈Ap\in Ap∈A, there is a unique q∈C[T]q\in\mathbb C[T]q∈C[T] such that

deg⁡q<d,p−ι(q)∈I.\deg q<d,\qquad p-\iota(q)\in I.degq<d,p−ι(q)∈I.

Then there are polynomials r1,r2,r3∈C[T]r_1,r_2,r_3\in\mathbb C[T]r1​,r2​,r3​∈C[T], each of degree less than ddd, such that

I=(ι(M), x1−ι(r1), x2−ι(r2), x3−ι(r3)).I=(\iota(M),\ x_1-\iota(r_1),\ x_2-\iota(r_2),\ x_3-\iota(r_3)).I=(ι(M), x1​−ι(r1​), x2​−ι(r2​), x3​−ι(r3​)).

Moreover, for every p∈Ap\in Ap∈A there is the exact membership test

p∈I⟺M(T)∣p(T,r1(T),r2(T),r3(T)).p\in I\quad\Longleftrightarrow\quad M(T)\mid p(T,r_1(T),r_2(T),r_3(T)).p∈I⟺M(T)∣p(T,r1​(T),r2​(T),r3​(T)).

The rir_iri​ are the unique bounded time representatives of the coordinate variables. Modulo the displayed four generators, substituting xi=ri(t)x_i=r_i(t)xi​=ri​(t) leaves every polynomial unchanged. Division by the monic MMM and uniqueness of the degree-bounded representative show that the time polynomials in III are precisely the multiples of MMM. Together these facts prove the generator equality and the membership criterion.

Formalization Note This is a general commutative-algebra lemma specialized to four variables over C\mathbb CC. Its hypotheses are supplied by the contact normal forms in the elliptic-extension application; no analytic or elliptic properties are assumed in this statement. Degree means Polynomial.degree, with bottom value for zero. The case d=0d=0d=0 is included and forces M=1M=1M=1, I=AI=AI=A, and all ri=0r_i=0ri​=0. The three Lean indices i : Fin 3 use i.succ for variables x1,x2,x3x_1,x_2,x_3x1​,x2​,x3​. The statement proves an ideal presentation and divisibility criterion; it does not assert a regular-sequence theorem or the global multiplicity estimate.

Preamble
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Algebra.Polynomial.AlgebraMap
import Mathlib.Algebra.Polynomial.Div
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.Ideal.Span
Formal statement
theorem WeierstrassEllipticZeta.time_normal_form_triangular_generators
    (I : Ideal (MvPolynomial (Fin 4) ℂ)) (d : ℕ) (M : Polynomial ℂ)
    (hM : M.Monic) (hdegree : M.degree = (d : ℕ))
    (hMI : Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) M ∈ I)
    (hrep : ∀ p : MvPolynomial (Fin 4) ℂ, ∃! q : Polynomial ℂ,
      q.degree < (d : ℕ) ∧ p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) q ∈ I) :
    ∃ r : Fin 3 → Polynomial ℂ,
      (∀ i, (r i).degree < (d : ℕ)) ∧
      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)))) ∧
      ∀ p : MvPolynomial (Fin 4) ℂ,
        p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p := by sorry
Source
Derived commutative-algebra presentation lemma for the differential polynomial-ring and finite-contact approach in Senthil Kumar K (2026), Appendix A and Appendix A.2, https://doi.org/10.1017/S001309152610145X. This conditional algebraic lemma is proved here and is not quoted as the quantitative zero estimate in Theorem A.2. Primary formal references in Mathlib: MvPolynomial.algHom_ext, Ideal.Quotient.mk_eq_mk_iff_sub_mem, Polynomial.modByMonic_add_div, Polynomial.degree_modByMonic_lt, Polynomial.modByMonic_eq_zero_iff_dvd, and Ideal.span_le.

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