Elliptic tales 2
by Emin Orhan
In this second part, we will be concerned with elliptic curves specifically, rather than arbitrary polynomial curves. The main idea will be to introduce an abelian group structure on the points of an elliptic curve, then we will be able to study the curve algebraically. But, first a brief recap of group theory.
Suppose is a subset of the abelian group . We define the subgroup of generated by to be the group:
with the group operation borrowed from (you can check that is indeed a group). is called a finitely generated abelian group if for some finite subset .
is called a torsion element of if has order for some integer , i.e. for some , but for all smaller . If is not a torsion element, we say that has infinite order. The set of torsion elements of make up the torsion subgroup of , with the group operation again borrowed from (again, you check that this is indeed a group).
A theorem then tells us that each subgroup of a finitely generated group is also finitely generated and in particular, its torsion subgroup is also finitely generated, hence is finite.
Another important concept is rank. Suppose is a finitely generated abelian group and is torsion subgroup. The rank of is defined to be the smallest integer such that can be generated by elements along with all elements of .
Now, we’re ready to take up elliptic curves and define an abelian group structure over them. We first define an elliptic curve over a field , denoted , to be a nonsingular cubic curve containing at least one point with -coordinates. We call this point . It isn’t a trivial assumption to assume that such a point exists. For example, it isn’t at all obvious that a given homogeneous cubic polynomial with rational coefficients should have a solution with rational coordinates.
We define the abelian group operation on geometrically. Here’s how: let and be two points on . We define as follows: first let be the line connecting and . This line intersects at a third point . Then draw the line connecting and . This line intersects the curve at a third point and that third point is defined to be the point . Pictorially, the construction looks like this (the curve is shown in red):
Some amount of work is needed to show that this construction does indeed define an abelian group (for example, you can check that is the identity element of this group), but we will not do it here. Note that we’re also assuming that is non-singular. The case of singular cubic equations requires special handling, but the group structure in this case turns out to be isomorphic to one of a small number of much simpler groups (again we will not do this reduction here), so in a sense, the non-singular case is the interesting case. Whether an elliptic curve is singular or not can be determined from its discriminant, , which is an easy-to-compute algebraic function of the coefficients describing the curve. The curve is singular if and only if .
We will later be interested in elliptic curves over finite fields such as , i.e. , and especially in the size of , which we denote by . A theorem due to Hasse states that:
Theorem (Hasse): The number satisfies .
The number turns out to be so important that it gets its own name, , so Hasse’s theorem can be restated as saying that .
We will also be interested in elliptic curves over rationals, , and we can say a few things about the group structure of :
1) A theorem due to Mordell says that is a finitely generated abelian group. This implies that the torsion subgroup is also finitely generated, hence is finite.
2) A theorem due to Mazur says that if is a point of order in , then either or . I fact, has a very simple structure: either is a cyclic group of order 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12; or is generated by two elements and , where the order of is 2, 4, 6, or 8, and the order of is 2.
3) A theorem due to Nagell and Lutz says that for an elliptic curve described by the equation , with integers, if is an element of , then both and are integers and either , in which case , or else divides the discriminant . This theorem allows us to enumerate all torsion points of relatively easily.
4) It turns out to be much more difficult to say something about the rank of . It is conjectured that there is no maximum rank for , but this remains extremely difficult to prove. It is also believed that a random elliptic curve, i.e. an equation of the form , where and are random integers, should have rank 0 or 1 with high probability.