## A Very Basic Introduction to the Sylow Theorems.

### May 18, 2012

[Note: It’s been a while! I’ve now completed most of my pre-research stuff for my degree, so now I can relax a bit and write up some topics. This post will be relatively short just to “get back in the swing of things.”]

In Group Theory, the big question used to be, “Given such-and-such is a group, how can we tell which group it is?”

The Sylow Theorems (proved by Ludwig Sylow, above) provide a really nice way to do this for finite groups using prime decomposition. In most cases, the process is quite easy. We’ll state the theorems here in a slightly shortened form, but you can read about them here. Note that subgroup which is of order for some is unsurprisingly called a -subgroup. A -subgroup of maximal order in is called a *Sylow *-subgroup.

**Theorem (Sylow)**. Let be a group such that for . Then,

- There exists at least one subgroup of order .
- The Sylow -subgroups are conjugate to one-another; that is, if are Sylow -subgroups, then there is some such that . Moreover, for all , we have that is a Sylow -subgroup.
- The number of Sylow -subgroups of , denoted by , is of the form . In other words, divides .

This first part says that the group of Sylow -subgroups of is not empty if divides the order of . Note that this is slightly abbreviated (the second part is actually more general, and the third part has a few extra parts) but this will give us enough to work with.

**Problem: **Given a group for prime and , is ever simple (does it have any nontrivial normal subgroups)? Can we say explicitly what is?

We use the third part of the Sylow theorems above. We note that and , but so this immediately implies that (why?). So we have one Sylow -subgroup; let’s call it . Once we have this, we can use the second part of the Sylow theorem: since for each we have is a Sylow -subgroup, but we’ve shown that is the only one there is! That means that ; this says is normal in . We have, then, that isn’t simple. Bummer.

On the other hand, we can actually say what this group is. So let’s try that. We know the Sylow -subgroup, but we don’t know anything about the Sylow -subgroups. We know that and , but that’s about it. There are two possibilities: either or .

For the first case, by using the modular relation, if does not divide then this forces ; this gives us a unique normal Sylow -subgroup . Note that since the orders of our normal subgroups multiply up to the order of the group, we have ; in other words, .

For the second case, . We will have a total of subgroups of order and none of these are normal. This part is a bit more involved (for example, see this post on it), but the punch line is that it will be the cyclic group .

I’ll admit that the last part is a bit hand-wavy, but this should at least show you the relative power of the Sylow theorems. They also come in handy when trying to show something either does or does not have a normal subgroup. Recall that a simple group has no nontrivial normal subgroups.

**Question. **Is there any simple group with ?

I just picked this number randomly, but it works pretty well for this example. We note that . Let’s consider, for kicks, . We know must divide and it must be the case that ; putting these two facts together, we get . This immediately gives us a normal subgroup of order 11, which implies there are *no simple groups *of order 165.

**Question. **Is there any simple group with ?

Alas, alack, you may say that 777 is too big of a number to do, but you’d be *dead wrong*. Of course, . Use the same argument as above to show there are no simple groups of this order.

**Question. **Is there any simple group with ?

Note that so we need to do a little work, but not much. Just for fun, let’s look at . We must have that it is 1 modulo 7 and it must divide . Hm. A bit of thinking will give you that , which gives us the same conclusion as above.

Of course, there are examples where this doesn’t work nicely. Think about the group of order 56, for example. In order to work with these kinds of groups, one must do a bit more digging. We will look into more of this later.