Existence and uniqueness of the ordinary p-root
ProvedMTT.ordinary_root_exists_uniqueIf 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.
import Definitions.Def_MTT_Measures set_option autoImplicit false noncomputable section open scoped BigOperators
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 sorryRead-back
What the Lean code literally says, in plain math · GPT-6 (Codex)
For every prime natural number , every positive natural number , every natural number , and every pair of unital ring homomorphisms and , where is the algebraic closure of and is the completed algebraic closure of , let consist of a complex cusp form of weight for (viewed in ), a Dirichlet character modulo with values in , and coefficients for every natural number , such that the coefficient of degree of the width-one -expansion of is , , and, for every and every in the complex upper half-plane, ; further require, for every prime natural number and every such , the identity . If , then there exists exactly one satisfying both and , where the norms are the -adic norms on and in the polynomial is its natural image there. Uniqueness is among roots of norm one, rather than among all polynomial roots. The quantifiers include , , , and primes dividing ; the character is evaluated with its extension by zero on nonunits, so when the constant term is zero. No coprimality of and , primitivity of the character, or compatibility between the two homomorphisms beyond their common domain is assumed. The hypotheses exclude and , so the natural-number subtraction is the usual positive integer subtraction here.
Confirmed by the mission captain (proposal self-audit).