## Applying Lagrange!: Groups of Prime Orders.

### June 29, 2010

Little post. Because I love doing things that comments tell me to do, we’re going to use Lagrange to prove a neato theorem. Now, normally, if I told you, “Hey, guy, I’ve got a group with elements. What one is it?” you’d probably be unable to tell me! Why? Lots of different groups have the same order! For example, if we’re talking about order 8, are we talkin’ ? Are we talkin’ ? Are we talkin’ ? I just don’t know!

But! If the order of the group is prime, Lagrange’s Theorem tells us that the group *must *be cyclic. No way out of it! But let’s prove it just to be sure.

Let’s introduce a little notation before we do this, just to make things easier. Let’s denote **the cyclic group generated by the element x** as with those little brace-things around it. So we have that, by definition .

** **

**Theorem **(Classification of Groups of Prime Order): If a group has prime order, then it is cyclic.

*Proof. *Okay, talk about slick proofs, I love this one: Cauchy’s theorem tells us there’s an element of order , so consider the group . This is a subgroup of the group and it has the same order. Therefore, it must be the case that . Then is cyclic. Bam.

*Alternate Proof. *Alright, another proof of this. Since we have that there is a non-identity element in . Let this non-identity element be called . Then consider . Certainly, we have that since it has at least the identity and the element in it, and by Lagrange, since it is a subgroup, it must divide the order of the group. Since the order of the subgroup is greater than 1, and only 1 and divide the order of the group, it must be the case that , which means that .