Chapter 1 Answers to Exercises

Lecturer of Math203: Dr Kai Du

March 18, 2016
1. Expand the following sums:
6
X
i2
32
42
52
62
9 16 25 36
=
+
+
+
= +
+
+
i
+
1
3
+
1
4
+
1
5
+
1
6
+
1
4
5
6
7
i=3
5
X

2k x6k = 2x5 + 4x4 + 8x3 + 16x2 + 32x

k=1
4
X

(n + 1)2 = 1 + 22 + 32 + 42 + 52 = 1 + 4 + 9 + 16 + 25

n=0

Express the sums:

12 + 22 + 32 + + 102 =

10
X

i2

i=1

2 3 + 4 5 + 6 7 + 8 9 + + 2016 2017 =

2016
X

i(i + 1)

i=2

The answers to the second part are not unique, for example
2016
X

i(i + 1) =

i=2

2015
X

(i + 1)(i + 2)

i=1

2. The answers are

6 2 8
2A = 4 0 2
2 4 4

3
2
2
2A 3B = 5 3 1
4 16
1

8 15 11
AB = 0 4 3
1 6
6

5 10 15
1
4
AT B T = 5
8
9 6

4
A + B = 5
3

(2A)T (3B)T

10
BA =
15

5
(BA)T = 5
8

Obviously, AB 6= BA and AT B T = (BA)T .



19 21
13 18
3. (a)
(b) Not possible (c) 17 21
4
0
8 10

1 6
1 2
2 3

3
5 4
= 2 3 16
2 1
1

5
8
1 9
4
6

10 15
1 4
9 6

(d) Not possible.

4. (a) We compute



3 1
4 18 4
20 22
2 1 =
(AB)C =
2 13 3
17 17
1 2


 

2 4
4 1
20 22
A(BC) =
=
1 3
7
6
17 17


So (AB)C = A(BC).
(b) We compute
T

4
2

2
1

AB + AC =
T

A(B + C ) =

 
 
18 4
10 8 6
+
=
13 3
6 5 5

 
4
1 3 1
6 26
=
3
1 5 3
4 18

6
4
10
8

26
18


10
8

So AB + AC T = A(B + C T ).
5. (Here we only detail the prove of Rule 3. Please do the others by following the process)
Rule 3: Let A = [aij ]mn , B = [bij ]nr , C = [cij ]rs . Denote
D = [dij ]mr = AB,

F = [fij ]ns = BC

Then we compute (carefully about the indices!)

" r
#
X
(AB)C = DC =
dik ckj
k=1

"
=

r
n
X
X
k=1

A(BC) = AF =

r
n
X
X

k=1

!#

"

ai` b`k ckr

`=1

#
ai` f`j

" n
X

!#

r X
n
X

ckr
ms

#
ai` b`k ckr

!#
b`k ckj

k=1
r X
n
X
k=1 `=1

ms

ms

r
X

ai`

"

ai` b`k ckr

k=1

ai` b`k

`=1

`=1

ms

k=1 `=1

ms

" n
X

n
r
X
X
`=1

=
ms

