You are currently browsing the tag archive for the ‘elliptic curves’ tag.
An algebraic (affine) plane curve of degree over some field is a curve of the form
where is some non-constant polynomial of degree . Examples of low-degree plane curves include
- Degree (linear) curves , which are simply the lines;
- Degree (quadric) curves , which (when ) include the classical conic sections (i.e. ellipses, hyperbolae, and parabolae), but also include the reducible example of the union of two lines; and
- Degree (cubic) curves , which include the elliptic curves (with non-zero discriminant , so that the curve is smooth) as examples (ignoring some technicalities when has characteristic two or three), but also include the reducible examples of the union of a line and a conic section, or the union of three lines.
Algebraic affine plane curves can also be extended to the projective plane by homogenising the polynomial. For instance, the affine quadric curve would become .
One of the fundamental theorems about algebraic plane curves is Bézout’s theorem, which asserts that if a degree curve and a degree curve have no common component, then they intersect in at most points (and if the underlying field is algebraically closed, one works projectively, and one counts intersections with multiplicity, they intersect in exactly points). Thus, for instance, two distinct lines intersect in at most one point; a line and a conic section intersect in at most two points; two distinct conic sections intersect in at most four points; a line and an elliptic curve intersect in at most three points; two distinct elliptic curves intersect in at most nine points; and so forth. Bézout’s theorem is discussed in this previous post.
From linear algebra we also have the fundamental fact that one can build algebraic curves through various specified points. For instance, for any two points one can find a line passing through the points , because this imposes two linear constraints on three unknowns and is thus guaranteed to have at least one solution. Similarly, given any five points , one can find a quadric curve passing through these five points (though note that if three of these points are collinear, then this curve cannot be a conic thanks to Bézout’s theorem, and is thus necessarily reducible to the union of two lines); given any nine points , one can find a cubic curve going through these nine points; and so forth. This simple observation is one of the foundational building blocks of the polynomial method in combinatorial incidence geometry, discussed in these blog posts.
In the degree case, it is always true that two distinct points determine exactly one line . In higher degree, the situation is a bit more complicated. For instance, five collinear points determine more than one quadric curve, as one can simply take the union of the line containing those five points, together with an arbitrary additional line. Similarly, eight points on a conic section plus one additional point determine more than one cubic curve, as one can take that conic section plus an arbitrary line going through the additional point. However, if one places some “general position” hypotheses on these points, then one can recover uniqueness. For instance, given five points, no three of which are collinear, there can be at most one quadric curve that passes through these points (because these five points cannot lie on the union of two lines, and by Bézout’s theorem they cannot simultaneously lie on two distinct conic sections).
For cubic curves, the situation is more complicated still. Consider for instance two distinct cubic curves and that intersect in precisely nine points (note from Bézout’s theorem that this is an entirely typical situation). Then there is in fact an entire one-parameter family of cubic curves that pass through these points, namely the curves for any (with the convention that the constraint is interpreted as when ).
In fact, these are the only cubics that pass through these nine points, or even through eight of the nine points. More precisely, we have the following useful fact, known as the Cayley-Bacharach theorem:
Proposition 1 (Cayley-Bacharach theorem) Let and be two cubic curves that intersect (over some algebraically closed field ) in precisely nine distinct points . Let be a cubic polynomial that vanishes on eight of these points (say ). Then is a linear combination of , and in particular vanishes on the ninth point .
Proof: (This proof is based off of a text of Husemöller.) We assume for contradiction that there is a cubic polynomial that vanishes on , but is not a linear combination of and .
We first make some observations on the points . No four of these points can be collinear, because then by Bézout’s theorem, and would both have to vanish on this line, contradicting the fact that meet in at most nine points. For similar reasons, no seven of these points can lie on a quadric curve.
One consequence of this is that any five of the determine a unique quadric curve . The existence of the curve follows from linear algebra as discussed previously. If five of the points lie on two different quadric curves , then by Bezout’s theorem, they must share a common line; but this line can contain at most three of the five points, and the other two points determine uniquely the other line that is the component of both and , and the claim follows.
Now suppose that three of the first eight points, say , are collinear, lying on a line . The remaining five points do not lie on , and determine a unique quadric curve by the previous discussion. Let be another point on , and let be a point that does not lie on either or . By linear algebra, one can find a non-trivial linear combination of that vanishes at both and . Then is a cubic polynomial that vanishes on the four collinear points and thus vanishes on , thus the cubic curve defined by consists of and a quadric curve. This curve passes through and thus equals . But then does not lie on either or despite being a vanishing point of , a contradiction. Thus, no three points from are collinear.
In a similar vein, suppose next that six of the first eight points, say , lie on a quadric curve ; as no three points are collinear, this quadric curve cannot be the union of two lines, and is thus a conic section. The remaining two points determine a unique line . Let be another point on , and let be another point that does not lie on either and . As before, we can find a non-trivial cubic that vanishes at both . As vanishes at seven points of a conic section , it must vanish on all of , and so the cubic curve defined by is the union of and a line that passes through and , which must necessarily be . But then this curve does not pass through , a contradiction. Thus no six points in lie on a quadric curve.
Finally, let be the line through the two points , and the quadric curve through the five points ; as before, must be a conic section, and by the preceding paragraphs we see that does not lie on either or . We pick two more points lying on but not on . As before, we can find a non-trivial cubic that vanishes on ; it vanishes on four points on and thus defines a cubic curve that consists of and a quadric curve. The quadric curve passes through and is thus ; but then the curve does not pass through , a contradiction. This contradiction finishes the proof of the proposition.
I recently learned of this proposition and its role in unifying many incidence geometry facts concerning lines, quadric curves, and cubic curves. For instance, we can recover the proof of the classical theorem of Pappus:
Theorem 2 (Pappus’ theorem) Let be two distinct lines, let be distinct points on that do not lie on , and let be distinct points on that do not lie on . Suppose that for , the lines and meet at a point . Then the points are collinear.
Proof: We may assume that are distinct, since the claim is trivial otherwise.
Let be the union of the three lines , , and (the purple lines in the first figure), let be the union of the three lines , , and (the dark blue lines), and let be the union of the three lines , , and (the other three lines). By construction, and are cubic curves with no common component that meet at the nine points . Also, is a cubic curve that passes through the first eight of these points, and thus also passes through the ninth point , by the Cayley-Bacharach theorem. The claim follows (note that cannot lie on or ).
The same argument gives the closely related theorem of Pascal:
Theorem 3 (Pascal’s theorem) Let be distinct points on a conic section . Suppose that for , the lines and meet at a point . Then the points are collinear.
Proof: Repeat the proof of Pappus’ theorem, with taking the place of . (Note that as any line meets in at most two points, the cannot lie on .)
One can view Pappus’s theorem as the degenerate case of Pascal’s theorem, when the conic section degenerates to the union of two lines.
Finally, Proposition 1 gives the associativity of the elliptic curve group law:
Theorem 4 (Associativity of the elliptic curve law) Let be a (projective) elliptic curve, where is the point at infinity on the -axis, and the discriminant is non-zero. Define an addition law on by defining to equal , where is the unique point on collinear with and (if are disjoint) or tangent to (if ), and is the reflection of through the -axis (thus are collinear), with the convention . Then gives the structure of an abelian group with identity and inverse .
Proof: It is clear that is the identity for , is an inverse, and is abelian. The only non-trivial assertion is associativity: . By a perturbation (or Zariski closure) argument, we may assume that we are in the generic case when are all distinct from each other and from . (Here we are implicitly using the smoothness of the elliptic curve, which is guaranteed by the hypothesis that the discriminant is non-zero.)
Let be the union of the three lines , , and (the purple lines), and let be the union of the three lines , , and (the green lines). Observe that and are cubic curves with no common component that meet at the nine distinct points . The cubic curve goes through the first eight of these points, and thus (by Proposition 1) also goes through the ninth point . This implies that the line through and meets in both and , and so these two points must be equal, and so as required.
One can view Pappus’s theorem and Pascal’s theorem as a degeneration of the associativity of the elliptic curve law, when the elliptic curve degenerates to three lines (in the case of Pappus) or the union of one line and one conic section (in the case of Pascal’s theorem).
[This post is authored by Emmanuel Kowalski.]
This post may be seen as complementary to the post “The parity problem in sieve theory“. In addition to a survey of another important sieve technique, it might be interesting as a discussion of some of the foundational issues which were discussed in the comments to that post.
Many readers will certainly have heard already of one form or another of the “large sieve inequality”. The name itself is misleading however, and what is meant by this may be something having very little, if anything, to do with sieves. What I will discuss are genuine sieve situations.
The framework I will describe is explained in the preprint arXiv:math.NT/0610021, and in a forthcoming Cambridge Tract. I started looking at this first to have a common setting for the usual large sieve and a “sieve for Frobenius” I had devised earlier to study some arithmetic properties of families of zeta functions over finite fields. Another version of such a sieve was described by Zywina (“The large sieve and Galois representations”, preprint), and his approach was quite helpful in suggesting more general settings than I had considered at first. The latest generalizations more or less took life naturally when looking at new applications, such as discrete groups.
Unfortunately (maybe), there will be quite a bit of notation involved; hopefully, the illustrations related to the classical case of sieving integers to obtain the primes (or other subsets of integers with special multiplicative features) will clarify the general case, and the “new” examples will motivate readers to find yet more interesting applications of sieves.
On Wednesday, Shou-wu Zhang continued his lecture series. Whereas the first lecture was a general overview of the rational points on curves problem, the second talk focused entirely on the genus 1 case – i.e. the problem of finding rational points on elliptic curves. This is already a very deep and important problem in number theory – for instance, this theory is decisive in Wiles’ proof of Fermat’s last theorem. It was also somewhat more technical than the previous talk, and I had more difficulty following all the details, but in any case here is my attempt to reconstruct the talk from my notes. Once again, the inevitable inaccuracies here are my fault and not Shou-wu’s, and corrections or comments are greatly appreciated.
NB: the talk here seems to be loosely based in part on Shou-wu’s “Current developments in Mathematics” article from 2001.