Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Residual quotient algebra and length in a time-polynomial presentation

Proved
WeierstrassEllipticZeta.triangular_residual_quotient_length

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​], choose r1,r2,r3∈C[T]r_1,r_2,r_3\in\mathbb C[T]r1​,r2​,r3​∈C[T], and let

Φ:A⟶C[T],Φ(t)=T,Φ(xi)=ri(T).\Phi:A\longrightarrow\mathbb C[T],\qquad \Phi(t)=T,\quad\Phi(x_i)=r_i(T).Φ:A⟶C[T],Φ(t)=T,Φ(xi​)=ri​(T).

Let M∈C[T]M\in\mathbb C[T]M∈C[T] be nonzero and let I⊆AI\subseteq AI⊆A be an ideal satisfying, for every f∈Af\in Af∈A,

f∈I⟺M∣Φ(f).f\in I\quad\Longleftrightarrow\quad M\mid\Phi(f).f∈I⟺M∣Φ(f).

For any p∈Ap\in Ap∈A, set q=Φ(p)q=\Phi(p)q=Φ(p), g=gcd⁡(M,q)g=\gcd(M,q)g=gcd(M,q) and G=M/gG=M/gG=M/g. The quotient is exact because ggg divides MMM. Define the residual ideal

R=I:p={f∈A:fp∈I}.R=I:p=\{f\in A:fp\in I\}.R=I:p={f∈A:fp∈I}.

Then

f∈R⟺G∣Φ(f)(f∈A),f\in R\quad\Longleftrightarrow\quad G\mid\Phi(f)\qquad(f\in A),f∈R⟺G∣Φ(f)(f∈A),

and there is an isomorphism of complex algebras

A/R≅CC[T]/(G).A/R\cong_{\mathbb C}\mathbb C[T]/(G).A/R≅C​C[T]/(G).

The quotient is finite dimensional, with

dim⁡C(A/R)=deg⁡G,dim⁡C(A/R)+deg⁡g=deg⁡M.\dim_{\mathbb C}(A/R)=\deg G,\qquad \dim_{\mathbb C}(A/R)+\deg g=\deg M.dimC​(A/R)=degG,dimC​(A/R)+degg=degM.

This computes the residual ideal for a finite scheme given by a time-polynomial presentation. Together with the usual intersection model A/(I+(p))≅C[T]/(g)A/(I+(p))\cong\mathbb C[T]/(g)A/(I+(p))≅C[T]/(g), the last identity states that the residual and intersection lengths add to the original length.

Formalization Note No contact, lattice, smoothness or monicity hypothesis is imposed. The exact membership presentation and M≠0M\ne0M=0 are the hypotheses. The gcd is Mathlib's normalized polynomial gcd and / is polynomial Euclidean division. The proof establishes g≠0g\ne0g=0 and G≠0G\ne0G=0, so the displayed degrees agree with the formal natural degrees. The zero polynomial ppp, the case q=0q=0q=0, and nonzero constant MMM are included. The algebra isomorphism is asserted to exist; its coordinate action is not part of the formal conclusion. The result supplies residual algebra and length data without a global degree or algebraic-group estimate.

Preamble
import Mathlib.Algebra.MvPolynomial.Eval
import Mathlib.Algebra.Polynomial.AlgebraMap
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.AdjoinRoot
import Mathlib.RingTheory.PrincipalIdealDomain
import Mathlib.RingTheory.Ideal.Quotient.Operations
import Mathlib.RingTheory.Ideal.Colon

open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.triangular_residual_quotient_length
    (I : Ideal (MvPolynomial (Fin 4) ℂ)) (M : Polynomial ℂ)
    (r : Fin 3 → Polynomial ℂ) (hM : M ≠ 0)
    (hI : ∀ f : MvPolynomial (Fin 4) ℂ,
      f ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) :
    ∀ p : MvPolynomial (Fin 4) ℂ,
      let q := MvPolynomial.aeval (Fin.cons Polynomial.X r) p
      let G := M / gcd M q
      let J := I.colon {p}
      (∀ f : MvPolynomial (Fin 4) ℂ,
        f ∈ J ↔ G ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) ∧
      Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ J) ≃ₐ[ℂ]
        (Polynomial ℂ ⧸ Ideal.span {G})) ∧
      FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
      Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = G.natDegree ∧
      Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) + (gcd M q).natDegree = M.natDegree := by sorry
Source
Derived residual-ideal calculation for the finite-intersection algebra used in the approach associated with Senthil Kumar K (2026), Appendix A, https://doi.org/10.1017/S001309152610145X. This exact algebra statement is proved here rather than quoted from the article. Bezout identity for the normalized gcd shows M divides f*q iff M/gcd(M,q) divides f. A surjective time substitution and the first isomorphism theorem give the quotient algebra, whose power basis gives its length. Primary formal references: exists_gcd_eq_mul_add_mul, EuclideanDomain exact division, mul_dvd_mul_iff_right, Ideal.quotientKerAlgEquivOfSurjective, AdjoinRoot.powerBasis, finrank_quotient_span_eq_natDegree and Polynomial.natDegree_mul.

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