Group Actions
Prelim: Group Isomorphisms and Homomorphisms
Needed for Burnsides Lemma
Group Actions Introduction
Definition:
Let
Additionally, we have it so
Essentially we have Identity and associativity property.
Example:
Take the Dihedral group
For example, we can take a look at
Which is a group action.
Acting by conjugation
A group can act on itself by conjugation through the following definition:
Let
This works as we can prove identity and associativity through the following:
- Identity:
so .
- Associativity
- Let
. - Then
- Let
Orbits and Stabilizers
Orbits
Two elements in a set are G-equivalent if an element of
To reiterate, you can think of
Lets prove G-equvilance is a equivalence relation:
- Reflexive: x~x
- Clearly any group contains the identity, and we have defined group actions such that ex=x. Thus x~x
- Symmetry:
- Assume x~y. 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 y~x
- Assume x~y. There there exists g s.t.
- Transitivity:
- Assume x ~ y and y ~ g. Then we have it so
and . - From here, we can show
. - Then
and as it is a group. thus x~z
- Assume x ~ y and y ~ g. Then we have it so
Stabilizer
Stabilizers are the subgroup of elements
Proving that is a subgroup of :
- Identity:
- By definition
fixes every element, thus
- By definition
- Closure:
- Let
. Then, as both elements fix x. Thus
- Let
- Inverses:
- Suppose
. Then , so and we have it that is also in .
- Suppose
Example
Lets consider
First note: $$D_4 = {e,r^1,r^2,r^3,s,sr^1,sr^2,sr^3}$$
Which I drew out and represented as permutations in
and $$X = {1,2,3,4}$$
for the
You can observe all these stabilizer groups are isomorphic to
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
- we saw that
and so . - The size of
- Lastly, size of
. So we know there are 4 cosets of in - Thus,