Lemmas and Closure of Cosets

Lemma

  1. For each gG we have ggH (see Left and Right Cosets)
  2. For a given g1,g2G we have g1g2Hg21g1H.
  3. For any pair of elements g1,g2G we have either g1Hg2H= or g1H=g2H. This means that the left-cosets Partition G

Proof

(1): g=g1gH since 1H. Thus ggH

(2):
(): Suppose g1g2H. Then:

g1=g2h

for some hH. Now then:

g21g1=hH

(): Suppose g21gH. Then g21g1=h for some hH. Then:

g1=g2hgH

(3): If the sets are distinct then we are done, so suppose g1Hg2H. We want to show that g1H=g2H as a result. Choose some element:

g0(g1H)(g2H)

Let's show that g1Hg2H. Take any g1hg1H where hH. Again, we want to show that g1hg2H. Using (2), we have to show that g21g1H which is equivalent to showing:

(g21g1)hH

Notice that g0g1H so then nH where g0=g1n. Further, notice g0g2H so then there is some mH where g0=g2m. Thus:

g1n=g2m

So notice that:

g21g1=mn1H

which is what we wanted! Thus g1Hg2H. Without loss of generality, we can do the same argument with g1 and g2 swapped, so then g2Hg1H. 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).

Drawing canvas

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