Finite zero sets and labelled points in the first Weierstrass cubic chart
DefinitionWeierstrassEllipticZeta_FiniteChartZeroLocusFix a period pair and write the first chart ring as
The data consist of an ideal containing the cubic relation, a proof that its complex zero set is finite, and a distinctly labelled family of points in that zero set:
There is no assumption of finite-dimensionality of the quotient in this definition. The associated local multiplicity is the length of the original localized quotient at the evaluation ideal of the labelled point:
The interface uses the natural-number conversion of this extended-natural length. Finiteness follows from the separately proved finite-zero-set criterion and the earlier quotient-localization theorem. The ideal is retained with its full scheme multiplicity, and need not be radical. The labelled family need not exhaust the zero set. Selecting a suitable ideal and points from the analytic vanishing hypotheses, and bounding the multiplicities, remain application-specific tasks.
import Definitions.Def_WeierstrassEllipticZeta_ChartQuotientMultiplicity
import Mathlib.RingTheory.Nullstellensatz
noncomputable section
namespace WeierstrassEllipticZeta
/-- A finite zero set in the first Weierstrass chart, with distinctly labelled points.
No finite-dimensionality assumption is placed on the coordinate quotient. -/
structure FiniteChartZeroLocusData (L : PeriodPair) (ι : Type) where
ideal : Ideal (MvPolynomial (Fin 4) ℂ)
cubic_mem : extensionChartCubic L.g₂ L.g₃ 0 ∈ ideal
finite_zeroLocus : (MvPolynomial.zeroLocus ℂ ideal).Finite
point : ι → Fin 4 → ℂ
point_injective : Function.Injective point
point_mem : ∀ i, point i ∈ MvPolynomial.zeroLocus ℂ ideal
/-- The length of the full ideal at the evaluation prime of a labelled zero.
The ideal is not replaced by its radical, so nilpotent multiplicity is retained. -/
def FiniteChartZeroLocusData.localLength {L : PeriodPair} {ι : Type}
(Z : FiniteChartZeroLocusData L ι) (i : ι) : ℕ :=
(Module.length (Localization.AtPrime (MvPolynomial.pointToPoint (k := ℂ) (Z.point i)).asIdeal)
((Localization.AtPrime (MvPolynomial.pointToPoint (k := ℂ) (Z.point i)).asIdeal) ⧸ Z.ideal.map
(algebraMap (MvPolynomial (Fin 4) ℂ)
(Localization.AtPrime (MvPolynomial.pointToPoint (k := ℂ) (Z.point i)).asIdeal)))).toNat
end WeierstrassEllipticZeta