Definition
Let (G,×) be a group and (H,×) a subgroup we denote cosets as follows:
Given any g∈G the
- Left coset (the left coset of H in G with respect to g)
- is denoted gH={gh|h∈H}
- Right coset (the right coset of H in G with respect to g)
- is denoted Hg={hg|h∈H}
It is quite simply: the set of everything in H (pre/post) multiplied by g
Properties
These will be stated for the left coset definition, but the right version is basically the same
Membership
To say x∈gH is to say ∃y∈H:x=gy that is:
Cosets are either disjoint or equal
[Expand]
Given two cosets, g1H and g2H we have either g1H=g2H or g1H∩g2H=∅
Suppose they are not disjoint⟹ they are equal
- If they are not disjoint, then take any k∈g1H∩g2H, this means k is in both g1H and g2H so:
- k∈g1H⟹∃z1∈H:k=g1z1
- k∈g2H⟹∃z1∈H:k=g2z2
- This means g1z1=g2z2 allowing us to say:
- g1=g2z2z−11 where z2z−11∈H
- g2=g1z1z−12 where z1z−12∈H
- We now need to show equality of sets
- g1H⊆g2H, that is x∈g1H⟹x∈g2H
- Take x∈g1H, this means x=g1y1 for some y1∈H
- Using g1=g2z2z−11 we see x=g2z2z−11y1
- but z2z−11y1∈H so let h1=z2z−11y1∈H then
- x=g2h1∈g2H
- we have shown x∈g1H⟹x∈g2H if they are not disjoint, thus g1H⊆g2H
- g2H⊆g1H, that is x∈g2H⟹x∈g1H
- Take x∈g2H, this means x=g2y2 for some y2∈H
- Using g2=g1z1z−12 we see x=g1z1z−12y2
- but z1z−12y2∈H so let h2=z1z−12y2∈H then
- x=g1h2∈g1H
- we have shown x∈g2H⟹x∈g1H if they are not disjoint, thus g2H⊆g1H
- Combining these we see g1H∩g2H≠∅⟹g1H=g2H
Suppose they are disjoint⟹ they are not equal
- If they are disjoint then trivially the sets g1H and g2H are not equal.
So we may conclude
[g1H=g2H]⟺[g1H∩g2H≠∅]
See also