LECTURE NO.

11

DEFINITION AND EXAMPLES OF GROUPS COSETS

Dr.MUHAMMAD RASHAD
Department of Mathematics,
University of Malakand, Pakistan,
Email: rashad@uom.edu.pk

1. DEFINITION AND EXAMPLES OF GROUPS COSETS

Definition 1. right coset Let H be a subgroup of a group G, and a ∈ G, then
the set
Ha = {ha : h ∈ H}
is called right coset of H in G. The element a is a representative of aH.
Similarly
aH = {ah : h ∈ H}
is a left coset of H in G.
In general the right coset of a subgroup is different from its left coset. However,
aH = Ha, ∀a ∈ G, if the group operation is commutative.
Example 1. The following are examples cosets
(i) Let H = {1, −1} be a subgroup of (R − 0, ·} and a = 5 then aH = {5, −5} =
Ha is left as well as right coset of H in G.
(ii)
  
a b
G = : a, b, c, d ∈ R; ad − bc 6= 0
c d
is the group of all 2 × 2 matrices under matrix multiplication and
  
a b
H = : a, b, d ∈ R; ad 6= 0
0 d
is a subgroup of G, then for
 
1 2
A = ∈G
3 4
The set
    
1 2 a b
AH = · : a, b, d ∈ R; ad 6= 0
3 4 0 d
is a left coset of H in G determined by A. Similarly, the set
    
a b 1 2
HA = · : a, b, d ∈ R; ad 6= 0
0 d 3 4
is a right coset
 of H in G determined
by A.
(iii) Let G = e, f, g, gf, f g, g 2 withe f 2 = g 3 = (f g)2 = e be a group. Let
H = e, g, g 2  then
(i) H · e = e, g, g 2 .
1
2 BY Dr. MUHAMMAD RASHAD LECTURE 11 Definition and examples of Groups Cosets


(ii) H · f = f, gf, g 2 f = {f, gf, f g} because f 2 = e ⇒ f · f = e ⇒ f =
f −1 , g 3 = e ⇒ g 2 = g −1 , (f g)2 = e ⇒ f g = (f g)−1 = g −1 f −1 ⇒ f g =
g 2 f.  
(iii) H · g = g, g 2 , g 3 = e,g, g 2 .
(iv) H · g 2 = g 2 , g 3 , g 4 = e, g, g 2 .
(v) H · gf = gf, g 2 f, g 3 f = {g,  gf } .
f g,
(vi) H · f g = f g, g(f g), g 2 (f g) = f g, g(g 2 f ), g 2 (g 2 f ) = {f g, f, gf }
Thus we have only two  distinct right cosets that is
He = Hg = Hg 2 = e, g, g 2 and
Hf = Hf g = Hgf = {f, gf, f g}.
Definition 2. If H is a subgroup of (G, +) and a ∈ G, then the set
a+H = {a + h : h ∈ H}
is said to be the left coset of H in G determined by a. Similarly, the set
H +a = {h + a : h ∈ H}
is said to be the right coset of H in G determined by a.
Example 2. If H is a subgroup of a group G, then show that H itself is both left
coset and right coset of H in G
Solution 1. Since the identity element e of G is in G such that
eH = {eh : h ∈ H} = {h : h ∈ H} = H
and He = {he : h ∈ H} = {h : h ∈ H} = H
So H is both left and right coset of H in G.
 
Example 3. Let G =< a, a4 = e >= 1, a, a2 , a3 and H =< a2 >= e, a2 write
right(left) cosets of H in G.
Solution 2. Since G is a group generated by a, so all right and left cosets of H in
G are
   
(i) H · e = e · e, a2 · 1 = e, a2 = H and e · H = e · e, e · a2 = e, a2 =
H
   
(ii) H · a = e · a, a2 · a = a, a3 and a · H = a · e, a · a2 = a, a3
   
(iii) H · a2 = e · a2 , a2 · a2 = a2 , e and a2 · H = a2 · e, a2 · a2 = a2 , e
   
(iv) H · a3 = e · a3 , a2 · a3 = a3 , a and a3 · H = a3 · e, a3 · a2 = a3 , a .
Thus the distinct right(left) coset of H in G are H and Ha(aH), such that H ∩
aH(H ∩ Ha) = ∅ and H ∪ aH(H ∪ Ha) = G.
Example 4. Let Z6 = {0, 1, 2, 3, 4, 5} and H = {0, 2, 4} write all right(left) cosets
of H in G.
Solution 3. Since Z6 = {0, 1, 2, 3, 4, 5} is a group and H = {0, 2, 4} so all right
and left cosets of H in G are
(i) H + 0 = {0, 2, 4} = H and 0 + H = {0, 2, 4} = H
 LECTURE NO. 11 Definition and examples of group cosets 3

