*in which we prove the Isomorphism Theorem and first meet group actions.
*

Today we proved the** Isomorphism Theorem**: if is a group hom with kernel , then (as seen before) and . We proved this by defining a homomorphism that sends any coset to the image (under ) of any of its elements. Again, as usually with cosets, the main thing is to check that this is well-defined. The reason behind it is that the cosets of the kernel give you exactly the partition of into the subsets which get mapped to the same image by . Once we saw that our map was well-defined, we could prove that it is indeed an injective group hom, giving us an isomorphism to the image of as required. As a consequence, when we have an *injection* (i.e. the kernel is just the identity element), we can view as (isomorphic to) a subgroup of . And if is a* surjection*, then the codomain itself is a quotient of . A possible slogan for the Isomorphism Theorem could be “**homomorphic images are quotients**“. As examples we looked at the determinant of an matrix, we found the unit circle as the quotient , and had a quick look at how many “quadratic residues” there are modulo a prime .

Then we used the Isomorphism Theorem to show **essential uniqueness of cyclic groups**: any cyclic group is isomorphic to either or , for some . We also defined a **simple group** as one which only has and itself as normal subgroups. Examples are for prime (by Lagrange; in fact they have no other subgroups at all, let alone normal ones), and , the alternating group on elements, which we will investigate more in Chapter 6.

After that we started on Group Actions (Chapter 5). An **action** of a group on a set is a function which satisfies:

0. for all ;

1. for all ;

2. for all .

We saw several other alternative notations to write this , for example , or we can view , for a fixed , as a map . We will prove next time that these are all bijections. As examples for actions we saw the **trivial action**, which does nothing, and both acting on , and rotations of a cube acting on several different sets, such as the faces of the cube, the diagonals, the “pairs of opposite faces”, etc.

**Understanding today’s lecture**

The Isomorphism Theorem is one that we will use over and over again, and eventually we will probably not even notice any more when we are using it. It is that central. You can get used to it by applying it to any group hom you have lying around at home (or meet on your travels).

Actions are what make groups tangible or concrete. Through actions, the groups are really “doing” something. We have had several different notations: see that you can translate between them. And maybe you have a favourite one? In lectures we will use different ones in different contexts, as they all have their advantages and disadvantages, and it depends what you want to do as to which is most useful.

We will talk more about rotations of a cube as well in future lectures. I suggest you make yourself your own “Taylor-cube” to play around with, you can find the net to print out here. You may very well want to check out Gareth Taylor’s website which has many more useful things on it.

**Preparing for Lecture 13
**

Next time we will keep exploring actions, by giving an alternative definition and finding out a bit more about them. In particular, we will be looking at orbits and stabilisers. Orbits are all elements of the set that can be reached from a given element, and stabilisers are all group elements which fix a particular element. You can read up on these in any group theory book (or the latexed notes) before next time. We will prove that orbits partition the set , and the very important Orbit-Stabiliser Theorem, which is extremely useful for finding sizes of all sorts of things. The proof is a sort of “geometric version of Lagrange”, so go and freshen up on the proof of Lagrange.

**Going a little deeper**

The Isomorphism Theorem isn’t really something that is restricted to groups, there is a version of it in many other areas of maths. (And in fact there are other Isomorphism Theorems for groups as well, sometimes called Noether’s Isomorphism Theorems. But our one is “the” (or first) Isomorphism Theorem.) In second year Groups Rings and Modules you’ll see one for rings and one for modules. Either in Vectors and Matrices, or at least in second year Linear Algebra, you will see one for vectorspaces, though it looks different (and a lot easier, because vectorspaces are very nice). The rank-nullity theorem says: if is a linear map between vectorspaces, then , where the rank is the dimension of the image and the nullity is the dimension of the kernel. If you compare that to our isomorphism theorem and (once you know more about finite dimensional vectorspaces) see what the equivalent would be for vectorspaces, you’ll see it is exactly this.

So, in what sense are quotient groups “the opposite of” kernels? I explained last blog that kernels have a certain universal property. Quotients also have a universal property, but sort of on the other side of the homomorphism. Given with kernel (viewed as an inclusion), we know that for all . Writing for the quotient map as in lectures, this has the same property: for all . Remember that we can describe this as “the composite is zero”. Now if we have any other group hom which also satisfies for all , then this factors through the quotient map, in the sense that there is a unique group hom satisfying . We saw in the proof of the Isomorphism Theorem one special case of how such a morphism might be defined. Perhaps you can extend that construction to this case? We won’t necessarily get that is injective, like we had in the Isomorphism Theorem, but the rest works just the same.