Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Ramanujan–Petersson for cusp forms of weight 111 (Deligne–Serre 1974)

Open
RamanujanPetersson.petersson_weight_one

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

modular-formsnumber-theory

Let Γ⊆SL(2,Z)\Gamma\subseteq SL(2,\mathbb Z)Γ⊆SL(2,Z) be a congruence subgroup and let fff be a holomorphic cusp form of weight 111 for Γ\GammaΓ. Let h>0h>0h>0 be the width of the cusp ∞\infty∞ for Γ\GammaΓ and write f(z)=∑n≥0ane2πinz/hf(z)=\sum_{n\ge0}a_n e^{2\pi i n z/h}f(z)=∑n≥0​an​e2πinz/h. Then for every ε>0\varepsilon>0ε>0,

an=Oε ⁣(nε),a_n=O_\varepsilon\!\left(n^{\varepsilon}\right),an​=Oε​(nε),

which is the bound n(k−1)/2+εn^{(k-1)/2+\varepsilon}n(k−1)/2+ε for k=1k=1k=1.

This weight-one case is due to Deligne and Serre.

Formalization Note Same conventions as the weight k≥2k\ge2k≥2 milestone: Mathlib CuspForm for the image of Γ\GammaΓ in GL(2,R)GL(2,\mathbb R)GL(2,R), coefficients from qExpansion with period strictWidthInfty.

Preamble
import Mathlib

open UpperHalfPlane Filter Asymptotics MatrixGroups
Formal statement
namespace RamanujanPetersson

theorem petersson_weight_one (Γ : Subgroup SL(2, ℤ))
    (hΓ : CongruenceSubgroup.IsCongruenceSubgroup Γ)
    (f : CuspForm (Γ : Subgroup (GL (Fin 2) ℝ)) 1) (ε : ℝ) (hε : 0 < ε) :
    (fun n : ℕ => (qExpansion (Γ : Subgroup (GL (Fin 2) ℝ)).strictWidthInfty f).coeff n)
      =O[atTop] fun n : ℕ => (n : ℝ) ^ ε := by sorry

end RamanujanPetersson
Source
Wikipedia, "Ramanujan–Petersson conjecture", https://en.wikipedia.org/w/index.php?title=Ramanujan%E2%80%93Petersson_conjecture&oldid=1369029052 (PDF snapshot supplied by the proposer, 9 pp.), section "Ramanujan–Petersson conjecture for modular forms": "This is also true for the case k=1k=1k=1, where it is a result of Deligne & Serre (1974)"
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me