Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Ramanujan's bound ∣τ(p)∣≤2p11/2|\tau(p)|\le 2p^{11/2}∣τ(p)∣≤2p11/2 (Deligne 1974)

Open
RamanujanPetersson.tau_prime_bound

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

modular-formsnumber-theory

For every prime ppp,

∣τ(p)∣≤2 p11/2.|\tau(p)|\le 2\,p^{11/2}.∣τ(p)∣≤2p11/2.

This is the third of Ramanujan's 1916 conjectures. It is equivalent to the statement that the polynomial 1−τ(p)u+p11u21-\tau(p)u+p^{11}u^21−τ(p)u+p11u2 has non-real or double roots, and it follows from Deligne's proof (1974) of the Riemann hypothesis for varieties over finite fields.

Formalization Note τ\tauτ is RamanujanPetersson.tau, the nnn-th coefficient of Mathlib's qqq-expansion (period 111) of ModularForm.discriminant, valued in C\mathbb CC.

Preamble
import Mathlib
import Definitions.Def_RamanujanPetersson_tau

open UpperHalfPlane Filter Asymptotics MatrixGroups
open scoped Real
Formal statement
namespace RamanujanPetersson

theorem tau_prime_bound :
    ∀ p : ℕ, p.Prime → ‖tau p‖ ≤ 2 * (p : ℝ) ^ ((11 : ℝ) / 2) := 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 conjecture", Ramanujan's conjecture 3 ("∣τ(p)∣≤2p11/2|\tau(p)|\le 2p^{11/2}∣τ(p)∣≤2p11/2 for all primes ppp"); proved via Deligne (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