Prelim: Group Isomorphisms and Homomorphisms Needed for Burnsides Lemma

Group Actions Introduction

Definition:

Let be a group and be a set. Then we can define a group action as: Additionally, we have it so and for all and . Essentially we have Identity and associativity property.

Example:

Take the Dihedral group acting on a regular n-gon. This is a group action where the elements of act on the vertices of the n-gon (which is a set of n elements).

For example, we can take a look at acting on the vertices of a square; . Then we know and this acts on the vertex by sending it to . i.e. . Clearly: Which is a group action.

Acting by conjugation

A group can act on itself by conjugation through the following definition: Let be a group and let . Then a group acts on itself via conjugation via: This works as we can prove identity and associativity through the following:

  1. Identity:
    1. so .
  2. Associativity
    1. Let .
    2. Then

Orbits and Stabilizers

Orbits

Two elements in a set are G-equivalent if an element of can take the first element to the second. Rigorously, x is G-equivalent to y if such that . This creates an equivalence relation where all the classes are called orbits, denoted and the specific orbit of x (all the places where G takes x) is denoted .

To reiterate, you can think of as all the places takes

Lets prove G-equvilance is a equivalence relation:
  1. Reflexive: x~x
    1. Clearly any group contains the identity, and we have defined group actions such that ex=x. Thus x~x
  2. Symmetry:
    1. Assume xy. There there exists g s.t. . However, this means and as G is a group and has inverses clearly the inverse of g is in G. Thus yx
  3. Transitivity:
    1. Assume x ~ y and y ~ g. Then we have it so and .
    2. From here, we can show .
    3. Then and as it is a group. thus x~z

Stabilizer

Stabilizers are the subgroup of elements that do not move an element . i.e. collection of where . This is denoted as for all elements in which fix . This creates a subgroup in .

Proving that is a subgroup of :
  1. Identity:
    1. By definition fixes every element, thus
  2. Closure:
    1. Let . Then, as both elements fix x. Thus
  3. Inverses:
    1. Suppose . Then , so and we have it that is also in .

Example

Lets consider acting on the vertices of a square. What are the orbits and stabilizers? First note: Which I drew out and represented as permutations in here and for the we see that 1 can go anywhere through just the rotations. So we only have one orbit and all the vertices are G-equivalent. Then, for the stabilizer of 1, or . Clearly these elements fix r, and so this is a subgroup isomorphic to . I put the stabilizer groups for every element bellow: You can observe all these stabilizer groups are isomorphic to and are all subgroups of .

Connection

The size of the orbit of x is the same as the number of left cosets of the stabilizer group in G. We can show this here: #review proof if you have time. For

  1. we saw that and so .
  2. The size of
  3. Lastly, size of . So we know there are 4 cosets of in
  4. Thus,