(ii) H + 1 = {1, 3, 5} and 1 + H = {1, 3, 5}

(iii) H + 2 = {2, 4, 0} = {0, 2, 4} = H and 2 + H = {2, 4, 0} = {1, 2, 4} = H

(iv) H + 3 = {3, 5, 1} = {1, 3, 5} = H + 1 and 3 + H = {3, 5, 1} = {1, 3, 5} =

1+H

(v) H + 4 = {4, 0, 2} = {0, 2, 4} = H and 4 + H = {4, 0, 2} = {0, 2, 4} = H

(vi) H + 5 = {5, 1, 3} = {1, 3, 5} = H + 1 and 5 + H = {5, 3, 1} = {1, 3, 5} =

1+H

Thus the distinct right(left) coset of H in G are H and H + 0(0 + H), such that
H ∩ 0 + H(H ∩ H + 0) = ∅ and H ∪ 0 + H(H ∪ H + 0) = G.

Example 5. Find all right coset of D4 , if H ⊂ G and H = {1, b}.


Solution 4. Since D4 =< a, b : a4 = b2 = (ab)2 = 1 >= 1, a, a2 , a3 , b, ab, a2 b, a3 b , H =
{1, b} so all right coset of H are
(i) H · 1 = {1 · 1, b · 1} = {1, b}

(ii) H · a = {1 · a, b · a} = a, a3 b
 
(iii) H · a2 = 1 · a2 , b · a2 = a2 , a2 b
 
(iv) H · a3 = 1 · a3 , b · a3 = a3 , ab

(v) H · b = {1 · b, b · b} = 1, b2
 
(vi) H · ab = {1 · ab, b · ab} = ab, b · ba3 = ab, a3
  
(vii) H · a2 b = 1 · a2 b, b · a2 b = a2 b, b · ba2 = a2 b, a2
  
(viii) H · a3 b = 1 · a3 b, b · a3 b = a3 b, b · ba = a3 b, a .
 
Example 6. Let G =< a, a8 = 1 >= 1, a, a2 , a3 , a4 , a5 , a6 , a7 and H = 1, a2 , a4 , a6
then find all right and left coset of H.

Solution 5. right coset

 
(i) H · 1 = 1 · 1, a2 · 1, a4 · 1, a6 · 1 = 1, a2 , a4 , a6
 
(ii) H · a = 1 · a, a2 · a, a4 · a, a6 · a = a, a3 , a5 , a7
 
(iii) H · a2 = 1 · a2 , a2 · a2 , a4 · a2 , a6 · a2 = 1, a2 , a4 , a6
 
(iv) H · a3 = 1 · a3 , a2 · a3 , a4 · a3 , a6 · a3 = a3 , a5 , a7 , a
 
(v) H · a4 = 1 · a4 , a2 · a4 , a4 · a4 , a6 · a4 = 1, a4 , a6 , a2
4 BY Dr. MUHAMMAD RASHAD LECTURE 11 Definition and examples of Groups Cosets

 
(vi) H · a5 = 1 · a5 , a2 · a5 , a4 · a5 , a6 · a5 = a5 , a7 , a, a3
 
(vii) H · a6 = 1 · a6 , a2 · a6 , a4 · a6 , a6 · a6 = 1, a6 , a7 , a4
 
(viii) H · a7 = 1 · a7 , a2 · a7 , a4 · a7 , a6 · a7 = a7 , a, a3 , a5

left coset
 
(i) 1 · H = 1 · 1, 1 · a2 , 1 · a4 , 1 · a6 = 1, a2 , a4 , a6
 
(ii) a · H = a · 1, a · a2 , a · a4 , a · a6 = 1, a2 , a4 , a6
 
(iii) a2 · H = a2 · 1, a2 · a2 , a2 · a4 , a2 · a6 = 1, a2 , a4 , a6
 
(iv) a3 · H = a3 · 1, a3 · a2 , a3 · a4 , a3 · a6 = a3 , a5 , a7 , a
 
(v) a4 · H = a4 · 1, a4 · a2 , a4 · a4 a4 · a6 = 1, a4 , a6 , a2
 
(vi) a5 · H = a5 · 1, a5 · a2 , a5 · a4 , a5 · a6 = a5 , a7 , a, a3
 
(vii) a6 · H = a6 · 1, a6 · a2 , a6 · a4 , a6 · a6 = 1, a6 , a7 , a4
 
