HCSSiM Workshop day 16
This is a continuation of this, where I take notes on my workshop at HCSSiM.
Two days ago Benji Fisher came to my workshop to talk about group laws on rational points of weird things in the plane. Here are his notes.
Degenerate Elliptic Curves in the plane
Conics in the plane
Pick . Consider the line given by . Where does intersect the y-axis? Where does it intersect the unit circle,
Substitute into the equation for the circle to get
After you do it the hard way, notice that you already know one root: .
The sum of the roots is and their product is . Either way, you get
.
From you get .
Do not forget that if you are given and , then .
This gives you a 1-1 correspondence between the points of the circle (conic) and the points of the -axis (including ). The formula for Pythagorean triples also falls out. So do the formulae for the tangent-of-the-half-angle substitution, which is useful when integrating rational functions of and : set and
There are several ways you can generalize this. You could project a sphere onto a plane. I want to consider replacing the circle with a cubic curve. The problem is that the expected number of intersections between a line and a cubic is 3, so you get a 2-to-1 correspondence in general. That is interesting, too, but for now I want to consider the cases where the curve has a double point and I choose lines through that point. Such lines should intersect the cube in one other point, giving a 1-1 correspondence between the curve (minus the singular point) and a line (minus a small number of points).
cubic with a cusp
Let be the curve defined by
,
which has a sharp corner at the origin. This type of singularity is called a cusp. Let denote the line through the origin and the point , which has slope .
- Sketch the curve . Does Mathematica do a good job of this?
- The line meets the curve at the origin and in one other point, . Find formulae for and in terms of and for in terms of and .
- You almost get a digestion (bijection) between and the line . What points do you have to omit from each in order to get a digestion?
- Three points , and on are collinear. What condition does this impose on the corresponding values of ?
The calculations are easier than for the circle: , and
You have to remove the point from the curve and the point from the line. Well, you do not have to remove them, but the formula for in terms of and is fishy if you do not. The point at infinity (the third point of intersection between the curve and the -axis) corresponds to itself.
The condition for colliniarity is
Plug in the expressions in terms of the coordinates, chug away, and you should get
.
If we let , then is the natural coordinate on the line . (Maybe I should use that line to start with instead of .)
cubic with a node
This problem deals with the curve defined by
,
which intersects itself at the origin. This type of singularity is called a node. Let denote the line through the origin and the point , which has slope .
- Sketch the curve . Does Mathematica do a good job of this?
- The line meets the curve at the origin and in one other point, ). Find formulae for and in terms of and for in terms of and .
- You almost get a digestion (bijection) between and the line . What points do you have to omit from each in order to get a digestion?
- Three points , and on are collinear. What condition does this impose on the corresponding values of ?
Once again, . The usual method gives and . In order to get a 1-1 correspondence, you need to delete the singular point from the curve and the points and from the line.
The lines through the origin with slope are tangent to the curve. If you plug away, you should find that the condition for colliniarity is:
.
Remember our curve (not to be Maximum Confused with )? It’s the one whose equation is The condition for 3 points to be collinear on is:
Claim: in terms of , the condition is
(Hint: In terms of , .)
If you start with the known equation and replace the ‘s with ‘s, it takes some work to get down to the condition .
If you start with the LHS of the desired equation, there is a shortcut:
.
But then we have
Note that the change-of-variable formulae are fractional linear transformations. Geometrically, is the natural coordinate on the line and is the natural coordinate on the line .
To get from one line to the other, just draw a line through the origin.
One interpretation of our results for the curves , , is that it gives us a way to add points on the line (with coordinate ) and multiply points on the line (with coordinate ) using just a straightedge, provided that we are allowed to draw lines through the point at infinity.
In other words, we are allowed to draw vertical lines. I will continue to refer to this as “straightedge only.” I forgot to mention: you need to have the curve provided as well. Explicitly, this is the rule. Given two points on the line, find the corresponding point on the curve. Draw a line through them. The third point of intersection with the curve will be the (additive or multiplicative) inverse of the desired sum. Draw a vertical line through this point: the second point of intersection (or the third, if you count the point at infinity as being the second) will be the desired sum/product.
More precisely, it is the point on the curve corresponding to the desired sum/product, so you have to draw one more line.
Another interpretation is that we get a troupe (or karafiol) structure on the points of the curve, excluding the singular point but including the point at infinity. The point at infinity is the identity element of the troupe (group). The construction is exactly the same as in the previous paragraph, except you leave off the parts about starting and ending on the line.
smooth cubic
Similarly, we get a troupe (group) structure on any smooth cubic curve. For example, consider the curve defined by
Start with two points on the curve, say and . The equation for the line through these two points is $
Solving for gives the equation where
Plug this into the equation defining and you get, after a little algebra,
Luckily, we know how to solve the general cubic. (Just kidding! Coming back to what we did with the circle, we observe that and are two of the roots, so we can use either of the relations or .)
The result is:
where the final form comes from squaring and using the relations and .
At this point, a little patience (or a little computer-aided algebra) gives
Do not forget the final step: is the third point of intersection, but to get the sum we need to draw a vertical line, or reflect in the -axis:
Now, I give up. With a lot of machinery, I could exlpain why the group law is associative. (The identity, as I think I said above, is the point at infinity. Commutativity and inverses are clear.) What I can do with a different machine (Mathematica or some other computer-algebra system) is verify the associative law. I could also do it by hand, given a week, but I do not think I would learn anything from that exercise.
Some content on this page was disabled on December 15, 2019.
Given the poor organization of the notes, not to mention a little unusual terminology, I want to explain the context of the notes that Cathy posted here. I talked about these ideas over several days, and several problem sets, in my own class before giving a single presentation in Cathy’s. In case she and her junior staff wanted to follow up in her own p-sets, I copied several problems into one document and added enough commentary that Cathy (who was returning the favor while I talked in her class) would know the context and would have an easy reference for the answers.
As for the unusual terminology, Cathy must have explained that elsewhere …
One further note. Since the group law on the smooth points of the cuspidal and nodal cubics corresponds to addition and multiplication (respectively) on the number line, we get associativity for free. For the smooth cubic, we have to verify associative law, but the reward is that we get a brand-new group. (If some smart alec wants to say the group is not new because of the parameterization in terms of elliptic functions, I have a ready defense: finite fields!)
LikeLike