12 Quotient Groups
For any
be called (respectively) a left coset and a right coset of
We denote the set of left cosets by
In general
Examples
Say we have
1 | |
Notice that these are partitioned. Namely name: |
creating a partition of 3 elements.
For one right coset see the order matters:
- For each
we have (see Left and Right Cosets) - For a given
we have . - For any pair of elements
we have either or . This means that the left-cosets Partition
Proof
(1):
(2):
for some
(3): If the sets are distinct then we are done, so suppose
Let's show that
Notice that
So notice that:
which is what we wanted! Thus
☐
This is a different method of proving things we saw in Left (and Right) Cosets form a Partition in G (you can see the similarities, but different lemmas are used here).
For any
(see Left and Right Cosets) In fact, the following are equivalent:
for any for all for all for all (see Normalizer) (see Normal Subgroup) (comes directly from (5))
Proof
For the former, we'll do both directions:
so then there is some
thus proving (3), namely
We just need to prove that
So choose
as we needed to verify. Thus then:
☐
Let
(see Normalizer). Which means you get the equivalence of Equivalences for Normal Subgroups.
We'll use the notation
Example
Recall our Left and Right Cosets#Examples
thus
is normal.