Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform boundedness of ordinary disk masses

Proved
MTT.ordinary_disk_bound

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

modular-formsnumber-theoryp-adic-l-functions

For a fixed ordinary form, period system, and unit root, there is one nonnegative real constant bounding the p-adic norm of every signed constant disk mass, uniformly over all positive depths and all integer centers. The finite integral lattice and the unit-root hypothesis are retained explicitly.

Preamble
import Definitions.Def_MTT_Measures

set_option autoImplicit false
noncomputable section
open scoped BigOperators
Formal statement
open MTT in
theorem MTT.ordinary_disk_bound
    {p N k : ℕ} [Fact p.Prime] (hN : 0 < N) (hk : 2 ≤ k)
    (ι : Qbar →+* ℂ) (ιp : Qbar →+* ℂ_[p]) (f : Eigenform N k ι)
    (P : Periods k ι f.form) (α : ℂ_[p]) (hα : IsOrdinaryRoot f ιp α) :
    ∃ C : ℝ, 0 ≤ C ∧ ∀ (s : Bool) (n : ℕ), 0 < n → ∀ (a : ℤ),
      ‖diskMoment f ιp P α s 0 n a‖ ≤ C := 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, §11, axiom III at polynomial degree zero, pp. 13–15, specialized to ord_p(α)=0; §2 finite generation, pp. 6–7, and (10.2).
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, the following holds. Suppose fff is a weight-kkk cusp form for Γ1(N)\Gamma_1(N)Γ1​(N) (viewed as a subgroup of GL2(R)\mathrm{GL}_2(\mathbb R)GL2​(R)), supplied with a Dirichlet character ϵ:Z/NZ→Q‾\epsilon:\mathbb Z/N\mathbb Z\to\overline{\mathbb Q}ϵ:Z/NZ→Q​ and coefficients cn∈Q‾c_n\in\overline{\mathbb Q}cn​∈Q​ for every natural number nnn, such that its width-one qqq-expansion has coefficient ι(cn)\iota(c_n)ι(cn​) for every nnn, c1=1c_1=1c1​=1, and, for every γ=(abcd)∈Γ0(N)\gamma=\left(\begin{smallmatrix}a&b\\c&d\end{smallmatrix}\right)\in\Gamma_0(N)γ=(ac​bd​)∈Γ0​(N) and every upper-half-plane point zzz, f(γz)=ι(ϵ(d))(cz+d)kf(z)f(\gamma z)=\iota(\epsilon(d))(cz+d)^k f(z)f(γz)=ι(ϵ(d))(cz+d)kf(z). Suppose also that, for every prime natural number ℓ\ellℓ and every such zzz, ℓ−1∑b=0ℓ−1f((z+b)/ℓ)+ι(ϵ(ℓ))ℓk−1f(ℓz)=ι(cℓ)f(z)\ell^{-1}\sum_{b=0}^{\ell-1}f((z+b)/\ell)+\iota(\epsilon(\ell))\ell^{k-1}f(\ell z)=\iota(c_\ell)f(z)ℓ−1∑b=0ℓ−1​f((z+b)/ℓ)+ι(ϵ(ℓ))ℓk−1f(ℓz)=ι(cℓ​)f(z), with integers passed to their residue classes when evaluating the character. Let a period system consist of nonzero complex numbers ωs\omega_sωs​ for both Boolean values sss, and algebraic numbers vs,j(r)v_{s,j}(r)vs,j​(r) for every Boolean sss, every natural number jjj, and every rational rrr. Define σtrue=1\sigma_{\mathrm{true}}=1σtrue​=1, σfalse=−1\sigma_{\mathrm{false}}=-1σfalse​=−1, and Ij(r)=2π∫0∞f(r+it)(r+it)j dtI_j(r)=2\pi\int_{0}^{\infty}f(r+it)(r+it)^j\,dtIj​(r)=2π∫0∞​f(r+it)(r+it)jdt, with the integral interpreted as the complex Bochner integral over the positive real numbers (whose total definition returns zero if it is not integrable). Require ι(vs,j(r))=(Ij(r)+σs(−1)jIj(−r))/(2ωs)\iota(v_{s,j}(r))=(I_j(r)+\sigma_s(-1)^jI_j(-r))/(2\omega_s)ι(vs,j​(r))=(Ij​(r)+σs​(−1)jIj​(−r))/(2ωs​) for every s,rs,rs,r and 0≤j≤k−20\le j\le k-20≤j≤k−2, and require the Z\mathbb ZZ-submodule of Q‾\overline{\mathbb Q}Q​ generated by all these vs,j(r)v_{s,j}(r)vs,j​(r) with j≤k−2j\le k-2j≤k−2 to be finitely generated; no corresponding comparison or finite-generation requirement is imposed on values with j>k−2j>k-2j>k−2. For every α∈Cp\alpha\in\mathbb C_pα∈Cp​ satisfying ∥α∥=1\lVert\alpha\rVert=1∥α∥=1 and α2−ιp(cp)α+ιp(ϵ(p))pk−1=0\alpha^2-\iota_p(c_p)\alpha+\iota_p(\epsilon(p))p^{k-1}=0α2−ιp​(cp​)α+ιp​(ϵ(p))pk−1=0, there exists a real number C≥0C\ge0C≥0 such that, for both Boolean values sss, every positive natural number nnn, and every integer aaa,

∥α−nιp ⁣(vs,0 ⁣(−apn))−ιp(ϵ(p))pk−2αn+1ιp ⁣(vs,0 ⁣(−apn−1))∥≤C.\left\lVert\alpha^{-n}\iota_p\!\left(v_{s,0}\!\left(-\frac{a}{p^n}\right)\right)-\frac{\iota_p(\epsilon(p))p^{k-2}}{\alpha^{n+1}}\iota_p\!\left(v_{s,0}\!\left(-\frac{a}{p^{n-1}}\right)\right)\right\rVert\le C.​α−nιp​(vs,0​(−pna​))−αn+1ιp​(ϵ(p))pk−2​ιp​(vs,0​(−pn−1a​))​≤C.

Here rational arguments are formed in Q\mathbb QQ, powers of ppp outside those arguments are interpreted in Cp\mathbb C_pCp​, and the norm is that of Cp\mathbb C_pCp​. The displayed expression is the stated disk moment at polynomial degree zero: its defining algebraic-symbol sum reduces to the single term vs,0(−a/m)v_{s,0}(-a/m)vs,0​(−a/m). The bound is simultaneous in s,n,as,n,as,n,a and may depend on all the initially supplied data. It includes a=0a=0a=0, negative aaa, and integers divisible by ppp, without any coprimality or choice-of-residue-representative restriction. It includes N=1N=1N=1, k=2k=2k=2, and ppp dividing NNN; for k=2k=2k=2 the factor pk−2p^{k-2}pk−2 is 111, and for n=1n=1n=1 the second rational argument is −a-a−a. Depth n=0n=0n=0 is excluded, so the natural-number subtraction n−1n-1n−1 does not truncate below zero; likewise k−2k-2k−2 and k−1k-1k−1 do not truncate below zero. The norm-one condition implies α≠0\alpha\ne0α=0, and primality implies p≠0p\ne0p=0, so the displayed denominators are nonzero. The assertion is conditional on the existence of the specified eigenform, period system, and root and does not itself assert their existence.

Read-back model: GPT-6 (Codex).

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