Birch and Swinnerton-Dyer conjecture

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

Lua error in package.lua at line 80: module 'strict' not found. In mathematics, the Birch and Swinnerton-Dyer conjecture describes the set of rational solutions to equations defining an elliptic curve. It is an open problem in the field of number theory and is widely recognized as one of the most challenging mathematical problems. The conjecture was chosen as one of the seven Millennium Prize Problems listed by the Clay Mathematics Institute, which has offered a $1,000,000 prize for the first correct proof.[1] It is named after mathematicians Bryan Birch and Peter Swinnerton-Dyer who developed the conjecture during the first half of the 1960s with the help of machine computation. As of 2016, only special cases of the conjecture have been proven correct.

The conjecture relates arithmetic data associated to an elliptic curve E over a number field K to the behaviour of the Hasse–Weil L-function L(Es) of E at s = 1. More specifically, it is conjectured that the rank of the abelian group E(K) of points of E is the order of the zero of L(Es) at s = 1, and the first non-zero coefficient in the Taylor expansion of L(Es) at s = 1 is given by more refined arithmetic data attached to E over K (Wiles 2006).

Background

Mordell (1922) proved Mordell's theorem: the group of rational points on an elliptic curve has a finite basis. This means that for any elliptic curve there is a finite sub-set of the rational points on the curve, from which all further rational points may be generated.

If the number of rational points on a curve is infinite then some point in a finite basis must have infinite order. The number of independent basis points with infinite order is called the rank of the curve, and is an important invariant property of an elliptic curve.

If the rank of an elliptic curve is 0, then the curve has only a finite number of rational points. On the other hand, if the rank of the curve is greater than 0, then the curve has an infinite number of rational points.

Although Mordell's theorem shows that the rank of an elliptic curve is always finite, it does not give an effective method for calculating the rank of every curve. The rank of certain elliptic curves can be calculated using numerical methods but (in the current state of knowledge) these cannot be generalised to handle all curves.

An L-function L(Es) can be defined for an elliptic curve E by constructing an Euler product from the number of points on the curve modulo each prime p. This L-function is analogous to the Riemann zeta function and the Dirichlet L-series that is defined for a binary quadratic form. It is a special case of a Hasse–Weil L-function.

The natural definition of L(Es) only converges for values of s in the complex plane with Re(s) > 3/2. Helmut Hasse conjectured that L(Es) could be extended by analytic continuation to the whole complex plane. This conjecture was first proved by Deuring (1941) for elliptic curves with complex multiplication. It was subsequently shown to be true for all elliptic curves over Q, as a consequence of the modularity theorem.

Finding rational points on a general elliptic curve is a difficult problem. Finding the points on an elliptic curve modulo a given prime p is conceptually straightforward, as there are only a finite number of possibilities to check. However, for large primes it is computationally intensive.

History

In the early 1960s Peter Swinnerton-Dyer used the EDSAC computer at the University of Cambridge Computer Laboratory to calculate the number of points modulo p (denoted by Np) for a large number of primes p on elliptic curves whose rank was known. From these numerical results Birch & Swinnerton-Dyer (1965) conjectured that Np for a curve E with rank r obeys an asymptotic law

File:BSD data plot for elliptic curve 800h1.svg
A plot of \prod_{p\leq X} \frac{N_p}{p} for the curve y2 = x3 − 5x as X varies over the first 100000 primes. The X-axis is log(log(X)) and Y-axis is in a logarithmic scale so the conjecture predicts that the data should form a line of slope equal to the rank of the curve, which is 1 in this case. For comparison, a line of slope 1 is drawn in red on the graph.
\prod_{p\leq x} \frac{N_p}{p} \approx C\log (x)^r \mbox{ as } x \rightarrow \infty

where C is a constant.

