Point-supported ideals in the first Weierstrass cubic chart
DefinitionWeierstrassEllipticZeta_PunctualChartIdealsFix a period pair and a label set. In the first Weierstrass chart, write
The data assign a point and an ideal to each label. The points are distinct, every ideal contains the cubic equation, and each ideal has exactly its assigned point as complex zero set:
The ideals retain their full nilpotent structure. In particular, they are not required to equal the reduced evaluation ideals. Their finite-dimensionality follows from the separately proved finite-zero-set criterion.
The local multiplicity assigned to a label is the length of its localized quotient at the evaluation ideal of the point:
The formal interface converts this extended-natural length to a natural number, just as the parent interface does. The new data contain no budget or dimension estimate; those are obligations of the geometric theorem. A finite collection can be assembled into one global chart ideal by intersection, with exact local multiplicity and total-dimension identities.
import Definitions.Def_WeierstrassEllipticZeta_FiniteChartZeroLocus
noncomputable section
namespace WeierstrassEllipticZeta
/-- An ideal supported at each of a distinctly indexed family of cubic-chart points.
These ideals retain their full nilpotent structure. -/
structure PunctualChartIdealData (L : PeriodPair) (ι : Type) where
point : ι → Fin 4 → ℂ
point_injective : Function.Injective point
ideal : ι → Ideal (MvPolynomial (Fin 4) ℂ)
cubic_mem : ∀ i, extensionChartCubic L.g₂ L.g₃ 0 ∈ ideal i
zeroLocus_eq : ∀ i, MvPolynomial.zeroLocus ℂ (ideal i) = {point i}
/-- Local length of the single-point ideal assigned to a label. -/
def PunctualChartIdealData.localLength {L : PeriodPair} {ι : Type}
(P : PunctualChartIdealData L ι) (i : ι) : ℕ :=
(Module.length (Localization.AtPrime (MvPolynomial.pointToPoint (k := ℂ) (P.point i)).asIdeal)
((Localization.AtPrime (MvPolynomial.pointToPoint (k := ℂ) (P.point i)).asIdeal) ⧸ (P.ideal i).map
(algebraMap (MvPolynomial (Fin 4) ℂ)
(Localization.AtPrime (MvPolynomial.pointToPoint (k := ℂ) (P.point i)).asIdeal)))).toNat
end WeierstrassEllipticZeta