Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite quotient models preserve local multiplicities exactly

Proved
TranscendenceTheory.finite_quotient_multiplicity_model

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

algebraic-geometrynumber-theory

Let RRR be a commutative complex algebra, and let III be an ideal such that R/IR/IR/I is finite-dimensional over C\mathbb CC. Let YYY be an indexing set, and let p:Y→Spec⁡(R)p:Y\to\operatorname{Spec}(R)p:Y→Spec(R) be injective with I⊆p(c)I\subseteq p(c)I⊆p(c) for every c∈Yc\in Yc∈Y.

There exists a finite complex algebra multiplicity model MMM on YYY whose algebra has dimension

dim⁡CM.A=dim⁡C(R/I),\dim_{\mathbb C}M.A=\dim_{\mathbb C}(R/I),dimC​M.A=dimC​(R/I),

and whose local multiplicity at each index is exactly

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

Every displayed localized quotient length is finite. The construction uses the algebra R/IR/IR/I and the distinct quotient primes p(c)/Ip(c)/Ip(c)/I, so it loses neither multiplicity nor dimension. No Noetherian hypothesis on RRR is required.

This connects localized ideal multiplicities in a coordinate ring to the local factors of a finite algebra. In the Weierstrass application, one must still choose a suitable ideal containing the chart cubic, compare the derivative-ideal budgets with these multiplicities, and bound the quotient dimension. Empty indexing sets and the zero quotient are included.

Formalization Note The model's multiplicities are natural numbers; the theorem proves that the original extended natural lengths are finite as well as identifying their natural-number values.

Preamble
import Definitions.Def_TranscendenceTheory_FiniteAlgebraMultiplicityModel
import Mathlib.RingTheory.Localization.Ideal
import Mathlib.RingTheory.Localization.Submodule
import Mathlib.RingTheory.Ideal.Quotient.Operations
Formal statement
theorem TranscendenceTheory.finite_quotient_multiplicity_model
    (R : Type) [CommRing R] [Algebra ℂ R] (I : Ideal R)
    [Module.Finite ℂ (R ⧸ I)] (ι : Type) (p : ι → PrimeSpectrum R)
    (hp : Function.Injective p) (hIp : ∀ i, I ≤ (p i).asIdeal) :
    ∃ M : FiniteAlgebraMultiplicityModel ι,
      Module.finrank ℂ M.A = Module.finrank ℂ (R ⧸ I) ∧
      ∀ i, M.localLength i =
        (Module.length (Localization.AtPrime (p i).asIdeal)
          ((Localization.AtPrime (p i).asIdeal) ⧸ I.map
            (algebraMap R (Localization.AtPrime (p i).asIdeal)))).toNat ∧
        Module.length (Localization.AtPrime (p i).asIdeal)
          ((Localization.AtPrime (p i).asIdeal) ⧸ I.map
            (algebraMap R (Localization.AtPrime (p i).asIdeal))) ≠ ⊤ := by sorry
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