Since time is short, I am going to discuss a couple of Groups questions but in slightly less detail than I have been giving up to now: instead of working through the questions completely, I’ll try to zero in on the most important points. Because there wasn’t a separate Groups course until 2008, I am taking my questions from that year.
5E. For a normal subgroup of a group , explain carefully how to make the set of (left) cosets of into a group.
For a subgroup of a group , show that the following are equivalent:
(i) is a normal subgroup of ;
(ii) there exist a group and a homomorphism such that is the kernel of .
Let be a finite group that has a proper subgroup of index (in other words, ). Show that if , then cannot be simple. [Hint: Let act on the set of left cosets of by left multiplication.]
The first part of this is bookwork, so I shan’t go through it. However, let me remark that there is one how-much-to-write decision to make here. Is it enough to say that we define the product of and to be , or do we need to prove that that operation is well-defined (meaning that if and then )? There is a simple principle that determines the answer to this question: if you are in doubt, and the question says “explain carefully”, then that word “carefully” is telling you to go for the more careful option. So it’s pretty clear here that you are intended to prove that the operation is well-defined, rather than merely stating it or, worse still, failing to mention the issue at all.
Next, we’re asked to prove that kernels of homomorphisms and normal subgroups are the same thing. The proof that kernels of homomorphisms are normal subgroups is easy, but the reverse is rather less so (I discussed this result in detail in this blog post). The rough answer is that if is a normal subgroup, then it is the kernel of the quotient map from to . So we need to prove that that map is a homomorphism, but that follows directly from the definition of multiplication of cosets.
Now for the non-bookwork part of the question (though this little problem is often on examples sheets). If you are not comfortable with group actions, you may wonder how defining an action can help you prove that a group is not simple. But the answer to that question is simple (if you’ll excuse the very feeble pun).
1. is not simple if and only if has a non-trivial normal subgroup. [Definition of "simple".]
2. So we want a non-trivial normal subgroup.
3. The question is begging us to find a homomorphism with non-trivial kernel, by which I mean a kernel that is not the identity and not the whole of . [Remark: even if the question were not begging us to do that, defining homomorphisms and taking their kernels is still a very good way of coming up with normal subgroups.]
4. We’re given a group action.
5. But group actions are homomorphisms (or, if you prefer, naturally associated with homomorphisms). So let’s think about the kernel of the group action we are given. [Remark: similarly, it is a good general rule that group actions give us a nice big supply of homomorphisms.]
What does do to the left cosets? It permutes them. Since has index , there are left cosets. The axioms for group actions tell us that the action on is a homomorphism from to the group of permutations of the left cosets of , which is isomorphic to the permutation group . The action is non-trivial, in the sense that at least some elements of do not perform the identity permutation on the left cosets (proof — pick and observe that ).
Now where is this condition that going to come in? Ah, the relevance of that is that it is the size of the group . So we have a non-trivial homomorphism from to , and is strictly larger than . Therefore, it has a non-trivial kernel. And we’re done.
The eventual proof can be written concisely as follows.
There are left cosets of , so the group of permutations of these left cosets has size . The left-multiplication action is a homomorphism from to this group, and since , this action must contain elements other than the identity in its kernel. On the other hand, the kernel is not the whole of , since any element permutes the left cosets of non-trivially. Therefore, the action of has a non-trivial kernel, which is a non-trivial normal subgroup, so is not simple.
I have already said that you’ll get more out of these posts if you try the questions first. That is particularly true of this next question: if you solve it for yourself you’ll have really learnt something.
7E. Show that every Möbius map may be expressed as a composition of maps of the form , and (where and are complex numbers).
Which of the following statements are true and which are false? Justify your answers.
(i) Every Möbius map that fixes may be expressed as a composition of maps of the form and (where and are complex numbers).
(ii) Every Möbius map that fixes may be expressed as a composition of maps of the form and (where is a complex number).
(ii) Every Möbius map may be expressed as a composition of maps of the form and (where is a complex number).
A quickish way of doing the first part is to observe that the class of maps we are allowed to use is closed under inversion: the first is inverted by , the second by (since we will not take ), and the third by itself. So if we can convert into by applying maps of the three kinds, then doing the inverses of those maps in the reverse order will convert into .
How can we simplify ? It’s tempting to subtract , because that looks as though it will simplify the fraction. And indeed,
We don’t want to carry too many complicated expressions around, so we might as well rewrite this as , remarking that , by the definition of a Möbius map. To simplify this, an obvious move is to turn it upside down. That gives us , which we can write as . And now it’s obvious that we can get to by subtracting and dividing by . Or is it? We need not to be zero. That’s a problem, because it is conceivable that is zero. I’ve overlooked the possibility that might be zero. Probably the easiest way of dealing with that is to observe that when the problem is easy.
OK, let’s move to the three true-or-false problems.
(i) Under what circumstances does a Möbius map fix ? The limit as of is , so we need , which implies that . It also implies that , so we have a map of the form , which can obviously be expressed in the desired way. So that’s one TRUE.
(ii) A Möbius map fixes if and only if , which implies that implies that neither nor is . Since we’re allowed the transformation , let’s think about rather than about . Can we express using a combination of scalar multiplication and reciprocals? It looks a bit difficult because of that plus sign.
There are two natural ways that one might think of proceeding from here. We suspect that the result is false, so we could either try to understand which maps can be expressed as combinations of scalar multiplication and reciprocals, or we could try to find some property that distinguishes all such maps from the map (for suitably chosen ). Let’s try both approaches.
A little experimentation suggests that the only maps you can make out of and are of the form or . Indeed, we can make all these maps, and if you multiply one of them by or take its reciprocal you get another one. But the map is not of that form, so we’re done.
But why am I so confident that it is not of that form? After all, the representation of a Möbius map is not unique. It’s not hard to be sure about this, but in the end I think the nicest way of doing it is to go for the second approach. And a natural thing to think about when you’re trying to distinguish between Möbius maps is fixed points, or more generally fixed sets of points. What can we say about the two maps we’re allowed to use? Multiplying by fixes and < while taking the reciprocal swaps and . So either way, the set maps to itself. Since takes to , it can't be expressed in the desired way. So that's a FALSE.
(iii) This looks like a FALSE as well, since when we started the question we certainly made use of scalar multiplication. So let’s try to find a special property that compositions of translation and reciprocation have that a general Möbius map does not need to have.
Another thought is this. If some Möbius map is not going to have the property, then some scalar multiplication won’t have the property, assuming, that is, that the property is closed under composition, which it more or less has to be if it is going to be at all natural. So maybe we should look for a property that the map fails to have that all compositions of translations and reciprocation have.
What might this property be? It’s difficult to see where fixed points might come in, because translations fix just and once you start composing with there is no obvious pattern. But one thing we can say is that translations don’t stretch the complex plane. Could that help? Might there be some sense in which every composition of translations and is either “on average” like a translation or “on average” like a translation of ?
It seems difficult to come up with a pithy definition, so let’s switch to the other kind of approach: just getting a feel for what kinds of maps we can generate.
And here is a general and very useful group theory tip: think about conjugations. Almost always, a conjugation will be more informative than some arbitrary composition. So in a spirit of experimentation, let’s conjugate by and see what we get. And later we might conjugate by .
The first conjugation takes to to to . That last map can be rewritten as . That’s interesting: it doesn’t look much like a translation. Can we simplify it? We could take the reciprocal, but that’s just undoing what we’ve done. Another possibility would be to subtract : at the moment the limit as is , so doing this subtraction would move it to , which ought to make things look nicer. And indeed,
It’s looking awfully as though we’ve managed to get scalar multiplication in here. Let’s take the reciprocal. That gets us to . Adding simplifies this to . Which complex numbers can be written as for some complex number . Er … all of them. So we’ve managed to generate all maps of the form , and therefore, by the introductory result, we get all Möbius maps.
I confess that I remember being told by the examiner that year that the answer was TRUE and that almost nobody got it. However, they would have got it if they had followed two basic principles, one general and one slightly more specific. The general one is to do a bit of experimentation: if you want to get a feel for what you can generate, then see what you can generate! The more specific one is that a great start in this process is to look at what you get if you conjugate some of your generators by other generators.
That more specific tip can be generalized: if you are doing a question about Möbius maps, there is a strong chance that conjugation will make things easier. Here’s a quick example. Suppose you are asked to find a non-trivial Möbius map that fixes the complex numbers 1 and . You could just define the map to be , get some equations for and find a non-trivial solution. But the calculations would be fairly unpleasant.
How much less unpleasant they would be if only the fixed points were something nice like and . Then we could just write down an example: the map . Let’s call this map . Is there some way of “transferring” this example to the one we’re actually asked for? Yes there is — conjugation. What we do is find a Möbius map that takes to and to . Then what does do to the point 1? It takes it first to , where it remains fixed before returning to . Similarly, goes to , stays still, then comes back again. Since fixes no other points, fixes no points other than and .
How easy is it to find a map that takes to and to ? The first condition tells us that , and the second that . So we can just write down an answer: . That will be our .
The remaining calculations are slightly tedious but basically easy. We need to work out the inverse of (which is easy enough — just set that expression to be and solve for in terms of ). We then need to work out what happens to if we apply , multiply by 2, and apply .
You may question whether that was easier than the brute-force approach. So perhaps I should add that in theoretical questions it really is much easier. Suppose the question were to prove that for any two distinct complex numbers and there is a non-trivial Möbius map that fixes and and that gives you the identity after you do it four times. (That is, it has order 4 in the group of Möbius maps.) That would be truly horrible if you did it by brute force. However, if you use conjugation, you can observe that multiplication by has the desired property, but with the fixed points and instead. Then you prove that there exists a Möbius map that takes to and to . And then the conjugation does the job. And since the question merely asked you to prove that the map exists, you don’t even have to work out the conjugation, though it wouldn’t be too unpleasant if you did want to.
In general, conjugation can be thought of as what you do when you want to move the “centre of activity” to a nice place. You find a map that takes the nice place to the place you’ve actually been given. Then you do to get to the nice place, followed by a nice transformation (which exists because the place is nice) followed by to get back to the place you were given. It’s this basic idea that explains why expressions of the form occur so frequently in mathematics. Less importantly, but more urgently, it also explains why conjugation occurs so frequently in Tripos questions.