Birch and Swinnerton-Dyer (part 2)
William Stein
Monday, March 7, 2016
Recall: BSD for elliptic curves over
BSD Rank:
BSD Formula:
Exercise: Choose a curve of rank and compute what you can about the BSD formula for it.
Hint: use elliptic_curves.rank(2)
to get at some curves of algebraic rank .
Exercise: Choose a curve of rank and compute what you can about the BSD formula for it.
Hint: use elliptic_curves.rank(4)
to get at some curves of algebraic rank .
A Deep Theorem
Theorem (Birch, Gross, Zagier): If , then there is an algorithm to compute .
Why?
Birch contribution: Connect to modular symbosls.
See ((2.8.7) of [Cremona])
The modular symbol is called the winding element (e is the first letter of "winding" in French).
Let , so that .
For , we have . Using this (and the Hasse bound that ), one can show that .
More precisely, we get that for each , Note that , so .
is the least real element of (or twice it) and is related to .
The argument above shows that With a little more work, it even shows that which is evidence for the BSD formula.
Computing the image of in is something one can do very algebraically. Just use linear algebra and Hecke operators to find a map with the same kernel as . Then compute the image of under this map. That exactly computes .
(NOTE: I've brushed over issues of the "Manin constant"...)
Gross-Zagier contribution: Connect to rational points.
Elliptic curves are modular, so there is surjective morphism .
is (coarse) moduli space of isomorphism classes of pairs , where is an elliptic curve and is a cyclic subgroup of order .
If is a quadratic imaginary field in which all primes dividing split, then the theory of CM elliptic curves produces an element , defined over some class field of .
Heegner point: The trace of is a naturally constructed element of !
Theorem (Gross-Zagier): , where is the canonical height of .
Here , where is the quadratic twist of over .
Theorem (Bump-Friedberg-Hoffstein, or Murty-Murty, or Waldspurger): There is a such that (and has opposite parity to ).
Now suppose . Using Birch we see that . Then computing to some precision we find that and we're done. (Aside: to prove BSD rank in this case -- Choose so that . Then the Gross-Zagier formula above implies that has infinite order and that has rank at least . To get rank at most 1, one has to use an ingenous argument of Kolyvagin that involves a lot more Heegner points and Galois cohomology, and which led to one of the most central ideas in modern number theory ("Euler systems"). In this case, the formula above is so explicit that we also know that as predicted by BSD.)
If , then we can use Birch to prove that . Using the functional equation we automatically get that . We then can compute to a few digits to prove that it is nonzero. choose a so that
If , then we use Birch to check that and from the functional equation we know that the order of vanishing is odd. Find a so that . Then . We then explicitly compute -- it's a concrete point after all -- and compute its height. We find that it is , hence conclude that . Since , we conclude that . We automatically get by the functional equation. We then compute to some precision and get that it is nonzero.
If , we can show that using Birch, and that from parity. We can compute all day and night and see that . But there is no known (not even crazy wild conjecture!) for some relationship like So there's no point to compute explicitly.