Since the end of March (more precisely March 30), I’m participating of the “Dynamics and PDEs” trimester at Institut Mittag-Leffler. During this trimester (ending on June 15), I had several opportunities to attend interesting talks and minicourses. In fact, they have 4 talks (of 1 hour) each Tuesday and Thursday and J. C. Yoccoz is giving his minicourse (1 hour every Wednesday) on his 220 pages long paper with J. Palis (about Nonuniformly Hyperbolic Horseshoes) during “normal” weeks, while special thematic weeks (varying from abstract Ergodic Theory, interval exchange maps, non-uniformly hyperbolic dynamics and KAM theorems for PDEs) had 4 talks per day. In particular, I got a lot of new ideas for future posts, although it will take some time to publish them. Indeed, the excellent scientific ambient provided by Institut Mittag-Leffler stimulated me (and my coauthors) to write down our ongoing projects in a more systematic way during the available period between the talks, so that my time for new posts was somewhat reduced (besides that, I should confess that it is difficult to resist taking a bicycle to visit Stockholm during summer weekendsđ ).
In any case, I would like to start the series of posts related to my stay in Stockholm with the symposium “Abel Prize 2010” held at the Royal Swedish Academy of Sciences. This symposium occurred on May 31 (Monday) and there were 2 non-technical talks (of 5 and 15 min. describing the Abel Prize) and the following 4 mathematical talks:
- Applications of Tate’s work to cyptography by J. HĂ„stad (KTH, Stockholm);
- The arithmetic of elliptic curves by the Abel Prize 2010 laureate John Tate;
- Point count statistics for families of curves over a fixed finite field by P. Kurlberg (KTH, Stockholm);
- Detecting elements in the Grothendieck ring of varieties by T. Ekedahl (Stockholm University).
As one could expect from this kind of symposium, it was mostly accessible to a non-specialist (like me). In fact, I attended the first 3 talks and they were really joyful: the speakers went directly to the heart of the matter with the minimum possible technicalities. In particular, I decided to take the advice of my friend David Damanik to write down a sketch of these lectures. Of course, the curious reader may ask me why I skipped the last talk and the reason is very simple: at the beginning of the symposium, they provided lecture notes for the fourth talk, and the most basic definition (appearing in the first page of these notes) was the concept of Grothendieck-Kontsevich universal group of varieties (in a not-so-simple-to-follow language from category theory); after seeing that the 3 previous talks started with much humble concepts (such as elliptic and hyperelliptic curves), I thought that this 4th talk would not be suited for a dynamicist (in other words, the propaganda of the 4th talk made at the beginning of the symposium had the opposite effect on me).
Concerning the talks of J. HĂ„stad and P. Kurlberg, let me make a few comments on them before passing to the main focus of this post, namely, J. Tate’s lecture.
Firstly, J. HĂ„stad started his lecture by reviewing some basic facts about crytography: in particular, he explained some well-known basic principles in public-key crytography via the standard Alice and Bob example. After that, he mentioned that N. Koblitz and V. Miller (independently) proposed the use of elliptic curves to perform more efficient (in the sense that the size of the key is smaller [say 70 digits] when compared with previous methods [whose keys have 300 digits say]). This subject is nowadays known as elliptic curve cryptography. Here, the advantage of the algebraic (Abelian group) structure of elliptic curves over finite cyclic groups (for instance) for the public-key cryptography is related to the unfeasibility of solving the so-called discrete logarithm problem: in fact, as it is explained in this Wikipedia article here, when trying to communicate a message (encrypted as an element of an Abelian group), we usually lock it by taking powers and sending this data through insecure networks; thus, the key-exchange protocol is more secure when the solvability of the discrete logarithm problem (i.e., given and , find such that ) on a given Abelian group becomes hard; since the discrete logarithm problem is notably harder over elliptic curves than finite cyclic groups, the use of elliptic curves in such cryptography tasks is more than justified. Nevertheless, by the end of his lecture, J. HĂ„stad explained how one can use the so-called Weil pairing and its properties to make the slight improvements in elliptic curve based protocols.
Secondly, P. Kurlberg gave a nice lecture (based on his paper with Z. Rudnick) about the problem of counting points on hyperelliptic curves over finite fields. More precisely, let be a finite field (of odd cardinality ) and consider square-free monic polynomials of degree . Since is assumed to be square-free, we have that
is a smooth projective hyperelliptic curve of genus or (depending on the parity of ). We denote by the number of -points (i.e., points whose coordinates belong to ). The leitmotiv of Kurlberg’s talk was the limit average behavior of when the genus and/or the cardinality of grows. In order to attack this problem, he recalled the cute approach of comparing our problem with an appropriate random matrix model. Roughly speaking, we write , where are the eigenvalues of Frobenius action on certain cohomology groups. During his proof of the Riemann hypothesis over finite fields, A. Weil showed that for any (compared it with Hasse’s bound over elliptic curves). This allows us to write
where is a unitary matrix (which is well-defined modulo conjugation) and stands for the trace of the matrix . Therefore, one can hope to apply some techniques from random matrix theory (see, e.g., these posts by Terence Tao for an excellent introduction to the subject) to control and, a fortiori, , at least when (or, more precisely, its conjugacy class) becomes “equidistributed”. Using this point of view, N. Katz and P. Sarnak used Deligne’s equidistribution theorem to show that, for a fixed genus , we have that, when , the limiting distribution of is the Haar measure on (unitary symplectic group). On the other hand, P. Diaconis and M. Shahshahani showed that the limiting distribution of is a Gaussian distribution with zero mean and variance 1. Therefore, the limiting distribution of
is a Gaussian distribution (of zero mean and variance 1) when and (in this order). Of course, one can ask what happens when we let and grow at the same time. In this direction, P. Kurlberg and Z. Rudnick showed (in their loc. cit. paper) that one still gets a Gaussian distribution with zero mean and variance 1. Also, by the end of his lecture, he mentioned the problem of understanding the limiting distribution of (where is a smooth curve [not necessarily hyperelliptic]) when is fixed but the genus grows. In this situation, as P. Kurlberg pointed out, a naive approach using random matrix theory can’t work: in fact, since our original problem concerns point counting, we have a trivial constraint
which is clearly not taken into account by the Gaussian distribution (as the previous inequality is violated for any close to the identity [when ]). In this context, P. Kurlberg mentioned a recent paper joint with E. Wigman where they constructed specific families of curves of increasing genus over fixed finite field whose limiting distribution is Gaussian.
Finally, after all these preliminaries, let’s start discussing Tate’s lecture.
Remark: Besides my notes, I used also some nice pictures (taken by my wife Aline G. Cerqueira) to illustrate today’s post.
–Elliptic curves–
Let be a field, e.g., or . An elliptic curve is a smooth projective curve of genus 1 (i.e., topologically a torus) defined over with a -rational point . Any elliptic curve admits an algebraic (plane) curve model with non-vanishing discriminant (this last condition is the algebraic incarnation of the smoothness assumption on our elliptic curve). For some introductory material on elliptic curves (and some references), see these links here and here.
We denote by the set of -rational points of . It is well-known that is an Abelian group: from the naive point of view, we declare that whenever are collinear (this makes sense because a line intersects the zero set of a cubic equation within 3 points [counting multiplicities]), and from the advanced point of view, we say that the map from to the group of divisor classes of degree 0. See the photo of Tate’s slide below and this link for nice illustrations of the naive point of view, and this post (from the nice blog “Rigorous Trivilities”) for more comments on the advanced point of view.
Below, we find a photo showing J. Tate explaining the example of the elliptic curve : here, it is indicated 14 integral points, namely, where and , the discriminant and the fact that the (Abelian) group of -rational points is isomorphic to in the present case is mentioned. Also, J. Tate introduces a height function
where , ( and coprimes), so that because .
–Mordell-Weil theorem–
Once we know that is an Abelian group, one may ask what kind of Abelian group can be. The answer is provided by the Mordell-Weil theorem:
Theorem 1 (Mordell-Weil) Let be a number field. Then, is a finitely generated Abelian group.
Remark 1 This theorem was proved by L. Mordell in the case and by A. Weil in the general case .
Remark 2 In the sequel, we’ll present Mordell’s “accidental” proof. As pointed out by J. Tate (compare with the photo below), he says that Mordell’s proof was “accidental” because when he asked (personally) L. Mordell about how the idea of the proof came out, Mordell said that he was trying to prove other results when he realized that his arguments gave a proof of this theorem.
Proof: The argument can be divided into two parts:
- firstly, one shows that is a finite group;
- secondly, one construct a height function verifying the following properties
- (a) for every , the set is finite;
- (b) there exists a constant (depending on the elliptic curve ) such that for all ;
- (c) for some constant depending on the elliptic curve and the point .
The first part of the argument (claiming that is finite) is known as weak Mordell-Weil theorem. Since its proof is beyond the scope of this post, we recommend to the interested reader this link here for a proof using group cohomology and this .ps file here for a proof using some commutative algebra (and number theory).
The second part of the argument involves the construction of appropriate height functions: while this is not hard ([at least when ] since an adequate modification of the height function introduced above does the job), we’ll assume its existence because it is not the main point of Mordell’s proof (in the sense that any height function with the previous properties is sufficient to perform the argument, as we’re going to see). We refer the reader to the loc. cit. .ps file for further details on the construction of these height functions.
From this point, we can derive the Mordell-Weil theorem as follows. From the weak Mordell-Weil theorem, we can select a finite set of representatives of the (finite) set . By definition, given a point , there exists such that , i.e., for some . Using the properties of the height function, we see that
so that
where . For our future purposes, we introduce . We claim that the previous estimate implies that is generated by the finite set
of -rational points with height at most (we’re using here the property (a) of ). Indeed, this fact is easy to derive intuitively (via a modification of Fermat’s infinite descent argument): if we start with a point of height , we can write it as where and we saw that any can be written as where , which is, roughly speaking, half of the size of ; hence, we can iterate this procedure finitely many times (i.e., ) to write as a finite combination of elements of heights at most (since the height decrease by half at each iteration). More formally, given a point , we take an integer such that (e.g., ), and we write with and as above. Since , we see that . By iterating this process, we see that, after steps, we can write as a sum of points of heights . Thus, by taking , we get that is the sum of points of heights , as it was claimed.
Remark 3 Although the previous argument allows to bound the number of elements of the finite set used to generate a given point , it is not effective because, for instance, there is no efficient method (to the best of my knowledge) to find explicit representatives of .
A direct consequence of Mordell-Weil theorem and the fundamental theorem of finitely generated Abelian groups is:
Corollary 2 is isomorphic to where is a finite (Abelian) group and .
In the literature, is called the torsion subgroup and is the rank of . For example, we saw that in the case of the elliptic curve , so that its torsion group is trivial and its rank is 1.
In the photo below, we see J. Tate showing an example of N. Elkies (discovered in 2006) of an elliptic curve with trivial torsion group and rank (although the precise value of the rank is not known). Also, a list of (the coordinates of) 28 rationally independent points is presented.
–Birch-Swinnerton-Dyer conjecture–
The previous proof of the Mordell-Weil theorem hints a natural way to investigate finer properties of . In fact, as explained by J. Tate in the photo below, one can use some group cohomology to induce some short exact sequence (starting from ) leading to the Selmer () and Shafarevich groups. See this link for more details.
As J. Tate pointed out, although Selmer groups are understood (in the sense that they’re finite and computable by the method of descent), it is a hard open problem to decide whether the Shafarevich group is finite!
After this, we can start doing some number theory with elliptic curves in the following way: loosely speaking, given an elliptic curve , we can use the quantities to construct zeta functions
From the expressions of these zeta functions as rational functions of , we can produce numbers (for each prime ), which in turn can be put together to define a L-series (called Hasse-Weil zeta function) via a Euler product (type) expression. See this Wikipedia article on elliptic curves for more discussion and references.
It is know that converges absolutely when (essentially in view of Hasse’s theorem). Furthermore, after the celebrated works of A. Wiles and R. Taylor (among others), we know that this L-series is an entire function of the complex plane satisfying a functional equation relating to : technically speaking, this was derived from the proof of the so-called Shimura-Tanyama conjecture asserting that elliptic curves are completely related to modular forms (some objects with nice L-series attached to them). Another famous consequence of this relationship between elliptic curves and modular forms is Fermat’s last theorem: after Frey, Serre and Ribet, we have that the existence of a solution of (with prime) would imply that the elliptic curve has too little ramifications to be related to modular forms. See this photo of a slide of J. Tate where these facts are resumed.
As we can see in the previous picture, J. Tate also states the Birch and Swinnerton-Dyer conjecture giving a precise prediction of the behaviour of the L-series (zeta function) near : its expansion (in terms of ) starts with where is the rank of and is an explicit constant depending on the cardinalities of the Shafarevich group and the torsion subgroup (besides some “local” factors ). Nevertheless, he stated his theorem (with Artin) saying that the Birch-Swinnerton-Dyer is true over function fields if and only if the Shafarevich group is finite, and the results of Gross-Zagier and Kolyvagin saying that the Birch-Swinnerton-Dyer conjecture over is true if has a zero of order . Concerning these results, J. Tate thinks that they will be extended to totally real fields , but we’re still not capable of attacking the cases of higher rank () elliptic curves (or not totally real).
Closing his lecture, J. Tate reported on three recent results. The first one is due to Manjul Bhagarva. Given an elliptic curve , we consider its algebraic curve model . This permits to order them using the height function (the exponents of and are chosen in view of the formula of the discriminant of the elliptic curve).
Theorem 3 Using the previous ordering on elliptic curves, we have:
- the average rank is ;
- a positive proportion of elliptic curves have , so that, by the results of Gross-Zagier and Kolyvagin, the Shafarevich group is finite, the Birch-Swinnerton-Dyer conjecture is true and the rank is zero for a positive proportion of elliptic curves (over );
- If the Shafarevich group is finite for every elliptic curve , then a positive proportion of elliptic curves have rank equal to 1.
In the picture below, J. Tate stresses out that the first item (on the average rank) is an unconditional result (in the sense that it doesn’t depend on any conjecture such as the generalized Riemann hypothesis or Birch-Swinnerton-Dyer conjecture). Also, he pointed out other interesting results of M. Bhagarva (such as the fact that the average size of the Selmer group is 3).
The second and third results concern elliptic curves and Hilbert’s 10th problem (about the existence of algorithms capable of solving Diophantine equations). More precisely, after the works of B. Poonen, A. Shlapentokh and K. EisentrĂ€ger, we have:
Theorem 4 Suppose that, for every cyclic extension of prime degree of number fields, we can find an elliptic curve such that the (i.e., there are elliptic curves whose rank doesn’t increase with the extension ). Then, Hilbert’s 10th problem has a negative solution over the ring of integers of number fields.
While at a first glance, the hypothesis of this theorem maybe strange, it turns out that, after the work of B. Mazur and K. Rubin (accepted for publication in Inventiones Mathematicae), we have an explicit criterion for the verification of this hypothesis:
Theorem 5 If the Shafarevich group is finite, then the hypothesis of the previous theorem is always satisfied.
In other words, these two results together say that the conjecture of the finiteness of the Shafarevich group implies a negative answer to Hilbert’s 10th problem over the ring of integers of number fields.
Leave a Reply