12 Quotient Groups

left/right cosets

For any N≤G (see Subgroup) and any g∈G let:
gN={gn|n∈N};Ng={ng|n∈N}
be called (respectively) a left coset and a right coset of N in G. Any element of a coset is called a representative for the coset.

We denote the set of left cosets by GH, as we see in Quotient Group.

Warning

In general gH≠Hg for all g∈G. Essentially, once the left/right cosets agree with each other, then we have a Normal Subgroup specifically for that H.

Examples

Say we have G=S3 (see Symmetric Group & Permutations) and H=⟨(1 2)⟩{1,(1 2)}. Then the left-cosets of H are;

g∈G gH
1 {1 1,1(1 2)}={1,(1 2)}=H
(1 2) {(1 2)1,(1 2)(1 2)}={(1 2),1}
(1 3) {(1 3),(1 2 3)}
(2 3) {(2 3),(1 3 2)}
(1 2 3) {(1 2 3),(1 3)}
(1 3 2) {(1 3 2),(2 3)}
Notice that these are partitioned. Namely name:
  • 1H,(1 2)H=C1
  • (1 3)H,(1 2 3)H=C2
  • (2 3)H,(1 3 2)H=C3
    creating a partition of 3 elements.
Note

For one right coset see the order matters:
H(1 3)={1(1 3),(1 2)(1 3)}={(1 3),(1 3 2)}≠(1 3)H

Lemma

  1. For each g∈G we have g∈gH (see Left and Right Cosets)
  2. For a given g1,g2∈G we have g1∈g2H⟺g2−1g1∈H.
  3. For any pair of elements g1,g2∈G we have either g1H∩g2H=∅ or g1H=g2H. This means that the left-cosets Partition G

Proof

(1): g=g⋅1∈gH since 1∈H. Thus g∈gH

(2):
(⇒): Suppose g1∈g2H. Then:
g1=g2h
for some h∈H. Now then:
⇒g2−1g1=h∈H
(⇐): Suppose g2−1g∈H. Then g2−1g1=h for some h∈H. Then:
g1=g2h∈gH
(3): If the sets are distinct then we are done, so suppose g1H∩g2H≠∅. We want to show that g1H=g2H as a result. Choose some element:
g0∈(g1H)∩(g2H)
Let's show that g1H⊆g2H. Take any g1h∈g1H where h∈H. Again, we want to show that g1h∈g2H. Using (2), we have to show that g2−1g1∈H which is equivalent to showing:
(g2−1g1)h∈H
Notice that g0∈g1H so then n∈H where g0=g1n. Further, notice g0∈g2H so then there is some m∈H where g0=g2m. Thus:
g1n=g2m
So notice that:
g2−1g1=mn−1∈H
which is what we wanted! Thus g1H⊆g2H. Without loss of generality, we can do the same argument with g1 and g2 swapped, so then g2H⊆g1H. Thus g1H=g2H.

☐

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).

See also Left (and Right) Cosets form a Partition in G.

Lemma

For any H≤G (see Subgroup) and g∈G we have:
gH=Hg⟺gHg−1=H
(see Left and Right Cosets) In fact, the following are equivalent:

  1. gH=Hg for any g∈G
  2. gHg−1=H for all g∈G
  3. gHg−1⊆H for all g∈G
  4. ghg−1∈H for all g∈G
  5. NG(H)=G (see Normalizer)
  6. H⊴G (see Normal Subgroup) (comes directly from (5))

Proof

For the former, we'll do both directions:

(⇒): Suppose gH=Hg. Take any h∈H where then:
gh∈gH=Hg⇒gh∈Hg
so then there is some h′∈H where gh=h′g. Thus:
ghg−1=h′∈H
thus proving (3), namely gHg−1⊆H.

We just need to prove that H⊆gHg−1. So take any h∈H. We want to show (want to find) some h′∈H such that h=gh′g−1. So then we'd want h=gh′g−1⇐g−1hg.

So choose h′:=g−1hg. Now notice that hg∈Hg=gH. Thus then hg=gh~ for some h~∈H. Then:
h′=g−1hg=g−1(gh~)=h~∈H
as we needed to verify. Thus then:
⇒h=g(g−1hg)g−1∈gHg−1⇒H⊆gHg−1

☐

normal

Let H≤G be normal if:
NG(H)=G
(see Normalizer). Which means you get the equivalence of Equivalences for Normal Subgroups.

We'll use the notation K⊴G when K is normal to G.

Example

Recall our Left and Right Cosets#Examples G=S3 with H=⟨(1 2)⟩={1,(1 2)}. Then we saw that:
(1 3)H≠H(1 3)
thus H is not normal. On the other hand if we have:
K=⟨(1 2 3)⟩={1,(1 2 3),(1 3 2)}
is normal.