Pictures of Modular Curves (I)
Posted by John Baez
guest post by Tim Silverman
Introduction—and a Kind of Apology
It is with considerable relief that I finally find myself in a position to make a (hopefully) more substantive contribution here: namely, the second in the series I started here, an alarmingly long time ago. I took the long way around to generate the pretty pictures I wanted, and did a lot of reading and calculation—mostly for articles that I intend to appear after this one! Somehow, it all took a lot longer than I expected—even after taking into account that, as I know all too well, these things tend to take a lot longer than expected.
But we’re here at last! My aim in this series is to give the most elementary discussion of modular curves and modular forms that I can manage at each stage, partly for my own benefit, and partly for the benefit of, well, people like me, I guess. One of the strange (but nice) things about the theory of modular curves and modular forms is that, although it lies at the confluence of many areas of mathematics, and leads directly on to some subjects that are very hard indeed, nevertheless, there is a surprising amount that one can do in it using only quite basic geometry and arithmetic. This aspect of the subject is perhaps sometimes somewhat obscured by all the other aspects, but one of my aims here is to bring it out more clearly.
I’m a little embarrassed that this article, and the next few ones at least, are not really categorical, let alone n-categorical, but if things go according to plan, I will at least end up talking a lot about the sorts of things that people often talk about here, albeit at a more elementary level than usual. In any case, I hope that it will provide some interest and amusement to the n-Café patrons, and ideally also to the crowds of urchins in the street outside with their noses pressed against the café window, not to mention the more elegant ladies and gentlemen who pass by and look in but do not enter.
With that warning out of the way, let me start by summarising where we got to in the first article.
The Story so Far
A Farey sequence consists of those fractions, reduced to their lowest terms, which lie between and and have denominators less than some given natural number, the fractions being placed in order of increasing value (as rational numbers).
Here are the first few Farey sequences:
Given any two adjacent fractions and in any Farey sequence, we have . Given any three adjacent fractions , and in any Farey sequence, where is in the middle, we have . That is, the middle fraction is the mediant of the fractions on either side. We get later Farey sequences (with larger maximum denominator) by inserting mediants between pairs of adjacent fractions in earlier sequences.
Now lets make this more geometrical. Suppose, wherever two fractions are adjacent in some Farey sequence, we join them by an edge. From what we said above, it follows that when we have three such fractions of which one is the mediant of the other two, we find the three fractions give the vertices of a triangle. By taking the limit of increasing denominators, so that we eventually include all Farey sequences, we get to include all rational numbers between and , and we can also extend the idea (in the obvious way!) to include all rational numbers—or (to express ourselves geometrically) to the entire affine line over . And from there, it’s just one short step to extend to the projective line over : we simply throw in the fraction , which is just as capable of forming mediants as any other fraction. Having done this, we find that if we are given any pair of points on such that they both lie in some triangle (and hence are connected by an edge), then they also both lie in exactly one other triangle, on the “other side” of the edge, and indeed all the triangles together form a tiling of a (hyperbolic) surface. In the Poincaré Disc view it looks something like the picture below, where the edges appear as segments of circles and the elements of are distributed around the circumference of the disc. (Just to be clear: in the hyperbolic plane, all these triangles are (or can be made) congruent).
Notice that each rational number is at the vertex of an infinite number of triangles. Note also that is adjacent to, precisely, the integers—and each integer is also adjacent to its predecessor and successor integers.
The Action of the Modular Group
Taking another, quite different, geometrical approach, we may consider points of to be lines in .
The group acts on this plane, preserving lines (and preserving enclosed areas, if we consider as a subset of the Euclidean plane). But more than that, preserves crucial features of the structure of Farey sequences. It preserves the relationship between adjacent elements (since this just says that the points and , corresponding to reduced fractions and , form the vertices of a parallelogram of area ; and area is preserved). It also preserves mediancy, since, in the lattice , this just corresponds to the sum of vectors. So elements of preserve the adjacency and mediancy relations, and hence preserve the triangles—at least combinatorially.
In fact, it’s much better than that. The metric structure on the hyperbolic plane gives it a natural conformal structure—which enables it to be considered as a region of . Also, of course, is a subgroup of , and the latter naturally acts on , preserving its conformal structure. And the conformal structure implies a unique metric structure of constant curvature (up to an overall scale factor). So in this way acts as a group of conformal transformations, hence as a group of isometries of the hyperbolic plane, and preserves the tiling by triangles. In fact, more even than that, this group is precisely the symmetry group of the tiling.
Reducing mod
Now one thing we can do with is reduce it mod :
Since a lot of the things we have been talking about so far come from , it might be interesting to see to what extent reduction mod can be applied to these other things. The rings provide, in a way, simpler microcosms of itself, and we might achieve a similar simplification of related objects. So let’s see where we can go with this.
Obviously the surjective morphism of rings will induce a morphism of the plane . But a line in the former plane is defined algebraically (as all points of the form for a certain point ). So the lines in get carried down, in a well-defined way, to “lines” in the reduced plane . And so the projective line over —or perhaps it might almost be better here to say the “projective line” over , if that weren’t confusing for other reasons—gets sent to a sort of projective line over . If is prime, so that is a field, then this is a completely ordinary projective line over a finite field. In any case, we can try to represent points of this projective line by fractions of some kind, but “reduced mod ”.
Here is how we reduce these fractions mod : we identify two fractions and if and . This will sometimes leave common factors between top and bottom (e.g. reduces to ) but we won’t cancel these factors unless they could also have been canceled back in fractions over —which means we only cancel factors of . This means that some lines may get associated with several different fractions—I’ll say a little more about this later.
What about Farey sequences? These can be reduced too! The fractions corresponding to points in the projective line over go to reduced fractions corresponding to points in the reduced “projective line” over . But, in addition, the “adjacency” relation between successive members of a Farey sequence, viz. and are adjacent in some Farey sequence iff , also has a well-defined reduction mod . So we get a reduced adjacency relation, and therefore a set of “reduced edges” between adjacent “reduced points” (i.e. adjacent reduced fractions). Not only that, but the mediancy relation, is also defined algebraically, so we can also reduce the triangles mod ! In fact, the whole tiled surface can be reduced mod !
We can think of this whole thing alternatively in terms of quotients of the original surface by certain subgroups of .
Of course, will act on the reduced plane through its action on , hence on lines in the reduced plane, and so on the ‘projective line’ over . Now, the automorphisms of the latter are what we might call . That is, they are given by the group of matrices whose entries are elements of and whose determinants are equal to mod , all modulo scalar multiplication by .
On the other hand, by reducing matrix elements mod , we get the obvious surjection . And since the action of these matrices is defined in terms of addition and multiplication, the reduction mod commutes with the action: we can either act on with , then reduce to , or we can reduce to , and act with the latter on and get the same result.
Now the kernel of the reduction is the group of matrices congruent to the identity mod . This well-known and interesting subgroup of is called .
So is the “residual” action of left after we have taken the quotient of the latter by . And in the same way, the “projective line” over is what is left after we have taken the quotient of the “projective line” over by the action of as matrices. And, finally, the reduced surface tiled with reduced triangles (made up of reduced edges joining reduced points) is the quotient of the full hyperbolic plane (or complex upper half-plane—which is what we are really after) by the action of on the tiling. There is left a remaining group of symmetries of the reduced tiling by the residual (i.e. quotient) group .
The special case of reduction mod obviously gives the identity map , and makes the trivial group, so we get the full tiled hyperbolic plane. At the opposite extreme, reduction mod sends to the trivial ring, and sets to the entirety of , so reduces the surface down to one covered by a single tile.
Including in larger subgroups enables us to quotient the reduced surfaces even further.
And this is basically what I’m going to be talking about for the next few weeks.
I’ll just say something about how I’m going to write the reduced fractions. I’ll represent the congruence classes of the numerator and denominator in the usual way by numbers lying in . The fact that we can cancel a factor of enables us to send to , or in other words to (mod ), so we’ll use this to ensure that all denominators are when writing our reduced fractions down; also, by the same mechanism, we can ensure that if the denominator is , or if is even and the denominator is (hence equal to minus itself), then the numerator is also . So, for instance, (mod ) we’ll be writing rather than , and rather than .
The Plane over
Let’s look at an example of this. Here, in the picture below, are the six lines which lie in the plane over . Since is cyclic, the plane over it is a kind of torus, and the lines wrap round! But since I’m forced to draw this on a flat surface, some of the lines end up broken into several pieces in the diagram below. I’ve given each line a different colour to make it clear what belongs with what.
Let’s look at an example of this. Here, in the picture below, are the six lines which lie in the plane over . Since is cyclic, the plane over it is a kind of torus, and the lines wrap round! But since I’m forced to draw this on a flat surface, some of the lines end up broken into several pieces in the diagram below. I’ve given each line a different colour to make it clear what belongs with what.
Let’s be more explicit. Listing the lines by the points they contain, we have
Note that, e.g. but .
Some, but not all, of the points “generate” the line they lie on: e.g. if we simultaneously multiply the numerator and denominator of by, successively , , and , we get all the points on the line (viz. , , , and ), but this does not work with (which, indeed, lies on two lines through the origin). We get a fraction which generates a line whenever the numerator and denominator do not have a factor in common which is also a factor of . (Shared factors which are coprime to are fine.)
Because, in our rules for reducing mod , we are not allowed to cancel common factors other than , the “fractions reduced mod ” correspond not to the lines in themselves but to all the points which generate the lines—mod cancellation of factors of as usual. Mod , there are two generators for each line—but the ability to cancel factors of means that they are secretly the same (e.g. ); so in the case of mod , there is just one fraction per line. But this is not generally true. For instance, mod we have that is different from , since they correspond to different generating points, even though they generate the same line.
We Want More!
So much for reduced points. But what about reduced edges? And reduced triangles? And the reduced tilings of reduced surfaces!
Since there are only a finite number of fractions mod , we end up with only a finite number of mediant triangles in our tiling, which will tile a compact quotient surface of the hyperbolic plane. My real goal in this post is to show you some pictures of this happening.
Some Arrangements Of Triangles
Let’s start nice and small with . Our rule for denominators (that they must be ) ensures that in this case the denominator must be either or , and, in the case where the denominator is , our rule for numerators ensures that the numerator must be either or . However, is ruled out. The reason is that this would have to come from a fraction over whose numerator and denominator were both multiples of —but those original fractions over were all reduced to their lowest form, and so wouldn’t have had this common factor in there in the first place. So the only fractions we are left with mod are , , and . Any three of these form a mediant triangle (i.e. one is the mediant of the other two—mod , of course!), so we get the following picture:
Lets go up to .
Here, the allowed fractions are , , , , and , as we saw above. Note that there is no or because is a factor of (viz. ) and so the parent fraction in would have had to have had a common factor of on top and bottom—which it can’t have done because it was reduced to lowest form. Not all of these triplets form mediant triangles: the arrangement of triangles actually looks like this:
And now up to . Here we get to see two different fractions with denominator (viz. and )—symmetrically placed opposite one another, at top and bottom.
Yes, if you’re not sure—that is an icosahedron.
Why would the Platonic solids fall out of modular arithmetic like that?
Well, actually it’s not really surprising. Consider the tiling of the hyperbolic plane induced by the full set of Farey sequences over . Consider, in particular, the vertex and its neighbours, which are just the integers. Adding to all vertex fractions is a symmetry of this tiling, which sends to itself and each integer to its neighbour. (The corresponding element of is ). Obviously there are an infinite number of integers, so we can just keep adding forever.
But think now of how this reduces mod . Now, reduces to , reduces to and adding reduces to adding (mod ). And the integers reduce to integers mod . So after adding times, we get back to where we started. So there are just triangles with a vertex at , rather than an infinite number as with . But all vertices are identical, so there are triangles meeting at every vertex. So we have a tiling of a surface by equilateral triangles, with of them meeting at each vertex. Which is pretty much all we need to get Platonic solids.
Some Arrangements Of -gons
Actually, I don’t really like working with the triangular tiling, with triangles meeting at each vertex. I’d rather work with the dual tiling, where three -gons meet at each vertex. As gets larger, I find the mass of triangles gets difficult to decipher and my eyes start to go funny. Also, my whole discussion obviously relies heavily on the importance of the fractions (reduced mod ) which in the triangle tiling get assigned to mere insubstantial vertices, whereas in the dual tiling they get placed into the centres of faces, which somehow I seem to feel is psychologically more appropriate to their important role—as well as making the numbers easier to read when you see them in a diagram. So here are the dual tilings. I’ve taken the liberty of pasting the fractions flat onto the faces instead of sticking them on invisible pins as in the previous pictures.
Here’s .
Next, .
Observe how rotating around the top face () adds : adding to the top face does nothing (); adding to the integers on the side faces sends them to their anticlockwise (as seen from above) neighbours; and , so the bottom face is also correctly sent to itself.
Observe also that rotating around the edge separating from sends each fraction . E.g. and .
Both of these facts relating arithmetic and geometry are generally true, not just for . These two operations correspond to the matrices and , which between them generate (or as appropriate).
And here’s .
Re: Pictures of Modular Curves (I)
Great post, Tim! That’s gorgeous stuff.