*in which we meet orbits and stabilisers and prove the Orbit-Stabiliser Theorem.
*

Given an action of on , we can look at which elements of can be “reached” from a particular . The **orbit** of is . The **stabiliser** of is , all the elements of which keep fixed. Notice that I tend to write these orb and stab sometimes with lower-case letters and sometimes with capital letters; that has no significance. We proved that the **stabilisers are subgroups** of (rather than just subsets), and defined an action as **transitive** if the orbit of any element is the whole set . We showed that the **orbits of an action partition** the set , and this helped us to prove the **Orbit-Stabiliser Theorem**: If a finite group acts on a set , then for any we have . Beardon calls this a “geometric version of Lagrange”, and we proved it by “turning it into Lagrange”: The left cosets are the sets which contain all which take to , and there is exactly one for each element in the orbit of . In the example of acting on , we saw that while we always get the same product, the orbits (and stabilisers) need not all have the same size. The Orbit-Stabiliser Theorem is also very useful in helping us find for example stabilisers, because it tells us how big they are to begin with. This helped us prove that the stabiliser of in really is .

Equipped with Orbit-Stabiliser, we started looking at some standard actions. Today we investigated the** left regular action** of on itself, by left multiplication. This is faithful and transitive. It also implies **Cayley’s Theorem**: every group is isomorphic to a subgroup of some symmetric group. We will have more standard actions next time.

**Understanding today’s lecture**

Orbits and stabilisers are really fun once you get your teeth into them. And the Orbit-Stabiliser Theorem is so immensely useful! Remember to try and use it whenever you want to find a stabiliser. It is also useful in other situations of course. The standard actions you will have to get used to, they will keep cropping up. We’ve just had one so far, so you have time to play with that one before we get the others.

**Preparing for Lecture 15
**

We will get to know more standard actions next time. The left coset action of a group on left cosets of a subgroup , and the very important conjugation action. Conjugating an element by an element means taking the element . You could think already why this will give an action. We will prove that acts on itself by conjugation, but there are also other sets that can act on by conjugation: on any normal subgroup , or on the set of subgroups of . We will see some applications of actions, for example we will work more on the rotations of the cube. So if you haven’t made your own “Taylor cube” yet, now would be a good time, and you could even bring it to the next lecture. Though in fact for this next bit, any cube will do :-). You can also read up on Cauchy’s Theorem: there is an element of order for any prime dividing the order of the group. That will be a longish proof, so reading ahead might help. There are several different versions of proof. I’m not sure if we will get there next time, but certainly the one after that.

**Going a little deeper**

We proved today that every group is isomorphic to a subgroup of some symmetric group. In the proof we in fact saw that is isomorphic to a subgroup of . Now that is in general a very very large group. Many groups are subgroups of much smaller symmetry groups. The most obvious one being : it is the (whole) group of symmetries on elements, whereas our proof of Cayley would give it to us as a subgroup of , which is much bigger. And we’ve seen that the dihedral group can be viewed as a subgroup of , rather than as a subgroup of which Cayley would give us. So Cayley doesn’t give us the *best* way of seeing as symmetries, but it does show there is always at least *one*!

There was a mistake in one of the examples of stabilisers in this lecture. You can see the correction plus an added bonus-example for free.

LikeLike