Prime-power recursion for (Mordell 1917)
OpenRamanujanPetersson.tau_prime_power_recursionmodular-formsnumber-theory
Ramanujan's tau function is not completely multiplicative, i.e. there exist natural numbers with . Moreover, for every prime and every integer ,
This is the second of Ramanujan's 1916 conjectures, proved by Mordell in 1917. It is what makes each Euler factor of the reciprocal of a quadratic polynomial in .
Formalization Note is RamanujanPetersson.tau, the -th coefficient of Mathlib's -expansion (period ) of ModularForm.discriminant, valued in . The range is copied from the source. The classical recursion also holds for , 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 RamanujanPeterssonSource
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 (" is not completely multiplicative, but has the following recursive dependence for prime and "); proved by Mordell (1917)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.