Ramanujan tau function explained

The Ramanujan tau function, studied by, is the function

\tau : N \rarr Z defined by the following identity:\sum _{n\geq} \tau(n)q ^{n = q\prod} _{n\geq 1} \left( 1- q ^{n\right)} ^{24} = q\phi(q) ^{24} = η (z) ^{24} = \Delta(z), where with, \phi is the Euler function, is the Dedekind eta function, and the function is a holomorphic cusp form of weight 12 and level 1, known as the discriminant modular form (some authors, notably Apostol, write \Delta/( 2 \pi) ^{12} instead of \Delta ). It appears in connection to an "error term" involved in counting the number of ways of expressing an integer as a sum of 24 squares. A formula due to Ian G. Macdonald was given in .

Values

The first few values of the tau function are given in the following table :

	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16
	1	−24	252	−1472	4830	−6048	−16744	84480	−113643	−115920	534612	−370944	−577738	401856	1217160	987136

Calculating this function on an odd square number (i.e. a centered octagonal number) yields an odd number, whereas for any other number the function yields an even number.^[1]

Ramanujan's conjectures

observed, but did not prove, the following three properties of :

• if (meaning that is a multiplicative function)
• for prime and .
• for all primes .

The first two properties were proved by and the third one, called the Ramanujan conjecture, was proved by Deligne in 1974 as a consequence of his proof of the Weil conjectures (specifically, he deduced it by applying them to a Kuga-Sato variety).

Congruences for the tau function

For and, the Divisor function is the sum of the th powers of the divisors of . The tau function satisfies several congruence relations; many of them can be expressed in terms of . Here are some:^[2]

\tau(n)\equiv\sigma _{11} (n) \bmod 2 ^{11} for n\equiv 1 \bmod 8 ^[3] \tau(n)\equiv 1217 \sigma _{11} (n) \bmod 2 ^{13} for n\equiv 3 \bmod 8 ^[3] \tau(n)\equiv 1537 \sigma _{11} (n) \bmod 2 ^{12} for n\equiv 5 \bmod 8 ^[3] \tau(n)\equiv 705 \sigma _{11} (n) \bmod 2 ^{14} for n\equiv 7 \bmod 8 ^[3] \tau(n)\equiv n ^{-610} \sigma _{1231} (n) \bmod 3 ^{6} for n\equiv 1 \bmod 3 ^[4] \tau(n)\equiv n ^{-610} \sigma _{1231} (n) \bmod 3 ^{7} for n\equiv 2 \bmod 3 ^[4] \tau(n)\equiv n ^{-30} \sigma _{71} (n) \bmod 5 ^{3} for n\not\equiv 0 \bmod 5 ^[5] \tau(n)\equiv n\sigma _{9} (n) \bmod 7 ^[6] \tau(n)\equiv n\sigma _{9} (n) \bmod 7 ^{2forn\equiv} 3 , 5 , 6 \bmod 7 ^[6] \tau(n)\equiv\sigma _{11} (n) \bmod 691 . ^[7]

For prime, we have^{[2] [8]}

11. \tau(p)\equiv 0 \bmod 23 \left( (p)/(23) \right) =-1
12. \tau(p)\equiv \sigma _{11} (p) \bmod 23 ^{2if} p isoftheform a ^{2+23b} ^{2} ^[9]
13. \tau(p)\equiv -1 \bmod 23 otherwise .

Explicit formula

In 1975 Douglas Niebur proved an explicit formula for the Ramanujan tau function:^[10]

\tau(n) = n ^{n -1} _{i =1} i ^{2(35i} ^{2-52in+18n} ^{2)\sigma(i)\sigma(n-i).}

where is the sum of the positive divisors of .

Conjectures on τ(n)

Suppose that is a weight- integer newform and the Fourier coefficients are integers. Consider the problem:

Given that does not have complex multiplication, do almost all primes have the property that ?Indeed, most primes should have this property, and hence they are called ordinary. Despite the big advances by Deligne and Serre on Galois representations, which determine for coprime to, it is unclear how to compute . The only theorem in this regard is Elkies' famous result for modular elliptic curves, which guarantees that there are infinitely many primes such that, which thus are congruent to 0 modulo . There are no known examples of non-CM with weight greater than 2 for which for infinitely many primes (although it should be true for almost all). There are also no known examples with for infinitely many . Some researchers had begun to doubt whether for infinitely many . As evidence, many provided Ramanujan's (case of weight 12). The only solutions up to 10¹⁰ to the equation are 2, 3, 5, 7, 2411, and .^[11]

conjectured that for all, an assertion sometimes known as Lehmer's conjecture. Lehmer verified the conjecture for up to (Apostol 1997, p. 22). The following table summarizes progress on finding successively larger values of for which this condition holds for all .

	reference
	Lehmer (1947)
	Lehmer (1949)
	Serre (1973, p. 98), Serre (1985)
	Jennings (1993)
	Jordan and Kelly (1999)
	Bosman (2007)
	Zeng and Yin (2013)
	Derickx, van Hoeij, and Zeng (2013)

Ramanujan's L-function

Ramanujan's L-function is defined by

L(s) = \sum _{n\ge} (\tau (n))/(n ^{s}) if \Re s> 6 and by analytic continuation otherwise. It satisfies the functional equation(L(s)\Gamma (s))/(= ( 2 \pi) ^{s}) (L( 12- s)\Gamma( 12- s))/(( 2 \pi) ^{12-s}) , s\notin Z ^{- ,} _{0} 12- s\notin Z ^{-} _{0} and has the Euler productL(s) = \prod _{pprime} (1)/(1- \tau (p)p ^{-s} + p ^{11-2s}) , \Re s> 7 . Ramanujan conjectured that all nontrivial zeros of L have real part equal to 6 .

Notes and References

1. Odd squares: (2n-1)^2. Also centered octagonal numbers..
2. Page 4 of
3. Due to
4. Due to
5. Due to Lahivi
6. Due to D. H. Lehmer
7. Due to
8. Due to
9. Due to J.-P. Serre 1968, Section 4.5
10. Niebur . Douglas . September 1975 . A formula for Ramanujan's $\tau$-function . Illinois Journal of Mathematics . 19 . 3 . 448–449 . 10.1215/ijm/1256050746 . 0019-2082. free .
11. N. Lygeros and O. Rozier . 2010 . A new solution for the equation \tau(p)\equiv 0 \pmod{p} . Journal of Integer Sequences . 13 . Article 10.7.4 .