Thang Vu

Bates College 17

Math 309. Abstract Algebra

Homework 5

Chapter 2
Exercise 12. For any integer n > 2, show that there are at least two elements
in U (n) that satisfy x2 = 1.
Proof. By Table 2.1, the identity of U (n) is 1. So, (12 )mod n=1. Hence, there
exists x = 1 for x2 = 1.
Consider x = (n 1) in U (n). Then, we have (x2 ) = (n 1)2 mod n = (n2
2n + 1)mod n. As proved in Exercise 11, Chapter 0, we have (n2 2n + 1)mod n =
[n2 mod n + (2n)mod n +1mod n]mod n.Since n divides n2 and (2n), we have
n2 mod n = (2n)mod n=0. Hence, we have x2 = (0 + 0 + 1)mod n = 1mod n =1
for x = n 1. Since n > 2, n 1 6= n.
Therefore, we have showed that for any n > 2, the group U (n) has at least two
elements x = 1 and x = n 1 such that x2 = 1.


Exercise 17. Prove that a group G is Abelian if and only if (ab)1 = a1 b1

for all a and b in G.
Proof. Firstly, we will prove that if G is Abelian, then (ab)1 = a1 b1 for all a
and b in G.
Let a and b be two arbitrarily given elements in G. By theorem 2.4, we have
(ab)1 = b1 a1 , with a1 and b1 are also in G by the inverse property of a group.
Since G is Abelian, b1 a1 = a1 b1 . Hence, we have (ab)1 = a1 b1 .
Secondly, we will prove that if (ab)1 = a1 b1 for all a and b in G. then G is
Abelian.
Let a and b be two arbitrarily given elements in G. By the definition of inverse,
and the inverse property of a group, there exists c = a1 and d = b1 in G
with c1 = a and d1 = b. By theorem 2.4, we have (cd)1 = d1 c1 . From
the assumption, we have (cd)1 = c1 d1 . Hence, d1 c1 = c1 d1 . Substitute
c1 = a and d1 = b into this equation, we have ab = ba. Therefore, G is Abelian.
As we have proved both way of the statement, it is true that a group G is Abelian
if and only if (ab)1 = a1 b1 for all a and b in G.


Exercise 20. If a1 , a2 , ..., an belong to a group, what is the inverse of a1 a2 ...an ?

1
1 1
Proof. We will prove by induction that (a1 a2 ...an )1 = a1
n an1 ...a2 a1 .
1
1
Base case: Suppose n = 1. (a1 ) = a1 . So, the statement is true for n = 1.
1

Induction step: Suppose the statement is true for n = k, which is (a1 a2 ...ak )1 =
1
1 1
a1
k ak1 ...a2 a1 .

Consider n = k + 1. We have
1
(a1
k+1 )(a1 a2 ...ak )

(by theorem 2.4)

1 1
1 1
=(a1
k+1 )(ak ak1 ...a2 a1 )
1 1
1 1
=
a1
k+1 ak ak1 ...a2 a1

(by the inductive assumption)

(a1 a2 ...ak ak+1 )1 =

Thus, the statement holds for n = k + 1 if holds for n = k.

We have showed that the statement is true for n = 1. Therefore, by the principle
of induction, it is true for all positive integer n.


Exercise 22. Give an example of a group with 105 elements. Give two examples
of groups with 44 elements.
Proof. By Table 2.1, we know that Z105 under addition mod105 has 105 elements.
Z105 = {0, 1, 2, 3, ..., 104}.
Also Table 2.1, we have Z44 under addition mod44 has 44 elements. Z44 =
{0, 1, 2, 3, ..., 43}.
The dihedral group of order 44: D22 has 44 elements.


Chapter 3
Exercise 2. Let Q be the group of rational numbers under addition and let
Q be the group
multiplication. In Q, list the

 of nonzero rational numbers

under

elements in 12 . In Q , list the elements in 12 .

  
k
3
1
1
3
k
1
= . . . , , . . . , , 1, , 0, , 1, , . . . , , . . .
Proof. In Q,
2
2
2
2
2
2
2

  
1
1
1
1
1
1
In Q ,
= . . . , k , . . . , , , , , 1, 2, 4, . . . , 2k , . . .
2
2
16 8 4 2


Exercise 6. Suppose that a is in a group element and a6 = e. What are the

