## Group Theory Primer, part 5: the last of the isomorphism theorems.

### June 28, 2010

Last time we talked about a whole lot of stuff. We did homomorphisms, isomorphisms, and talked about the first ismorphism theorem. What did this one state? It states that for are groups and is a homomorphism, then we have that , or, in other words, the quotient of with the kernel of the map is equal to the image of the map. This makes sense if you think about it: we’re kind of condensing everything that goes to 0 when we map it away from and we say that these elements ultimately don’t matter in the image — but, because of the nice properties of homomorphisms, a lot of other elements map onto each other, too.

Today, we’re going to discuss the final two isomorphism theorems (which don’t come up as often, but they’re nice) and conclude with one of the most used theorems in elementary abstract algebra: Cauchy’s Theorem.

Let’s define a **product** of two subgroups of before we begin. If we have and , then we define . Yeah, it’s just the product of elements. For example, in if we take , or the multiples of 3, and , or the multiples of 5, we have that the product of those two will be every element which is of the form (why?). Note that in this product, , we have and .

Now, we know what the **intersection** of two sets is, right? is the set of elements which is common to both and ; in other words, an element is in if and only if it is in both and . Okay, so now…

## Second Isomorphism Theorem!

Let’s state the theorem first.

**Theorem** (Second Isomorphism Theorem): Given is a group and is any subgroup of and is a normal subgroup of :

- The product is a subgroup of .
- The intersection is normal in H (meaning that is a normal subgroup of ).
- We have an isomorphism .

*Proof.* Let’s check **(1)** first because it’s the easiest. Is the identity in ? Yes. Is it closed under the group operation? If , this means that for and . Then . We use a clever trick, by multiplying the inside by an element and its inverse: we have that , and since is normal in this means that (why?) and so we have implying where we have made and . Obviously and , so . Whew.

We must last check to see if inverses are in this group. If then we have as above. What is going to be? . and because of ‘s normalcy, the latter factor is in , which means the inverse of is in . Therefore, is a subgroup.

Now, there was a lot of manipulating here, but make sure you understood it. This type of proof will come up time and time again when you have normalcy floating around.

Alright, onto part **(2)**. We want to show is normal in . This is the same as showing that for all . Given an element we have that and . Then we have that obvious, since all the elements are in , but notice also that is in due to its normalcy (since as well!). That means . How nice. This proves the second part.

The last part, part **(3)**, looks scary, but it isn’t. Let’s see…we want to make a map between and so that it similar to the first isomorphism theorem with the modding stuff out and all. It suffices to find a map with kernel since, if we do, we can apply the first isomorphism theorem and the two quotient groups in this theorem will be isomorphic.

Let’s define a map by , or, in other words, the coset multiplied by an element of . We need to show a few things:

- that this map is a homomorphism.
- that this map is surjective.
- that this map gives us a kernel of .

Once we have these things, we can finish the proof. This is obviously a homomorphism (check this for yourself!). Now, we prove that this is surjective. Suppose that is an element of (notice that this is a coset with coefficient in ). We want to show that some element from goes into it under . Well, this is kind of convenient: look at for a moment. We have that , so we have that (why?). Since we have that , and so this homomorphism is surjective.

Now, what exactly is the kernel of ? That is, what goes to the identity in ? Well, what is the identity in ? It is simply the coset ! So, we need elements such that which happens if and only if . Therefore, , which means that .

Now, we apply the first isomorphism theorem and we obtain the following: , but, of course the image of is and the kernel of is , which implies that . This completes the proof.

**Note that this proof requires** **to be normal in** **(in order to take the quotient), which I did not prove. This is up to the reader to prove!**

## Third Isomorphism Theorem.

Let’s state the result first:

**Theorem** (Third Isomorphism Theorem): Given a group and are normal subgroups of such that .

- We have is normal in , and
- We have the quotient .

My algebra professor, Prof. Herrmann, would often call this theorem by an adorable pet name: the freshman theorem. Why? Give something that looks like to a freshman math student, and he’ll probably guess (since it looks so much like a fraction!) that it’ll reduce to . Cute.

*Proof. * I’m not gonna get my hands dirty with **(1)**, you’re on your own with that. It’s really just a matter of showing normalcy, and it is very similar to the manipulating we did in the proof above.

For **(2)** we have to do a bit of fancy footwork. Let’s define the natural map as . This is called the **projection map **in some places; it’s just sending to its coset in . It should seem reasonable, then, that we have a map by defining it essentially the same way: . So the only thing that is doing is telling us to “forget about the ” and just send to where it should go in .

We need to prove that is surjective. If we have some , then we have and so we have .

Now we need to ask ourselves what the kernel of is. Well, if we have , then this implies that the elements that satisfy this are exactly those such that and such that . In other words, we have that implies that . Check this out, it makes sense. You may need to think about these last few sentences for a bit: they’re not ridiculously obvious.

