Double cosets
Definition 1.
Let and be subgroups of . Define
The double cosets of and partition . To see this, define an equivalence relation on by
if for some and . It is easy to see that is reflexive and symmetric. If and , then and , which gives . Thus, is transitive. It follows that is an equivalence relation and therefore partitions .
Remarks:
- If is normal, then .
- If is not normal, then contains a left coset and a right coset, namely and .
Group actions
Definition 2.
Let be a group and let be a set. We say that acts on if we have a map ( is denoted by ), called a group action, satisfying
- , and
- and .
It can be notationally convenient to curry , so that it instead maps from to the set of maps , with each being associated with a map satisfying
is the identity on , and
.
It is easy to see that is a bijection for all :
- .
- for all , , ., .
Thus, the codomain of can be reduced to the symmetric group , the group of all bijections from to . This along with the defining properties of a group action makes a group homomorphism.
If is injective, then it is said to be faithful or effective.
Example 3.
Let and , the latter as defined here. Let be defined by
satisfies the properties of a group action. Note that the curried version of is not injective here, as .
Cayley’s theorem
Theorem 4.
Any group of order is isomorphic to a subgroup of .
Proof
Let act on itself by left multiplication. That is, define by , . Note that is the identity on , and . Thus, is a group action. If , then for all , which implies , making injective. Note being a homomorphism makes is a subgroup of . So, defined by is a bijective homomorphism, or an isomorphism. Thus, .