Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Analytic orbit data for transverse component multiplicities

Definition
TranscendenceTheory_AnalyticOrbitMultiplicityData

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

algebraic-geometrynumber-theory

For natural numbers T,eT,eT,e, AnalyticOrbitMultiplicityData T e consists of a commutative Noetherian Q\mathbb QQ-algebra RRR, ideals I,pI,\mathfrak pI,p with p\mathfrak pp a minimal prime over III, and a Q\mathbb QQ-derivation DDD of RRR.

It also supplies an algebra homomorphism Φ:R→(C→C)\Phi:R\to (\mathbb C\to\mathbb C)Φ:R→(C→C) and a point z0∈Cz_0\in\mathbb Cz0​∈C. Multiplication and addition in the target are pointwise. For every r∈Rr\in Rr∈R, the germs of Φ(Dr)\Phi(Dr)Φ(Dr) and (Φr)′(\Phi r)'(Φr)′ at z0z_0z0​ agree. Every element of p\mathfrak pp evaluates to zero at z0z_0z0​.

There is an element f∈pf\in\mathfrak pf∈p such that Φf\Phi fΦf is analytic at z0z_0z0​ and has finite analytic order there, equivalently an analytic germ which is not identically zero near z0z_0z0​. No transverse equation q∈pq\in\mathfrak pq∈p with Dq∉pDq\notin\mathfrak pDq∈/p is included in the data.

Finally, the data satisfy

Djg∈p(g∈I, 0≤j≤T),length⁡Rp(Rp/IRp)≤e.D^j g\in\mathfrak p\quad(g\in I,\ 0\le j\le T), \qquad \operatorname{length}_{R_{\mathfrak p}}(R_{\mathfrak p}/IR_{\mathfrak p})\le e.Djg∈p(g∈I, 0≤j≤T),lengthRp​​(Rp​/IRp​)≤e.

Formalization Note. The analytic transversality theorem constructs the missing transverse equation from these data. This is an explicit sufficient analytic-coordinate route. No converse for arbitrary abstract minimal-prime witnesses is asserted. Constructing these data from the Weierstrass geometric hypotheses, and bounding the sum of the local lengths by the bidegrees, remain obligations of the Open child theorem.

Definition code
import Definitions.Def_TranscendenceTheory_MinimalPrimeMultiplicityData
import Mathlib.Analysis.Analytic.Order
import Mathlib.Analysis.Complex.Basic

open scoped Topology

noncomputable section
namespace TranscendenceTheory

/-- Minimal-prime multiplicity data with an analytic orbit through the prime.
The transverse equation is not supplied: it is constructed by the first
derivative iterate that leaves the prime. -/
structure AnalyticOrbitMultiplicityData (T e : ℕ) where
  R : Type
  [commRing : CommRing R]
  [algebra : Algebra ℚ R]
  [noetherian : IsNoetherianRing R]
  I : Ideal R
  p : Ideal R
  [prime : p.IsPrime]
  minimal : p ∈ I.minimalPrimes
  D : Derivation ℚ R R
  φ : R →ₐ[ℚ] (ℂ → ℂ)
  z : ℂ
  deriv_compat : ∀ r, φ (D r) =ᶠ[𝓝 z] deriv (φ r)
  point_on_prime : ∀ r ∈ p, φ r z = 0
  f : R
  f_mem : f ∈ p
  analytic : AnalyticAt ℂ (φ f) z
  nonzero_germ : analyticOrderAt (φ f) z ≠ ⊤
  jets : ∀ f ∈ I, ∀ k ≤ T, (D^[k]) f ∈ p
  length_le : Module.length (Localization.AtPrime p)
    ((Localization.AtPrime p) ⧸ I.map
      (algebraMap R (Localization.AtPrime p))) ≤ (e : ℕ∞)

attribute [instance] AnalyticOrbitMultiplicityData.commRing AnalyticOrbitMultiplicityData.algebra
  AnalyticOrbitMultiplicityData.noetherian AnalyticOrbitMultiplicityData.prime

end TranscendenceTheory
Source
Philippon (1986), Lemmes de zeros dans les groupes algebriques commutatifs, Bull. Soc. Math. France 114, 355-383, Lemma 4.6, p. 378, and Proposition 4.7, pp. 378-379. 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. One-direction analytic auxiliary criterion for the transverse equation: a nonzero analytic germ on an orbit through the prime yields a first derivative leaving it. This is not the full tangent-rank assertion of Lemma 4.6. Taylor-order characterization: Mathlib 0df444a360eaa60ab8c11dca51a86af692955474, Analysis/Analytic/Order.lean, analyticOrderAt_eq_nat_iff_iteratedDeriv_eq_zero. Geometric orbit and prime selection and the total 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