Left and Right Cosets of Subgroups
Definition: Let
be a group and let
be a subgroup. Let
. Then the Left Coset of
with Representative
is the set
. The Right Coset of
with Representative
is the set
.
When the operation symbol “
” is used instead of
we often denote the left and right cosets of
with representation
with the notation
and
respectively.
For example, consider the group
and the subgroup
. Consider the element
. Then the left coset of
with representative
is:

And the right coset of
with representative
is:

In this particular example we see that
. But in general, is
for a given subgroup
of
and for
? The answer is NO. There are many examples when left cosets are not equal to corresponding right cosets.
To illustrate this, consider the symmetric group
. Let
. Then
is a subgroup of
since
,
is closed under
, and
,
(since
is a transposition). Now consider the element
. Then the left coset of
with representative
is:

And the right coset of
with representative
is:

We note that
and so
!
So, when exactly are the left and right cosets of a subgroup with representative
equal? The following theorem gives us a simple criterion for a large class of groups.
Proposition 1: Let
be a group and let
be a subgroup. If
is abelian then for all
,
.
- Proof: Let
. If
is abelian then for all
(and hence for all
) we have that
. So:

Proposition 2: Let
be a group,
a subgroup, and
. Then the following statements are equivalent:
a)
.
b)
.
c)
.
d)
.
e)
.
The Set of Left (Right) Cosets of a Subgroup Partitions the Whole Group
Recall that if
is a group,
is a subgroup, and
then the left coset of
with representative
is the set:

The right coset of
with representative
is the set:

We will now look at a nice theorem which tells us that the set of all left cosets of a subgroup
actually partitions
. The proof below can be mirrored to analogously show that the set of all right cosets of a subgroup
also partitions
.
Theorem 1: Let
be a group and let
a subgroup. Then the set of all left cosets of
partitions
.
Recall that a partition of a set
is a collection of nonempty subsets of
that are pairwise disjoint and whose union is all of
.
- Proof: We first show that any two distinct left cosets of
are disjoint. Let
,
and assume the left cosets
and
are distinct. Suppose that
. Then there exists an
. So
and
and there exists
such that:


- So using
and
we see that
. So
. But
since
is a group and is hence closed under
. So
. But this means that
, a contradiction since
and
distinct. So the assumption that
was false. So:

- Now if
is the identity element for
then
since
is a subgroup and must contain the identity element. So
for all
. So:

- Therefore the left cosets of
partition
.
Licensing
Content obtained and/or adapted from: