Orbit, stabilizer and kernel

Definition 1.

Let be a group action. For , define the orbit of by

Note that , and does not have any group structure.

Definition 2.

Let be a group action. For , define the stabilizer of by

It is easy to verify that for all .

Definition 3.

The kernel of a group action is the set of all elements for which is the identity on :

Note that .

Example 4.

In this example, , and , which is just the union of the inverse images of and . Ditto for and . The kernel is .

Example 5.

Let and . Let be defined by , ., acts on by left multiplication (verify that this is a group action).

For , , .
For , , .


Groups acting on themselves

Let be a group, and . Standard group actions include

  1. Left multiplication: .
  2. Right multiplication: .
  3. Conjugation: . The stabilizer of under conjugation, also denoted by , is called the centralizer of . It is the set of all which commute with . Note that the orbit of , , is the conjugacy class of . The centralizer of any subset is similarly defined.

can also act on for some : .

Theorem 6.

Let be a group, let , let act by left multiplication on . Let be the permutation representation. Then,

  1. this action is transitive.
  2. the stabilizer of is .
  3. the kernel of the action is , and is the largest normal subgroup of contained in .

Proof
To see (1), observe that for any two cosets , . Thus, any two arbitrary elements of lie in the same orbit.

For (2), we have

For (3), we already know that the kernel of a group action is the intersection of all stabilizers, so . We know that . Further, if , then , so . Thus, . Let be a normal subgroup of contained in . For every , conjugation by is an automorphism, so implies . But , so we have for all . This implies

Thus, is the largest normal subgroup of contained in .

Theorem 7(Corollary).

Let be the smallest prime dividing the order of a group . Then, any subgroup of of index is a normal subgroup.

Proof
Suppose and . Let be the permutation representation of acting on the set of all left cosets of in by left multiplication (just to be clear, ). Let . Then, and . Let . Then, .

From the first isomorphism theorem, . Since , divides . So, divides . Thus . But, since is a subgroup of , , and so all prime divisors of are greater than or equal to , forcing to be . So, .


Centralizer and normalizer

Definition 8.

The centralizer of is the set of elements of which commute with every element of . Denoted by or .

It can easily be shown that for all .

Definition 9.

The center of a group is defined to be , the set of all elements in which commute with every element of . Also denoted by .

It follows that .

Definition 10.

The normalizer of in is the set of all that satisfy : .

It can be shown that for all .
More details here.
Examples of how to find these here.

Note the crucial difference between the centralizer and the normalizer:

It follows that , and since is a group, we have .

To summarize:

Important

for all .

How these arise naturally from group actions

Let be a group. Let be the power set of . Let act on by conjugation:

Let . Under this action, the normalizer of in is the stabilizer of : .

Next, let the group act on by conjugation:

Under this action, the centralizer of in is the kernel: .

Next, let the group act on by conjugation:

Under this action, the center of is the kernel: . So, we have .

Some theorems

Theorem 11.

If is cyclic, then is abelian.

Proof
Let for some . Then, any can be expressed as for some integer and . Let , , . Then, , and . Therefore, is abelian.


Second isomorphism theorem

Theorem 12.

Let be a group, let and be subgroups of and assume . Then,

  1. ,
  2. ,
  3. , and
  4. .

Proof
follows from here. Since and , , so . This allows us to define the homomorphism

It is easy to see that is a homomorphism: . Clearly, . Thus, . Additionally, since is surjective, the first isomorphism theorem gives .