Ramanujan tau function

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Values of |τ(n)| for n < 16,000 with a logarithmic scale. The blue line picks only the values of n that are multiples of 121.

The Ramanujan tau function, studied by Ramanujan (1916), is the function defined by the following identity:

where q = exp(2πiz) with Im z > 0, is the Euler function, η is the Dedekind eta function, and the function Δ(z) is a holomorphic cusp form of weight 12 and level 1, known as the discriminant modular form. 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 Dyson (1972).

Values[edit]

The first few values of the tau function are given in the following table (sequence A000594 in the OEIS):

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

Ramanujan's conjectures[edit]

Ramanujan (1916) observed, but did not prove, the following three properties of τ(n):

  • τ(mn) = τ(m)τ(n) if gcd(m,n) = 1 (meaning that τ(n) is a multiplicative function)
  • τ(pr + 1) = τ(p)τ(pr) − p11 τ(pr − 1) for p prime and r > 0.
  • |τ(p)| ≤ 2p11/2 for all primes p.

The first two properties were proved by Mordell (1917) 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[edit]

For k and n>0, define σk(n) as the sum of the kth powers of the divisors of n. The tau function satisfies several congruence relations; many of them can be expressed in terms of σk(n). Here are some:[1]

  1. [2]
  2. [2]
  3. [2]
  4. [2]
  5. [3]
  6. [3]
  7. [4]
  8. [5]
  9. [5]
  10. [6]

For p ≠ 23 prime, we have[1][7]

  1. [8]

Conjectures on τ(n)[edit]

Suppose that f is a weight-k integer newform and the Fourier coefficients a(n) are integers. Consider the problem:

Given that f does not have complex multiplication, do almost all primes p have the property that a(p) ≢ 0 (mod p)?

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 a(n) (mod p) for n coprime to p, it is unclear how to compute a(p) (mod p). The only theorem in this regard is Elkies' famous result for modular elliptic curves, which guarantees that there are infinitely many primes p such that a(p) = 0, which thus are congruent to 0 modulo p. There are no known examples of non-CM f with weight greater than 2 for which a(p) ≢ 0 (mod p) for infinitely many primes p (although it should be true for almost all p). There are also no known examples with a(p) ≡ 0 (mod p) for infinitely many p. Some researchers had begun to doubt whether a(p) ≡ 0 (mod p) for infinitely many p. As evidence, many provided Ramanujan's τ(p) (case of weight 12). The only solutions up to 1010 to the equation τ(p) ≡ 0 (mod p) are 2, 3, 5, 7, 2411, and 7758337633 (sequence A007659 in the OEIS).[9]

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

N reference
3316799 Lehmer (1947)
214928639999 Lehmer (1949)
1000000000000000 Serre (1973, p. 98), Serre (1985)
1213229187071998 Jennings (1993)
22689242781695999 Jordan and Kelly (1999)
22798241520242687999 Bosman (2007)
982149821766199295999 Zeng and Yin (2013)
816212624008487344127999 Derickx, van Hoeij, and Zeng (2013)

Notes[edit]

  1. ^ a b Page 4 of Swinnerton-Dyer 1973
  2. ^ a b c d Due to Kolberg 1962
  3. ^ a b Due to Ashworth 1968
  4. ^ Due to Lahivi
  5. ^ a b Due to D. H. Lehmer
  6. ^ Due to Ramanujan 1916
  7. ^ Due to Wilton 1930
  8. ^ Due to J.-P. Serre 1968, Section 4.5
  9. ^ N. Lygeros and O. Rozier (2010). "A new solution for the equation " (PDF). Journal of Integer Sequences. 13: Article 10.7.4.

References[edit]