Past Paper: Group Theory I

OHT-II, 2022

Rashid M. Talha

Disclaimer: Use at your own risk. Errors possible.

Question 1.
Suppose ak is a generator of G. Then, we can write a as a power of ak , say, a = (ak )m = akm
for some m ∈ Z.
Then, a = akm =⇒ aa−km = e =⇒ a1−km = e. So, n | 1 − km. That is ∃q ∈ Z such
that 1 − km = qn. We can re-arrange this to get qn + km = 1. From number theory, this
implies gcd(n, k) = 1 (Bezout’s lemma).
Conversely, suppose gcd(n, k) = 1. Then, there exist integers x, y such that xk + yn = 1.
So, a = a1 = axk+yn = axk ayn = (ak )x (an )y = (ak )x ey = (ak )x .
Now, for all b ∈ G = ⟨a⟩, we have b = ar for some r ∈ Z. Therefore, we can write it as a
power of ak as b = ar = ((ak )x )r = (ak )xr . So, ak also generates G.
Question 2 (i).
Sk
Let a1 H, . . . , ak H be all the distinct cosets of H in G. Then, G = j=1 aj H because for
all g ∈ G, g ∈ aj H for some j.
Moreover, |aH| = |bH|, for all a, b ∈ G. In particular, |aj H| = |eH| = |H| for all j.
Now, since G is written as a union of distinct sets, we have

|G| = |a1 H| ∪ · · · ∪ |ak H| = |H| ∪ · · · ∪ |H| = k|H|.

Therefore, |H| divides |G|.

Question 2 (ii).
Suppose aH = bH. As H ≤ G, we have e ∈ H. So, b = be ∈ bH = aH. Thus, we can
write b = ah for some h ∈ H. Consequently, a−1 b = h ∈ H.
Conversely, let a−1 b ∈ H. This means a−1 b = h for some h ∈ H. As a result, b = ah.
Therefore,

bH = {bk | k ∈ H} = {(ah)k | k ∈ H} = {ah′ | h′ ∈ H} = aH.

Here we used the associativity and closure property because H ≤ G.

Question 3.
We have O(a4 ) = 6. So, |H| = O(a4 ) = 6. Also, |C24 | = 24.

|C24 | 24
[C24 : H] = = = 4.
|H| 6

–1–
 Past Paper: Group Theory I

Question 4 (i).
Firstly note that there are exactly [Z15 : H] = |Z15 |/|H| = 15/5 = 3 distinct (left) cosets
of H in Z15 . These are {H, 1 + H, 2 + H}. So,

Z15 = H ∪ (1 + H) ∪ (2 + H).

Here, 1 + H = {1, 4, 7, 10, 13} and 2 + H = {2, 5, 8, 11, 14}.

Question 4 (ii).
Find all the subgroups of Z15 .
Solution. Z15 is a cyclic group, so all of its subgroups are also cyclic. We arrange these
by the GCD of n = 15 and the order of the generator.

gcd = 1 : ⟨1⟩ = {1}

gcd = 3 : ⟨a5 ⟩ = ⟨a10 ⟩ = {1, a5 , a10 }
gcd = 5 : ⟨a3 ⟩ = ⟨a6 ⟩ = ⟨a9 ⟩ = ⟨a12 ⟩ = {1, a3 , a6 , a9 , a12 }
gcd = 15 : ⟨a⟩ = ⟨a2 ⟩ = ⟨a4 ⟩ = ⟨a7 ⟩ = ⟨a8 ⟩ = ⟨a11 ⟩ = ⟨a13 ⟩ = ⟨a14 ⟩ = Z15

Question 5.
This is not an equivalence relation because it is not transitive.
/
We have −1R0 because (−1)(0) = 0 ≥ 0, and 0R1 because (0)(1) = 0 ≥ 0, but −1R1
because (−1)(1) = −1 ≱ 0.

–2–