Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite quotients and support primes in the first Weierstrass cubic chart

Definition
WeierstrassEllipticZeta_ChartQuotientMultiplicity

by tomasz · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrynumber-theory

For a period pair LLL, let

R=C[t,x,y,u],FL=y2−4x3+g2x+g3.R=\mathbb C[t,x,y,u],\qquad F_L=y^2-4x^3+g_2x+g_3.R=C[t,x,y,u],FL​=y2−4x3+g2​x+g3​.

Given an indexing set YYY, chart quotient multiplicity data consist of an ideal I⊆RI\subseteq RI⊆R containing FLF_LFL​, finite-dimensionality of R/IR/IR/I over C\mathbb CC, and an injective assignment of prime ideals

p:Y⟶Spec⁡(R),I⊆p(c)(c∈Y).p:Y\longrightarrow\operatorname{Spec}(R),\qquad I\subseteq p(c)\quad(c\in Y).p:Y⟶Spec(R),I⊆p(c)(c∈Y).

Its local multiplicity at an index ccc is

ec=ℓRp(c)(Rp(c)/IRp(c)).e_c=\ell_{R_{p(c)}}\bigl(R_{p(c)}/IR_{p(c)}\bigr).ec​=ℓRp(c)​​(Rp(c)​/IRp(c)​).

This records a finite quotient of the first cubic chart, with distinct support primes. It does not select the ideal or support from an analytic vanishing hypothesis, and does not impose a section-degree bound or a comparison with derivative ideals. Those are separate obligations in an application.

Formalization Note The local multiplicity is the natural-number conversion of the extended natural module length. Finiteness is a conclusion of the accompanying quotient-model theorem. The definition permits an empty indexing set and the unit ideal; if the indexing set is nonempty, prime containment excludes the unit ideal.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_FirstCubicChartBase
import Mathlib.RingTheory.Length
import Mathlib.RingTheory.Spectrum.Prime.Noetherian

noncomputable section

namespace WeierstrassEllipticZeta

/-- Finite quotient and distinct support primes in the first cubic chart.
The ideal, support, and finite-dimensionality must be constructed in applications. -/
structure ChartQuotientMultiplicityData (L : PeriodPair) (ι : Type) where
  ideal : Ideal (MvPolynomial (Fin 4) ℂ)
  cubic_mem : extensionChartCubic L.g₂ L.g₃ 0 ∈ ideal
  [finite : Module.Finite ℂ (MvPolynomial (Fin 4) ℂ ⧸ ideal)]
  point : ι → PrimeSpectrum (MvPolynomial (Fin 4) ℂ)
  point_injective : Function.Injective point
  ideal_le : ∀ i, ideal ≤ (point i).asIdeal

attribute [instance] ChartQuotientMultiplicityData.finite

/-- Length of the chosen quotient at a support prime of the chart ring. -/
def ChartQuotientMultiplicityData.localLength {L : PeriodPair} {ι : Type}
    (J : ChartQuotientMultiplicityData L ι) (i : ι) : ℕ :=
  (Module.length (Localization.AtPrime (J.point i).asIdeal)
    ((Localization.AtPrime (J.point i).asIdeal) ⧸ J.ideal.map
      (algebraMap (MvPolynomial (Fin 4) ℂ) (Localization.AtPrime (J.point i).asIdeal)))).toNat

end WeierstrassEllipticZeta
Source
Stacks Project, Proposition 10.9.14 (tag 00CT), https://stacks.math.columbia.edu/tag/00CT: localization commutes with quotient; Lemma 10.52.3 (tag 00IV), https://stacks.math.columbia.edu/tag/00IV: length additivity; the quotient ideal correspondence preserves submodule lattices and module length under surjective scalar restriction. Given a finite complex quotient R/I and distinct support primes p_i containing I, the complete theorem constructs the finite algebra model A=R/I, preserves finrank exactly, and identifies each localization length with length over R_(p_i) of R_(p_i)/IR_(p_i). The new geometric child specializes R to C[t,x,y,u], requires I to contain the first Weierstrass cubic, and retains the chart-budget and uniform section-dimension obligations. It is a sufficient first-chart finite-quotient route, not a formalized converse or a claim that slicing has been constructed. Multiplicities in the source zero-estimate framework: Philippon (1986), section 3, Lemma 3.2, p. 364, https://www.numdam.org/item/10.24033/bsmf.2060.pdf. Application: Senthil Kumar K (2026), Appendix A, Theorem A.2, https://doi.org/10.1017/S001309152610145X.

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