Notes:Coset stuff
From Maths
Contents
[hide]Stuff
Let (G,×) be a group and let H⊆G be a subgroup. Proper or not. Then
- Any set of the form gH is called a left coset, where gH:={g×h | h∈H}
- Any set of the form Hg is called a right coset, where Hg:={h×g | h∈H}
H itself is a coset as eH=H clearly (for e the identity of G)
Claims
- For x,y∈G we can define an equivalence relation on G: x∼y⟺x−1y∈H[Note 1]. Done - Alec (talk) 21:23, 23 October 2016 (UTC)
- By symmetry this is/must be the same as y−1x∈H - this is true as H is a subgroup.
- ∀x,g∈G[x∈[g]⟺x∈gH]. Done - Alec (talk) 21:23, 23 October 2016 (UTC)
- For x,y∈G we can define another equivalence relation on G: x∼′y⟺xy−1∈H. Done - Alec (talk) 21:23, 23 October 2016 (UTC)
- By symmetry this is/must be the same as yx−1∈H - this is true as H is a subgroup.
- ∀x,g∈G[x∈[g]′⟺x∈Hg]. Done - Alec (talk) 21:23, 23 October 2016 (UTC)
Going forward
I have shown we get two equivalence relations. ∼ and ∼′ Thus we get two partitions of G.
Proof of claims
- x∼y⟺x−1y∈H is an equivalence relation
- Reflexive: x∼x holds
- Trivial, x−1x=e∈H as H a subgroup
- Symmetric: x∼y⟹y∼x
- Suppose x∼y, then x−1y∈H, i.e. ∃h∈H such that x−1y=h]
- Thus y=xh so e=y−1xh and lastly h−1=y−1x. Notice h−1∈H as H is a subgroup.
- So y−1x∈H too! And y−1x∈H⟺y∼x. As required.
- Suppose x∼y, then x−1y∈H, i.e. ∃h∈H such that x−1y=h]
- Transitive: ∀x,y,z∈G[(x∼y∧y∼z)⟹x∼z]
- Suppose x,y,z∈G given such that x∼y and y∼z then:
- ∃h1,h2∈H such that x−1y=h1 and
- As H is a subgroup h1h2∈H. So we see:
- h1h2=x−1yy−1z∈H, tidying up: x−1z∈H
- But x−1z∈H⟺x∼z
- ∃h1,h2∈H such that x−1y=h1 and
- Since the x,y,z were arbitrary we have shown this for all. As required.
- Suppose x,y,z∈G given such that x∼y and y∼z then:
- Reflexive: x∼x holds
-
- Let gH be a coset. I claim this is [g]. That is:
- x∈gH⟺x∈[g] (by the implies-subset relation and from gH⊆[g] and [g]⊆gH)
- ⟹
- Let x∈gH be given. Then ∃h1∈H[x=gh1]
- But then g−1x=h1 so g−1x∈H so g∼x or x∼g, Thus x∈[g] as [g]:={k∈G | k∼g}
- Let x∈gH be given. Then ∃h1∈H[x=gh1]
- ⟸
- Let x,g∈G be given, then we claim x∈[g]⟹x∈gH
- If x∈[g] then x∼g so x−1g∈H so ∃h2∈H[x−1g=h]
- Thus g=xh so gh−1=x
- As H is a subgroup h−1∈H. So gh−1∈gH so x=gh−1∈gH or just:
- If x∈[g] then x∼g so x−1g∈H so ∃h2∈H[x−1g=h]
- x∈gH as required.
- Let x,g∈G be given, then we claim x∈[g]⟹x∈gH
- ⟹
- x∈gH⟺x∈[g] (by the implies-subset relation and from gH⊆[g] and [g]⊆gH)
- Let gH be a coset. I claim this is [g]. That is:
- Follows by doing 1 again but with xy−1 instead
- Follows by doing 2 again, but slightly differently. I should copy and paste it and make the alterations.
Notes
- Jump up ↑ It must be this way as we will require x∼x, then we get x−1x=e∈H as H is a subgroup.