Initially this was based on somewhat tenuous trends in graphical plots; this induced a measure of skepticism in J. W. S. Cassels (Birch's Ph.D. advisor).[2] Over time the numerical evidence stacked up.

This in turn led them to make a general conjecture about the behaviour of a curve's L-function L(Es) at s = 1, namely that it would have a zero of order r at this point. This was a far-sighted conjecture for the time, given that the analytic continuation of L(Es) there was only established for curves with complex multiplication, which were also the main source of numerical examples. (NB that the reciprocal of the L-function is from some points of view a more natural object of study; on occasion this means that one should consider poles rather than zeroes.)

The conjecture was subsequently extended to include the prediction of the precise leading Taylor coefficient of the L-function at s = 1. It is conjecturally given by

\frac{L^{(r)}(E,1)}{r!} = \frac{\#\mathrm{Sha}(E)\Omega_E R_E \prod_{p|N}c_p}{(\#E_{\mathrm{Tor}})^2}

where the quantities on the right hand side are invariants of the curve, studied by Cassels, Tate, Shafarevich and others: these include the order of the torsion group, the order of the Tate–Shafarevich group, and the canonical heights of a basis of rational points (Wiles 2006).

Current status

The Birch and Swinnerton-Dyer conjecture has been proved only in special cases:

  1. Coates & Wiles (1977) proved that if E is a curve over a number field F with complex multiplication by an imaginary quadratic field K of class number 1, F = K or Q, and L(E, 1) is not 0 then E(F) is a finite group. This was extended to the case where F is any finite abelian extension of K by Arthaud (1978).
  2. Gross & Zagier (1986) showed that if a modular elliptic curve has a first-order zero at s = 1 then it has a rational point of infinite order; see Gross–Zagier theorem.
  3. Kolyvagin (1989) showed that a modular elliptic curve E for which L(E, 1) is not zero has rank 0, and a modular elliptic curve E for which L(E, 1) has a first-order zero at s = 1 has rank 1.
  4. Rubin (1991) showed that for elliptic curves defined over an imaginary quadratic field K with complex multiplication by K, if the L-series of the elliptic curve was not zero at s = 1, then the p-part of the Tate–Shafarevich group had the order predicted by the Birch and Swinnerton-Dyer conjecture, for all primes p > 7.
  5. Breuil et al. (2001), extending work of Wiles (1995), proved that all elliptic curves defined over the rational numbers are modular, which extends results 2 and 3 to all elliptic curves over the rationals, and shows that the L-functions of all elliptic curves over Q are defined at s = 1.
  6. Bhargava & Shankar (2015) proved that the average rank of the Mordell–Weil group of an elliptic curve over Q is bounded above by 7/6. Combining this with the p-parity theorem of Nekovář (2009) and Dokchitser & Dokchitser (2010) and with the proof of the main conjecture of Iwasawa theory for GL(2) by Skinner & Urban (2014), they conclude that a positive proportion of elliptic curves over Q have analytic rank zero, and hence, by Kolyvagin (1989), satisfy the Birch and Swinnerton-Dyer conjecture.

Nothing has been proved for curves with rank greater than 1, although there is extensive numerical evidence for the truth of the conjecture.[3]

Consequences

Much like the Riemann hypothesis, this conjecture has multiple consequences, including the following two:

  • Let n be an odd square-free integer. Assuming the Birch and Swinnerton-Dyer conjecture, n is the area of a right triangle with rational side lengths (a congruent number) if and only if the number of triplets of integers (x, y, z) satisfying 2x2 + y2 + 8z2 = n is twice the number of triples satisfying 2x2 + y2 + 32z2 = n. This statement, due to Tunnell's theorem (Tunnell 1983), is related to the fact that n is a congruent number if and only if the elliptic curve y2 = x3n2x has a rational point of infinite order (thus, under the Birch and Swinnerton-Dyer conjecture, its L-function has a zero at 1). The interest in this statement is that the condition is easily verified.[4]
  • In a different direction, certain analytic methods allow for an estimation of the order of zero in the center of the critical strip of families of L-functions. Admitting the BSD conjecture, these estimations correspond to information about the rank of families of elliptic curves in question. For example: suppose the generalized Riemann hypothesis and the BSD conjecture, the average rank of curves given by y2 = x3 + ax+ b is smaller than 2.[5]

Notes

  1. Birch and Swinnerton-Dyer Conjecture at Clay Mathematics Institute
  2. Lua error in package.lua at line 80: module 'strict' not found..
  3. Lua error in package.lua at line 80: module 'strict' not found.
  4. Lua error in package.lua at line 80: module 'strict' not found.
  5. Lua error in package.lua at line 80: module 'strict' not found.

References

  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.

External links