Math2070 Algebraic Structures B and C

HW3
Charles Li
Due: Feb 26th, Monday, 11:59pm.
NOT the usual Friday due to the Chinese new year.
Instructions

1. Hand in your work through Gradescope before the deadline. No late HW will be accepted. You
must match the question number with page number.
2. You have to answer all the questions. Show your steps unless otherwise stated.

3. The scores for each part may be adjusted without further notification. The total score is 100.
Questions
In below, unless otherwise stated, Z represents the group (Z, +) and Zn represents (Zn , +n ).

1. Let G be the set of non-negative real numbers with multiplication as the binary operation. Show
that ϕ : G → SL(2, R),  
a
ϕ(a) =
a−1
is a group homomorphism.
Find ker(ϕ) and hence show that ϕ is one-to-one.
Answer. Note that
    
ab a b
ϕ(ab) = = = ϕ(a)ϕ(b)
a−1 b−1 a−1 b−1

Hence it is a group homomorphism. Let ϕ(a) = I where I is the identity element in SL(2, R), i.e
identity matrix, then a = 1 is the identity element in G. Hence ker(ϕ) = 1 and ϕ is a injection. □
2. Determine if the following maps are group homomorphism. Justify your answer.
(a) ϕ : Z3 × Z3 → Z3 , ϕ(a, b) = a2 +3 b2 .
(b) ψ : Z3 × Z3 → Z3 , ψ(a, b) = a3 +3 b3 .
Answer.
(a) Note that

ϕ((1, 1) +3 (1, 1)) = ϕ(2, 2) = 22 +3 22 = 2 ̸= 1 = 2 +3 2 = ϕ(1, 1) +3 ϕ(1, 1)

Hence it is not a group homomorphism.

(b) Recall in Z3 , we (a +3 b)3 = a3 +3 3a2 b +3 3ab2 +3 b3 = a3 +3 b3 . Thus ∀a, b, c, d ∈ Z3 ,

ϕ((a, b)+3 (c, d)) = ϕ(a+3 c, b+3 d) = (a+3 c)3 +3 (b+3 d)3 = a3 +3 b3 +3 c3 +3 d3 = ϕ(a, b)+3 ϕ(c, d).

Hence it is a group homomorphism.

□
3. Consider the map ϕ : Z3 × Z3 → Z3 × Z3 defined by ϕ(a, b) = (a +3 2b, 2a +3 b).
(a) Show that ϕ is a group homomorphism.
(b) Find ker(ϕ) and im(ϕ).
Answer.

1
 (a) We check it by definition, ∀a, b, c, d ∈ Z3 ,

ϕ((a, b) +3 (c, d)) = ϕ(a +3 c, b +3 d) = (a +3 c +3 2b +3 2d, 2a +3 2c +3 b +3 d)

= (a +3 2b, 2a +3 b) +3 (c +3 2d, 2c +3 d)
= ϕ(a, b) +3 ϕ(c, d).

Hence it is a group homomorphism.

(b) Suppose ϕ(a, b) = 0, then we have

a +3 2b = 0 (1)
2a +3 b = 0 (2)

Note that if a +3 2b = 0, then 2(a +3 2b) = 2a +3 4b = 2a +3 b = 0.

On the other hand if 2a +3 b = 0, then 2(2a +3 b) = 4a +3 2b = a +3 2b = 0.
Hence that a +3 2b = 0 ⇔ 2a +3 b = 0. Thus we only need to solve a +3 2b = 0.
a +3 2b = 0 if and only if a = −2b = b. Substituting b = 0, 1, 2, we can show that all elements
in the kernel are (0, 0), (1, 1) and (2, 2). Hence ker(ϕ) = {(0, 0), (1, 1), (2, 2)}.
For im(ϕ), we compute all 9 cases:
ϕ(0, 0) = (0, 0), ϕ(0, 1) = (2, 1), ϕ(0, 2) = (1, 2)
ϕ(1, 0) = (1, 2), ϕ(1, 1) = (0, 0), ϕ(1, 2) = (2, 1)
ϕ(2, 0) = (2, 1), ϕ(2, 1) = (1, 2), ϕ(2, 2) = (0, 0).
So im(ϕ) is {(0, 0), (1, 2), (2, 1)}.
□
4. Let n, m be positive integers. Define ϕ : Zn → Zm by

ϕ(a) = remainder of a divided by m.

(a) Suppose m divides n, show that ϕ is a group homomorphism.

(b) Suppose m does not divide n, show that ϕ is not a group homomorphism.
Hint: Let a = 1, b = n − 1, consider ϕ(a + b).