(viii) a6 · H = a6 · 1, a6 · a2 , a6 · a4 , a6 · a6 = a7 , a, a3 , a5

Definition 3. Let H be a subgroup of a group G then for a, b ∈ G, we say that a

is left congruent to b modulo H ⇐⇒ a−1 b ∈ H that is
a ≡l b(modH) ⇐⇒ a−1 b ∈ H
a ≡r b(modH) ⇐⇒ ab−1 ∈ H

Theorem 1. Let H be a subgroup of a group G the relation

a ≡l b(modH) ⇐⇒ a−1 b ∈ H
a ≡r b(modH) ⇐⇒ ab−1 ∈ H
are equivalence relations on G, left congruence modulo H and right congruence
modulo H respectively the equivalence classes of left (right) congruence modulo H
are the left (right) cosets of H in G.
Proof. We prove the statement for left congruence and left cosets as similar proof
holds for the right case.
Reflexive: Since a−1 a = e ∈ H. Thus a ≡l b(modH)
Symmetric: Let a ≡l b(modH) then a−1 b ∈ H. Since H is a subgroup therefore
(a−1 b)−1 = ba−1 ∈ H so that b ≡l a(modH).
Transitive: Let a ≡l b(modH) and b ≡l c(modH) then a−1 b ∈ H and b−1 c ∈ H.
Since H is a subgroup therefore (a−1 b)(b−1 c) = a−1 c ∈ H so that a ≡l c(modH)
This establishes that left congruence modulo H is an equivalence relation on G 

Theorem 2. The left (right) cosets contain | H | elements.

LECTURE NO. 11 Definition and examples of group cosets 5

Proof. Let H be a subgroup of a group G and let aH be a left coset of H in G. We

show that H and aH have the same number of elements. For this let
φ : H −→ aH
be a mapping defined by φ(h) = ah, then clearly φ is onto as the elements of aH
are of the form ah for some choice of h ∈ H. Further φ is one-one as
φ(h1 ) = φ(h2 )
⇒ ah1 = ah2
⇒ h1 = h2
Hence there exists one-one correspondence between the elements of elements of H
and those of aH. Hence | H |=| aH |. 

Theorem 3. Let H be a subgroup of a group G then

(i) aH = bH ⇐⇒ a−1 b ∈ H.
(ii) Ha = Hb ⇐⇒ ab−1 ∈ H.
Proof. We only prove the first part as the second one is an easy consequence of the
first.
(i) Suppose that aH = bH. Then a ∈ bH i.e. a = bh for some h ∈ H. This
implies a−1 b = h−1 ∈ H:
Conversely: if a−1 b ∈ H then a−1 b = h for some h in H. This gives b = ah.
Now bH = ahH = a(hH) = aH as hH = H by previous theorem


Definition 4. A collection {Aα : α ∈ I} of subsets of a set A is called the partition

of A if
(i) A = ∪α∈I Aα
(ii) Aα ∩ Aβ = ∅ for α 6= β
Theorem 4. Let H be a subgroup of group G, then the set of all left(right) cosets
of H in G form a partition of G.
Proof. Suppose {aH : a ∈ G} is a collection of all left(right) cosets of H in G. Then
obviously
∪ aH ⊆ G (1.1)
a∈G

Next each element of G occurs in at least one coset. [For each a ∈ G, a ∈ aH as

a = ae.] Thus for each a in G,
a ∈ aH ⇒ a ∈ ∪ aH
a∈G
G ⊆ ∪ aH (1.2)
a∈G

Combining (1.1) and (1.2), we have

H = ∪α∈G aH (1.3)
Next, let aH and bH are two distinct left cosets of H in G, then we have to show
that that their intersection is an empty set. For this suppose on contrary that
aH ∩ bH 6= ∅ let x ∈ aH ∩ bH ⇒ x ∈ aH and x ∈ bH ⇒ x = ah1 , x = bh2 for
6 BY Dr. MUHAMMAD RASHAD LECTURE 11 Definition and examples of Groups Cosets

some h1 , h2 ∈ H. Then x = ah1 = bh2 ⇒ ah1 = bh2 ⇒ a = bh2 h−1 1 = bh3 where
h3 = h2 h−1
1 . Now for h ∈ H, ah ∈ aH, but ah = bh3 is also an element of bH so
aH ⊆ bH (1.4)
Similarly
aH ⊆ bH (1.5)
From Equations(1.4) and (1.5), aH = bH. Which contradict our supposition, hence
x∈/ aH ∩ bH ⇒ aH ∩ bH = ∅. Hence proved