an introduction to the birch and swinnerton dyer
play

An Introduction to the Birch and Swinnerton-Dyer Conjecture April - PowerPoint PPT Presentation

An Introduction to the Birch and Swinnerton-Dyer Conjecture April 1, 2004 William Stein http://modular.fas.harvard.edu Slides: http://modular.fas.harvard.edu/talks/uconn Pythagorean Theorem Pythagoras approx 569-475 B.C. Babylonians


  1. An Introduction to the Birch and Swinnerton-Dyer Conjecture April 1, 2004 William Stein http://modular.fas.harvard.edu Slides: http://modular.fas.harvard.edu/talks/uconn

  2. Pythagorean Theorem Pythagoras approx 569-475 B.C.

  3. Babylonians 1800-1600 B.C.

  4. Pythagorean Triples Triples of whole numbers a , b, c such that + = 2 2 2 a b c

  5. 1 b c Enumerating Pythagorean Triples = = y 2 y + Line of Slope t a c 2 = x x Circle of Radius 1

  6. Enumerating Pythagorean Triples r = t If then s = + = = − 2 2 2 2 c s r 2 a s r b rs is a Pythagorean triple.

  7. Integer and Rational Solutions

  8. Elliptic Curves + = 3 3 x y 1 = + + 2 3 y x ax b + + = 3 3 3 x 4 y 5 0 + = − 2 3 y y x x Cubic algebraic equations in two unknowns x and y . Exactly the 1-dimensional compact algebraic groups.

  9. The Secant Process

  10. The Tangent Process x − 3 x = y + 2 y

  11. Big Points From Tangents

  12. Operation Z Group ≅ The ) Q ( E

  13. Group Law When P=Q

  14. Mordell’s Theorem The group of rational E Q ( ) points on an elliptic curve is finitely generated. Thus every rational point can be obtained from a finite number of solutions, using some combination of the secant and tangent processes. 1888-1972

  15. Stolls The Simplest Solution Can Be Huge

  16. Central Question How many solutions are needed to generate all Birch and Swinnerton-Dyer solutions to a cubic equation? EDSAC in Cambridge, England

  17. More EDSAC Photos E lectronic D elay S torage A utomatic C omputer

  18. Conjectures Proliferated Conjectures Concerning Elliptic Curves By B.J. Birch, pub. 1965 “The subject of this lecture is rather a special one. I want to describe some computations undertaken by myself and Swinnerton-Dyer on EDSAC, by which we have calculated the zeta-functions of certain elliptic curves. As a result of these computations we have found an analogue for an elliptic curve of the Tamagawa number of an algebraic group; and conjectures (due to ourselves, due to Tate, and due to others) have proliferated. […] though the associated theory is both abstract and technically complicated, the objects about which I intend to talk are usually simply defined and often machine computable; experimentally we have detected certain relations between different invariants, but we have been unable to approach proofs of these relations, which must lie very deep.”

  19. Solutions Modulo p Consider solutions modulo a prime number: p = 2,3,5,7,11,13,17,19,23,29,31,37,... We say that ( a,b ), with a,b integers, is a solution modulo p to + = − 2 3 y y x x if + ≡ − 2 3 b b a a (mod p ). For example, + ≡ − 2 3 4 4 2 2 (mod 7). This idea generalizes to any cubic equation.

  20. Counting Solutions

  21. The Error Term (Hasse’s Bound) = + N p ( ) p A p ( ) Write with 1898-1979 error term ≤ A p ( ) 2 p = = A (7) 1. For example, so N (7) 8

  22. More Primes N p = ( ) number of soln's = + N p ( ) p A p ( ) = = = = = = Continuing: (13) 2, (17) 0, (19) 0, (23) -2, (29) -6, (31) 4, .... A A A A A A

  23. Cryptographic Application Commercial Break:

  24. M Guess 10 0.083… 100 0.032… If a cubic curve has infinitely many solutions, then probably N ( p ) is 1000 0.021… larger than p , for many primes p . 10000 0.013… 100000 0.010… Thus maybe the product of terms will tend to 0 as M gets larger. Swinnerton-Dyer at AIM

  25. The L -function 1 ∏ = L E s ( , ) − − − ⋅ + ⋅ s 2 s 1 A p ( ) p p p The product is over all primes p . (At a finite number of primes the factor must be slightly adjusted.) 3 s > Re( ) Product converges for 2

  26. The Riemann Zeta Function 1 ∏ ζ = ( ) s 1 − − s p 1826-1866 all primes p Zeta extends to an analytic function everywhere but at 1.

  27. An Analytic Function Thus Bryan Birch and Sir Peter Swinnerton-Dyer Swinnerton-Dyer defined an analytic function L E s ( , ) such that formally: = ∏ p ( ,1) " " L E ( ) N p

  28. The Birch and Swinnerton-Dyer Conjecture The order of vanishing of ( , ) L E s at 1 equals the rank of the group E Q ( ) of all rational solutions to E : = ord s L E s ( , ) rank ( E Q ) = 1 CMI: $1000000 reward for a proof. Bryan Birch

  29. The Modularity Theorem Theorem (2000, Wiles, Taylor, and A. Wiles Breuil, Conrad, Diamond) The curve E arises from a “modular form”, so extends to an analytic L E s ( , ) function on the whole complex plane. (This modularity is the key input to Wiles’s proof of Fermat’s Last Theorem.) R. Taylor

  30. + = − 2 3 L -series for y y x x

  31. Birch and Swinnerton-Dyer

  32. L E s ( , ) Some Graphs of for s real s The graph of vanishes to order r. L E s ( , ) r

  33. Examples of that appear L E s ( , ) to vanish to order 4 + = − − + 2 3 2 y xy x x 79 x 289 s

  34. Congruent Number Problem Open Problem: Decide whether an integer n is the area of a right triangle with rational side lengths. Fact: Yes, precisely when the cubic equation = − 2 3 2 y x n x x y ∈ � , has infinitely many solutions n = 6 1 1 3 4 6 = × = × = A b h 6 2 2

  35. Connection with BSD Conjecture Theorem (Tunnell): The Birch and Swinnerton-Dyer conjecture implies that there is a simple algorithm that decides whether or not a given integer n is a congruent number. See [Koblitz] for more details

  36. Gross-Zagier Theorem Benedict Gross When the order of vanishing of Don Zagier L E s ( , ) at 1 is exactly 1, then E has rank at least 1 . Subsequent work showed that if the order of vanishing is exactly 1, then the rank equals 1, so the Birch and Swinnerton- Dyer conjecture is true in this case.

  37. Kolyvagin’s Theorem L E ( ,1) Theorem. If is nonzero then the E Q ( ) rank is zero, i.e., is finite.

  38. = ord s L E s ( , ) rank ( E Q ) = 1 Thank You Acknowledgments • Benedict Gross • Keith Conrad • Ariel Shwayder (graphs L E s ( , ) of )

  39. Mazur’s Theorem For any two rational a , b , there are at most 15 rational solutions ( x,y ) to = + + 2 3 y x ax b with finite order.

Recommend


More recommend