possibilities for |a|? Provide reasons for your answer.
Proof. Let n be the order of a in the group. By the definition of order, n is the
smallest positive integer satisfying an = e. Consider, (an )k = ek = e. So ank = a6
with 1 n 6 and k N. This implies nk = 6. Therefore the possible values of n
are 1, 2, 3, 6.

2

Exercise 20. Let G be a group, and let a G. Prove that C(a) = C(a1 )
Proof. By the inverse property of groups, a and a1 are both in G. Hence, by
theorem 3.6, C(a) and C(a1 ) are both subgroups of G.
Let b C(a). Then, ab = ba = a1 (ab)a1 = a1 (ba)a1 = (a1 a)(ba1 ) =
1
(a b)(aa1 ) = e(ba1 ) = (a1 b)e = ba1 = a1 b. From this, b must also
be a centralizer of a1 , ie. b C(a1 ). Thus, C(a) C(a1 ).
Let c C(a1 ). Then, a1 c = ca1 = a(a1 c)a = a(ca1 )a =
(aa1 )(ca) = (ac)(a1 a) = e(ca) = (ac)e = ca = ac. From this, c must also
be a centralizer of a, ie. c C(a). Thus, C(a1 ) C(a).
Since C(a) C(a1 ), C(a1 ) C(a), and both of them are group, C(a) =
C(a1 ).




a b
|a, b, c, d Z under addition. Let H =
Exercise 51. Let G =
c d



a b
|a + b + c + d = 0 .
c d
Prove that H is a subgroup of G. What if 0 is replaced by 1.
Proof. We will prove that H is a subgroup of G by the one-step subgroup test.
Let A, B be two arbitrarily given matrix in H. These matrices take the form



aA bA
|a + bA + cA + dA = 0
A=
cA dA A
and
.


aB
B=
cB



bB
|a + bB + cB + dB = 0
dB B

Consider AB 1 = A B
 

a
aA bA
B
cB
cA dA

 
a aB
bB
= A
cA cB
dB

bA bB
dA dB

.
The sum of all elements in AB 1 is aA aB + bA bB + cA cB + dA
dB = (aA + bA + cA + dA ) (aB + bB + cB + dB ). Since A and B are in H,
aA + bA + cA + dA = aB + bB + cB + dB = 0. Therefore, the sum of all elements in
AB 1 is 0. By the one-step subgroup test, H is a supgroup of G.
If we replace 0 with 1 in H, call the new set S, the new set under addition is not
a group because it has no identity
matrix.


 
 

0 0
0 0
a b
a b
The identity of G is
because
+
=
for all a, b, c, d
0 0
0 0
c d
c d
Z. Since S is a subset of G, if S under addition is a group, it must be a subgroup
of G. Then, it must have the same identity matrix as G because identity is unique
by theorem 2.1. However, the identity matrix is not in S because 0 + 0 + 0 + 0 6= 1.
Therefore, S is not a subgroup of G and consequently not a group.


Exercise 59(c). Let G = GL(2, R). Find Z(G).

3

Proof. We have




 





a b
a b x1 x2
x x2 a b
x1 x2
Z(G) =
G|
= 1
for all
in G
c d
c d x3 x4
x3 x4 c d
x3 x4
.
Consider






a b x1 x2
x1 x2 a b
=
c d x3 x4
x3 x4 c d

 

ax1 + bx3 ax2 + bx4
ax1 + cx2 bx1 + dx2
=
=
cx1 + dx3 cx2 + dx4
ax3 + cx4 bx3 + dx4

ax1 + bx3 = ax1 + cx2

bx3 = cx2

ax + bx = bx + dx
ax + bx = bx + dx
2
4
1
2
2
4
1
2
Then we have
=
.

cx1 + dx3 = ax3 + cx4

cx1 + dx3 = ax3 + cx4

cx2 + dx4 = bx3 + dx4

cx2 = bx3
(
bx3 = cx2
For
for all x2 , x3 R, we must have c = b = 0. Substitute back in
cx2 = bx3
(
ax2 = dx2
the set of equation we have
, which is true for all x2 , x3 R if and
dx3 = ax3
only if a = d. 



a 0
a b
must take the form
with a R and a 6= 0. In other
Therefore,
0 a
c d



a 0
words, Z(G) =
|a R, a 6= 0 .
0 a
Computer exercise 3. Is there an arithmetic relationship between |ab| and |a|
and |b|?
Answer. The relationship is that |ab| must divide |a|.|b|.