Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Existence and uniqueness of the ordinary p-root

Proved
MTT.ordinary_root_exists_unique

by davidloeffler · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

modular-formsnumber-theoryp-adic-l-functions

If the p-th eigenvalue is a p-adic unit, the polynomial X²−a_p X+ε(p)p^(k−1) has exactly one root of p-adic norm one. Characters and coefficients are transported through the fixed algebraic-to-p-adic embedding. This includes p dividing the level, where the constant term vanishes.

Preamble
import Definitions.Def_MTT_Measures

set_option autoImplicit false
noncomputable section
open scoped BigOperators
Formal statement
open MTT in
theorem MTT.ordinary_root_exists_unique
    {p N k : ℕ} [Fact p.Prime] (hN : 0 < N) (hk : 2 ≤ k)
    (ι : Qbar →+* ℂ) (ιp : Qbar →+* ℂ_[p]) (f : Eigenform N k ι)
    (hord : ‖ιp (f.coeff p)‖ = 1) :
    ∃! α : ℂ_[p], IsOrdinaryRoot f ιp α := by sorry
Source
Mazur–Tate–Teitelbaum, On p-adic analogues of the conjectures of Birch and Swinnerton-Dyer, Invent. Math. 84 (1986), https://doi.org/10.1007/BF01388731; Chapter I, §12, p. 16, ordinary case; polynomial (10.1), p. 12.
Read-back

What the Lean code literally says, in plain math · GPT-6 (Codex)

For every prime natural number ppp, every positive natural number NNN, every natural number k≥2k\ge 2k≥2, and every pair of unital ring homomorphisms ι:Q‾→C\iota:\overline{\mathbb Q}\to\mathbb Cι:Q​→C and ιp:Q‾→Cp\iota_p:\overline{\mathbb Q}\to\mathbb C_pιp​:Q​→Cp​, where Q‾\overline{\mathbb Q}Q​ is the algebraic closure of Q\mathbb QQ and Cp\mathbb C_pCp​ is the completed algebraic closure of Qp\mathbb Q_pQp​, let fff consist of a complex cusp form FFF of weight kkk for Γ1(N)\Gamma_1(N)Γ1​(N) (viewed in GL2(R)\mathrm{GL}_2(\mathbb R)GL2​(R)), a Dirichlet character ε\varepsilonε modulo NNN with values in Q‾\overline{\mathbb Q}Q​, and coefficients an∈Q‾a_n\in\overline{\mathbb Q}an​∈Q​ for every natural number nnn, such that the coefficient of degree nnn of the width-one qqq-expansion of FFF is ι(an)\iota(a_n)ι(an​), a1=1a_1=1a1​=1, and, for every γ=(abcd)∈Γ0(N)\gamma=\begin{pmatrix}a&b\\c&d\end{pmatrix}\in\Gamma_0(N)γ=(ac​bd​)∈Γ0​(N) and every zzz in the complex upper half-plane, F(γz)=ι(ε(d mod N))(cz+d)kF(z)F(\gamma z)=\iota(\varepsilon(d\bmod N))(cz+d)^kF(z)F(γz)=ι(ε(dmodN))(cz+d)kF(z); further require, for every prime natural number ℓ\ellℓ and every such zzz, the identity ℓ−1∑b=0ℓ−1F((z+b)/ℓ)+ι(ε(ℓ mod N))ℓk−1F(ℓz)=ι(aℓ)F(z)\ell^{-1}\sum_{b=0}^{\ell-1}F((z+b)/\ell)+\iota(\varepsilon(\ell\bmod N))\ell^{k-1}F(\ell z)=\iota(a_\ell)F(z)ℓ−1∑b=0ℓ−1​F((z+b)/ℓ)+ι(ε(ℓmodN))ℓk−1F(ℓz)=ι(aℓ​)F(z). If ∥ιp(ap)∥=1\|\iota_p(a_p)\|=1∥ιp​(ap​)∥=1, then there exists exactly one α∈Cp\alpha\in\mathbb C_pα∈Cp​ satisfying both ∥α∥=1\|\alpha\|=1∥α∥=1 and α2−ιp(ap)α+ιp(ε(p mod N))pk−1=0\alpha^2-\iota_p(a_p)\alpha+\iota_p(\varepsilon(p\bmod N))p^{k-1}=0α2−ιp​(ap​)α+ιp​(ε(pmodN))pk−1=0, where the norms are the ppp-adic norms on Cp\mathbb C_pCp​ and ppp in the polynomial is its natural image there. Uniqueness is among roots of norm one, rather than among all polynomial roots. The quantifiers include N=1N=1N=1, k=2k=2k=2, p=2p=2p=2, and primes dividing NNN; the character is evaluated with its extension by zero on nonunits, so when p∣Np\mid Np∣N the constant term is zero. No coprimality of ppp and NNN, primitivity of the character, or compatibility between the two homomorphisms beyond their common domain is assumed. The hypotheses exclude N=0N=0N=0 and k<2k<2k<2, so the natural-number subtraction k−1k-1k−1 is the usual positive integer subtraction here.

Human review
  • Endorsed by Shuze Chen · Sep 5, 2026

  • Endorsed by davidloeffler · Sep 5, 2026

    Confirmed by the mission captain (proposal self-audit).

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me