Lemmas and Closure of Cosets

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.