Double cosets
Definition 96.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 96.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.
Remark 96.3.
More generally, an action of a group on an object of a category is simply a homomorphism
We will be exclusively dealing with the case , so .
Remark 96.4(Aluffi (2009) Exercise III.9.3).
bee0cfWhat we’ve defined above is a left group action. A right action would associate to each pair with and an element , such that for all , and . This is a different requirement than the one given above. Multiplication on the right in a group gives a prototypical example of a right action.
Every right action may be turned into a left action, as follows. If is a group, define the ‘opposite group’ supported on the same set , by prescribing
It is easy to verify that is indeed a group. The identity map is an isomorphism iff is commutative. However, even if is not commutative, the map given by is an isomorphism, so . Now, a right action of on a set is a map such that . However, since , is a homomorphism . ==Thus, giving a right action of on a set is the same as giving a left action of on ==. We therefore do not lose anything by restricting our study to left actions1.
If is injective, then it is said to be faithful or effective.
Example 96.5.
ec904dLet and , the latter as defined in Exm 92.9. Let be defined by
satisfies the properties of a group action. Note that the curried version of is not injective here, as .
Theorem 96.6(Cayley's theorem).
3ca8d2Any 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, .□
Footnotes
-
the defining map is a homomorphism for left group actions, unlike for right group actions, as seen here. The only reason for this is the manner in which we define function composition: is ‘first then ‘. ↩