Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prime Hecke recurrences determine a coefficient sequence from its first term

Proved
MTT.coeff_eq_of_hecke_recurrence

by cbirkbeck · Sep 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

hecke-operatorsmodular-formsnumber-theory

Fix k≥0k\ge0k≥0 and two functions e,a:N→Ce,a:\mathbf N\to\mathbf Ce,a:N→C (only their values at primes matter; in applications ep=ε(p)e_p=\varepsilon(p)ep​=ε(p) and apa_pap​ is the ppp-th Hecke eigenvalue). Say that a sequence (bm)m≥0(b_m)_{m\ge0}(bm​)m≥0​ of complex numbers satisfies the prime Hecke recurrences with data (e,a)(e,a)(e,a) if for every prime ppp and every m≥0m\ge0m≥0

bpm+ep pk−1 [p∣m] bm/p=ap bm.b_{pm}+e_p\,p^{k-1}\,[p\mid m]\,b_{m/p}=a_p\,b_m .bpm​+ep​pk−1[p∣m]bm/p​=ap​bm​.

These are exactly the relations satisfied by the Fourier coefficients of a TpT_pTp​-eigenform with eigenvalue apa_pap​ and nebentypus ε\varepsilonε (Diamond–Shurman, Proposition 5.8.5), by the qqq-expansion formula for TpT_pTp​.

Claim. If (bm)(b_m)(bm​) and (cm)(c_m)(cm​) both satisfy the prime Hecke recurrences with the same data (e,a)(e,a)(e,a), and c1=1c_1=1c1​=1, then

bm=b1 cmfor all m≥1.b_m=b_1\,c_m\qquad\text{for all } m\ge1 .bm​=b1​cm​for all m≥1.

Proof. Strong induction on mmm. For m=1m=1m=1 this is c1=1c_1=1c1​=1. For m≥2m\ge2m≥2 choose a prime p∣mp\mid mp∣m and write m=pm′m=pm'm=pm′ with 1≤m′<m1\le m'<m1≤m′<m. The recurrence at m′m'm′ gives

bpm′=ap bm′−ep pk−1[p∣m′] bm′/p,b_{pm'}=a_p\,b_{m'}-e_p\,p^{k-1}[p\mid m']\,b_{m'/p},bpm′​=ap​bm′​−ep​pk−1[p∣m′]bm′/p​,

and likewise for ccc; both m′m'm′ and m′/pm'/pm′/p are smaller than mmm and positive, so the inductive hypothesis substitutes bm′=b1cm′b_{m'}=b_1c_{m'}bm′​=b1​cm′​ and bm′/p=b1cm′/pb_{m'/p}=b_1c_{m'/p}bm′/p​=b1​cm′/p​, giving bpm′=b1cpm′b_{pm'}=b_1c_{pm'}bpm′​=b1​cpm′​. □\square□

This is the uniqueness half of the statement that a normalised eigenform is determined by its Hecke eigenvalues: applied with cm=am(f)c_m=a_m(f)cm​=am​(f) for a normalised eigenform fff and bm=am(g)b_m=a_m(g)bm​=am​(g) for a cusp form ggg with the same eigenvalues at every prime, it gives am(g)=a1(g) am(f)a_m(g)=a_1(g)\,a_m(f)am​(g)=a1​(g)am​(f) for m≥1m\ge1m≥1. In Lean, [p∣m] bm/p[p\mid m]\,b_{m/p}[p∣m]bm/p​ is if p ∣ m then b (m / p) else 0 with natural-number division.

Preamble
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Data.Complex.Basic
import Mathlib.Tactic.Linarith
set_option autoImplicit false
Formal statement
theorem MTT.coeff_eq_of_hecke_recurrence (k : ℕ) (e a b c : ℕ → ℂ)
    (hb : ∀ p : ℕ, p.Prime → ∀ m : ℕ,
      b (p * m) + e p * (p : ℂ) ^ (k - 1) * (if p ∣ m then b (m / p) else 0) = a p * b m)
    (hc : ∀ p : ℕ, p.Prime → ∀ m : ℕ,
      c (p * m) + e p * (p : ℂ) ^ (k - 1) * (if p ∣ m then c (m / p) else 0) = a p * c m)
    (hc1 : c 1 = 1) :
    ∀ m : ℕ, 0 < m → b m = b 1 * c m := by sorry
Source
Diamond–Shurman, A First Course in Modular Forms (GTM 228), §5.8, Proposition 5.8.5 (coefficient relations of a normalised eigenform) and the surrounding discussion of uniqueness (pp. 199–200); C. Williams, An introduction to p-adic L-functions II: modular forms, Theorem 9.10.

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