THE CHINESE UNIVERSITY OF HONG KONG
Department of Mathematics
MATH 2070 Algebraic Structures 2024-25 Term 2
Coursework 1 Sample Solutions
Name: Student ID: Score:
1. Show that for every element g in a group G, we have:
(g −1 )−1 = g.
Let h = g −1 . Since g −1 is the inverse of g, we have:
hg = g −1 g = e
and
gh = gg −1 = e.
It now follows from the uniqueness of the inverse of the group element h that:
−1
g = h−1 = g −1 .
2. Show that for all g, h in a group G, we have:
(gh)−1 = h−1 g −1 .
Let e denote the identity element of G. By the associativity of the group operation, we
have:
(h−1 g −1 )(gh) = h−1 (g −1 g)h = h−1 eh = e;
(gh)(h−1 g −1 ) = g(hh−1 )g −1 = geg −1 = e.
Hence, by the uniqueness of the inverse of an element in a group, we have:
(gh)−1 = h−1 g −1 .
2
3. Let:
1 x
S= :x∈Z
0 1
Show that S is a group with respect to matrix multiplication by performing the following
steps:
(a) Show that matrix multiplication is a well-defined binary operation on S. Namely,
show that for all s, t ∈ S, we have st ∈ S.
(b) Given that matrix multiplication is associative on the set M2×2 (R) of 2 × 2 real
matrices, explain why matrix multiplication is associative on S.
(c) Show that S has an identity element e with respect to matrix multiplication. Define
this identity element explicitly.
(d) Show that every element s ∈ S has an inverse s−1 ∈ S with respect to matrix
multiplication and the identity element e found above.
1 x ′ 1 y
More precisely, for s = , where x ∈ Z, show that there exists s = ,
0 1 0 1
for some y ∈ Z, such that ss′ = s′ s = e.
1 x 1 y
(a) Given any , in S, we have:
0 1 0 1
1 x 1 y 1 x+y
= ,
0 1 0 1 0 1
which lies in S, since x + y ∈ Z if x, y ∈ Z. Hence, matrix multiplication is a
well-defined binary operation on S.
(b) The set S is a subset of M2×2 (R), the set of real 2 × 2 matrices. Since matrix
multiplication is associative on M2×2 (R), it is associative on S.
(c) The 2 × 2 identity matrix I lies in S, and for all A ∈ S we have AI = IA = A.
Hence, S has an identity element.
1 x
(d) For any ∈ S, we have:
0 1
1 x 1 −x 1 −x 1 x
= = I.
0 1 0 1 0 1 0 1
Hence, each element in S has an inverse.
We conclude that S is a group under matrix multiplication.
3
4. By definition, the orthogonal group O(2, R) consists of real 2 × 2 matrices A which
satisfy the condition:
A⊤ A = AA⊤ = I,
where A⊤ denotes the transpose of A, and I denotes the 2 × 2 identity matrix.
By carrying out the same steps outlined in the previous problem, show that O(2, R) is a
group under matrix multiplication.
First, note that in general for matrices A, B we have (AB)⊤ = B ⊤ A⊤ provided that AB
is well-defined. Hence, the condition A⊤ A = AA⊤ = I, is equivalent to AA⊤ = I, since
I = I ⊤.
• Multiplication:
For any A, B ∈ O(2, R), we have:
AB · (AB)⊤ = ABB ⊤ A⊤ = AIA⊤ = I,
which implies that AB ∈ O(2, R). Hence, matrix multiplication is a well-defined
binary operation on O(2, R).
• Associativity:
Since O(2, R) is a subset of M2×2 (R), where multiplication is associative, multipli-
cation on O(2, R) is also associative.
• Identity:
The 2 × 2 identity matrix I satisfies: II ⊤ = I, so I ∈ O(2, R). For all A ∈ O(2, R),
we have AI = IA = A. Hence, O(2, R) has an identity element.
• Inverse:
For any A ∈ O(2, R), the condition AA⊤ = I implies that A−1 = A⊤ . Hence:
A−1 (A−1 )⊤ = (A⊤ )A = (AA⊤ )⊤ = I ⊤ = I.
This shows that if A lies in O(2, R), then so does A−1 . Hence, every element in
O(2, R) has an inverse element.
4
5. Let G be a group. Show that for all a, b ∈ G such that ord ab is finite, we have:
ord ab = ord ba.
Solution. Let m = ord ab. We have:
| ·{z
ab · · ab} = e.
m times
Observe that:
· · ba} = (a−1 a) · ba
|ba ·{z · · ba} = a−1 ab
| ·{z · · ab} a = a−1 ea = e
| ·{z
m times m times m times
This implies that the order of ba is finite, and is less than or equal to m = ord ab.
Let n = ord ba, then:
· · ab} = (b−1 b) · ab
| ·{z
ab · · ab} = b−1 ba
| ·{z · · ba} b = b−1 eb = e
| ·{z
n times n times n times
This implies that ord ab ≤ n = ord ba.
We conclude that ord ab = ord ba.
◀
6. Let a, b be elements of a group G. Suppose a has order 5 and a3 b = ba3 . Prove that
ab = ba.
Solution. Let e denote the identity element of G. By hypothesis, we have a5 = e.
Multiplying with a2 from the left on both sides of the equation a3 b = ba3 , we have:
a5 b = a2 ba3 .
|{z}
=b
Hence, we have:
ab = a a2 ba3
= (a3 b)a3
= ba3 a3
= ba.
◀
