Residual quotient algebra and length in a time-polynomial presentation
ProvedWeierstrassEllipticZeta.triangular_residual_quotient_lengthLet , choose , and let
Let be nonzero and let be an ideal satisfying, for every ,
For any , set , and . The quotient is exact because divides . Define the residual ideal
Then
and there is an isomorphism of complex algebras
The quotient is finite dimensional, with
This computes the residual ideal for a finite scheme given by a time-polynomial presentation. Together with the usual intersection model , 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 are the hypotheses. The gcd is Mathlib's normalized polynomial gcd and / is polynomial Euclidean division. The proof establishes and , so the displayed degrees agree with the formal natural degrees. The zero polynomial , the case , and nonzero constant 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.
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
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