`=1

"

"

ms

#
ai` b`k ckr
ms

So we have (AB)C = A(BC).

6. (a) We compute
(A + B)2 (A2 + 2AB + B 2 ) = (A + B)(A + B) (A2 + 2AB + B 2 )
= (A2 + AB + BA + B 2 ) (A2 + 2AB + B 2 )
= BA AB
It is not always zero, as AB 6= BA in general.
(b) We compute
(A + B)(A B) (A2 B 2 ) = (A2 AB + BA B 2 ) (A2 B 2 ) = BA AB
It is not always zero, as AB 6= BA in general.
7. Yes, they are true, because when B = I, then AB = BA = A.
8. The answers are not unique. One example is

1
A=
0

0
0


B=

0
0

0
1

9. First, notice that C must be singular, otherwise we have

A = AI = ACC 1 = BCC 1 = B
So we can choose (again, not uniquely)


1
0

C=

0
0

then for A = [aij ]22 and B = [bij ]22 ,


AC =

a11
a21

0
0

b11
b21

BC =

0
0

To ensure AC = BC but A 6= B, we should take a11 = b11 and a21 = b21 , and choose other entries not to be
identical, for example




1 1
1 0
A=
B=
0 0
0 1
10. We compute

0
A2 =
0
0

0
1
0
0

0
0
1
0

0
0
= I,
0
1

A3 = A2 A = IA = A =

1
2
1
2
21
21

12

0
0
0
0

1
2
12
12

12
12

12
12

12

1
2
12

1
2

So we have
A2n = (A2 )n = I n = I
A2n+1 = A2n A = IA = A
11. We compute

0
A2 =
0
0

0
0
0
0

1
0
0
0

0
1
,
0
0

0
A3 =
0
0

0
0
0
0

0
0
0
0

1
0
,
0
0

0
A4 =
0
0

0
0
=O
0
0

0
0
0
0

So for n 4, we have
An = An4 A4 = An4 O = O
12. First, we compute
A2 =

2
0

2
2


,

A3 =

3
0

32
3

A4 =

4
0

43
4

so we guess
n

A =

n
0

nn1
n


(1)

Next, we use the mathematical induction to prove this formula:

Step 1. For n = 1, the formula (1) is true.
Step 2. Suppose that the formula (1) is true for n = k, where k 1, that is
 k

kk1
Ak =
0
k
Then
A

k+1

=A A=

k
0

kk1
k




=

k+1
0

(k + 1)k
k+1

Thus, the formula (1) is also true for n = k + 1. By induction, the formula (1) holds true for all n 1.
3

13. Using the formula in Lecture Notes (page 9), we have




3
2

7
3


1
 

1
2
1 2
1 2
=
=
,
1
7
3
7
7 1 2 3 3
1 


1 

5
3
5
4 3
1 1.5
=
,
=
3
2 3
2 2
1
2

14. Use that fact that A and B are symmetric, that is, AT = A and B T = B, and rules of matrix operations. The
detail is omitted.
15. Keeping in mind that C is not symmetric, i.e., C 6= C T , we compute
A AT = C + C T (C + C T )T = C + C T (C T + C) = 0
B B T = C C T (C C T )T = C C T (C T C) = 2C 2C T = 2(C C T ) 6= 0
D DT = C T C (C T C)T = C T C C T (C T )T = C T C C T C = 0
E E T = C T C CC T (C T C CC T )T = C T C CC T (C T C CC T ) = 0
F F T = (I + C)(I + C T ) ((I + C)(I + C T ))T = (I + C)(I + C T ) (I + C T )T (I + C)T
= (I + C)(I + C T ) (I + C)(I + C T ) = 0
G GT = (I + C)(I C T ) ((I + C)(I C T ))T = (I + C)(I C T ) (I C T )T (I + C)T
= (I + C)(I C T ) (I C)(I + C T ) = (I + C C T CC T ) (I C + C T CC T )
= 2(C C T ) 6= 0
So A, D, E, F are symmetric, and B, G are nonsymmetric.
16. (a) Since
B B T = A + AT (A + AT )T = A + AT (AT + A) = 0
C + C T = A AT + (A AT )T = A AT + (AT A) = 0
we have B = B T and C T = C, thus B is symmetric and C is skew-symmetric.
(b) Let A be an n n matrix. We set
B=

1
(A + AT ),
2

C=

1
(A AT )
2

Then A = B + C, and from (b) we know B is symmetric and C is skew-symmetric.

17. We compute
(I A)(I + A + A2 + + Ak ) = I + A + A2 + + Ak A(I + A + A2 + + Ak )
= I + A + A2 + + Ak (A + A2 + + Ak + Ak+1 )
= I Ak+1 = I O = I
(I + A + A2 + + Ak )(I A) = I + A + A2 + + Ak (I + A + A2 + + Ak )A
= I + A + A2 + + Ak (A + A2 + + Ak + Ak+1 )
= I Ak+1 = I O = I
So the proof is complete.
18. Since Ax = Ay, i.e.,
A(x y) = 0
and x 6= y, we know that x y is a nontrivial solution of the system Ax = 0. From Theorem 1.6.2, A must
be singular.

19. The simplest nonsingular matrix is the identity matrix I, so we let





1 0
0 0
B=
A=
0 0
0 1
Obviously, A + B = I is nonsingular.
20. The 1st, 4th matrices are in row echelon form. None is in reduced row echelon form.
21. Follow the procedure in Examples 1.5.4 and 1.5.5.







1
1
1  1
1
1
1  1
1

1 1 1  2
0 2 2  1
0


1 
1 

1
1

1
0.5

1 0 0
0 1 1

Thus, for any real number , the 3-tuple

[1.5, 0.5, ]
is a solution of the system.
22. Follow the procedure in Examples 1.5.4 and 1.5.5. x1 = 2, x2 = 2, x3 = 1.
23. (a) Yes. Type I. (b) No. (c) Yes. Type III. (d) Yes. Type II.
24. The inverses are, respectively,

0
(a)
1

1
0

1


(b)

1
3

1
(c) 0
5

0 0
1 0
0 1

1
(d) 0
0

0
1
3

0
0
1

25. (a) The operation changing A to B is replace Row 3 by Row 3 - Row 1, so

1 0 0
E = 0 1 0
1 0 1
(b) The operation changing B to C is replace Row 2 by Row 2 - Row 3, so

1 0 0
E = 0 1 1
0 0 1
(c) Yes. Because C = F EA and E, F are elementary matrices.
26. (a) We compute

1
E1 A = 3
0

1
E2 A1 = 0
2

1
E 3 A2 = 0
0

0
0 A =
1

0 0
1 0 A1 =
0 1

0 0
1 0 A2 =
1 1
0
1
0

1
def
2 == A1
3

2
1 1
def
0
1 2 == A2
0 1 1

2 1 1
def
0 1 2 == U
0 0 3
2
0
4

1
1
1

Thus, U = E3 E2 E1 A.
(b) We compute

E11

1
= 3
0

0
1
0

0
0 ,
1

E21

1
= 0
2
5

0
1
0

0
0 ,
1

E31

1
= 0
0

0 0
1 0
1 1




1.5

 0.5

and

L = E11 E21 E31

0 0
1 0
1 1

1
= 3
2

One can check that A = LU .

27. The answers are not unique.


2
0

0
1

1
0

12
1

A=
A



1
6


0
1



1
6

0
1

1 12
0 1
 1


0
1

28. Follow the procedure in Example 1.6.5. Here we dont give the detail.

3 0 5
1 1
2
1
1
1
1

1
1
0.6
0
0
A =
, B =
, C =
3
1
0.4
1 0
2
29. Compute the inverses of A and I A:

2
A1 =
3

3
5

(I A)1 =

1
5
3
5

53

3
1.2
0.2

3
1
0

4
5

(a) Since AX = C B, left-multiplying by A1 the both sides we have



20 5
1
X = A (C B) =
34
7
(b) Since XA = C B, right-multiplying by A1 the both sides we have


8 14
X = (C B)A =
13
19
(c) Since
B = X AX = IX AX = (I A)X
1

left-multiplying by (I A)

the both sides we have

1

X = (I A)


B=

0
2

2
2

(d) Since
C = X XA = IX XA = X(I A)
right-multiplying by (I A)1 the both sides we have
X = C(I A)1 =

2
3

4
6

30. (a) Method 1: det U is equal to the product of its diagonal entries, thus not zero. So U is nonsingular. Method
2: Since the diagonal entries of U are nonzeor, using only the elementary row operations of type III we can
reduce U into a diagonal matrix. Then by the elementary row operations of type II, we can further reduce it
into I.
(b) Considering the operations on the extended matrix [A | I], it follows directly from Method 2 to (a).
31. By computation (please complement the detail) we know that A is row equivalent to the reduced row echelon
matrix

1 0 1
C= 0 1 0
0 0 0
6

and B is row equivalent to the reduced row echelon matrix

1 0 0
D= 0 1 1
0 0 0
Because the reduced row echelon form associated with a matrix is unique (by Theorem 1.5.3), and C is not row
equivalent to D, we conclude that A and B are NOT row equivalent.
32. If A is row equivalent to B, then there exists a finite sequence E1 , E2 , ..., Ek of elementary matrices such that
B = Ek Ek1 E2 E1 A
Since each elementary matrix is nonsingular, we have
1
E11 E21 Ek1
Ek1 B = A

The inverse of an elementary matrix is still an elementary matrix, so the above formula means B is row equivalent to A.
33. only if: Using the notation from the last question, it is sufficient to set M = Ek Ek1 E2 E1 .
if: Since M is nonsingular, M is row equivalent to I (from Theorem 1.6.2), that is, there exists a finite
sequence E1 , E2 , ..., Ek of elementary matrices such that
M = Ek Ek1 E2 E1
So we have
B = M A = Ek Ek1 E2 E1 A
Thus B is row equivalent to A.
34. (a)


det(M21 ) = 


det(M22 ) = 


det(M23 ) = 

2
3
3
2
3
2


4 
= 2 2 4 3 = 8
2 

4 
= 3 2 4 2 = 2
2 

2 
=3322=5
3 

(b)
A21 = (1)2+1 det(M21 ) = (8) = 8
A22 = (1)2+2 det(M22 ) = 2
A23 = (1)2+3 det(M23 ) = 5
(c)
det(A) = a21 A21 + a22 A22 + a23 A23
= 1 8 + (2) (2) + 3 (5)
= 3
35. Using Sarrus rule, we compute

a x

 1

 0

b
x
1


c 
0  = (a x)(x)(x) b 1 (x)
x
= x3 + ax2 + bx
7

36. Compute the determinant of the given matrix:



2
4 

= (2 )(3 ) 4 3 = 2 5 6
 3
3 
From Theorem 1.7.4, the matrix is singular if and only if its determinant is zero, i.e.,
2 5 6 = 0
The roots of this equation are = 1 and = 6. So when is 1 or 6, the given matrix is singular.
37. Following the procedure of Example 1.7.7:





 1
 1
 0
1
1
1 
1
2
3 



 0



 1
1
2
3 
1
1
1 

 0

=

 0



 2 2
3
3 
3
3 

 2 2

 0



 1
1
1 2 3
1 2 3




 1 1
1
1 




 0 1
2
3 

=
5

= 5 


1
1 

 0 0

 0 0 3 4 

1
1
0
0

1
1
2
3
5
5
3 4

1
0
0
0

1
1
0
0

1
2
1
0

1
3
1
1

= 5 1 1 1 (1)
=5
38. Using Theorem 1.7.6, we compute
1 = det(I) = det(AA1 ) = det(A) det(A1 )
So
det(A1 ) =

1
det(A)

39. From the last question we have det(A1 ) = 1/ det(A) = 14 . So using Theorem 1.7.6, we have
det(AB) = det(A) det(B) = 4 5 = 20
det(3A) = det(3I) det(A) = 33 4 = 108
5
det(A1 B) = det(A1 ) det(B) =
4
40. Following the procedure of Example 1.7.7:

 
1 x1 x21  1

 
1 x2 x22  = 0

 
1 x3 x23  0



x21

(x2 x1 )(x2 + x1 )
(x3 x1 )(x3 + x1 )


1 x1
x21 

= (x2 x1 )(x3 x1 ) 0 1 x2 + x1 
0 1 x3 + x1 


1 x1
x21 

= (x2 x1 )(x3 x1 ) 0 1 x2 + x1 
0 0 x3 x2 
x1
x2 x1
x3 x1

= (x2 x1 )(x3 x1 )(x3 x2 )

41. (Omit.)
42. (Omit.)

43. A is an n n skew-symmetic matrix, that means AT = A. So

det(A) = det(AT ) = det(A) = (1)n det(A)
Since n is odd, that is (1)n = 1, we have
det(A) = det(A)
Thus 2 det(A) = 0, i.e., det(A) = 0.
44. (a) Using Sarrus rule, we compute
det(A) = 1 3 5 + 2 4 3 + 3 2 4 33 2 2 5 1 4 4
= 15 + 24 + 24 27 20 16
=0
So A is singular.
(b) The adjoint of A is given by

A11 A12
adjA = A21 A22
A31 A32



1+1 3
4
(1)

2+1 2

= (1)
4

3+1 2
(1)
3

1
2
= 2 4
1
2

1
2
= 2 4
1
2

T
A13
A23
A33



4
1+2 2
(1)
3
5




4
1+3 2
(1)
3
5

2+2


1

3




3
2+3 1
(1)
3
5

3+2


1

2




3
3+3 1
(1)
2
4


3
5

3
4

(1)

(1)

T
3
4


2
3

T
1
2
1

1
2
1

So we compute

1
A(adjA) = 2
3

2
3
4

1
3
4 2
5
1

2 1
4
2 =O
2 1

45. Since
det(A) det(adjA) = det(A adjA) = det(det(A)I) = (det(A))n
we have
det(adjA) = (det(A))n1
46. Since

I
CA1



 
B
A
=
D
O

B
D CA1 B


O A
I  C

 
B  A
=
D  O



B

D CA1 B 

O
I

A
C

using Theorem 1.7.6 we have


 I

CA1
that implies

A
det M = 
O



B
1

B)
1  = det(A) det(D CA
D CA B