Answer.
(a) We first show that ϕ is a well-defined map: For all k ∈ Z, ϕ(a + kn) = remainder of a + kn
divided by m = remainder of a divided by m (as m | n) = ϕ(a).
For all a, b ∈ Zn , write a = k1 m + x1 , b = k2 m + x2 , with 0 ≤ x1 , x2 < m then a + b =
(k1 + k2 )m + (x1 + x2 ), ϕ(a) = x1 , ϕ(b) = x2 , thus ϕ(a + b) = remainder of x1 + x2 divided
by m = x1 +m x2 (+m the group operation on Zm ) = ϕ(a) +m ϕ(b). Therefore, ϕ is a group
homomorphism.
(b) Suppose ϕ is a group homomorphism, then for all a, b ∈ Zn , we have ϕ(a) + ϕ(b) = ϕ(a + b)
and ϕ(0) = 0. Now consider a = 1, b = n − 1, we have a + b = 0 in Zn , then ϕ(a + b) = 0.
However, ϕ(a) +m ϕ(b) = remainder of 1 + (n − 1) = n divided by m, which is nonzero as
m ∤ n, contradiction arises. Therefore, ϕ is not a group homomorphism
□

5. Suppose (G, ∗), (G′ , ∗′ ), (G′′ , ∗′′ ) are groups and ϕ : G → G′ , ψ : G′ → G′′ are group homomor-
phisms.
(a) Show that ψ ◦ ϕ : G → G′′ is a group homomorphism.
(b) If ϕ, ψ are group isomorphisms, show that ψ ◦ ϕ is also a group isomorphism.

Answer.
(a) By definition of group homomorphism, ∀a, b ∈ G, ψ ◦ ϕ(a ∗ b) = ψ(ϕ(a) ∗′ ϕ(b)) = ψ ◦ ϕ(a) ∗′′
ψ ◦ ϕ(b). Hence ψ ◦ ϕ is a group homomorphism.

2
 (b) Since ψ and ϕ are group isomorphism, they are bijections. Therefore, ψ ◦ ϕ is a bijection
because it is a composition of two bijections. By(a) we know it is also a homomorphism,
thus it is an isomorphism.
□
6. Let (G, ∗) be a group. Define ϕ : G → G, ϕ(g) = g −1 . Show that ϕ is an isomorphism if and only
if G is abelian.
Answer. Note that ∀g, h ∈ G, we have ϕ(g ∗ h) = (g ∗ h)−1 = h−1 g −1 . Thus ϕ(g ∗ h) = ϕ(g) ∗ ϕ(h)
if and only if h−1 ∗ g −1 = g −1 ∗ h−1 if and only if g ∗ h = h ∗ g. □
7. Find an isomorphism from Z2 × Z2 to D2 . Justify your answer.
Answer. Recall that D2 consists of {r0 , r, s, sr}, we define ϕ : Z2 × Z2 → D2 by ϕ(0, 0) = r0 ,
ϕ(1, 0) = r, ϕ(0, 1) = s and ϕ(1, 1) = sr. We list the cayley tables:
(0, 0) (1, 0) (0, 1) (1, 1)
(0, 0) (0, 0) (1, 0) (0, 1) (1, 1)
for Z2 × Z2 (1, 0) (1, 0) (0, 0) (1, 1) (0, 1)
(0, 1) (0, 1) (1, 1) (0, 0) (1, 0)
(1, 1) (1, 1) (0, 1) (1, 0) (0, 0)
r0 r s sr
0
r r0 r s sr
and for D2 : r r r0 sr s
s s sr r0 r
sr sr s r r0
Then not difficult to check by Cayley tables, ϕ is an isomorphism. In general we don’t need to
list the Cayley table, we can check it on generators. □
8. Recall the following theorem (you don’t need to prove the theorem):
Theorem: A finite group G is cyclic if and only if there exists an element g ∈ G such that the
ord g = |G|.

Let n, m be two positive integers. An integer c is said to be a common multiple of n and m if

it is a multiple of both n and m. The Least Common Multiple of n, m, denoted by lcm(n, m),
is the smallest positive integer which is a multiple of both n and m.

Let n, m be two positive integers. Let ℓ = lcm(n, m), let d = gcd(n, m).
(a) Show that nm/d is a common multiple of both n and m. Hence show that ℓ ≤ nm/d.
Remark: In fact it is known that ℓ = nm/d.
(b) Let g = (a, b) ∈ Zn × Zm . Suppose k is a common multiple of n and m. Show that

g k = g + g + · · · + g = (0, 0).
| {z }
k times

Hence show that ord g ≤ ℓ.

(c) Show that if d > 1, then Zn × Zm is not cyclic.
Answer.
(a) As d = gcd(n, m), we have d | n, d | m, which implies m/d, n/d ∈ Z. Now we have n |
n(m/d), m | m(n/d), hence mn/d is a common multiple of n and m. As ℓ is the least one,
we have ℓ ≤ mn/d.
(b) Note that g k = (a, b)k = (ak, bk) in Zn × Zm . Since n | k, m | k, we have n | ak, m | bk,
thus (ak, bk) = (0, 0) in Zn × Zm . As ℓ is a common multiple of both m and n, we have
g ℓ = (0, 0), therefore ord g ≤ ℓ.
(c) It suffices to show for all g ∈ Zn × Zm , ord g < |Zn × Zm | = nm. By (b), for g ∈ Zn ×
Zm , ord g ≤ l ≤ mn/d (by part (a)) < mn as d > 1. Therefore, Zn × Zm is not cyclic.

