You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
I wrote a little article explaining the concept of 'moduli space' through an example:
This article is due October 1st so I'd really appreciate it if y'all could take a look and see if it's understandable. It's just 2 pages long, and it's written for people who know some math.
This is mostly stuff I learned from James Dolan. The cool part is the connection between the moduli space of acute triangles - that is, the space of all shapes an acute triangle can have - and the more famous moduli space of elliptic curves.
Very cool! And thankfully quite an easy read (at least I thought so). I don't like giving feedback without any suggestions, though, so here's one: If you have an extra footnote worth of space, it might be worth noting that adding the right triangles to your moduli space is a way to compactify it. I'm sure you know this, but there's a cottage industry of people compactifying existing moduli spaces (usually with the technology of GIT quotients, etc) and seeing what the new points on the boundary parameterize. It might be worth adding a sentence of this context to your compactification of the space of acute triangles
But I think the article is already great, and I don't have any pointed feedback at all
Also I don't know if it was intentional or not, but a nice thing to keep on your radar that I just double checked -- purple/yellow (especially since the purple is dark and the yellow is light) is a good combination for colorblind people. Another common one to have on your radar is blue/orange, which can basically always be distinguished.
Actually throwing in the right triangles isn't quite enough to compactify this space - there are also the 'infinitely skinny triangles' lurking at , and . You see, this is itself the interior of a triangle in the hyperbolic plane, but it's an 'ideal triangle' with all three vertices at infinity!
In the Poincare disk model of the hyperbolic plane could be any of the triangles here:
But I think the article is already great, and I don't have any pointed feedback at all.
Thanks!
Also I don't know if it was intentional or not, but a nice thing to keep on your radar that I just double checked -- purple/yellow (especially since the purple is dark and the yellow is light) is a good combination for colorblind people.
Nice! That wasn't intentional: I just wanted complementary colors that looked light and dark.
I haven't tried to read the whole thing yet, but I quite enjoyed the start of the article. The idea of putting isomorphism classes in some kind of topological space to talk about the "nearness" of them is quite cool! That also seems like a very powerful tool to think about collections of things of arbitrarily huge geometric size in terms of a nice bounded region.
This is where I got a bit stuck:
To get the moduli space of acute triangles with unlabeled vertices, we must mod out by the action of that permutes the three vertices.
I know that an action of the group is a group homomorphism to the automorphism group of some object in some category . It sounds like is acting on - presumably then the idea is to place an equivalence relationships on , where we consider two elements in equivalent if they are in the same orbit of this action.
If is acting on , we are looking for a group homomorphism . To do this, for each element of we want to induce a bijection from to itself. Each element of is a point in our purple and yellow region, which specifies an acute triangle (in terms of that point, and the points 0 and 1).
We are given that the action of permutes the three vertices. However, to apply a given permutation I think we need to put an ordering on the vertices of an acute triangle determined by an element of . For example, we could say that the first vertex is the one at 0, the second vertex is the one at 1, and the third vertex is the one at some in the purple and yellow region (the one that is an element of ). Then an element would tell us to take a triangle, and transform it by similarity-preserving transformations until the vertices are appropriately permuted. To take an example, if is , then we would want to apply a similarity-preserving transformation so that the vertex at 0 gets mapped to 1, the vertex at 1 gets mapped to the purple and yellow region at some , and the vertex in the purple and yellow region at gets mapped to . This seems like it could describe part of a permutation of induced by , namely .
It seems like this might be the action of that the article alludes to. But I'm not sure! It seems like it might take some work to show that we can always permute the vertices of the triangle in the way I describe above while preserving similarity.
By the way, the next section of the article reminded me of this video, which provides an enjoyable visualization of Möbius transformations using a "Riemann sphere".
This is fun! I agree that actually seeing the action of would be a lot easier with a picture or a bit more description. Basically I wish it could have one more page, but I assume that's an external constraint.
Also, don't you want to rotate a triangle about the midpoint of one of its edges to construct a parallelogram, rather than reflect across that edges? I think the reflection generally gives you a kite instead of a parallelogram.
If you have a triangle with its vertices labeled {1,2,3}, the group permutes these labels. More generally if you have anything labelled with elements of some set, permutations of that set act to give new labelings. I think this is standard enough not to require much explanation, at least for readers of the Notices of the American Mathematical Society, where this column will - if accepted - appear.
If there's something really quick that would help explain this idea, I can try it. I don't have room for more pictures, and if I did I would illustrate some of the later, more tricky constructions.
However, to apply a given permutation I think we need to put an ordering on the vertices of an acute triangle determined by an element of T.
Don't think about T at first, think about a triangle in the plane with vertices labeled 1, 2, 3. Permutations of the set act on any such triangle to give a new labeled triangle - the same triangle, just with a different labeling. There's nothing about an ordering involved here, though of course the set 1, 2, 3 is ordered if you want it to be.
T is the set of isomorphism classes of labeled acute triangles in the plane, where 'isomorphism' means that two labeled triangles are related by a similarity (rotation, reflection and/or rescaling) in a way that preserves the labelings, mapping vertex 1 of the first triangle to vertex 1 of the second one, etc.
Since acts on the set of labeled triangles in the plane it acts on the set of isomorphism classes of these.
There's no 'work' involved in anything here... except of course the work involved in learning general concepts. It's all very general: I could replace similarity classes of triangles with labeled vertices in the plane by isomorphism classes of 3d vector spaces with labeled basis vectors and everything would work the same.
The only thing particular to the case at hand is our concrete description of the space T, which we're not using in anything I just said.
Kevin Arlin said:
Also, don't you want to rotate a triangle about the midpoint of one of its edges to construct a parallelogram, rather than reflect across that edges? I think the reflection generally gives you a kite instead of a parallelogram.
Yikes! You're right! Thanks, I'll fix that.
That was an incredibly helpful comment.
Note that if you do this in all 3 possible ways (for the 3 edges of the original triangle), you get 3 new triangles, which taken together with the original one form a triangle similar to the original, but with sides twice as long!
You can then fold up this thing and get a tetrahedron, and that tetrahedron plays an interesting role in the next chapter of this story, which alas I didn't have space to explain.
John Baez said:
think about a triangle in the plane with vertices labeled 1, 2, 3 ...
It's not too hard to realize that transposing the bottom two vertices flips the third vertex across the vertical line Re(z) = 1/2. But is there a short explanation for why transposing a different pair of vertices does ... something else (not sure what; a reflection through a circle of radius 1?) For example, what happens to the triangle whose third vertex is at the point z = (1/2, 1/2 + epsilon)? If that's explainable in a few words, perhaps it would be a useful addion.
I think understanding this requires the reader to realize an implicit detail that I missed the first time: When you say "its first vertex at 0, the second at 1,..." you really mean that the vertex labeled 1 is at 0, the vertex labeled 2 is at 1, etc. So transposing labels means that the triangle has to be repositioned, rescaled, to satisfy this requirement. Maybe rewording to say the explicit label list could clarify? (If you do that, perhaps consider the labels {0,1,2}, so that the vertex labeled 0 is at 0, etc?)
Over on ma(th)stodon I suggested that overlaying the picture you have with a few example triangles might help clarify, and that wouldn't require any extra space. (I don't know if you saw that comment or not; that's the only reason I'm repeating it here; it's of course fine by me if you prefer not to change the picture!) The other comment I made there is that I think the phrase "If we reflect a labeled triangle..." is not explained. My comments above could be considered an expansion of that comment.
But is there a short explanation for why transposing a different pair of vertices does ... something else?
I don't have anything really quick and fun to say about that - perhaps because I haven't thought about it hard enough.
It's clear that we have acting on the moduli space of acute triangles shown in purple and yellow here:
It's clear that the point corresponding to the equilateral triangle is fixed by this action. And it's clear from what you said that the transposition 1 2, 2 1 is reflection across the vertical line Re(z) = 1/2. But it takes more work to show that the other transpositions act as (hyperbolic) reflection across the obvious other (hyperbolic) lines separating yellow and purple regions, so I think explaining that would distract people from the main story here.
fair enough; thanks for the clarification though, it will give me something fun to think about :)
Oh, here's something fairly quick, which I still don't want to include in the article!
Think about the portion of the circle |z| = 1 in the colored region of the picture.
Points on this circle correspond to isosceles triangles with vertices labeled 1, 2, 3 where the side 12 has the same length as the side 13.
So these are the points that are fixed by the action of the transposition 2 3, 3 2.
Similarly points on the circle |z-1| = 1 will be fixed by the transposition 1 3, 3 1.
Thanks for raising this issue!
When you say "its first vertex at 0, the second at 1,..." you really mean that the vertex labeled 1 is at 0, the vertex labeled 2 is at 1, etc.
Right, maybe I should have said a bit more forcefully that "first vertex, second vertex, third vertex" are not just off-hand utterances here: I'm using the labeling to say which vertices are the "first", "second" and "third".
I'm not sure I want to pound this point in more forcefully. I'll think about it. I often have the fear, in writing these short columns, that making everything very formal would confuse or bore more people than it will actually help.
These columns are supposed to be entertaining. I like to think that anyone who gets worried about the technical details can stare at what I wrote and figure things out - like you did - while those who don't care about the technical details should not have their noses rubbed in them.
Ah, seeing the circle |z| = 1 as the fixed points of the transposition is great! (Note, if you do decide to put any of that in the article, you've used the labeling {0,1,2} in one of your comments, and then the labeling {1,2,3} in another of them... that's probably my fault, but still... edit: fixed now)
I often have the fear, in writing these short columns, that making everything very formal would confuse or bore more people than it will actually help.
I see what you mean, and I suppose different people will have different preferences for what they consider "a technical bore" v.s. "clear writing". I've been thinking about that kind of thing more generally, so I appreciate your comments about it. I'll be excited to see what you eventually decide :)
I've straightened out my choice of labelings in my comments above, trying to use {1,2,3} everywhere. I see the advantages of using {0,1,2}, though.
Niles Johnson said:
I see what you mean, and I suppose different people will have different preferences for what they consider "a technical bore" v.s. "clear writing". I've been thinking about that kind of thing more generally, so I appreciate your comments about it. I'll be excited to see what you eventually decide :)
I'm pretty sure I'm not going to put in more detail unless a referee forces me. It would be different if this were a paper where I was supposed to be proving theorems. But one reason I like writing a column is that I'm not proving things, just explaining stuff as if I were talking to someone in front of a blackboard. A blog, or forum like this, is even better - since then people can ask questions!
The 6 yellow and purple regions in T are fundamental
domains
I was slightly confused first time, since I didn't realise the top two regions continued all the way up to infinity. Because I expected the pattern to continue as shown, to cover the whole strip.
John Baez said:
Permutations of the set act on any such triangle to give a new labeled triangle - the same triangle, just with a different labeling.
Thanks for clarifying what it means to act on labelled triangles! I was trying to understand this action as something complicated and geometric, not just a changing of labels.
I think I am still confused, however. But this is probably just a sign that I would benefit from learning more about the basics of group actions, not a sign that the article is unclear!
David Michael Roberts said:
The 6 yellow and purple regions in T are fundamental domains
I was slightly confused first time, since I didn't realise the top two regions continued all the way up to infinity. Because I expected the pattern to continue as shown, to cover the whole strip.
Okay, I'm too used to this picture:
Fundamental domains of the modular group, as drawn by Dedekind in 1877
I'll say that the regions on top continue up to infinity.
David Egolf said:
John Baez said:
Permutations of the set act on any such triangle to give a new labeled triangle - the same triangle, just with a different labeling.
Thanks for clarifying what it means to act on labelled triangles! I was trying to understand this action as something complicated and geometric, not just a changing of labels.
I think I am still confused, however. But this is probably just a sign that I would benefit from learning more about the basics of group actions, not a sign that the article is unclear!
If you want me to help you straighten things me, go ahead and ask questions. Quite separate from improving my paper, I'm always happy to explain interesting and important math. Doing it makes me think about lots of interesting things... and I hate it when people are confused!
Note that it's possible to think of the process of permuting labels as a complicated geometrical thing: if I have a right triangle where the right angle is at vertex 2, and I switch the labels so now it's at vertex 1, I can also think "okay, now I'm gonna shrink the angle at vertex 2 so it becomes smaller than a right angle, and expand the angle at vertex 1 so it becomes a right angle".
It's like if you and I wanted to trade identities, one way would be for us to trade labels: I could legally change my name to David Egolf and you could change yours to John Baez. Another way would be for me to get plastic surgery to look like you, and learn to dress like you and act like you, and get a gene transplant so I had your genes... and for you to do the same for me. Either way, in the end we'd have a guy named David Egolf with the properties of the old John Baez, and vice versa! But one way is easy while the other is perversely difficult.
But this perversity is actually implicit in the picture here:
since in this picture vertex 1 is 'nailed down' at the origin and vertex 2 is 'nailed down' at the point 1 on the real line, so the only way for them to trade properties is for us to morph the triangle by moving the third vertex. We reflect the third vertex across the line Re(z) = 1/2.
I think your mistake may have been to dive in and take the perverse "morphing triangles" approach right away instead of taking full advantage of the much easier "permuting labels" approach.
See, this was fun to think about.
But maybe something completely different was bothering you!
John Baez said:
I think your mistake may have been to dive in and take the perverse "morphing triangles" approach right away instead of taking full advantage of the much easier "permuting labels" approach.
Yes, I think this was indeed my mistake. For example, you can make some very "skinny" triangles by placing a vertex at 0, a vertex at 1, and third vertex in the sliver of the yellow region that gets very very close to 0. Then, I was trying to imagine how I could obtain a similar triangle to this with third vertex in the top left yellow region. For example if we want to swap the vertex in the yellow region with the vertex at 1, I was imagining a process where:
I was led to thinking of this sort of process while I was trying to understand the idea that each of the six yellow or purple regions by itself can let us describe all possible shapes (up to similarity) of acute triangles.
I think what is still confusing me is this:
I'm not sure how to do this, so I'm thinking out loud here. If is the set of all labelled acute triangles (not necessarily having vertex "1" at 0, vertex "2" at 1, and vertex "3"in a yellow or purple region), then we should have some projection function that sends a labelled triangle to its equivalence class of labelled triangles. To take an example, if has vertex 1 and vertex 2 very close to each other, and vertex 3 is far away from these, then the underlying triangle is a very "skinny" triangle. Then is similar to other triangles having this shape. Let us assume that and are similar. However, if denotes a labelled version of , it is not necessarily the case that and are isomorphic as labelled triangles: if vertex 1 and vertex 2 of are not very close to one another (relative to their distance to vertex 3), then I think is not going to be isomorphic to as a labelled triangle.
Ok, so we have that sends a labelled triangle to its isomorphism class of labelled triangles, which is represented by some "standard" triangle determined by its third vertex (in a yellow or purple region). Now let's assume we have some bijection defined in terms of changing labels around. I want to use this to induce a bijection on . To do this, I think I want to introduce a function that sends a vertex in the purple and yellow region to the "standard labelling" of the triangle in "standard position" that it naturally induces. That is, sends to the labelled triangle .
Now we have and also available to us. Let's assume again we have a bijection which acts by shuffling the labels on each triangle according to some element of . Then we can form the endofunction . Intuitively, this takes a point in a yellow or purple region, forms a labelled triangle where is vertex 3 (and 0 is vertex 1, and 1 is vertex 2), then permutes these labels according to , and then sends this relabelled triangle back to a corresponding point in by sending it to its isomorphism class of labelled triangles.
It would remain to show that is actually a bijection, and that we can get an action of on in this way. However, I suspect this relates to your earlier comment, quoted below:
John Baez said:
Since acts on the set of labeled triangles in the plane it acts on the set of isomorphism classes of these.
It sounds like actions on individual things can in general get promoted to actions on isomorphism classes of those things. But this sounds like general theory I can try to understand without invoking specifics involving an action on labelled triangles!
David wrote:
We want to act on labelled triangles by permuting their labels. I can understand this: for each triangle, keep the triangle same, but move labels on the vertices around.
However, we want to (I think) extend this action to one on . The elements of are points in the yellow and purple regions, not labelled triangles (although - each such point does represent an isomorphism class of labelled acute triangles).
That's right, though most mathematicians would not use the word "extend" here. If I have function or group action on some set and some larger set with , I might want to "extend" my function or group action from to . But here we have a set and a quotient set , i.e. a set of equivalence classes of elements of . So we're more likely to ask if the function or action "descends" from to .
(We think of elements of as being below those of , like shadows of objects: different objects can have the same-looking shadow.)
Some hardcore category theorists might say "extend" even in this case, since the two cases have this in common: we have a map . Category theorists might ask if a group action "extends along ". But normal mathematicians would be put off by this when is not an injection.
It sounds like actions on individual things can in general get promoted to actions on isomorphism classes of those things. But this sounds like general theory I can try to understand without invoking specifics involving an action on labelled triangles!
Right, it's easier to do things in general. Say you have a group acting on a set . Say you have an equivalence relation on . And let be the set of equivalence classes. Write for the equivalence class of .
Does the action of on descend to one on ? We try to guess a way for to act on equivalence classes. There's only one plausible guess:
where at right means the result of acting on , but at left is our guess as to how should act on .
Now, whenever you work with equivalence classes you need to check that things are well-defined independent of our choice of representative! Right now that means we need to check whether
1) Show that if this is true then the formula gives a well-defined action of on .
2) Does this condition hold in the case we care about, where , is the set of all labeled triangles in the plane, and is the relation of similarity of labeled triangles?
3) Can you think of an example of a group acting on a set with an equivalence relation where the condition
does not hold? What happens then?
Thanks for explaining things, step by step! Let me see if I can work out the details.
We have a set with an equivalence relation on it, and a set of the resulting equivalence classes. We write to denote the equivalence class of .
We have an action of a group on and we wish to investigate whether it descends to an action on .
We guess that the action can be defined as: . If we assume that , so that defines a function, then does give a well-defined action of on ?
Let be our proposed group action. For , we have . First, let's check that the function is a bijection of . To do this, we aim to show it has an inverse, which we guess is . Then and . So, has an inverse in , so we conclude it is an isomorphism and hence a bijection.
Next, we want to show that is a group homomorphism. , so is the identity function on . Also, . So, we conclude that is a group homomorphism and hence defines an action of on .
Next, we wish to know if when , is the set of all labelled triangles in the plane, and is the relation on similarity of labelled triangles.
Intuitively, this condition would mean that if we have two similar triangles with "matching labels", then after we permute their labels, they are still similar triangles with "matching labels". Well, certainly if and are similar labelled triangles, then they are still similar after we change the labelling of their vertices. It remains to show that the "labels still line up". I'm not sure how to show this formally, but intuitively if we transform one triangle to lie on top of the other (by similarity-preserving transformations) such that the original labels line up, then doing this will make the new labels line up as well, because we permuted the labels in the same way on each triangle.
Finally, we wish to consider a case where a group acts on a set so that does not hold.
As an example, assume our set is the set of pairs of integers, having elements of the form with . We place an equivalence relationship on by saying . So, two tuples are equivalent exactly when their first coordinates are equal. We now let the group act on by permutation of coordinates. Then if is the permutation that swaps two things, we can have but and are only equivalent if . So in general, in this case, does not guarantee that .
If we try to extend our action of on to equivalence classes in this case using the formula , we will run into a problem. Namely, that and might be different even if . For example, trying and shows that does not define a function: but .
So, in summary, a group action on a set does not always descend to a group action on equivalence classes of that set under an arbitrary equivalence relationship. However, if holds, then I think that the action does descend to an action on the equivalence classes. And I think this condition holds for our case of interest with labelled triangles, so our action on acute labelled triangles can descend to an action on the isomorphism classes of these acute labelled triangles.
John Baez said:
I wrote a little article explaining the concept of 'moduli space' through an example:
This article is due October 1st so I'd really appreciate it if y'all could take a look and see if it's understandable. It's just 2 pages long, and it's written for people who know some math.
my modest contribution to the conversation is to say that this is fantastic, john! you learned from james dolan and i learned from you. i also learned from you about octonions, so long ago that in the meantime i forgot.
you really go in the corners. i don't know how the future archeologists (if they exist) will measure this, but you do make a difference :pray:
Great, @David Egolf! You crushed those problems!
David Egolf said:
Next, we wish to know if when , is the set of all labelled triangles in the plane, and is the relation on similarity of labelled triangles.
Intuitively, this condition would mean that if we have two similar triangles with "matching labels", then after we permute their labels, they are still similar triangles with "matching labels". Well, certainly if and are similar labelled triangles, then they are still similar after we change the labelling of their vertices. It remains to show that the "labels still line up". I'm not sure how to show this formally, but intuitively if we transform one triangle to lie on top of the other (by similarity-preserving transformations) such that the original labels line up, then doing this will make the new labels line up as well, because we permuted the labels in the same way on each triangle.
To prove it formally I think we'd have to define the set of triangles in the plane a bit more formally, and the set of labelled triangles, and the relation of similarity of labeled triangles, and the action of on labeled triangles. Then we could just "grind it out" and check that . This process should be completely mechanical, uninspired... and uninspiring.
It's important to know how to formally define concepts like this and work with them in an ultra-precise way. It comes in handy when you want to be very sure about something, especially when a more intuitive approach fails. But in this particular case I don't think it's worth bothering. Indeed, it's also good to practice just "seeing" things. (Here I include spotting when a plausible-sounding fact is not really true.)