Lemmas and Closure of Cosets
- 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): since . Thus
(2):
: Suppose . Then:
for some . Now then:
: Suppose . Then for some . Then:
(3): If the sets are distinct then we are done, so suppose . We want to show that as a result. Choose some element:
Let's show that . Take any where . Again, we want to show that . Using (2), we have to show that which is equivalent to showing:
Notice that so then where . Further, notice so then there is some where . Thus:
So notice that:
which is what we wanted! Thus . Without loss of generality, we can do the same argument with and swapped, so then . 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).
See also Left (and Right) Cosets form a Partition in G.