3
 □
9. Let n, m be positive integers such that gcd(n, m) = 1. Let G = Zn × Zm .
(a) Find the order of (1, 1) ∈ G.
nm
Hint You can use the fact that lcm(n, m) = gcd(n,m) .
(b) Show that Zn × Zm is isomorphism to Znm .
Hint: Recall the following theorem (you don’t need to prove the theorem):
Theorem: A finite group G is cyclic if and only if there exists an element g ∈ G such that
the ord g = |G|.

Answer.
(a) Let t be the order of (1, 1), then t(1, 1) = (t, t) = (0, 0). Hence

t=0 mod n , t = 0 mod m.

Since t should be the smallest number satisfying the above relation, t = lcm(m, n) =
mn
gcd(m,n) = mn.
(b) Note that ord(1, 1) = mn and |G| = mn, by the theorem in problem, G is cyclic and obviously
(1, 1) is one of generators of G. Then we define the map ϕ : Zmn → Zm × Zn by ϕ(1) = (1, 1)
and ϕ(k) = ϕ(k·1) = (k, k). Then ∀k, l ∈ Z, ϕ(k+l) = (k+l, k+l) = (k, k)+(l, l) = ϕ(k)+ϕ(l).
Hence it is an homomorpism. On the other hand, if ϕ(s · 1) = 0 for some s ∈ Z, then
(s, s) = (0, 0). Therefore we have m|s, n|s, by the minimality of t, t = mn|s, implies s = 0
mod nm. Hence ker ϕ is 0. But again Zmn and Zm × Zn has the same cardinality, we have
ϕ being a bijection, hence isomorphism.
□
10. Let (G, ∗) and (G′ , ∗′ ) be finite groups and ϕ : G → G′ a group isomorphism.
(a) Let eG and eG′ denote the identities of G and G′ respectively. Let k be a fixed integer. Show
that the sets
S = {g ∈ G | g k = eG } and S ′ = {g ′ ∈ G | (g ′ )k = eG′ }
have the same number of elements.
(b) Using the previous part, show that Z4 × Z4 is not isomorphic to Z2 × Z8 .
Answer.
(a) We want to show ϕ induces a bijection between S and S ′ . Let g ∈ S, then ϕ(g)k = ϕ(g k ) =
ϕ(eG ) = eG′ . This tells us it maps S to S ′ . On the other hand, ∀g ′ ∈ S ′ , there exists
g = ϕ−1 (g ′ ) such that g k = ϕ−1 ((g ′ )k ) = eG , this shows that ϕ induces a surjection between
S and S ′ . And since ϕ is a injection between G and G′ , it is automatically injection between
S and S ′ . Hence ϕ is bijection between S and S ′ . Thus we get they have the same number
of elements.
(b) In part (a), let k = 4, G = Z4 × Z4 and G′ = Z2 × Z8 .
Then
S = {(a, b) ∈ Z4 × Z4 | 4(a, b) = (0, 0)},
S ′ = {(a, b) ∈ Z2 × Z8 | 4(a, b) = (0, 0)}.
Since for any (a, b) ∈ Z4 × Z4 ,

4(a, b) = (4a, 4b) = (0, 0).

Hence S = G. Therefore |S| = 16.

Next for (0, 1) ∈ Z2 × Z8
4(0, 1) = (0, 4) ̸= (0, 0).
/ S ′ . Hence |S ′ | ≤ |G′ | − 1 = 15. Thus |S| ̸= |S ′ | and hence by part (a) G and G′
So (0, 1) ∈
are not isomorphic.

4
 □
11. Let G = Z × Z.
(a) Show that G is generated by X = {(1, 2), (3, 5)}.
(b) Show that G is not generated by Y = {(1, 2), (3, 4)} by finding an element (a, b) ∈ G but
not in ⟨Y ⟩.
Answer.
(a) First ⟨X⟩ ⊆ G.
Next for any (a, b) ∈ G = Z×Z, we claim that there exist x, y ∈ Z such that x(1, 2)+y(3, 5) =
(a, b). This is equivalent to solving the following equation:

x + 3y = a
2x + 5y = b

The solution is given by

x = −5a + 3b, y = 2a − b.
Since a, b ∈ Z, we have x, y ∈ Z. Therefore (a, b) ∈ ⟨X⟩. Hence G ⊆ ⟨X⟩. This completes
the proof.
(b) Consider (0, 1) ∈ G, if (0, 1) can be generated by Y , then there exists x, y ∈ Z such that
(0, 1) = x(1, 2) + y(3, 4). Then we have the following equation:

x + 3y = 0,
2x + 4y = 1.

The only possible solution to this equation is x = 23 , y = − 12 which contradicts to the fact
x, y ∈ Z. Hence G ̸= ⟨Y ⟩.
□