COSETS

Coset and Index of a Subgroup

Let G be a group, H ≤ G, and a, b ∈ G.

1. The right coset (left coset) of H containing a is Ha = {ha | h ∈ H} ⊆ G (aH = {ah | h ∈ H} ⊆ G).
• The set of right/left cosets of H in G forms a partition of G.
• Ha = Hb iff ab−1 ∈ H (aH = bH iff b−1 a ∈ H)
• G is abelian ⇒ Ha = aH
• #{left cosets of H in G} = #{right cosets of H in G} use the isomorphsim aH 7→ Ha−1
2. The index of H in G is [G : H] = no. of distinct right/left cosets of H in G.

• |aH| = |Ha| = |H| • [G : G] = 1 • [G : {e}] = |G|

3. Examples

• Left cosets of H = {(1), (12)} in S3 : (1)H = H, (13)H = {(13), (123)}, (23)H = {(23), (132)}
• Right cosets of H = {(1), (12)} in S3 : H(1) = H, H(13) = {(13), (132)}, H(23) = {(23), (123)}
• Cosets of 4Z in Z: 4Z + 0, 4Z + 1, 4Z + 2, 4Z + 3 in general, [Z : nZ] = n

Results from Cosets and Indices of Subgroups

1. tower of subgroups. Given: K ≤ H ≤ G

• [G : K] = [G : H][H : K] ˙
G = ∪Ha ˙
i , H = ∪Kbj , show K(bj ai ) = K(bt as ) ⇒ ai = as , bj = bt

• if any two indices are finite, then so is the third

2. theorem of Lagrange. Given: finite group G and H ≤ G
|G|
• |H| divides |G|, |H| = [G : H] use K = {e} in the previous theorem

3. finite order of elements. Given: finite group G

• |G| = n ⇒ |a| divides n and an = e, ∀a ∈ G use lagrange on hai
• |G| =prime ⇒ G is cyclic: G = hai, ∀e 6= a ∈ G ∃ a 6= e, |hai| =
6 1, |hai| = |G| (same finite order, subset)
4. consequences
∗
• Euler’s Thm. a is rel. prime to n ⇒ aϕ(n) ≡ 1(mod n) a|Zn | = 1, ∀a ∈ Z∗n
• Un : only subgroup of C∗ of order n H ≤ C∗ , |H| = n ⇒ z n = 1, ∀z ∈ H ∴ H = Un
• Zp : only group of prime order (up to isomorphism) only proper subgroup of Zp : h0i

Product and Intersection of Subgroups

1. Let H, K ≤ G and HK := {hk : h ∈ H and k ∈ K}. Then

• HK ≤ G iff HK = KH (⊇) subgrp test, (⊆) a ∈ HK, a−1 = hk, a = k −1 h−1
• HK ≤ G ⇒ HK = H ∨ K constructive, finite products of H, K, H −1 = H, and K −1 = K

2. Let H and K be finite subgroups of G.

|H||K|
• |HK| = . HK = ∪Hki , Hk1 = Hk2 iff k1 k2−1 ∈ H ∩ K
|H ∩ K|
• [H : H ∩ K] ≤ [G : K] < ∞, equality holds iff G = HK
• [G : H ∩ K] ≤ [G : H][G : K] < ∞, equality holds iff G = HK ex. [Z : 4Z ∩ 6Z] = [Z : 12Z] = 12 ≤ 4 · 6
blank ex. [Z : 3Z ∩ 4Z] = [Z : 12Z] = 12 = 3 · 4