Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Prime-power recursion for τ\tauτ (Mordell 1917)

Open
RamanujanPetersson.tau_prime_power_recursion

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

modular-formsnumber-theory

Ramanujan's tau function is not completely multiplicative, i.e. there exist natural numbers m,nm,nm,n with τ(mn)≠τ(m)τ(n)\tau(mn)\neq\tau(m)\tau(n)τ(mn)=τ(m)τ(n). Moreover, for every prime ppp and every integer j≥2j\ge 2j≥2,

τ(pj+1)=τ(p) τ(pj)−p11 τ(pj−1).\tau(p^{j+1})=\tau(p)\,\tau(p^j)-p^{11}\,\tau(p^{j-1}).τ(pj+1)=τ(p)τ(pj)−p11τ(pj−1).

This is the second of Ramanujan's 1916 conjectures, proved by Mordell in 1917. It is what makes each Euler factor of L(s,τ)L(s,\tau)L(s,τ) the reciprocal of a quadratic polynomial in p−sp^{-s}p−s.

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. The range j≥2j\ge2j≥2 is copied from the source. The classical recursion also holds for j=1j=1j=1, but that case is not part of this statement.

Preamble
import Mathlib
import Definitions.Def_RamanujanPetersson_tau

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

theorem tau_prime_power_recursion :
    (∃ m n : ℕ, tau (m * n) ≠ tau m * tau n) ∧
    ∀ p : ℕ, p.Prime → ∀ j : ℕ, 2 ≤ j →
      tau (p ^ (j + 1)) = tau p * tau (p ^ j) - (p : ℂ) ^ 11 * tau (p ^ (j - 1)) := 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 2 ("τ\tauτ is not completely multiplicative, but has the following recursive dependence for prime ppp and j≥2j\ge2j≥2"); proved by Mordell (1917)
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