Now that we have the kernel for we note, by the first isomorphism theorem, that . Since is surjective, , and since the kernel is , we have that . This concludes the proof.

## A Cauchy Break!

These last two theorems were much more tedious than the first isomorphism theorem, and, in fact, there is a fourth isomorphism theorem! I may write about that, but I probably won’t prove it. It’s kind of dull.

The kinds of proofs we did above are standard kinds of proofs: we run into this kind of thing all the time. With normalcy, we ordinarily use the trick where and insert terms cleverly into other terms, or see if we can get things into the form somehow. With cosets, we often use projection mappings. With isomorphisms, we ordinarily try to find a map with a nice kernel and use the first isomorphism theorem.

I’m going to conclude this post with the statement of cauchy’s theorem and one application of it. It’s pretty cute, no lie. Let’s define two terms before we start: the **order of a group** is simply how many elements are in the group. The notation is just . For example, if has 9 elements, then . The **order of an element in a group** is a little different; for an element , it is the smallest number such that , where 1 is the identity of . Confusingly enough, it is denoted the same way: as . For example, in the (the one where we rotated the square around) we have that and . Note that , which is why we call this group the dihedral group of *order* 8. Hope everything’s comin’ together for you.

**Theorem **(Cauchy’s Theorem): Let be a finite group and is a prime. If divides the order of the group, then there is an element of order in the group.

So what does this state? Suppose that . Well, since 3 and 7 go into 21 and 3 and 7 are primes, we must have an element of order 3 and an element of order 7 in .

Think about for a moment. As we noted above, has order 8, and the only prime that goes into 8 is 2. Do we have an element of order 2? Yes, we have . Note that this is not necessarily unique, since the element also has order 2 (since ).

We will not prove cauchy’s theorem, but we will use it to prove another cute theorem. Let’s define one more term before we pack up our things:

A group is **cyclic** if it is just the multiples of some element (usually called the **generator**). For example, if we take the number 2 and we keep taking multiples of it, then we will have a cyclic group. If we work in mod 12 arithmetic (clock arithmetic) we can take the element 3 and take all the multiples of it: we get 3, 6, 9, 12 = 0, 3, 6, 9, 12 = 0, … and so on. This means that is a cyclic subgroup of , which is the proper name of the integers mod 12.

Another cyclic group is something like: under multiplication. What is this group? Well, we have the elements , but we know that so we can reduce these elements to . This is also a cyclic group, and we say that **generates **it, since we’re taking multiples of .

Now, the theorem:

**Theorem**: Given a finite group such that and is a prime which divides , then has a cyclic subgroup which has order .

*Proof.* Think about this one yourself for a bit. Think of Cauchy. When you’re tired of thinking, or just wanna cheat, keep reading.

By Cauchy, since divides , there exists an element such that . We’re going to let generate a subgroup. Let . We have by assumption, and this is the smallest such number such that , which means that . Therefore, has order and is the subgroup we required to prove this theorem!

## The End of Groups as We Know it?

Certainly not! But this is the last of my group theory primers. For the types of things I’d like to cover in this blog there is not all that much more to know. Furthermore, if there are new things to know, I will want to introduce them a bit before we actually use them (like free groups before we go over certain fundamental groups). Without being able to apply these things to anything, you will quickly forget them; this is why I didn’t want to go step-by-step over every little thing at the beginning of a normal abstract algebra class. Either way, I highly recommend seeking the comforting questions tucked deeply within the pages of your favorite abstract algebra book: I use Dummit and Foote’s book, but I.N. Herstein is just as good. A much easier book is Frayleigh’s algebra textbook. Whatever book you have on abstract algbera is probably fine, and if you don’t have a book on abstract algbera, you’re going to have to be a clever little fox on the internet and find one.

So, what was the point of these primers? If you remember (or if you’re a new reader), the point of these was to use group theory to help us understand Linear Algebra. I wanted to be able to push things back and forth between matrices and groups and go over representation theory. This is a fun goal, but I feel I should modify it a bit. I feel that I should introduce my readers slowly to the theorems of representation theory, but focus on a primer to point-set topology. I have already written a primer on set theory, which I will eventually post with little modification.

The proofs of point-set topology will rely heavily on set theoretical notions, especially in the very beginning when we need to build up our machinery. Any readers who are not comfortable with set theory at the moment will be happy to know that all of the set theoretic concepts I use will be defined at some point in this blog. The interested and set-savvy reader should really start with Munkres (after the set theory chapter) for a great (if not a bit dry) introduction to point-set. I will be describing the same things, but I will emphasize slightly different aspects and I will, of course, be covering much less ground. If anyone has any suggestions or things they’d like to see covered, I’m open to it!