Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Compatibility of polynomial disk moments under refinement

Proved
MTT.distribution_relation

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

modular-formsnumber-theoryp-adic-l-functions

For an ordinary root and any period system, each signed degree-j disk moment at positive depth n equals the sum of its p refinements at depth n+1. This holds for every integer center, both signs, and all 0 ≤ j ≤ k−2. The disk moments are defined by (10.2), with the correction term at depth n−1.

Preamble
import Definitions.Def_MTT_Measures

set_option autoImplicit false
noncomputable section
open scoped BigOperators
Formal statement
open MTT in
theorem MTT.distribution_relation
    {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 α)
    (s : Bool) (j : ℕ) (hj : j ≤ k - 2) (n : ℕ) (hn : 0 < n) (a : ℤ) :
    (∑ b ∈ Finset.range p,
      diskMoment f ιp P α s j (n + 1) (a + (b : ℤ) * (p : ℤ) ^ n)) =
      diskMoment f ιp P α s j n a := 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, §10 Proposition, p. 12, with (10.2); §4 Proposition, (4.2), p. 8.
Read-back

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

For every prime natural number ppp, positive natural number NNN, natural number k≥2k\ge 2k≥2, and 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 an algebraic closure of Q\mathbb QQ and Cp\mathbb C_pCp​ is the completed algebraic closure of Qp\mathbb Q_pQp​, suppose the following data are given. There is a weight-kkk cusp form fff for the image of Γ1(N)\Gamma_1(N)Γ1​(N) in GL2(R)\mathrm{GL}_2(\mathbb R)GL2​(R), a Dirichlet character ε\varepsilonε modulo NNN with values in Q‾\overline{\mathbb Q}Q​ (extended by zero on nonunits), and a sequence cm∈Q‾c_m\in\overline{\mathbb Q}cm​∈Q​ for m∈Nm\in\mathbb Nm∈N, such that the coefficient of degree mmm in the period-one Fourier expansion of fff is ι(cm)\iota(c_m)ι(cm​), c1=1c_1=1c1​=1, and, for every (ABCD)∈Γ0(N)\left(\begin{smallmatrix}A&B\\ C&D\end{smallmatrix}\right)\in\Gamma_0(N)(AC​BD​)∈Γ0​(N) and zzz in the upper half-plane, f((Az+B)/(Cz+D))=ι(ε(D))(Cz+D)kf(z)f((Az+B)/(Cz+D))=\iota(\varepsilon(D))(Cz+D)^k f(z)f((Az+B)/(Cz+D))=ι(ε(D))(Cz+D)kf(z). In addition, for every prime natural number ℓ\ellℓ and every such zzz, these data satisfy ℓ−1∑b=0ℓ−1f((z+b)/ℓ)+ι(ε(ℓ))ℓk−1f(ℓz)=ι(cℓ)f(z)\ell^{-1}\sum_{b=0}^{\ell-1}f((z+b)/\ell)+\iota(\varepsilon(\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). There are also two nonzero complex numbers Ωs\Omega_sΩs​, indexed by Boolean values sss, and algebraic numbers vs,t(r)v_{s,t}(r)vs,t​(r) for every Boolean sss, natural number ttt, and rational rrr, such that, whenever t≤k−2t\le k-2t≤k−2, ι(vs,t(r))=(It(r)+σs(−1)tIt(−r))/(2Ωs)\iota(v_{s,t}(r))=(I_t(r)+\sigma_s(-1)^t I_t(-r))/(2\Omega_s)ι(vs,t​(r))=(It​(r)+σs​(−1)tIt​(−r))/(2Ωs​), where σtrue=1\sigma_{\mathrm{true}}=1σtrue​=1, σfalse=−1\sigma_{\mathrm{false}}=-1σfalse​=−1, and It(r)=2π∫0∞f(r+iy)(r+iy)t dyI_t(r)=2\pi\int_0^\infty f(r+iy)(r+iy)^t\,dyIt​(r)=2π∫0∞​f(r+iy)(r+iy)tdy is the complex-valued Bochner integral with respect to real Lebesgue measure. The Z\mathbb ZZ-submodule of Q‾\overline{\mathbb Q}Q​ generated by all vs,t(r)v_{s,t}(r)vs,t​(r) with t≤k−2t\le k-2t≤k−2 is assumed finitely generated; the values with t>k−2t>k-2t>k−2 are included in the data but have no comparison or finiteness requirement. Let α∈Cp\alpha\in\mathbb C_pα∈Cp​ satisfy ∥α∥=1\lVert\alpha\rVert=1∥α∥=1 and α2−ιp(cp)α+ιp(ε(p))pk−1=0\alpha^2-\iota_p(c_p)\alpha+\iota_p(\varepsilon(p))p^{k-1}=0α2−ιp​(cp​)α+ιp​(ε(p))pk−1=0. For rational a,ma,ma,m define As,j(a,m)=∑t=0j(jt)mtaj−tvs,t(−a/m)∈Q‾A_{s,j}(a,m)=\sum_{t=0}^{j}\binom jt m^t a^{j-t}v_{s,t}(-a/m)\in\overline{\mathbb Q}As,j​(a,m)=∑t=0j​(tj​)mtaj−tvs,t​(−a/m)∈Q​, using the rational embeddings into Q‾\overline{\mathbb Q}Q​, and, for an integer aaa and a positive natural number nnn, define Ds,j(n,a)=α−nιp(As,j(a,pn))−ιp(ε(p))pk−2α−(n+1)ιp(As,j(a,pn−1))D_{s,j}(n,a)=\alpha^{-n}\iota_p(A_{s,j}(a,p^n))-\iota_p(\varepsilon(p))p^{k-2}\alpha^{-(n+1)}\iota_p(A_{s,j}(a,p^{n-1}))Ds,j​(n,a)=α−nιp​(As,j​(a,pn))−ιp​(ε(p))pk−2α−(n+1)ιp​(As,j​(a,pn−1)). Then for every Boolean sss, every natural number j≤k−2j\le k-2j≤k−2, every positive natural number nnn, and every integer aaa, the identity ∑b=0p−1Ds,j(n+1,a+bpn)=Ds,j(n,a)\sum_{b=0}^{p-1}D_{s,j}(n+1,a+bp^n)=D_{s,j}(n,a)∑b=0p−1​Ds,j​(n+1,a+bpn)=Ds,j​(n,a) holds in Cp\mathbb C_pCp​. The assertion includes j=0j=0j=0, k=2k=2k=2 (which forces j=0j=0j=0), N=1N=1N=1, n=1n=1n=1 (for which pn−1=1p^{n-1}=1pn−1=1), negative and zero aaa, and aaa divisible by ppp; there is no coprimality assumption on aaa or on p,Np,Np,N, nor any assumption that the Dirichlet character is primitive. The hypothesis ∥α∥=1\lVert\alpha\rVert=1∥α∥=1 excludes α=0\alpha=0α=0, and p≥2p\ge2p≥2 and n≥1n\ge1n≥1 ensure that all rational denominators and exponents occurring in this identity are nondegenerate. The binomial sum includes its endpoints, with zeroth powers equal to one even when a=0a=0a=0; the theorem makes no assertion at depth n=0n=0n=0.

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