Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Global prime-ideal data with a component length bound

Definition
TranscendenceTheory_PrimeMultiplicityData

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

algebraic-geometrynumber-theory

For nonnegative integers T,eT,eT,e, prime multiplicity data consist of a commutative Q\mathbb QQ-algebra RRR, a prime ideal p\mathfrak pp, a Q\mathbb QQ-linear derivation D:R→RD:R\to RD:R→R, an element q∈pq\in\mathfrak pq∈p with Dq∉pDq\notin\mathfrak pDq∈/p, and an ideal III satisfying

Djf∈p(f∈I, 0≤j≤T).D^j f\in\mathfrak p\qquad(f\in I,\ 0\le j\le T).Djf∈p(f∈I, 0≤j≤T).

Let ι:R→Rp\iota:R\to R_{\mathfrak p}ι:R→Rp​ be the canonical localization map. The data also include the finite local-length upper bound

length⁡Rp(Rp/IRp)≤e,IRp=ideal⁡(ι(I)).\operatorname{length}_{R_{\mathfrak p}} \bigl(R_{\mathfrak p}/I R_{\mathfrak p}\bigr)\le e, \qquad I R_{\mathfrak p}=\operatorname{ideal}(\iota(I)).lengthRp​​(Rp​/IRp​)≤e,IRp​=ideal(ι(I)).

These data specify the original ring, prime, ideal, and derivation. They do not provide a derivation on the localized ring or assume that localized elements retain the derivative containment property. Those facts are proved in the separate localization theorem.

The definition does not assert that these data exist for the mission's geometric components or that their lengths obey a uniform degree bound. Those assertions form the remaining frontier.

Definition code
import Definitions.Def_TranscendenceTheory_DifferentialMultiplicity
import Mathlib.RingTheory.Localization.AtPrime.Basic

noncomputable section
namespace TranscendenceTheory

/-- Global ideal data and an upper bound on its length at a chosen prime.
No derivation on the localization or localized jet condition is assumed. -/
structure PrimeMultiplicityData (T e : ℕ) where
  R : Type
  [commRing : CommRing R]
  [algebra : Algebra ℚ R]
  p : Ideal R
  [prime : p.IsPrime]
  D : Derivation ℚ R R
  q : R
  q_mem : q ∈ p
  deriv_not_mem : D q ∉ p
  I : Ideal R
  jets : ∀ f ∈ I, ∀ j ≤ T, (D^[j]) f ∈ p
  length_le : Module.length (Localization.AtPrime p)
    ((Localization.AtPrime p) ⧸ I.map (algebraMap R (Localization.AtPrime p))) ≤ (e : ℕ∞)

attribute [instance] PrimeMultiplicityData.commRing PrimeMultiplicityData.algebra
  PrimeMultiplicityData.prime

end TranscendenceTheory
Source
Philippon (1986), Lemmes de zeros dans les groupes algebriques commutatifs, Bull. Soc. Math. France 114, 355-383, Proposition 4.7, especially p. 379, and section 5, Lemma 5.1, pp. 380-382. https://www.numdam.org/item/10.24033/bsmf.2060.pdf. Senthil Kumar K (2026), Appendix A, Theorem A.2. https://doi.org/10.1017/S001309152610145X. Algebraic auxiliary theorem: construct the derivation on the prime localization and prove exact transfer of finite-order derivative containment. Component selection, global transversality, and the total local-length degree budget remain open.

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