알기쉬운 선형대수 1장

CHAPTER
1: SYSTEMS OF LINEAR EQUATIONS AND MATRICES
1.1 Introduction to Systems of Linear Equations
2. Equations in part (a) do not form a linear system since the second one is not a linear equation.
Equations in parts (b), (c), and (d) form linear systems.
3. (a) Not linear because of the term x2 x3. (b) Linear
4. (b) We can solve this system by inspection since the second equation is a multiple of the first.

Letting 4 solves both equations, therefore the system is consistent.
(c) An easy way to find an example of a solution of this system would be by letting 0 first,

then look for values of and that solve the resulting system
4x + 2z = –1
–x – 3z = 0
Adding 4 times the second equation to the first will yield a simplified system
–10z = –1
–x – 3z = 0
which is solved by and . Together with 0, this is a solution of the original
system, showing it to be consistent.
(d) We add 6 times the first equation to the third, then proceed to add the first equation to

the fourth, and the second one to the fourth, obtaining a simplified system
3 4
5 1
16 27
7 1
Clearly, the last two equations are contradictory, thus the system is inconsistent.
Chapter 1: Systems of Linear Equations and Matrices 2

5. (b) Subtracting the first equation from the second gives 2x − 4z 0, or x 2z and the first

equation is w 1 − 5y. Parameterizing y r and z s, we get the solution x 2s, y r, z s,
w 1 − 5r.
((c) and (d) unchanged)
6. For example,
(a) (b) (c)
1 1 1
2 2 1
3 3 1

7. (a) No, the first equation is not satisfied by the vector: 3 5 2 −4 − 2 0 7 ≠ 1.
(b) Yes, all the equations are satisfied by the vector. For example, the first equation becomes
3 ( 75 ) 2 ( −74 ) − 2( 0) 15−8
7
1 . Verify the other equations also are satisfied.
(c) No, the second equation is not satisfied by the vector.
(d) Yes, all the equations are satisfied by the vector
(e) No, the second equation is not satisfied by the vector.
8. The values in (b), (d), and (e) satisfy all three equations – these vectors are solutions of the
system.
The vectors in (a) and (c) are not solutions of the system.
9. (a) Solving the equation for y, we get y 3

4
− 12 x, so parameterizing gives us x t, y 3
4
− 12 t .
(b) Parameterize the last three variables, and solve for x1 in terms of those parameters:
x1 3 5
3
r − 13 s − 34 t, x2 r, x3 s, x4 t.
10. (a) , , where and are arbitrary values
(b) , , , , where , , , and are arbitrary values
11. (a) 2x 5 y 6 (c) x1 5x2 7x3 − x4 3

y 2 2x1 2x2 x3 x4 0
‐x 0


12. (a) (b) (c) (d)

2 1 3 1 2 3 4 3 4 3
4 6 5 2 3 6 4 3 2 1 4 4 3
1 5 6 1 3 2 9
3 0 8 3 2

13. (b) (d)
⎛ 3 0 −1 6 0 ⎞ ⎛ 1 0 −1 0 4⎞
⎜⎝ 0 2 −1 −5 −2⎟⎠ ⎜ ⎟
⎝ 0 1 0 1 9⎠

14. (a) (b) (c) (d)
3 2 1 2 0 2 1 1 2 0 1 1 1 1 0 0 1
4 5 3 3 1 4 7 0 3 1 0 1 2 0 1 0 2
7 3 2 6 1 1 0 0 0 1 7 0 1 0 0 1 3

18. (a) False. A homogeneous system will be consistent, but may have more than one solution.
(e) True.
1.2 Gaussian Elimination
2. (a) Row echelon form only; Property 4 is not satisfied.
(b) Neither; Property 3 is not satisfied.
(c) Reduced row echelon form (and so also row echelon form).
(d) Neither; Property 2 is not satisfied.
(e) Reduced row echelon form (and so also row echelon form).
(f) Neither; Property 1 is not satisfied.
(g) Reduced row echelon form (and so also row echelon form).
4. (a) x1 0, x2 −2, x3 4.
(b) Because the column representing x4 does not have a leading 1, we parameterize it, x4 t.

The last equation is then x3 − 4t 1, or x3 1 4t. The second equation becomes x2 −t,

and the first equation is x1 2 − 3t. Thus, the parameterized solution is x1 2 − 3t, x2 −t,

x3 1 4t, x4 t.
(c) Variables x3 and x5 are parameterized because the third and fifth columns do not have
leading ones. The remaining variables are solved for in terms of x3 and x5. Let x3 s, and x5
t. Then x4 −7t, x2 1 2s, and x1 −2 − 2t. Thus the parameterized solution is x1
−2 − 2t, x2 1 2s, x3 s, x4 −7t, and x5 t.
(d) The bottom row corresponds to the equation 0 1, so there are no solutions.
⎛ 1 2 −3 6⎞
5. The augmented matrix for this system is ⎜ 2 − 1 4 1⎟ .
⎜ ⎟
⎝ 1 −1 1 3⎠
⎛ 1 2 −3 6 ⎞
Replace R2 with R2 − 2R1 and replace R3 with R3 − R1. ⎜ 0 −5 10 −11⎟
⎜ ⎟
⎝ 0 −3 4 −3 ⎠
⎛ 1 2 −3 6 ⎞
Replace R2 with − 15 R2. ⎜ 0 1 −2 115 ⎟
⎜ ⎟
⎝ 0 −3 4 −3⎠
⎛ 1 2 −3 6⎞
Replace R3 with R3 3R2. ⎜ 0 1 −2 11 ⎟

⎜ 5⎟
⎜⎝ 0 0 −2 18 ⎟
5⎠
⎛ 1 2 −3 6⎞
Replace R3 with − 12 R3. ⎜ 0 1 −2 11 ⎟

⎜ 5⎟
⎜⎝ 0 0 1 −9 ⎟
5⎠
The matrix is now in Reduced Echelon form. To get it into Reduced Row Echelon form, we
replace R2 with R2 2R3 and replace R1 with R1 3R3.
⎛1 2 0 3
5
⎞
⎜0 1 0 −7 ⎟

⎜ 5⎟
⎜⎝ 0 0 1 −9 ⎟
5⎠

⎛1 0 0 17
5
⎞
Finally, replace R1 with R1 − 2R2. ⎜ 0 1 0 −7 ⎟
. The solution is x1 17 −7 −9
5 , x2 5 , x3 5 .
⎜ 5⎟
⎜⎝ 0 0 1 −9 ⎟
5⎠
⎡ 2 2 2 0⎤
6. ⎢ −2
⎢ 5 2 1⎥⎥ The augmented matrix for the system.
⎢⎣ 8 1 4 −1⎥⎦
⎡ 1 1 1 0⎤
⎢ −2
⎢ 5 2 1⎥⎥ The first row was multiplied by .
⎢⎣ 8 1 4 −1⎥⎦
⎡ 1 1 1 0⎤
⎢ 0
1⎥⎥
2 times the first row was added to the second
⎢ 7 4
row.
⎢⎣ 8 1 4 −1 ⎥⎦
⎡1 1 1 0⎤
⎢0 7 4 1⎥ 8 times the first row was added to the third
⎢ ⎥ row.
⎢⎣0 −7 −4 −1⎥⎦
⎡1 1 1 0⎤
⎢0 1 4 1⎥

The second row was multiplied by .
⎢ 7 7⎥
⎢⎣0 −7 −4 −1⎥⎦
⎡1 1 1 0⎤
⎢0 1 ⎥
7 times the second row was added to the third
⎢ 1 74 7 ⎥

row.
⎢⎣ 0 0 0 0 ⎥⎦
⎡1 0 3
7 − 71 ⎤
⎢ 1⎥
1 times the second row was added to the first
⎢0 1 4
7 7⎥

row.
⎢⎣0 0 0 0⎥⎦

Infinitely many solutions: , , where is an arbitrary value.
⎛ 3 −1 1 7 13⎞
7. The augmented matrix is −2 1 −1 −3 −9⎟ .
⎜
⎜ ⎟
⎝ −2 1 0 −7 −8⎠
To get a leading one in the first row, we replace R1 with R1 R2.
⎛1 0 0 4 4⎞
⎜ −2 1 −1 −3 −9⎟
⎜ ⎟
⎝ −2 1 0 −7 −8⎠

⎛1 0 0 4 4 ⎞
Replace R2 with R2 2R1 and replace R3 with R3 2R3. ⎜ 0 1 −1 5 −1⎟
⎜ ⎟
⎝0 1 0 1 0 ⎠
⎛1 0 0 4 4⎞
Replace R3 with R3 − R2. 0 1 −1 5 −1⎟ The matrix is now row reduced. To get it in
⎜
⎜ ⎟
⎝ 0 0 1 −4 1 ⎠
⎛ 1 0 0 4 4⎞
reduced row echelon form replace R2 with R2 R3. ⎜ 0 1 0 1 0⎟
⎜ ⎟
⎝ 0 0 1 −4 1 ⎠
Since the fourth column does not have a leading one, the variable corresponding to the column,
w, will be parameterized, w t. The solution is x 4 − 4t, y −t, z 1 4t, w t.
⎡ 0 −2 3 1 ⎤
8. ⎢ 3 6 −3 −2⎥
⎢ ⎥ The augmented matrix for the system.
⎢⎣6 6 3 5⎥⎦
⎡ 3 6 −3 −2 ⎤
⎢0 −2 3 1⎥
⎢ ⎥ The first and second rows were interchanged.
⎢⎣6 6 3 5⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0 −2 3
⎢ 1⎥⎥ The first row was multiplied by .
⎢⎣6 6 3 5⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0 −2 3
1⎥⎥
–6 times the first row was added to the third
⎢ row.
⎢⎣0 −6 9 9⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0 1 − 3 − 1 ⎥
⎢ 2 2⎥ The second row was multiplied by .
⎢⎣0 −6 9 9⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0
1 − 32 − 12 ⎥⎥
⎢ row.
⎢⎣0 0 0 6 ⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0
⎢ 1 − 32 − 12 ⎥⎥ The third row was multiplied by .
⎢⎣0 0 0 1⎥⎦

⎡1 2 −1 − 32 ⎤
⎢0 1 − 3
0⎥⎥
times the third row was added to the second
⎢ 2
row.

⎣⎢0 0 0 1⎥⎦
⎡1 2 − 1 0⎤
⎢0 1 − 3
0⎥⎥
times the third row was added to the first
⎢ 2
row.
⎢⎣0 0 0 1⎥⎦
⎡1 0 2 0⎤
⎢0 1 − 3
0⎥⎥
–2 times the second row was added to the first
⎢ 2
row.
⎢⎣0 0 0 1⎥⎦

The last row corresponds to the equation
0 0 0 1
therefore the system is inconsistent.
(Note: this was already evident after the fifth elementary row operation.)
⎛ 1 2 −3 6⎞
9. The reduced echelon form of the matrix from problem 5 is ⎜ 0 1 −2 11 ⎟
. To solve using
⎜ 5⎟
⎜⎝ 0 0 1 −9 ⎟
5⎠
back‐substitution, we let x 3 −9
5 . Row 2 becomes x 2 − 2 ( −59 ) 11
5
and solving for x2 yields
x2 11
5
− 18
5
−7
5 . Substituting for x3 and x2 in Row 1 yields x 1 2 ( −57 ) − 3 ( −59 ) 6 , and thus,
−9
x1 6 14
5
− 27
5
17
5 . The solution is x1 17 −7
5 , x2 5 , x3 5 .
⎡ 2 2 2 0⎤
10. ⎢
⎢ −2 5 2 1⎥⎥ The augmented matrix for the system.

⎣⎢ 8 1 4 − 1⎦⎥
⎡ 1 1 1 0⎤
⎢ −2
⎢ 5 2 1⎥⎥ The first row was multiplied by .

⎣⎢ 8 1 4 − 1⎦⎥
⎡1 1 1 0⎤
⎢0
1⎥
2 times the first row was added to the
7 4
⎢ ⎥ second row.

⎣⎢ 8 1 4 − 1⎦⎥
⎡1 1 1 0⎤
⎢0 7 4 1⎥
⎢ ⎥ –8 times the first row was added to the third
⎣⎢0 −7 −4 −1⎦⎥ row.

⎡1 1 1 0⎤
⎢0 1 4 1⎥
⎢ 7 7⎥

⎢⎣0 −7 −4 −1⎥⎦
⎡1 1 1 0⎤
⎢0 1 4 1⎥
⎢ 7 7⎥
7 times the second row was added to the
⎣⎢ 0 0 0 0⎦⎥ third row.

The system of equations corresponding to this augmented matrix in row echelon form is
0

0 0
Solve the equations for the leading variables
x1 −x 2 − x 3

x2 7 − 7 x3
1 4
then substitute the second equation into the first
x1 − 71 − 73 x 3

x2 7 − 7 x3
1 4
If we assign an arbitrary value , the general solution is given by the formulas
, ,
⎛1 0 0 4 4 ⎞
11. The reduced echelon form of the matrix from problem 7 is ⎜ 0 1 −1 5 −1⎟ . The fourth w
⎜ ⎟
⎝ 0 0 1 −4 1 ⎠
is parameterized, w t.
Then back‐substitution gives z 1 4t. Row 2 becomes y − 1 4t 5t −1, so y −t.

Solving row 1 for x yields x 4 − 4t. The solution is x 4 − 4t, y −t, z 1 4t, w t.
⎡0 −2 3 1⎤
12. ⎢ ⎥
⎢3 6 −3 −2⎥ The augmented matrix for the system.
⎢⎣6 6 3 5⎥⎦

⎡3 6 −3 −2⎤
⎢0 −2 3 1⎥ The first and second rows were
⎢ ⎥ interchanged.

⎣⎢6 6 3 5⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0 −2 3
⎢ 1⎥⎥ The first row was multiplied by .
⎢⎣6 6 3 5⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0 −2 3 1⎥⎥
⎢ –6 times the first row was added to the third
⎢⎣0 −6 9 9⎥⎦ row.

⎡1 2 −1 − 32 ⎤
⎢0 1 − 3 − 1 ⎥
⎢ 2 2⎥
⎢⎣0 −6 The second row was multiplied by .
9 9⎥⎦
⎡1 2 −1 − 32 ⎤
⎢0 1 − 32 − 12 ⎥⎥
⎢ 6 times the second row was added to the
⎢⎣0 0 0 6 ⎥⎦ third row.

⎡1 2 −1 − 32 ⎤
⎢0 1 − 32 − 12 ⎥⎥
⎢
⎢⎣0 The third row was multiplied by .
0 0 1⎥⎦
The system of equations corresponding to this augmented matrix in row echelon form

0 1
is clearly inconsistent.
14. The system does not have nontrivial solutions.
(The third equation requires 0, which substituted into the second equation yields 0.
Both of these substituted into the first equation result in 0.)
16. The second equation is a multiple of the first one.
This system has nontrivial solutions (e.g., 2 and 3 ).

⎛ 2 1 4 0⎞ ⎛ 1 0 2 0⎞
17. The augmented matrix is ⎜ 3 1 6 0⎟ . Replace R1 with R2 − R1 ⎜ 3 1 6 0⎟
⎜ ⎟ ⎜ ⎟
⎝ 4 1 9 0⎠ ⎝ 4 1 9 0⎠
⎛ 1 0 2 0⎞
Replace R2 with R2 − 3R1 and replace R3 with R3 − 4R1. ⎜ 0 1 0 0⎟
⎜ ⎟
⎝ 0 1 1 0⎠
⎛ 1 0 2 0⎞
Replace R3 with R3 − R2. ⎜ 0 1 0 0⎟
⎜ ⎟
⎝ 0 0 1 0⎠
⎛ 1 0 0 0⎞
For reduced row echelon form replace R1 with R1 − 2R3. ⎜ 0 1 0 0⎟
⎜ ⎟
⎝ 0 0 1 0⎠
The only solution is the trivial solution x1 0, x2 0, x3 0.
18. We present two different solutions.
Solution I uses Gauss‐Jordan elimination
⎡ 2 −1 − 3 0⎤
⎢ −1
⎢ 2 − 3 0⎥⎥ The augmented matrix for the system.

⎣⎢ 1 1 4 0⎥⎦
⎡ 1 − 12 − 32 0⎤
⎢ ⎥
⎢ −1 2 −3 0⎥ The first row was multiplied by .
⎢⎣ 1 1 4 0⎥⎦
⎡1 − 12− 32 0⎤
⎢ ⎥
⎢0
3
2 − 92 0⎥ The first row was added to the second row.
⎢⎣1 1 4 0⎥⎦
⎡1 − 12 − 32 0⎤
⎢ ⎥ –1 times the first row was added to the third
⎢0
3
2 − 92 0 ⎥
row.
⎢⎣0 3
2
11
2 0 ⎥⎦
⎡1 − 12 − 32 0 ⎤
⎢ ⎥
⎢0 1 −3 0 ⎥
⎢⎣0 The second row was multiplied by .
3
2
11
2 0 ⎥⎦

⎡1 − 12 − 32 0 ⎤
⎢ ⎥
⎢0 1 −3 0 ⎥ times the second row was added to the
⎢⎣0 0 10 0 ⎥⎦ third row.

⎡1 − 12 − 32 0 ⎤
⎢ ⎥
⎢0 1 −3 0 ⎥
⎢⎣0 The third row was multiplied by .
0 1 0 ⎥⎦
⎡1 − 12 0 0⎤ 3 times the third row was added to the
⎢0 1 0 0⎥⎥
second row
⎢
and times the third row was added to the
⎣⎢0 0 1 0⎥⎦ first row

⎡1 0 0 0⎤
⎢0 1 0 0⎥⎥
⎢ times the second row was added to the
⎣⎢0 0 1 0⎥⎦ first row.

Unique solution: 0, 0, 0.
Solution II. This time, we shall choose the order of the elementary row operations differently in
order to avoid introducing fractions into the computation. (Since every matrix has a unique reduced
row echelon form, the exact sequence of elementary row operations being used does not matter –
see part 1 of the discussion “Some Facts About Echelon Forms” on p. 21)
⎡ 2 −1 −3 0⎤
⎢ −1 2 −3 0⎥
⎢⎣ 1 1 4 0⎥⎦
⎡ 1 1 4 0⎤ The first and third rows were interchanged
⎢ −1 2 −3 0⎥
⎢ ⎥ (to avoid introducing fractions into the first
⎢⎣ 2 −1 −3 0⎥⎦ row).
⎡1 1 4 0⎤
⎢0
⎢ 3 1 0⎥⎥ The first row was added to the second row.
⎢⎣2 − 1 −3 0⎥⎦
⎡1 1 4 0⎤
⎢0 3
1 0⎥⎥
–2 times the first row was added to the third
⎢ row.

⎣⎢0 −3 −11 0⎥⎦

⎡1 1 4 0⎤
⎢0 3 1 0⎥⎥
⎢
The second row was added to the third row.
⎣⎢0 0 −10 0⎥⎦
⎡1 1 4 0⎤
⎢0 3 1 0⎥⎥
⎢
The third row was multiplied by .
⎢⎣0 0 1 0⎥⎦
⎡1 1 4 0⎤
⎢0 3 0 0⎥⎥
⎢ –1 times the third row was added to the
⎢⎣0 0 1 0⎥⎦ second row.
⎡1 1 0 0⎤
⎢0 3 0 0⎥⎥
⎢ –4 times the third row was added to the first
⎢⎣0 0 1 0⎥⎦ row.
⎡1 1 0 0⎤
⎢0 1 0 0⎥⎥
⎢
⎢⎣0 0 1 0⎥⎦
⎡1 0 0 0⎤
⎢0 1 0 0⎥⎥
⎢ –1 times the second row was added to the
⎢⎣0 0 1 0⎥⎦ first row.

Unique solution: 0, 0, 0.
⎛ 1 −1 7 4 0⎞
19. The augmented matrix is ⎜ .
⎝ 1 2 −6 −1 0⎟⎠
⎛ 1 −1 7 4 0⎞
Replace R2 with R2 − R1 ⎜ .
⎝ 0 3 −13 −5 0⎟⎠
⎛ 1 −1 7 4 0⎞
Replace R2 with 13 R2. ⎜ .
⎝ 0 1 − 13
3
− 53 0⎟⎠
⎛ 1 0 83 7
3
0⎞
For row reduced echelon form replace R1 with R1 R2. ⎜ ⎟ .
⎝ 0 1 − 3 − 3 0⎠
13 5

Parameterize x3 s and x4 t. Then x 2 13

3
s 5
3
t and x 1 − 83 s − 73 t .
The solution is x 1 − 83 s − 73 t , x 2 13
3
s + 53 t , x3 s, x4 t. (Or, let x3 3S, x4 3T, and then
x2 13S 5T and x1 −8S − 7T.
⎡ 0 1 3 −2 0⎤
20. ⎢ 2 1 −4 3 0⎥
⎢ 2 3 2 −1 0⎥
⎢ ⎥
⎣ −4 −3 5 −4 0⎦
⎡ 2 1 −4 3 0⎤
⎢ 0 1 3 −2 0⎥
⎢ ⎥ The first and second rows were interchanged.
⎢ 2 3 2 −1 0⎥
⎢ ⎥
⎣ −4 −3 5 −4 0⎦
⎡1 1
2 −2 32 0⎤
⎢ ⎥
⎢ 0 1 3 −2
0⎥
The first row was multiplied by .
⎢ 2 3 2 −1 0⎥
⎢ ⎥
⎢⎣ −4 −3 5 −4 0⎥⎦
⎡1 12 −2 32 0⎤
⎢ ⎥
0 1 3 −2 0⎥ –2 times the first row was added to the third
⎢
⎢0 2 6 −4 0⎥ row and 4 times the first row was added to the
⎢ ⎥ fourth row.
⎢⎣0 −1 −3 2 0⎥⎦
⎡1 12 −2 3
2 0⎤
⎢ ⎥ –2 times the second row was added to the

⎢0 1 3 −2 0⎥
third row and the second row was added to
⎢0 0 0 0 0⎥
⎢ ⎥ the fourth row.
⎣⎢0 0 0 0 0⎦⎥
⎡1 0 − 72 5
2 0⎤
⎢ ⎥

⎢0 1 3 −2 0⎥ times the second row was added to the

⎢0 0 0 0 0⎥ first row.
⎢ ⎥
⎣⎢0 0 0 0 0⎦⎥

If we assign and the arbitrary values and , respectively, the general solution is given
by the formulas
, 3 2 , ,


⎡1 3 0 1 0⎤
⎢1 4 2 0 0⎥⎥
22. ⎢
⎢0 −2 −2 −1 0⎥
⎢2 −4 1 1 0⎥
⎢⎣1 −2 −1 1 0⎥⎦

⎡1 3 0 1 0⎤
⎢0 1 2 −1 0⎥⎥ –1 times the first row was added to the
⎢ second row,
⎢0 −2 −2 −1 0⎥
⎢ ⎥ –2 times the first row was added to the fourth
⎢0 −10 1 −1 0⎥ row,
⎢⎣0 −5 −1 0 0⎥⎦ and –1 times the first row was added to the
fifth row.

⎡1 3 0 1 0⎤
⎢0 1 2 −1 0⎥⎥ 2 times the second row was added to the third
⎢ row,
⎢0 0 2 −3 0⎥
⎢ ⎥ 10 times the second row was added to the
⎢0 0 21 −11 0⎥ fourth row,
⎢⎣0 0 9 −5 0⎥⎦ and 5 times the second row was added to the
fifth row.
⎡1 3 0 1 0⎤
⎢0 1 2 −1 0⎥⎥
⎢

⎢0 0 1 − 32 0⎥
⎢ ⎥ The third row was multiplied by .
⎢0 0 21 −11 0⎥
⎢⎣0 0 9 −5 0⎥⎦

⎡1 3 0 1 0⎤
⎢0
⎢ 1 2 −1 0⎥⎥ –21 times the third row was added to the

⎢0 0 1 − 32 0⎥ fourth row
⎢ ⎥
⎢0 0 0 412 0⎥ and –9 times the third row was added to the
⎢⎣0 0 0 172 0⎥⎦ fifth row.

⎡1 3 0 1 0⎤
⎢0 1 2 −1 0⎥⎥
⎢
⎢0 0 1 − 32 0⎥ The fourth row was multiplied by .
⎢ ⎥
⎢0 0 0 1 0⎥

⎢⎣0 0 0 172 0⎥⎦
⎡1 3 0 1 0⎤
⎢0 1 2 −1 0⎥⎥
⎢

⎢0 0 1 − 32 0⎥ times the fourth row was added to the
⎢ ⎥
⎢0 0 0 1 0⎥ fifth row.
⎢⎣0 0 0 0 0⎥⎦

The augmented matrix in row echelon form corresponds to the system
3 0
2 0

0
0
Using back‐substitution, we obtain the unique solution of this system
0, 0, 0, 0

⎡ 0 0 1 1 1 0⎤
⎢ −1 −1 2 −3 1
24. 0⎥
⎢ 1 1 −2 0 −1 0⎥
⎢ ⎥
⎣ 2 2 −1 0 1 0⎦

⎡ 1 1 −2 0 −1 0⎤
⎢ −1 −1 2 −3 1 0 ⎥
⎢ ⎥ The first and third rows were interchanged.
⎢ 0 0 1 1 1 0⎥
⎢ ⎥
⎣ 2 2 −1 0 1 0 ⎦
⎡ 1 1 −2 0 −1 0⎤

⎢ 0 0 0 −3 0 0⎥
⎢ ⎥ The first row was added to the second row
⎢ 0 0 1 1 1 0⎥ and –2 times the first row was added to the
⎢ ⎥ last row.
⎣ 0 0 3 0 3 0⎦
⎡ 1 1 −2 0 −1 0⎤
⎢ 0 0 1 1 1 0⎥
⎢ ⎥ The second and third rows were
⎢ 0 0 0 −3 0 0⎥ interchanged.
⎢ ⎥
⎣ 0 0 3 0 3 0⎦
⎡ 1 1 −2 0 −1 0⎤
⎢ 0 0 1 1 1 0⎥

⎢ 0 0 0 −3 0 0⎥ fourth row.
⎢ ⎥
⎣ 0 0 0 −3 0 0⎦
⎡ 1 1 −2 0 −1 0⎤
⎢ 0 0 1 1 1 0⎥
⎢ 0 0 0 1 0 0⎥
⎢ ⎥
⎣ 0 0 0 −3 0 0⎦

⎡ 1 1 −2 0 −1 0 ⎤
⎢ 0 0 1 1 1 0⎥
⎢ ⎥ 3 times the third row was added to the fourth
⎢ 0 0 0 1 0 0⎥ row.
⎢ ⎥
⎣ 0 0 0 0 0 0⎦
⎡ 1 1 −2 0 −1 0 ⎤
⎢ 0 0 1 0 1 0⎥
⎢ ⎥ –1 times the third row was added to the
⎢ 0 0 0 1 0 0⎥ second row.
⎢ ⎥
⎣ 0 0 0 0 0 0⎦
⎡ 1 1 0 0 1 0⎤
⎢ 0 0 1 0 1 0⎥
⎢ ⎥ 2 times the second row was added to the first
⎢ 0 0 0 1 0 0⎥ row.
⎢ ⎥
⎣ 0 0 0 0 0 0⎦
If we assign and the arbitrary values and , respectively, the general solution is given
by the formulas
, , , 0,
⎛ 1 2 1 2⎞
25. The augmented matrix is ⎜ 2 −2 3 1⎟ .
⎜ ⎟
⎝ 1 2 − a a⎠
⎛1 2 1 2 ⎞
⎜
Replace R2 with R2 − 2R1 and replace R3 with R3 − R1. 0 −6 1 −3 ⎟ .
⎜ ⎟
⎝ 0 0 −a − 1 a − 2⎠
The system will have no solutions if a −1, as this would make the equation for R3: 0 −3.
⎛1 2 1 2 ⎞
−1
If a ≠ −1, then replace R3 with R3. 0 −6 1 −3 ⎟ . At this point, one can see that
⎜
a +1 ⎜ ⎟
⎜⎝ 0 0 1 − a −2 ⎟⎠
a 1
there will be a unique solution to the system for all a ≠ −1.
⎡1 2 1 2 ⎤
26. ⎢2 −2
⎢ 3 1 ⎥⎥ The augmented matrix for the system.
⎢⎣1 2 −(a2 − 3) a ⎥⎦
⎡1 2 1 2 ⎤ –2 times the first row was added to the
⎢0 −6
⎢ 1 −3 ⎥⎥ second row and –1 times the first row was

⎣⎢0 0 −a 2 a − 2⎦⎥
2 added to the third row.

⎡1 2 1 2 ⎤
⎢0 1 ⎥

⎢ 1 −61
2 ⎥ The second row was multiplied by .
⎢⎣0 0 −a + 2 a − 2 ⎥⎦
2

The system has no solutions when √2 or √2 (since the third row of our last matrix
would then correspond to a contradictory equation).
For all remaining values of (i.e., √2 and √2 ) the system has exactly one solution.
There is no value of for which this system has infinitely many solutions.
⎛1 2 −3 4 ⎞
⎜
27. ⎜ 3 −1 5 2 ⎟⎟
⎜⎝ 4 1 (a2 − 2) a 4⎟⎠
⎛1 2 −3 4 ⎞

⎜
Replace R2 with R2 − 3R1 and replace R3 with R3 − 4R1. ⎜ 0 −7 14 −10 ⎟⎟
⎜⎝ 0 −7 (a2 10) a − 12⎟⎠
⎛1 2 −3 4 ⎞
⎜
Replace R3 with R3 − R2. ⎜ 0 −7 14 −10 ⎟⎟
⎜⎝ 0 0 (a2 − 4) a − 2⎟⎠
Replace R2 with − 71 R2. (This step is not actually necessary, but it is the usual next step in putting
the matrix in RRE form.)
⎛1 2 −3 4 ⎞
⎜0 1 −2 10 ⎟
.
⎜ 7 ⎟
⎜⎝ 0 0 (a − 4) a − 2⎟⎠
2
If a −2, R3 becomes 0 −4, so the system is inconsistent.
If a 2, R3 becomes 0 0 so the third variable would be parameterized, and the system has

infinitely many solutions.
For any other value of a, the system will have a unique solution.

⎡1 1 7 −7⎤
28. ⎢2 3 17 − 16⎥⎥
⎢ The augmented matrix for the system.

⎣⎢1 2 a 1 3a ⎥⎦
2

⎡1 1 7 −7 ⎤
⎢0 1 3 −2 ⎥⎥ –2 times the first row was added to the
⎢ second row and –1 times the first row was
⎢⎣0 1 a2 − 6 3a 7 ⎥⎦ added to the third row.

⎡1 1 7 −7 ⎤
⎢0 1 3 −2 ⎥⎥ –1 times the second row was added to the
⎢ third row.

⎣⎢0 0 a − 9 3a 9⎦⎥
2

The system has no solutions when 3 (since the third row of our last matrix would then
correspond to a contradictory equation).
The system has exactly one solution when 3 and 3.
The system has infinitely many solutions when 3.
⎡1 1 1 a ⎤
30. ⎢2 ⎥
⎢ 0 2 b ⎥ The augmented matrix for the system.
⎢⎣0 3 3 c ⎥⎦
⎡1 1 1 a ⎤
⎢0 −2 0
− 2a b ⎥⎥
–2 times the first row was added to the
⎢ second row.

⎣⎢0 3 3 c ⎥⎦
⎡1 1 1 a ⎤
⎢0 ⎥
⎢ 1 0 a − 2b ⎥ The second row was multiplied by .
⎢⎣0 3 3 c ⎥⎦

⎡1 1 1 a ⎤
⎢0 ⎥ –3 times the second row was added to the
⎢ 1 0 a− 2b
⎥
third row.
⎢⎣0 0 3 −3a 32 b c ⎥⎦

⎡1 1 1 a ⎤
⎢ ⎥
⎢0 1 0 a − 2b ⎥ The third row was multiplied by .
⎢⎣0 0 1 − a 2b c⎥
3⎦

⎡1 1 0 2a − 2b − 3c ⎤
⎢ ⎥ –1 times the third row was added to the first
⎢0 1 0 a − 2b ⎥
row.
⎢⎣0 0 1 − a 2b 3c ⎥⎦

⎡1 0 0 a − 3c ⎤
⎢0 1 0 a − 2b ⎥ first row.
⎢⎣0 0 1 − a 2b c⎥
3⎦

The system has exactly one solution: , , and .
⎡2 1 3⎤
32. ⎢0 −2 −29⎥
⎢ ⎥
⎣⎢3 4 5⎥⎦
⎡2 1 3⎤
⎢0 −2 −29⎥ –1 times the first row was added to the third
⎢ ⎥ row.
⎢⎣1 3 2⎥⎦
⎡1 3 2⎤
⎢0 −2 −29⎥
⎢ ⎥ The first and third rows were interchanged.
⎢⎣2 1 3⎥⎦
⎡1 3 2⎤
⎢0 −2 −29⎥ –2 times the first row was added to the third
⎢ ⎥ row.
⎢⎣0 −5 −1⎥⎦
⎡1 3 2⎤
⎢0 −2 −29⎥ –3 times the second row was added to the
⎢ ⎥ third row.

⎣⎢0 1 86⎦⎥
⎡1 3 2⎤
⎢0 1 86⎥
⎢ ⎥ The second and third rows were interchanged.
⎢⎣0 −2 −29⎥⎦
⎡1 3 2⎤
⎢0
1 86⎥⎥
⎢ row.
⎢⎣0 0 143⎥⎦
⎡1 3 2⎤
⎢0
⎢ 1 86 ⎥⎥ The third row was multiplied by .
⎢⎣0 0 1⎥⎦

⎡1 3 0⎤ –86 times the third row was added to the
⎢0
⎢ 1 0⎥⎥ second row and –2 times the third row was

⎣⎢0 0 1⎥⎦ added to the first row.
⎡1 0 0⎤
⎢0
0⎥⎥
–3 times the second row was added to the first
⎢ 1
row.
⎢⎣0 0 1⎥⎦

34. We begin by substituting sin , cos , and tan so that the system becomes
2 3 3
4 2 2 2
6 3 9
⎡ 2 −1 3 3⎤
⎢4 2 −2
⎢ 2⎥⎥ The augmented matrix for the system.
⎢⎣6 −3 1 9⎥⎦
⎡2 −1 3 3⎤
⎢0 4 −8 −4⎥ –2 times the first row was added to the second
⎢ ⎥ row and –3 times the first row was added to
⎢⎣0 0 −8 0⎥⎦
the third row.
⎡2 −1 3 3⎤
⎢0 4 −8 −4⎥

⎣⎢0 0 1 0⎥⎦
⎡2 −1 0 3⎤ 8 times the third row was added to the second
⎢0 4
⎢ 0 −4⎥⎥ row and –3 times the third row was added to
⎢⎣0 0 1 0⎥⎦ the first row.
⎡2 −1 0 3⎤
⎢0 1
⎢ 0 −1⎥⎥ The second row was multiplied by .
⎢⎣0 0 1 0⎥⎦
⎡2 0 0 2⎤
⎢0
⎢ 1 0 −1⎥⎥ The second row was added to the first row.
⎢⎣0 0 1 0⎥⎦
⎡1 0 0 1⎤
⎢0
⎢ 1 0 −1⎥⎥ The first row was multiplied by .

⎣⎢0 0 1 0⎥⎦

This system has exactly one solution 1, 1, 0.

The only angles , , and that satisfy the inequalities 0 2 , 0 2 , 0

and the equations
sin 1, cos 1, tan 0
are , , and 0.
36. We begin by substituting , , and so that the system becomes

2 4 1
2 3 8 0
9 10 5
⎡ 1 2 −4 1⎤
⎢ 2
⎢ 3 8 0⎥⎥ The augmented matrix for the system.
⎢⎣ −1 9 10 5⎥⎦
⎡1 2 −4 1⎤
⎢0
− 2⎥⎥
–2 times the first row was added to the second
⎢ −1 16
row and the first row was added to the third
⎢⎣0 11 6 6 ⎥⎦ row.
⎡1 2 −4 1⎤
⎢0
⎢ 1 − 16 2⎥⎥ The second row was multiplied by –1.
⎢⎣0 11 6 6 ⎥⎦
⎡1 2 −4 1⎤
⎢0
2⎥⎥
–11 times the second row was added to the
⎢ 1 − 16
third row.
⎣⎢0 0 182 −16⎦⎥
⎡1 2 −4 1⎤
⎢ ⎥
⎢0 1 − 16 2⎥ The third row was multiplied by .
⎢⎣0 0 1 − 918 ⎥⎦

Using back‐substitution, we obtain
8 1 91
91 8
54 1 91
2 16
91 54
7 1 13
1 2 4
13 7
38. Each point on the curve yields an equation, therefore we have a system of three equations
equation corresponding to 2, 7 : 53 2 7 0

53 2 7 1 0
The augmented matrix of this system 41 4 5 1 0 has the reduced row echelon
25 4 3 1 0
form
1 0 0 0
0 1 0 0
0 0 1 0
, , ,
(For instance, letting the free variable have the value 29 yields 1, 2, and

4.)
40. (a) 3 (this will be the number of leading 1's if the matrix has no rows of zeros)
(b) 5 (if all entries in are 0)
(c) 2 (this will be the number of rows of zeros if each column contains a leading 1)
42. (a) Either the three lines properly intersect at the origin, or two of them completely overlap and

the third one intersects them.
(b) All three lines completely overlap one another.
(Since the exercise specifically mentions three lines, we should assume that in each equation at
least one of the line coefficients is nonzero.)
1.3 Matrices and Matrix Operations
2. (a) Defined; 1 1 matrix
(b) Undefined (A 3 1 matrix cannot be multiplied by a 6 3 matrix )
(c) Defined; 6 1 matrix


(d) Undefined (2 is a 3 1 matrix, which cannot be added to a 6 2 matrix )
(e) Defined; 2 3 matrix
(f) Undefined ( is a 6 6 matrix, which cannot be added to a 6 1 matrix )
(g) Defined; 3 6 matrix
(h) Undefined ( is a 2 2 matrix, which cannot be added to a 1 1 matrix )
⎛ −2 4 8⎞ ⎛ −2 −2 8⎞
⎛ 10 0 ⎞
3. (a) −2 1 3 (b) ⎜ 8 −1 1⎟
⎜ ⎟ (c) ⎜
⎜ ⎟ ⎜ ⎟ ⎝ −20 30⎟⎠
⎝ 11 0 5⎠ ⎝ −3 −12 1⎠
⎛ 18 −9 −72⎞
(d) ⎜ −27 0 −18⎟ (e) Not possible since B and C are not the same size.
⎜ ⎟
⎝ −36 54 −27⎠
⎛ 6 18 −24⎞ ⎛ −4 32 16⎞
⎛ 0 0 0⎞
(f) ⎜ −44 7 1 ⎟ (g) ⎜ −44 10 14⎟ (h) ⎜ (i) −2 0 3 1
⎜ ⎟ ⎜ ⎟ ⎝ 0 0 0⎟⎠
⎝ 37 60 5 ⎠ ⎝ 78 48 26⎠
(j) −2 (k) Undefined since B is not square. (l) 8
4. (a) Not possible.
⎛ −2 8 −3 ⎞
T
(b) D − E T ⎜ −2 −1 −12⎟
⎜ ⎟
⎝8 1 1 ⎠
⎛ −2 8 −3 ⎞
(c) ( D − E )
T ⎜ −2 −1 −12⎟
⎜ ⎟
⎝8 1 1 ⎠
(d) Not possible
(e) Not possible
(f) Not possible

⎛ 6 −19 2 ⎞
T
(g) 2E − 3D T ⎜ 3 2 30⎟
⎜ ⎟
⎝ −24 −4 −5⎠
⎛ 6 3 −24⎞
(
(h) 2E − 3D T T T
) ⎜ −19 2 −4 ⎟
⎜ ⎟
⎝ 2 30 −5 ⎠
(i) Not possible
(j) Not possible
⎛ 3 19 8 ⎞
(
(k) tr DE T
) tr 0 −13 25⎟
⎜
⎜ ⎟
−12
⎝ −18 −23 −2⎠
⎛ 29 11⎞
(l) tr ( BC ) tr ⎜ 74
⎝ 11 45⎟⎠
⎛ 2 −14 4 ⎞
5. (a) ⎜
⎝ 26 46 −8⎟⎠

(b) Not possible since B has more columns than A has rows.
⎛ 27 0 18 ⎞
(c) 51 −33 −105⎟
⎜
⎜ ⎟
⎝ 36 −15 222 ⎠
⎛ 4 9⎞
⎛ 2 −14 4 ⎞ ⎜ ⎛ 58 22 ⎞
(d) ⎜ −3 0⎟ ⎜⎝ −50 226⎟⎠
⎝ 26 46 −8⎟⎠ ⎜ ⎟
⎝ 2 1⎠
⎛ 2 0⎞ ⎛ 29 11⎞ ⎛ 58 22 ⎞
(e) ⎜
⎝ −4 6⎟⎠ ⎜⎝ 11 45⎟⎠ ⎜⎝ −50 226⎟⎠ (so AB C A BC )
⎛ 4 9⎞ ⎛ 97 −12 17⎞
⎛ 4 −3 2⎞
(f) ⎜ −3 0⎟ ⎜ ⎜ −12 9 −6⎟
⎜ ⎟ ⎝ 9 0 1⎟⎠ ⎜ ⎟
⎝ 2 1⎠ ⎝ 17 −6 5 ⎠

⎛ 5 16 40⎞
(g) ⎜
⎝ −10 29 39⎟⎠
(h) Since CT is a 2 by 3 matrix, multiplication with the 2 by 3 matrix B is not defined.
⎛ 69 10 10⎞
(i) Trace ⎜ 10 13 18⎟ 143 (j) 11
⎜ ⎟
⎝ 10 18 61⎠
(k) The addition ATCT 2ET is not defined.
⎛ 64 −182 58⎞
(l) Trace ⎜ 186 −48 42⎟ 18.
⎜ ⎟
⎝ 11 −1 2⎠
6. (a) not possible
(b) not possible
(c) not possible
(d) not possible
(e) not possible
(f) DTET − ED T 0 (the 3 × 3 matrix of all zeros)
3 2 7 6 67
8. (a) first column of [first column of ] 6 5 4 0 64
0 4 9 7 63
6 2 4 4 38
(b) third column of [third column of ] 0 1 3 3 18
7 7 5 5 74
6 2 4
(c) second row of [second row of ] 0 1 3 0 1 3 21 22 18
7 7 5
3 2 7 3 3
(d) first column of [first column of ] 6 5 4 6 48
0 4 9 0 24

3 2 7 4 41
(e) third column of [third column of ] 6 5 4 3 59
0 4 9 5 57
3 2 7
(f) first row of [first row of ] 6 2 4 6 5 4 6 6 70
0 4 9
3 2 7 67
10. (a) first column of 6 6 0 5 7 4 64
0 4 9 63
3 2 7 41
second column of 2 6 1 5 7 4 21
0 4 9 67
3 2 7 41
third column of 4 6 3 5 5 4 59
0 4 9 57
6 2 4 6
(b) first column of 3 0 6 1 0 3 6
7 7 5 63
6 2 4 6
second column of 2 0 5 1 4 3 17
7 7 5 41
6 2 4 70
third column of 7 0 4 1 9 3 31
7 7 5 122
⎛ 5 1 1⎞ ⎛x⎞ ⎛ 2⎞ ⎛ 5 1 1⎞ ⎛ x ⎞ ⎛ 2⎞
11. (a) A ⎜ 2 0 3⎟ , x ⎜y⎟ b ⎜ 1⎟ , so the equation is ⎜ 2 0 3⎟ ⎜ y ⎟ ⎜ 1⎟ .
⎜ ⎟ ⎜ ⎟ ⎜ ⎟ ⎜ ⎟⎜ ⎟ ⎜ ⎟
⎝ 1 2 0⎠ ⎝z⎠ ⎝ 0⎠ ⎝ 1 2 0⎠ ⎝ z ⎠ ⎝ 0⎠
⎛x1⎞
⎛ 1 1 −1 −7⎞ ⎜ ⎟ ⎛ 6⎞
x
(b) ⎜ 0 −1 4 1 ⎟ ⎜ 2 ⎟ ⎜ 1⎟
⎜ ⎟ ⎜ x3⎟ ⎜ ⎟
⎝4 2 1 8 ⎠ ⎜ ⎟ ⎝ 0⎠
⎝ x4⎠
1 2 3 3 1 2 3 3
2 1 0 0 2 1 0 0
12. (a) , , ; the matrix equation:
0 3 4 1 0 3 4 1
1 0 1 5 1 0 1 5

3 3 3 3 3 3 3
(b) 1 5 2 , , 3 ; the matrix equation: 1 5 2
0 4 1 0 0 4 1
3
3
0
14. (a) 3 2 2

4 3 7 1
2 5 4
(b) 3 2 0
5 2 2 0
3 4 7 0
2 5 6 0
1 2 0 2 6
16. 2 2 2 0 3 2 2 2 3 4 12 20 10 2
0 3 1 6
The values of that satisfy the equation are 10 and 2 .
17. Setting the components of each matrix equal and moving the constants to the right hand side
gives
b 3
a −c 2d 0

c 2d 1
a b 0
This is a system of 4 equations in 4 unknowns so can be solved by inspection or by writing it as a
linear system:
⎛0 1 0 0 3⎞ ⎛1 0 0 0 −3⎞
⎜1 0 −1 2 0⎟ ⎜0 1 0 0 3⎟
⎜ ⎟ which row reduces to ⎜ ⎟ . Thus, the solution is
⎜0 0 1 2 1⎟ ⎜0 0 1 0 −1⎟
⎜⎝ 1 1 0 0 ⎟
0⎠ ⎜⎝ 0 0 0 1 1 ⎟⎠
a = −3, b = 3, c = −1, d = 1.
18. The given matrix equation is equivalent to the linear system
8
1

3 7
2 6

After subtracting first equation from the second, adding the third to the fourth, and back‐
substituting, we obtain the solution: , , , and .
22. (a) Suppose the jth column of B is a column of zeros. Using the column view of matrix
multiplication, the jth column vector of AB A [jth column vector of B] A 0 0. Thus, AB has a
column of zeros.
(b) If A has a row of all zeros, then AB also has a row of all zeros.
⎛ 0 −1 −2 −3⎞
⎜ 1 0 −1 −2⎟
24. (a) If aij i − j, the 4 × 4 matrix is ⎜ ⎟ .
⎜ 2 1 0 −1⎟
⎜⎝ 3 2 1 0 ⎟⎠
⎛ 1 −2 3 −4 ⎞
⎜ −2 4 −6 8 ⎟
(b) If aij −1 i ij, the 4 × 4 matrix is ⎜ ⎟ .
⎜ 3 −6 9 −12⎟
⎜⎝ −4 8 −12 16 ⎟⎠
⎪⎧ 0 i − j ≥1
(c) If aij ⎨ , the only non‐zero entries come from | i − j | 0 1, so the 4 × 4
⎪⎩−1 i−j 1
⎛ −1 0 0 0 ⎞
⎜ 0 −1 0 0 ⎟
matrix is ⎜ ⎟ .
⎜ 0 0 −1 0 ⎟
⎜⎝ 0 0 0 −1⎟⎠
28. There are infinitely many such matrices, e.g., for any real value , the matrix

1 0
0 0 0 will work. (There are other possible matrices as well, e.g.,
0 0 0
0 0
0 .)
0
⎛ 1 0 0⎞ ⎛ 0 0 0⎞
31. (c) False. For an example, consider A ⎜ 0 0 0⎟ and B ⎜ 0 0 2⎟
⎜ ⎟ ⎜ ⎟
⎝ 0 0 0⎠ ⎝ 0 0 0⎠
(d) True. This is the column‐view of matrix multiplication.

1.4 Inverses; Algebraic Properties of Matrices
72 248 132
2. (a) 28 68 88
44 108 152
20 32 23
(b) 1 84 23
13 52 2
20 30 9
(c) 10 37 67
16 0 71
0 56 84
(d) 28 196 112
84 140 252
3. [Note: Correct Exercise 3(a) B T T
B ]
⎛ 8 0 4⎞ ⎛ 8 −3 −5⎞
( )
T
(a) B T ⎜ −3 1 −7⎟ , and B T ⎜0 1 2 ⎟ B .
⎜ ⎟ ⎜ ⎟
⎝ −5 2 6 ⎠ ⎝ 4 −7 6 ⎠
T T
⎛ ⎛ 2 −1 3⎞ ⎛ 0 −2 3⎞ ⎞ ⎛ 2 −3 6 ⎞ ⎛ 2 1 1⎞
(b) ( A C )
T ⎜ ⎜ 0 4 5⎟ ⎜ 1 7 4⎟ ⎟ ⎜ 1 11 9 ⎟ ⎜ −3 11 6 ⎟ ;.
⎜⎜ ⎟ ⎜ ⎟⎟ ⎜ ⎟ ⎜ ⎟
⎜⎝ ⎝ −2 1 4⎠ ⎝ 3 5 9⎠ ⎟⎠ ⎝ 1 6 13⎠ ⎝ 6 9 13⎠
⎛ 2 0 −2⎞ ⎛ 0 1 3⎞ ⎛ 2 1 1⎞
AT CT ⎜ −1 4 1 ⎟ ⎜ −2 7 5⎟ ⎜ −3 11 6 ⎟
⎜ ⎟ ⎜ ⎟ ⎜ ⎟
⎝ 3 5 4⎠ ⎝ 3 4 9⎠ ⎝ 6 9 13⎠
So we see that A C T AT CT.
T
⎛ −14 7 −21⎞ ⎛ −14 0 14 ⎞
(c) (bA )
T ⎜ 0 −28 −35⎟ ⎜ 7 −28 −7 ⎟
⎜ ⎟ ⎜ ⎟
⎝ 14 −7 −28⎠ ⎝ −21 −35 −28⎠

⎛ 2 0 −2⎞ ⎛ −14 0 14 ⎞
bA T
−7 ⎜ −1 4 1 ⎟ ⎜ 7 −28 −7 ⎟ .
⎜ ⎟ ⎜ ⎟
⎝ 3 5 4⎠ ⎝ −21 −35 −28⎠
So, we see that bA T bAT.
T T
⎛ ⎛ 0 −2 3⎞ ⎛ 2 −1 3⎞ ⎞ ⎛ −6 −5 2 ⎞ ⎛ −6 −6 −12⎞
(d) (CA )
T ⎜ ⎜ 1 7 4⎟ ⎜ 0 4 5⎟ ⎟ ⎜ −6 31 54⎟ ⎜ −5 31 26 ⎟ .
⎜⎜ ⎟⎜ ⎟⎟ ⎜ ⎟ ⎜ ⎟
⎜⎝ ⎝ 3 5 9⎠ ⎝ −2 1 4⎠ ⎟⎠ ⎝ −12 26 70⎠ ⎝ 2 54 70 ⎠
⎛ 2 0 −2⎞ ⎛ 0 1 3⎞ ⎛ −6 −6 −12⎞
T
AC T ⎜ −1 4 1 ⎟ ⎜ −2 7 5⎟ ⎜ −5 31 26 ⎟
⎜ ⎟⎜ ⎟ ⎜ ⎟
⎝ 3 5 4 ⎠ ⎝ 3 4 9⎠ ⎝ 2 54 70 ⎠
So, we see that CA T ATCT.
4. The determinant of , det 3 2 1 5 1, is nonzero. Therefore is invertible

2 1
and its inverse is .
5 3
5. Using the formula for the inverse of a 2 × 2 matrix, we get ad − bc 6 −2 −3 −5 3, so
1⎛
−2 −3⎞
B −1 3⎜ .
⎝ 5 6 ⎟⎠
6. The determinant of , det 6 1 4 2 2, is nonzero. Therefore is invertible
1 4 2
and its inverse is .
2 6 1 3
1 ⎛
2 3⎞
7. D −1 21 ⎜
⎝ −7 0⎟⎠
8. The determinant of the matrix is cos cos sin sin 1 0 . Therefore the

cos sin
matrix is invertible and its inverse is .
sin cos
2 5
10.
1 3
−1
⎛ 6 −5⎞ 1⎛
−2 5⎞
11. B ( ) T −1
⎜⎝ 3 −2⎟⎠ 3⎜
⎝ −3 6⎟⎠
,

T
1⎛
−2 −3⎞ 1⎛
−2 5⎞
(B )
−1 T
3⎜
⎝ 5 6 ⎟⎠ 3⎜
⎝ −3 6⎟⎠
.
−1
⎛ 13 7 ⎞ ⎛ 11 − 73 ⎞
12. ( AB )
−1 3
⎜⎝ 20 11⎟⎠ ⎜⎝ − 20 13 ⎟
,
3 3 ⎠
1⎛
−2 5⎞ ⎛ 2 −1⎞ ⎛ 11 − 73 ⎞
B −1 A −1 3⎜
3

⎝ −3 6⎟⎠ ⎜⎝ −5 3 ⎟⎠ ⎜ − 20
⎝ 3 13 ⎟
3 ⎠
−1
⎛ 64 45⎞ ⎛ 23 − 15 ⎞
13. ( ABC )
−1 2 2
⎜⎝ 98 69⎟⎠ ⎜ − 49 32 ⎟
,
⎝ 3 3 ⎠
⎛ − 12 −2⎞ 1 ⎛ −2 5⎞ ⎛ 2 −1⎞ ⎛ 23 − 15 ⎞
C −1B −1 A −1 2 2
⎜ − 49 32 ⎟
⎝⎜ 1 3 ⎠⎟ 3 ⎝⎜ −3 6⎠⎟ ⎝⎜ −5 3 ⎠⎟ ⎝ 3 3 ⎠
14. From part (a) of Theorem 1.4.7 we have .
5 1
Therefore .
3 2
⎛ 4 2⎞ 1 ⎛
3 −2⎞
15. The inverse of ⎜ is 5A, and by Theorem 1.4.5 we find this to be 5A ,
⎝ 1 3⎟⎠ 10 ⎜
⎝ −1 4 ⎟⎠
1 ⎛
3 −2⎞
so A 50 ⎜ .
⎝ −1 4 ⎟⎠
16. From part (a) of Theorem 1.4.7 it follows that the inverse of 5 is 5 .

1
2 1 2 1
Thus 5 . Consequently, .
5 3 5 3
0
8 0
18. (a) (b)
28 1 1
1 0 0 0
(c) (d) 2
4 0 4 1
7 0 8 0
(e) 2 (f) 2 4
20 2 20 3

⎛ 1 −1⎞
19. Let A ⎜⎝ −2 3 ⎟⎠
⎛ 11 −15⎞
(a) A3 ⎜⎝ −30 41 ⎟⎠

⎛ 41 15⎞
(b) A −3 ⎜⎝ 30 11⎟⎠ (Note: 41 11 − −15 −30 1)
⎛ 3 −4⎞ ⎛ 2 −2⎞ ⎛ 1 0⎞ ⎛ 2 −2⎞

(c) A 2 − 2A I ⎜⎝ −8 11⎟⎠ − ⎜⎝ −4 6 ⎟⎠ ⎜⎝ 0 1⎟⎠ ⎜⎝ −4 6 ⎟⎠
⎛1 −1⎞ ⎛ 1 0⎞ ⎛ −1 −1⎞
(d) p ( x ) x − 2, p ( A ) ⎜ ⎟ − 2⎜ ⎜⎝ −2 1 ⎟⎠
⎝ −2 3⎠ ⎝ 0 1⎟⎠
⎛ 6 −8⎞ ⎛ 1 −1⎞ ⎛ 1 0⎞ ⎛ 6 −7⎞

(e) p ( x ) 2x 2 − x 1, p ( A ) ⎜⎝ −16 22⎟⎠ − ⎜⎝ −2 3 ⎟⎠ ⎜⎝ 0 1⎟⎠ ⎜⎝ −14 20⎟⎠
⎛ 11 −15⎞ ⎛ 1 −1⎞ ⎛ 4 0⎞ ⎛ 13 −13⎞

(f) p ( x ) x 3 − 2x 4, p ( A ) ⎜⎝ −30 41 ⎟⎠ − 2 ⎜⎝ −2 3 ⎟⎠ ⎜⎝ 0 4⎟⎠ ⎜⎝ −26 39 ⎟⎠
0
13 0 14 1 0 3
20. (a) 0 8 0 (b) 0 0 (c) 0 9 0
70 0 27 0 15 0 4
1 0 1 6 0 9 15 0 12
(d) 0 4 0 (e) 0 11 0 (f) 0 0 0
5 0 0 45 0 3 60 0 27
5 0
22. 9 ,
12 8
5 0 1 0 5 0
3 , 3 ,
4 4 4 2 12 8
24. 3 3

3 3 3 Theorem 1.4.1(e)

3 3 3 3 Theorem 1.4.1(i)

3 3 9 Theorem 1.4.1(m)

Property on p.
3 3 9
41

9 Theorem 1.4.1(b)
28. If A2 5A − 2I 0, then A2 − 5A 2I, so 12 A ( A − 5I ) I . Thus the inverse of A is 12 ( A − 5I ) .
30. Multiplying both sides on the left by and on the right by

yields
.
32. Yes, it is true. From part (e) of Theorem 1.4.8, it follows that .
This statement can be extended to n factors (see p. 47) so that

factors factors
( ) ( ) ( )
−1 −1
33. D −1CBA ( BA ) C −1 C −1D
−1
D −1CBA A −1B −1 C −1 C −1D

D −1CB ( AA −1 ) B −1C −1 (C −1D )

−1
D −1C ( BB −1 )C −1 (C −1D )
−1

D −1 (CC −1 )(C −1D )
−1

(
D −1 D −1 (C −1 )
−1
) D −2C .
34. .
multiplied by
its inverse yields
36. Letting , the matrix equation becomes
1 0 0
0 1 0
0 0 1
Although this corresponds to a system of nine equations, it is sufficient to examine just the three
equations corresponding to the first column
1
0
0

to see that subtracting the second and third equations from the first leads to a contradiction
0 1.
We conclude that is not invertible.
37. If X A−1 exists, then AX I, so we attempt to solve the linear system that arises from setting

the coordinates equal to each other.
⎛ 1 0 1 ⎞ ⎛ x 11 x 12 x 13 ⎞ ⎛ x 11 x 31 x 12 x 32 x 13 x 33 ⎞ ⎛ 1 0 0⎞
AX ⎜0 1 0 ⎟ ⎜ x x 22 x 23 ⎟ ⎜ x x 22 x 23 ⎟ ⎜ 0 1 0⎟ .
⎜ ⎟ ⎜ 21 ⎟ ⎜ 21
⎟ ⎜ ⎟
⎝ 1 0 −1⎠ ⎝ x 31 x 32 x 33 ⎠ x −
⎝ 11 x 31 x 12 − x 32 x 13 − x 33 ⎠ ⎝ 0 0 1⎠
Notice that we immediately see that x21 0, x22 1, x23 0, so we can just work with the linear

system given by the other 6 variables.
x11 + x 31 =1
x12 + x 32 =0
x13 + x 33 =0

x11 − x 31 =0
x12 − x 32 =0
x13 − x 33 =1
⎛1 0 0 1 0
1⎞ 0 ⎛1 0 0 0 0 0 1
2
⎞
⎜0 1 0 0 0⎟
1 0 ⎜0 1 0 0 0 0 0⎟
⎜ ⎟ ⎜ ⎟
⎜0 0 1 0 0 1 0⎟ ⎜0 0 1 0 0 0 2 ⎟
1
This augmented matrix ⎜ ⎟ reduces to ⎜ 1 ⎟
.
1 0 0 −1 0 0 0 ⎜0 0 0 1 0 0 2 ⎟
⎜ ⎟
⎜0 1 0 0 −1 0 0⎟ ⎜0 0 0 0 1 0 0⎟
⎜ ⎟ ⎜⎜ ⎟
⎝0 0 1 0 0 −1 1⎠ ⎝0 0 0 0 0 1 − 1 ⎟⎠
2
Thus x 11 1
2 , x12 0, etc.
⎛ 12 0 12 ⎞
Since there is a solution, the matrix A is invertible, and the inverse is ⎜ 0 1 0 ⎟ .
⎜ ⎟
⎜⎝ 1 0 − 1 ⎟⎠
2 2
40. ,
⎛ 7 2⎞ ⎛ x 1 ⎞ ⎛ 3⎞
41. This linear system is ⎜ ⎜⎝ 0⎟⎠ . To solve, multiply both sides of the equation by
⎝ 3 1⎟⎠ ⎜⎝ x 2 ⎟⎠
⎛ 1 −2⎞ ⎛ x1⎞ ⎛ 1 −2⎞ ⎛ 3⎞ ⎛ 3⎞

A −1 ⎜⎝ −3 7 ⎟⎠ to get ⎝⎜ x ⎠⎟ .
2 ⎝⎜ −3 7 ⎠⎟ ⎝⎜ 0⎠⎟ ⎝⎜ −9⎠⎟

42. ,
⎛ 0 0⎞ ⎛ 0 0⎞ ⎛ 0 0⎞ ⎛ 0 0⎞
58. (c) A ⎜⎝ 1 1⎟⎠ is one possible example, since ⎜⎝ 1 1⎟⎠ ⎜⎝ 1 1⎟⎠ ⎜⎝ 1 1⎟⎠ .
1.5 Elementary Matrices and a Method for Finding A−1
2. (a) Elementary matrix (corresponds to multiplying the second row by √3 )
(b) Elementary matrix (corresponds to interchanging the first row and the third row)
(c) Elementary matrix (corresponds to adding 9 times the third row to the second row)
(d) Not an elementary matrix
⎛1 0⎞ ⎛1 0 ⎞ ⎛1 0⎞
3. (a) Multiply R2 by −41 , E . Then ⎜ −1 ⎟ ⎜
I 2 .
⎜⎝ 0 −1 ⎟
4⎠ ⎝0 4 ⎠ ⎝0 −4⎟⎠
⎛ 1 −9 0⎞
(b) Add −9 R2 to R1. E ⎜ 0 1 0⎟ .
⎜ ⎟
⎝ 0 0 1⎠
⎛ 1 0 0⎞
(c) Interchage R2 and R3. E ⎜ 0 0 1⎟
⎜ ⎟
⎝ 0 1 0⎠
⎛1 0 0 0⎞
⎜0 1 0 1⎟
(d) Add R4 to R2. E ⎜ ⎟
⎜0 0 1 0⎟
⎜⎝ 0 0 0 1⎟⎠
1 0
4. (a) Add 3 times the first row to the second row:
3 1
1 0 0
(b) Multiply the third row by : 0 1 0
0 0

0 0 0 1
0 1 0 0
(c) Interchange the first and fourth rows:
0 0 1 0
1 0 0 0
1 0 0
(d) Add times the third row to the first row: 0 1 0 0
0 0 1 0
0 0 0 1
6 12 30 6
6. (a) Multiply the first row by 6 :
3 6 6 6
2 1 0 4 4
(b) Add 4 times the first row to the second row: 7 1 1 21 19
2 0 1 3 1
1 4
(c) Multiply the second row by 5 : 10 25
3 6
⎛ 1 0 0⎞ ⎛ 1 0 0⎞
7. (a) E ⎜ 0 1 0⎟ (b) E ⎜ 0 1 0⎟
⎜ ⎟ ⎜ ⎟
⎝ −2 0 1⎠ ⎝ 2 0 1⎠
⎛ 12 0 0⎞ ⎛ 2 0 0⎞
(c) E ⎜ 0 1 0⎟ (d) E ⎜ 0 1 0⎟
⎜ ⎟ ⎜ ⎟
⎜⎝ 0 0 1⎟⎠ ⎝ 0 0 1⎠
⎛ 1 0 0⎞ ⎛1 0 0 ⎞
8. (a) E ⎜ 0 1 1⎟ (b) E ⎜ 0 1 −1⎟
⎜ ⎟ ⎜ ⎟
⎝ 0 0 1⎠ ⎝0 0 1 ⎠
⎛ 1 0 0⎞ ⎛ 1 0 0⎞
(c) E ⎜ 3 1 0⎟ (d) E ⎜ −3 1 0⎟
⎜ ⎟ ⎜ ⎟
⎝ 0 0 1⎠ ⎝ 0 0 1⎠
10. ⎡ −3 6 1 0⎤ The identity matrix was adjoined to the given
⎢ ⎥
⎣4 5 0 1⎦ matrix.
⎡ 1 −2 − 13 0⎤
⎢ ⎥ The first row was multiplied by − 13 .
⎣ 4 5 0 1⎦
⎡ 1 −2 − 13 0⎤ 4 times the first row was added to the
⎢ ⎥
⎣ 0 13 3
4
1⎦ second row.

⎡ 1 −2 − 13 0⎤
⎢ ⎥ The second row was multiplied by .
⎣ 0 1
4 1
39 ⎦
13
⎡ 1 0 − 395 2
13
⎤ 2 times the second row was added to the first
⎢ ⎥
⎣ 0 1 4 1
39 13 ⎦ row.

The inverse is .
11. No inverse exists because the discriminant is 4 3 − 6 2 0.
12. ⎡ 6 −4 1 0⎤ The identity matrix was adjoined to the given
⎢ ⎥
⎣ −3 2 0 1⎦ matrix.
⎡ 0 0 1 2⎤ 2 times the second row was added to the first
⎢ ⎥
⎣ −3 2 0 1⎦ row.

A row of zeros was obtained on the left side, therefore the matrix is not invertible.
⎛ 2 1 −1 1 0 0⎞
13. ⎜ 0 6 4 0 1 0⎟
⎜ ⎟
⎜⎝ 0 −2 2 0 0 1⎟⎠
⎛ 1 12 −1
2
0 0⎞
1
2
Divide R1 by 2, and divide R2 by 6. ⎜⎜ 0 1 2
3
0 16 0⎟⎟
⎜⎝ 0 −2 2 0 0 1⎟⎠
⎛ 1 12 −1
2
1
2
0 0⎞
Add 2 R2 to R3. ⎜⎜ 0 1 2
3
0 16 0⎟⎟
⎜⎝ 0 0 10
0 13 1⎟⎠
3
⎛ 1 12 −1
2
1
2
0 0⎞
Multiply R3 by 10
3
. ⎜⎜ 0 1 2
3
0 1
6
0 ⎟⎟
⎜⎝ 0 0 1 0 1 3⎟
⎠
10 10
⎛ 1 12 0 12 1
20
3⎞
20
Add −2 ⎜ −1 ⎟
3 R3 to R2, and add 2 R3 to R1. ⎜ 0 1 0 0
1 1
10 5⎟

⎜⎝ 0 0 1 0 3⎟
10 ⎠
1
10

⎛ 1 0 0 12 0 1
4
⎞
Finally; add −1 ⎜0 1 0 0 −1 ⎟
2 R2 to R1. ⎜
1
10 5⎟
⎜⎝ 0 0 1 0 3⎟
10 ⎠
1
10
⎛ 12 0 1
4
⎞
Thus, A −1 ⎜0 1
−51⎟
.
⎜ 10 ⎟
⎜⎝ 0 1 3 ⎟
10 10 ⎠
⎡1 2 0 1 0 0⎤
14. ⎢ ⎥ The identity matrix was adjoined to the given
⎢2 1 2 0 1 0⎥
matrix.
⎢⎣0 2 1 0 0 1⎥⎦
⎡1 2 0 1 0 0⎤
⎢ ⎥ 2 times the first row was added to the
⎢0 −3 2 −2 1 0⎥ second row.
⎢⎣0 2 1 0 0 1⎥⎦
⎡1 2 0 1 0 0⎤
⎢ ⎥
⎢0 1 − 3 − 13 0⎥
2 2
3 The second row was multiplied by .
⎢⎣0 2 1 0 0 1⎥⎦
⎡1 2 0 1 0 0⎤
⎢0 1 − 3 3 − 3 0⎥
2 2 1
third row.
⎢0 0 3 −3
7 4 2
1⎥⎦
⎣ 3
⎡1 2 0 1 0 0⎤
⎢ ⎥
⎢0 1 − 3 3 − 3 0⎥
2 2 1
The third row was multiplied by .
⎢0 0 1 − 74 2 3⎥
⎣ 7 7⎦
⎡1 2 0 1 0 0⎤
⎢
2⎥
times the third row was added to the
⎢0 1 0 7 − 71
2
7⎥

⎢0 3⎥ second row.
⎣ 0 1 − 74 2
7 7⎦
⎡1 0 0 73 2
7 − 74 ⎤
⎢
2⎥
⎢0 1 0 72 − 1
7 7⎥
first row.
⎢0 0 1 − 74 2 3⎥
⎣ 7 7⎦
The inverse is .

⎡ 15 1
5 − 52 1 0 0⎤
16. ⎢1 ⎥ The identity matrix was adjoined to the given
⎢5
1
5
1
10 0 1 0⎥
matrix.
⎢⎣ 15 − 4
5
1
10 0 0 1⎥⎦
⎡1 1 −2 5 0 0⎤
⎢ ⎥
⎢1 1 2 0 5 0⎥
1
Each row was multiplied by 5.
⎢⎣1 −4 5⎥⎦
2 0 0
1
⎡1 1 −2 5 0 0⎤
⎢ ⎥ 1 times the first row was added to the
⎢0 0 2 −5 5 0⎥
5
second row and 1 times the first row was
⎢⎣0 −5 2 −5
5
0 5⎥⎦
added to the third row.
⎡1 1 −2 5 0 0⎤
⎢ ⎥
⎢0 −5 2 −5 0 5⎥
5
The second and third rows were interchanged.
⎢⎣0 0 5 0⎥⎦
2 −5
5
⎡1 1 − 2 5 0 0⎤
⎢ ⎥
⎢0 1 − 12 1 0 −1⎥ The second row was multiplied by and
⎢⎣0 0 1 −2 2 0⎥⎦ the third row was multiplied by .

⎡1 1 0 1 4 0⎤
⎢ ⎥ times the third row was added to the second
⎢0 1 0 0 1 −1⎥
⎢⎣ 0 row and 2 times the third row was added to
0 1 −2 2 0⎥⎦
the first row.
⎡1 1 0 1 3 1⎤
⎢0 1 0 0 1 −1 ⎥
first row.
⎢⎣ 0 0 1 −2 2 0⎥⎦

1 3 1
The inverse is 0 1 1 .
2 2 0
⎡ 2 3 2 0 1 0 0⎤
18. ⎢ ⎥ The identity matrix was adjoined to the given
⎢ −4 2 2 0 0 1 0⎥
matrix.
⎢ 0 0 1 0 0 1⎥⎦
⎣
⎡ 1 3
1
0 2 0 0⎤
⎢ ⎥ Each of the first two rows was multiplied by
⎢ −4 1 0 0 0⎥
1
2 .
⎢ 0 0 1 0 ⎥ √
⎢⎣ 0 1⎦⎥
⎡1 3 0 2
1
0 0⎤
⎢ ⎥ 4 times the first row was added to the second
⎢0 13 02 2 1
2
0 ⎥
⎢ ⎥ row.
⎢⎣0 0 1 0 0 1⎥
⎦

⎡1 3 0
1
2
0 0⎤
⎢ ⎥
⎢0 1 0 2 2
13
2
26 0⎥ The second row was multiplied by .
⎢ ⎥
⎢⎣0 0 1 0 0 1⎥
⎦
⎡1 0 0
2
26 − 3262 0⎤
⎢0 1 0 2 2
13 26
2
0⎥
⎢ ⎥ first row.
⎢⎣0 0 1 0 0 1⎥
⎦

√ √
0
The inverse is √ √
0 .

0 0 1
⎛ 1 4 4 1 0 0⎞
19. ⎜ 1 2 4 0 1 0⎟
⎜ ⎟
⎜⎝ 1 3 2 0 0 1⎟⎠
⎛ 1 4 4 1 0 0⎞
Subtract R1 from R2 and also from R3. ⎜ 0 −2 0 − 1 1 0⎟
⎜ ⎟
⎜⎝ 0 −1 −2 − 1 0 1⎟⎠
⎛ 1 4 4 1 0 0⎞
Interchange R3 and R2. ⎜ 0 −1 −2 − 1 0 1⎟
⎜ ⎟
⎜⎝ 0 −2 0 − 1 1 0⎟⎠
⎛1 4 4 1 0 0 ⎞
Multiply R2 by −1. ⎜ 0 1 2 1 0 −1⎟
⎜ ⎟
⎜⎝ 0 −2 0 − 1 1 0 ⎟⎠
⎛1 4 4 1 0 0 ⎞
Add 2 R2 to R3. ⎜ 0 1 2 1 0 −1⎟
⎜ ⎟
⎜⎝ 0 0 4 1 1 −2⎟⎠
⎛1 4 4 1 0 0 ⎞
Divide R3 by 4. ⎜ 0 1 2 1 0 −1⎟
⎜ ⎟
⎜⎝ 0 0 1 1 1 −1 ⎟⎠
4 4 2

⎛ 1 4 0 0 −1 2⎞
Add −2 R3 to R2 and −4 R3 to R1. ⎜ 0 1 0 12 −21 0⎟
⎜ ⎟
⎜⎝ 0 0 1 1 1 −1 ⎟
⎠
4 4 2
⎛1 0 0 − 2 1 2⎞
Finally, add −4 R2 to R1. ⎜ 0 1 0 12 −1
0 ⎟ .
⎜ 2 ⎟
⎜⎝ 0 0 1 1 1 −1 ⎟
⎠
4 4 2
⎛ −2 1 2⎞
Thus, A −1 ⎜ 1 − 1 0 ⎟ .
⎜ 2 2 ⎟
⎜⎝ 1 1
− 1⎟
4 4 2⎠
⎡1 0 0 0 1 0 0 0⎤
⎢ ⎥
20. ⎢ 1 3 0 0 0 1 0 0⎥ The identity matrix was adjoined to the

⎢1 3 5 0 0 0 1 0⎥ given matrix.
⎢ ⎥
⎢⎣ 1 3 5 7 0 0 0 1 ⎥⎦
⎡1 0 0 0 1 0 0 0⎤
⎢ ⎥
⎢0 3 0 0 −1 1 0 0 ⎥
⎢0
1 times the first row was added to
3 5 0 −1 0 1 0 ⎥
⎢ ⎥ each of the remaining rows.
⎢⎣ 0 3 5 7 − 1 0 0 1 ⎥⎦
⎡1 0 0 0 10 0⎤ 0
⎢ ⎥
⎢0 3 0 0 − 1 1 0 0⎥
⎢0
1 times the second row was added to
0 5 0 0 −1 1 0 ⎥
⎢ ⎥ the third row and to the fourth row.
⎣⎢0 0 5 7 0 −1 0 1 ⎦⎥
⎡1 0 0 0 1 0⎤
0 0
⎢ ⎥
⎢0 3 0 0 −1 1 0 0⎥ 1 times the third row was added to

⎢0 0 5 0 0 −1 1 0 ⎥ the fourth row
⎢ ⎥
⎣⎢0 0 0 7 0 0 −1 1 ⎦⎥
⎡1 0 0 0 1 0 0 0⎤
⎢ ⎥ The second row was multiplied by ,
⎢0 1 0 0 − 13 1
3 0 0⎥
the third row was multiplied by , and
⎢0 0 1 0 0 − 15 1
0⎥
⎢
5
1⎥ the fourth row was multiplied by .
⎢⎣0 0 0 1 0 0 − 71 7⎥
⎦

1 0 0 0
0 0
The inverse is .
0 0
0 0

22. This matrix is singular because its third row contains only zeros. (Refer to Example 6 in Section
1.4.)
⎡0 0 2 01 0 0 0⎤
⎢ ⎥
24. ⎢1 0 0 1 0 1 0 0⎥ The identity matrix was adjoined to

⎢0 −1 3 0 0 0 1 0⎥ the given matrix.
⎢ ⎥
⎣⎢2 1 5 −3 0 0 0 1 ⎦⎥
⎡1 0 0 10 1 0 0⎤
⎢ ⎥
⎢0 0 2 01 0 0 0⎥

The first and second rows were
⎢0 −1 3 00 0 1 0⎥ interchanged.
⎢ ⎥
⎢⎣2 1 5 −3 0 0 0 1 ⎥⎦
⎡1 0 0 1 0 0⎤
0 1
⎢ ⎥
⎢0 0 2 0 1 0 0 0⎥

2 times the first row was added to
⎢0 −1 3 0 0 0 1 0⎥
⎢ ⎥ the fourth row and to the fourth row.
⎣⎢0 1 5 −5 0 −2 0 1 ⎦⎥
⎡1 0 0 1 0 0⎤
0 1
⎢ ⎥
⎢0 −1 3 0 0
1 0⎥

0 The second and third rows were
⎢0 0 2 0 0 0⎥
1 0 interchanged.
⎢ ⎥
⎣⎢0 1 5 −5 0 −2 0 1 ⎦⎥
⎡1 0 0 1 0 0⎤ 1 0
⎢ ⎥
⎢0 1 − 3 0 0 0 −1 0 ⎥ The second row was multiplied by

⎢0 0 2 0 1 0 0 0⎥ 1.
⎢ ⎥
⎢⎣0 1 5 −5 0 −2 0 1 ⎥⎦
⎡1 0 0 1 0 1 0 0⎤
⎢ ⎥
⎢0 1 −3 0 0 0 −1 0 ⎥
⎢0
1 times the second row was added
0 2 0 1 0 0 0⎥
⎢ ⎥ to the fourth row.
⎢⎣0 0 8 −5 0 −2 1 1 ⎥⎦
⎡1 0 0 1 0 0⎤ 1 0
⎢ ⎥
⎢0 1 −3 0 0 0 −1 0 ⎥
⎢0
4 times the third row was added
0 2 0 1 0 0 0⎥
⎢ ⎥ to the fourth row.
⎣⎢0 0 0 −5 −4 −2 1 1 ⎦⎥
⎡1 0 0 1 0 1 0 0⎤
⎢ ⎥
⎢0 1 −3 0 0 0 −1 0 ⎥ The third row was multiplied by ,

⎢0 0 1 0 12 0 0 0⎥ and the fourth row was multiplied by
⎢ ⎥
⎣⎢0 0 0 1 54 52 − 15 − 15 ⎦⎥ .

⎡1 0 0 0 − 45 3
5
1
5 ⎤ 1
5
⎢ ⎥
⎢0 1 0 0 3
2 0 −1 0 ⎥ 1 times the fourth row was added

⎢0 0 1 0 1
0 0 0⎥ to the first row and 3 times the third
⎢
2
⎥
− 15 − 15 ⎦⎥ row was added to the second row.
⎣⎢0 0 0 1 4 2
5 5
0 1 0
The inverse is .
0 0 0
⎡0 0 0 k 1 1 0 0 0⎤
⎢ ⎥
0 0 k2 0 0 1 0 0⎥
26. (a) ⎢⎢ The identity matrix was adjoined to the
0 k3 0 0 0 0 1 0⎥ given matrix.
⎢ ⎥
⎢⎣k 4 0 0 0 0 0 0 1 ⎥⎦
⎡k 4 0 0 0 0 0 0 1⎤
⎢ ⎥ The first and fourth rows were
⎢0 k3 0 0 0 0 1 0⎥
interchanged; the second and third rows
⎢0 0 k2 0 0 1 0 0⎥
⎢ ⎥ were interchanged.
⎢⎣ 0 0 0 k 1 1 0 0 0⎥⎦
⎡1 0 0 0 0 0 0 1
k4 ⎤ The first row was multiplied by 1/ ,
⎢ ⎥ the second row was multiplied by 1/ ,
1 0 0 0 0 0⎥
1
⎢0 k3

⎢0 the third row was multiplied by 1/ ,
⎢ 0 1 0 0 1
k2 0 0 ⎥⎥ and the fourth row was multiplied by
⎢0 0 0 1 k1 0 0 0 ⎥⎦ 1/ .
⎣ 1

0 0 0
0 0 0
The inverse is .
0 0 0
0 0 0
⎡k 0 0 0 1 0 0 0⎤
⎢ ⎥
1 k 0 0 0 1 0 0⎥
(b) ⎢ The identity matrix was adjoined to
⎢0 1 k 0 0 0 1 0⎥ the given matrix.
⎢ ⎥
⎢⎣ 0 0 1 k 0 0 0 1⎥⎦

⎡1 0 0 0 1
k 0 0 0⎤
⎢ 1 ⎥
⎢k 1 0 0 0 1
k 0 0⎥
Each row was multiplied by 1/ .
⎢0 1
k 1 0 0 0 1
k 0⎥
⎢ ⎥
⎢⎣ 0 0 1 0 0 0 k1 ⎥⎦
1
k
⎡ 1 0 0 0 k1 0 0 0⎤
⎢ 0 0 ⎥⎥
⎢ 0 1 0 0 − k2
1 1
k

⎢ 0 k1 1 0 0
times the first row was added
0 k1 0 ⎥
⎢ ⎥ to the second row.
⎢⎣ 0 0 k 1 0
1
0 0 k1 ⎥⎦
⎡1 0 0 0 k
1
0 0 0⎤
⎢ 0 0 ⎥⎥
1 0 0 − k2
1 1
⎢0 k
⎢0
0 1 0 k13 − k12 1
0⎥ times the second row was added
⎢ k
⎥ to the third row.
⎢⎣0 0 k1 1 0 0 0 k1 ⎥⎦
⎡1 0 0 0 k
1
0 0 0⎤
⎢ 0 ⎥⎥
0 − k2 0
1 1
⎢0 1 0 k
⎢0
0 1 0 k13 − k12 1
0⎥ times the third row was added
⎢ k
⎥ to the fourth row.
⎢⎣0 0 0 1 − 14 1
− k12 1
⎥
k k3 k ⎦

0 0 0
0 0
The inverse is .
0
27. Form the augmented matrix with I3, and reduce to echelon form.
⎛ c −c c 1 0 0⎞ ⎛1 0 0 1 1
− 1c ⎞
1+ c 1+ c
⎜
⎜ 1 c 1 0 1 0⎟ reduces to 0 1 0 − 1 1 ⎟
⎜ 0⎟
⎜ ⎟ c (1+ c ) 1+ c
⎜⎝ 0 0 c 0 0 1⎟⎠ ⎜0 0 1 1 ⎟
⎝ 0 0 c ⎠
unless c 0 or c −1. Thus as long as c ≠ 0 or c ≠ −1, the matrix is invertible.
28. It follows from parts (a) and (d) of Theorem 1.5.3 that a square matrix is invertible if and only if
its reduced row echelon form is identity.

⎡c 1 0 ⎤
⎢1 ⎥
⎢ c 1 ⎥
⎣⎢ 0 1 c ⎦⎥
⎡1 c 1 ⎤
⎢c ⎥
⎢ 1 0 ⎥ The first and second rows were interchanged.
⎢⎣ 0 1 c ⎥⎦
⎡1 c 1⎤
⎢0
⎢ 1 c ⎥⎥ The second and third rows were interchanged.
⎢⎣ c 1 0 ⎥⎦
⎡1 c 1⎤
⎢0
c ⎥⎥
times the first row was added to the third
⎢ 1
row.
⎢⎣0 1 − c 2 −c ⎥⎦
⎡1 c 1 ⎤

⎢0 1 1 times the second row was added to the
⎢ c ⎥⎥
third row.
⎢⎣0 0 c 3 − 2c ⎥⎦

If 2 2 0 , i.e., if 0 , √2 or √2 the last matrix contains a row
of zeros, therefore it cannot be reduced to by elementary row operations.
Otherwise (if 2 0), multiplying the last row by would result in a row echelon
form with 1’s on the main diagonal. Subsequent elementary row operations would then lead to
the identity matrix.
We conclude that for any value of other than 0, √2 and √2 the matrix is invertible.
⎛ −2 3⎞
29. Keeping track of the elementary matrices used to row reduce A ⎜⎝ 1 0⎟⎠ to I, we see that
⎛ 0 1⎞ ⎛ 13 0⎞ ⎛ 1 2⎞ ⎛ −2 3⎞
⎜⎝ 1 0⎟⎠ ⎜⎝ 0 1⎟⎠ ⎜⎝ 0 1⎟⎠ ⎜⎝ 1 0⎟⎠ I, so taking inverses (and reversing the order of multiplication)
⎛ 1 −2⎞ ⎛ 3 0⎞ ⎛ 0 1⎞ ⎛ −2 3⎞
we get ⎜ ⎜⎝ 1 0⎟⎠
⎝ 0 1 ⎟⎠ ⎜⎝ 0 1⎟⎠ ⎜⎝ 1 0⎟⎠
30. We perform a sequence of elementary row operations to reduce the given matrix to the identity
matrix. As we do so, we keep track of each corresponding elementary matrices:
1 0

5 2

1 0 5 times the first row was added to the 1 0

0 2 second row. 5 1
1 0 1 0
The second row was multiplied by . 0
0 1

1 0 1 0
Since , then .
5 1 0 2
32. We perform a sequence of elementary row operations to reduce the given matrix to the identity
matrix. As we do so, we keep track of each corresponding elementary matrices:
1 1 0
1 1 1
0 1 1
1 1 0 1 0 0
0 0 1 1 1 0
second row.
0 1 1 0 0 1
1 1 0 1 0 0
The second and third rows were
0 1 1 0 0 1
interchanged
0 0 1 0 1 0
1 1 0 1 0 0
1 times the third row was added to the
0 1 0 0 1 1
second row.
0 0 1 0 0 1
1 0 0 1 1 0
1 times the second row was added to
0 1 0 0 1 0
the first row.
0 0 1 0 0 1

Since , then
1 0 0 1 0 0 1 0 0 1 1 0
1 1 0 0 0 1 0 1 1 0 1 0 .
0 0 1 0 1 0 0 0 1 0 0 1
−1
⎛ −2 3⎞ ⎛ 0 1⎞ ⎛ 13 0⎞ ⎛ 1 2⎞
33. From Exercise 29 above, we can quickly see that ⎜ ⎜⎝ 1 0⎟⎠ ⎜⎝ 0 1⎟⎠ ⎜⎝ 0 1⎟⎠
⎝ 1 0⎟⎠
34. We use the elementary matrices already obtained in the solution of Exercise 30. Since
, then
1 0
1 0

0 5 1
36. We use the elementary matrices already obtained in the solution of Exercise 32. Since
, then

1 1 0 1 0 0 1 0 0 1 0 0
0 1 0 0 1 1 0 0 1 1 1 0
0 0 1 0 0 1 0 1 0 0 0 1
37. Keeping track of the elementary matrices used to row reduce A to B, we see that
⎛ 1 0 0⎞ ⎛ 1 2 0⎞ ⎛ −3 −11 −18⎞ ⎛ 7 1 −2⎞

⎜ 0 0 1⎟ ⎜ 0 1 0⎟ ⎜ 5 6 8 ⎟ ⎜ −1 3 4 ⎟ , and so
⎜ ⎟⎜ ⎟⎜ ⎟ ⎜ ⎟
⎝ 0 1 0⎠ ⎝ 0 0 1⎠ ⎝ −1 3 4 ⎠ ⎝ 5 6 8⎠
⎛ 1 −2 0⎞ ⎛ 1 0 0⎞ ⎛ 7 1 −2⎞ ⎛ −3 −11 −18⎞

⎜ 0 1 0⎟ ⎜ 0 0 1⎟ ⎜ −1 3 4 ⎟ ⎜5 6 8 ⎟
⎜ ⎟⎜ ⎟⎜ ⎟ ⎜ ⎟
⎝ 0 0 1⎠ ⎝ 0 1 0⎠ ⎝ 5 6 8 ⎠ ⎝ −1 3 4 ⎠
38. Let us begin by finding a sequence of elementary row operations that will reduce to :
⎡ 6 9 4⎤
B ⎢ −5 −1 0⎥
⎢ ⎥

⎢⎣ −1 −2 −1⎥⎦
⎡ −1 −2 −1⎤
⎢ −5 −1 0⎥ (a)
⎢ ⎥
The first and third rows were interchanged.
⎢⎣ 6 9 4⎥⎦
⎡ 1 2 1⎤
⎢ −5 −1 0⎥⎥ (b)
⎢
The first row was multiplied by 1.
⎢⎣ 6 9 4⎥⎦
⎡1 2 1⎤

⎢0 9 5 ⎥⎥ (c)
⎢ 5 times the first row was added to the second
⎢⎣0 −3 −2 ⎥⎦ row and 6 times the first row was added to
the third row.
⎡1 2 1⎤
⎢0 1 5 ⎥ (d)
⎢ 9 ⎥
⎣⎢0 −3 −2 ⎦⎥

⎡1 2 1 ⎤
⎢ ⎥
⎢0 1 5 (e)
9 ⎥ times the second row was added to the third
⎢⎣0 ⎥⎦
0 − 13 row.


⎡1 2 1⎤
⎢0 1 5 ⎥ (f)
⎢ 9 ⎥
The third row was multiplied by 3.
⎣⎢ 0 0 1 ⎦⎥

⎡1 2 0⎤
⎢0 1 0 ⎥⎥ (g)
⎢ times the third row was added to the

⎢⎣ 0 0 1 ⎥⎦ second row and 1 times the third row was
added to the first row.
⎡1 0 0⎤
⎢0 1 0 ⎥⎥ (h)
⎢ 2 times the second row was added to the first

⎢⎣ 0 0 1 ⎥⎦ row.

Now we reduce to , then continue applying the inverse operations of the ones listed above,
in reverse order, to obtain .
⎡ 2 1 0⎤
A ⎢ −1 1 0 ⎥⎥
⎢

⎢⎣ 3 0 −1 ⎥⎦
⎡ −1 1 0⎤
⎢ 2 1 0 ⎥⎥
⎢
The first and second rows were interchanged.
⎣⎢ 3 0 −1 ⎦⎥
⎡1 −1 0⎤
⎢2 1 0 ⎥⎥
⎢
The first row was multiplied by 1.
⎢⎣ 3 0 −1 ⎥⎦
⎡1 −1 0⎤
⎢0 3 0 ⎥⎥ 2 times the first row was added to the second
⎢
row and 3 times the first row was added to
⎢⎣ 0 3 −1 ⎥⎦ the third row.
⎡1 −1 0⎤
⎢0 1 0 ⎥⎥
⎢ The second row was multiplied by .
⎣⎢ 0 3 −1 ⎦⎥

⎡1 −1 0⎤
⎢0 1 0 ⎥⎥
⎢ 3 times the second row was added to the

⎣⎢ 0 0 −1 ⎦⎥ third row.
⎡1 −1 0⎤
⎢0 1 0 ⎥⎥
⎢ The third row was multiplied by 1.
⎢⎣ 0 0 1 ⎥⎦
⎡1 0 0⎤
⎢0 1 0 ⎥⎥
⎢ The second row was added to the first row.
⎢⎣ 0 0 1 ⎥⎦
⎡1 2 0⎤
⎢0 1 0 ⎥⎥ inverted operation (h):
⎢ 2 times the second row was added to the first
⎢⎣ 0 0 1 ⎥⎦ row
⎡1 2 1⎤ inverted operations (g):
⎢0 1 5⎥
⎢ 9⎥ The third row was added to the first row and

⎢⎣0 0 1⎥⎦ times the third row was added to the second

row.
⎡1 2 1⎤
⎢ 5⎥
⎢0 1
9⎥
inverted operation (f):
⎢⎣0 1⎥
0 − 3⎦ The third row was multiplied by .

⎡1 2 1⎤
⎢0 1 5⎥ inverted operation (e):
⎢ 9⎥
⎣⎢0 −3 − 2⎦⎥ row.

⎡1 2 1⎤
⎢0 9 5⎥⎥
⎢ inverted operation (d):

⎢⎣0 −3 − 2⎥⎦ The second row was multiplied by 9.
⎡ 1 2 1⎤
⎢ −5 −1 inverted operations (c):
⎢ 0⎥⎥ 6 times the first row was added to the third row

⎢⎣ 6 9 4⎥⎦ and 5 times the first row was added to the
second row.

⎡ −1 −2 −1⎤
⎢ −5 −1 0⎥
⎢ ⎥ inverted operation (b):

⎣⎢ 6 9 4⎥⎦ The first row was multiplied by 1.
⎡ 6 9 4⎤
B ⎢ −5 −1 0⎥
⎢ ⎥ inverted operation (a):

⎢⎣ −1 −2 −1⎥⎦ The first and third rows were interchanged.
1.6 More on Linear Systems and Invertible Matrices
⎛ 3 5⎞ −1 ⎛ 2 −5⎞ ⎛ 2 −5⎞ ⎛ −2⎞ ⎛ −19⎞

1. If A ⎜⎝ 1 2⎟⎠ , then |A| 1 and A ⎜⎝ −1 3 ⎟⎠ , so x ⎜⎝ −1 3 ⎟⎠ ⎜⎝ 3 ⎟⎠ ⎜⎝ 11 ⎟⎠ .
4 3
2. We begin by inverting the coefficient matrix
2 5
⎡ 4 −3 1 0 ⎤
⎢ ⎥ The identity matrix was adjoined to the
⎣ 2 −5 0 1 ⎦
coefficient matrix.
⎡ 2 −5 0 1 ⎤
⎢ ⎥
⎣ 4 −3 1 0 ⎦ The first and second rows were interchanged.

⎡2 −5 0 1 ⎤
⎣0 7 1 −2⎦
row.
⎡1 − 52 0 12 ⎤
⎢ 2⎥

⎣0 1 7 − 7 ⎦
1
The first row was multiplied by and
the second row was multiplied by .
⎡1 0 5
14 − 143 ⎤
⎢ ⎥ times the second row was added to the first
⎣0 1
1
7 − 72 ⎦
row.


⎡ 5
14 − 143 ⎤
Since the inverse of the coefficient matrix is ⎢ ⎥ , Theorem 1.6.2 states that the system
⎣ 7
1
− 72 ⎦
3 3
has exactly one solution: , i.e., 3.
9 3
5 3 2
4. We begin by inverting the coefficient matrix 3 3 2
0 1 1
⎡5 3 2 1 0 0⎤
⎢ ⎥
⎢ 3 3 2 0 1 0 ⎥ The identity matrix was adjoined to the
⎢⎣ 0 1 1 0 0 1 ⎥⎦ coefficient matrix.

⎡2 0 0 1 −1 0⎤
⎢ ⎥
⎢3 3 2 0 1 0⎥ 1 times the second row was added to the first
⎢⎣0 1 1 0 0 1⎥⎦ row.

⎡ 1 0 0 12 − 12 0 ⎤
⎢ ⎥
⎢3 3 20 1 0 ⎥
⎢⎣ 0 1 1 0 The first row was multiplied by .
0 1 ⎥⎦
⎡1 0 0 12 − 12 0⎤
⎢ ⎥
⎢0 3 2 − 2 0⎥
3 5
2 3 times the first row was added to the second
⎢⎣0 1 1 0 0 1⎥⎦ row.

⎡1 0 0 12 − 12 0⎤
⎢ ⎥
⎢0 1 1 0 0 1⎥
⎢⎣0 3 2 − 32 The second and third rows were interchanged.
5
2 0⎥⎦
⎡1 0 0 12 − 12 0⎤
⎢ ⎥
⎢0 1 1 0 0 1⎥ 3 times the second row was added to the third
⎢⎣0 0 −1 − 32 5
−3⎥⎦ row.
2
⎡1 0 0 12 − 12 0⎤
⎢ ⎥
⎢0 1 1 0 0 1⎥
⎢⎣ 0 0 The third row was multiplied by 1 .
1 32 − 52 3 ⎥⎦

⎡1 0 0 12 − 12 0⎤
⎢ ⎥
⎢0 1 0 − 2 −2⎥
3 5
2 1 times the third row was added to the second
⎢⎣0 0 1 32 − 5
3⎥⎦ row.
2

0
Since the inverse of the coefficient matrix is 2 , Theorem 1.6.2 states that the
3
0
4 1
system has exactly one solution: 2 2 11 , i.e., 1, 11,
3 5 16
and 16.
⎛ 13 1
3
− 13 ⎞ ⎛ 6 ⎞ ⎛ −3⎞
5. x −1
A b ⎜ 1 1 2 ⎟⎜
−3⎟ ⎜ 9⎟
⎜ 3 3 3 ⎟
⎜ ⎟ ⎜ ⎟
⎜⎝ − 2 1
− 1 ⎟⎠ ⎝ 12⎠ ⎝ −9⎠
3 3 3
0 1 2 3
1 1 4 4
6. We begin by inverting the coefficient matrix
1 3 7 9
1 2 4 6
⎡ 0 − 1 −2 −3 1 0 0 0⎤
⎢ ⎥
⎢ 1 1 4 4 0 1 0 0⎥

⎢ 1 3 7 9 0 0 1 0⎥ The identity matrix was adjoined to the
⎢ ⎥ coefficient matrix.
⎣⎢ −1 −2 −4 −6 0 0 0 1 ⎦⎥
⎡ 1 1 4 4 0 1 0 0⎤
⎢ ⎥
⎢ 0 − 1 −2 −3 1 0 0 0⎥

⎢ 1 3 7 9 0 0 1 0⎥ The first and second rows were
⎢ ⎥ interchanged.
⎣⎢ − 1 − 2 − 4 − 6 0 0 0 1 ⎦⎥
⎡1 1 4 4 0 1 0 0⎤
⎢ ⎥
⎢ 0 − 1 −2 −3 1 0 0 0⎥
⎢0 2 3 5 0 −1 1 0 ⎥
⎢ ⎥ third row and the first row was added to
⎢⎣0 −1 0 −2 0 1 0 1 ⎥⎦
the fourth row.

⎡1 1 4 1 0 0⎤
4 0
⎢ ⎥
⎢0 1 2 3 −1 0 0 0⎥

⎢0 2 3 5 0 −1 1 0 ⎥ The second row was multiplied by 1 .
⎢ ⎥
⎣⎢ 0 − 1 0 −2 0 1 0 1 ⎦⎥
⎡1 1 4 4 0 1 0 0⎤
⎢ ⎥
⎢0 1 2 3 − 1 0 0 0⎥
⎢0 0 −1 −1 2 −1 1 0 ⎥
⎢ ⎥ third row and the second row was added to
⎢⎣0 0 2 1 −1 1 0 1 ⎥⎦
the fourth row.
⎡1 1 4 4 0 0⎤
0 1
⎢ ⎥
⎢0 1 2 3 −1 0 0 0⎥

⎢0 0 1 1 −2 1 − 1 0 ⎥ The third row was multiplied by 1 .
⎢ ⎥
⎢⎣ 0 0 2 1 −1 1 0 1 ⎥⎦
⎡1 1 4 4 0 0⎤ 0 1
⎢ ⎥
⎢0 1 2 3 −1 0 0 0⎥
⎢0 0 1 1 −2 1 −1 0 ⎥
⎢ ⎥ fourth row.
⎣⎢0 0 0 −1 3 − 1 2 1 ⎦⎥
⎡1 1 4 4 0⎤ 0 1 0
⎢ ⎥
⎢0 1 2 3 −1 0 0 0⎥

⎢0 0 1 1 −2 1 −1 0⎥ The fourth row was multiplied by 1 .
⎢ ⎥
⎢⎣ 0 0 0 1 −3 1 −2 −1 ⎥⎦
⎡1 1 4 0 12 −3 4⎤ 8
⎢ ⎥ 1 times the last row was added to the
⎢0 1 2 0 8 −3 6 3⎥
third row, 3 times the last row was added
⎢0 0 1 0 1 0 1 1⎥
⎢ ⎥ to the second row and 4 times the last
⎢⎣0 0 0 1 −3 1 −2 −1⎥⎦
row was added to the first row.
⎡1 1 0 0 0⎤8 −3 4
⎢ ⎥
⎢0 1 0 0 6 −3 4 1⎥
⎢0 0 1 0 1 0 1 1⎥
⎢ ⎥ second row and 4 times the third row was
⎣⎢0 0 0 1 − 3 1 −2 −1 ⎦⎥
added to the first row.

⎡1 0 0 0 20 −1 ⎤ 0
⎢ ⎥
⎢0 1 0 0 6 −3 4 1⎥
⎢0 0 1 0 1 0 1 1⎥
⎢ ⎥ first row
⎣⎢0 0 0 1 − 3 1 −2 −1 ⎦⎥

2 0 0 1
6 3 4 1
Since the inverse of the coefficient matrix is , Theorem 1.6.2 states that
1 0 1 1
3 1 2 1
2 0 0 1 0 6
6 3 4 1 7 1
the system has exactly one solution: ,
1 0 1 1 4 10
3 1 2 1 6 7
i.e., 6, 1, 10, and 7.
⎛6 −1⎞ ⎛ b1 ⎞ ⎛ 6b1 − b2 ⎞
7. x A −1 b ⎜ ⎜⎝ −5b b ⎟⎠
⎝ −5 1 ⎟⎠ ⎜⎝ b2 ⎟⎠ 1 2
1 2 3
8. We begin by inverting the coefficient matrix 2 5 5
3 5 8
⎡1 2 3 1 0 0 ⎤
⎢ ⎥
⎢2 5 5 0 1 0 ⎥ The identity matrix was adjoined to the
⎢⎣ 3 5 8 0 0 1 ⎥⎦ coefficient matrix.

⎡1 2 3 1 0 0⎤
⎢ 0 1 −1 −2 1 0 ⎥

⎢⎣ 0 −1 −1 −3 0 1 ⎥⎦ row and 3 times the first row was added to
the third row.
⎡1 2 3 1 0 0⎤
⎢ ⎥
⎢ 0 1 −1 − 2 1 0 ⎥
⎢⎣ 0 0 −2 −5 The second row was added to the third row.
1 1 ⎥⎦
⎡1 2 3 1 0 0⎤
⎢ ⎥
⎢0 1 −1 − 2 1 0⎥
⎢⎣0 0 1 52 − 12 − 12 ⎥⎦ The third row was multiplied by .


⎡1 2 0 − 132 3
2
3
2 ⎤
⎢ ⎥ The third row was added to the second row and
⎢0 1 0
1
2
1
2 − ⎥
1
2
⎢⎣0 0 1 3 times the third row was added to the first
5
2 − 1
2 − ⎥⎦
1
2 row.
⎡1 0 0 − 152 1
2
5
2 ⎤
⎢ ⎥
⎢0 1 0
1
2
1
2 − ⎥
1
2 2 times the second row was added to the first
⎢⎣0 0 1 5
− 1
− ⎥⎦
1
row.
2 2 2

⎡ − 152 1
2 ⎤5
2
Since the inverse of the coefficient matrix is ⎢⎢ 12 1
2
⎥
− ⎥ , Theorem 1.6.2 states that the
1
2
⎢⎣ 52 − 1
2 − ⎥⎦1
2
system has exactly one solution: , i.e.,
, , and .
⎡ −1 4 1 0 − 3⎤
⎢ ⎥ We augmented the coefficient matrix with two
⎢ 1 9 −2 1 4 ⎥ columns of constants on the right hand sides of
10. ⎢⎣ 6 4 −8 0 − 5⎥⎦
the systems
(i) and (ii) – refer to Example 2 on p. 62.
⎡1 −4 −1 0 3⎤
⎢ ⎥
⎢1 9 −2 1 4 ⎥
⎢⎣6 4 −8 0 − 5⎥⎦ The first row was multiplied by 1.

⎡1 − 4 − 1 0 3⎤
⎢ ⎥
⎢0 13 −1 1 1⎥ 1 times the first row was added to the
⎢⎣0 28 −2 0 −23⎥⎦ second row and 6 times the first row was

⎡1 −4 −1 0 3⎤
⎢ 1 ⎥
⎢0 1 − 13 13 13 ⎥
1 1

⎢⎣0 28 −2 0 −23⎥⎦ The second row was multiplied by .


⎡1 −4 −1 0 3⎤
⎢ 1 ⎥
⎢0 1 − 13 13 13 ⎥
1 1
⎢0 0 2 28 327 ⎥
13 − 13 − 13 ⎦ third row.
⎣
⎡1 −4 −1 0 3⎤
⎢ 1 ⎥
⎢0 1 − 13 13 13 ⎥
1 1

⎢⎣0 0 ⎥ The third row was multiplied by .
1 −14 − 327
2 ⎦
⎡1 −4 0 − 14 − 321
2 ⎤
⎢ 25 ⎥
⎢0 1 0 − 1 − 2 ⎥ times the third row was added to the
⎢⎣0 0 1 − 14 − 327
2 ⎦
⎥ second row and the third row was added to the

first row.
⎡1 0 0 − 18 − 421
2 ⎤
⎢ ⎥
⎢0 1 0 − 1 − 252 ⎥ times the second row was added to the first
⎢⎣0 0 1 − 14 − 327
2 ⎦
⎥ row.

We conclude that the solutions of the two systems are:
(i) 18, 1, 14 (ii) , ,
⎛ 4 −5⎞
11. A −1 −1 ⎜ , so we can find solutions for parts (a)‐(d) by multiplying A−1 by a matrix
⎝ −5 6 ⎟⎠
whose columns are the b vectors from parts (a)‐(d).
⎛ 0 −4 −1 −5⎞ ⎛ −4 5 ⎞ ⎛ 0 −4 −1 −5⎞ ⎛ 5 46 19 25 ⎞
A −1 ⎜⎝ 1 6 3 1 ⎟⎠ ⎜⎝ 5 −6⎟⎠ ⎜⎝ 1 6 3 1 ⎟⎠ ⎜⎝ −6 −56 −23 −31⎟⎠ .
⎛ 5⎞ ⎛ 46 ⎞ ⎛ 19 ⎞ ⎛ 25 ⎞
Thus (a) x ⎜⎝ −6⎟⎠ , (b) x ⎜⎝ −56⎟⎠ , (c) x ⎜⎝ −23⎟⎠ , (d) x ⎜⎝ −31⎟⎠ .
⎡ 1 3 5 1 0 −1 ⎤
⎢ ⎥ We augmented the coefficient matrix with
⎢ −1 −2 0 0 1 −1⎥ three columns of constants on the right hand
12. ⎢⎣ 2 5 4 −1 1 0⎥⎦
sides of the systems (i), (ii) and (iii) – refer to
Example 2 on p. 62.
⎡1 3 5 1 0 −1⎤
⎢ ⎥
⎢0 1 5 1 1 −2⎥ The first row was added to the second row and
⎢⎣0 −1 −6 −3 1 2⎥⎦ 2 times the first row was added to the third

row.

⎡1 3 5 1 0 −1⎤
⎢ ⎥
⎢0 1 5 1 1 −2⎥
⎢⎣0 0 −1 −2 2 0⎥⎦ The second row was added to the third row.

⎡1 3 5 1 0 −1 ⎤
⎢ ⎥
⎢0 1 5 1 1 −2 ⎥
⎢⎣0 0 1 2 −2 0⎥⎦ The third row was multiplied by 1.

⎡1 3 0 −9 10 −1⎤
⎢ ⎥
⎢0 1 0 −9 11 −2⎥
⎢⎣0 0 1 2 −2 0⎥⎦ 5 times the third row was added to the first
row and to the second row.
⎡1 0 0 18 −23 5⎤
⎢ ⎥
⎢0 1 0 −9 11 −2⎥ 3 times the second row was added to the
⎢⎣0 0 1 2 −2 0⎥⎦ first row.

We conclude that the solutions of the three systems are:
(i) 18, 9, 2
(ii) 23, 11 , 2
(iii) 5, 2, 0
⎛ 1 −3 b1 ⎞
13. Row reduce the augmented matrix ⎜ .
⎝ 4 −12 b2 ⎟⎠
⎛1 3 b1 ⎞
Add −4 R1 to R2. ⎜ . We can see that this system will be consistent only if
⎝ 0 0 −4b1 + b2 ⎟⎠
−4b1 b2 0, or b2 4b1.
⎛ 2 −5 b1 ⎞
14. Row reduce the augmented matrix ⎜ .
⎝ 3 6 b2 ⎟⎠
⎛ 1 − 52 1 ⎞
b
2 1
Multiply R1 by 12 . ⎜
⎝ 3 −2 b2 ⎟⎠

⎛ 1 − 52 1
b ⎞ ⎛ 1 − 52 1
b
2 1
⎞
Add −3R1 to R2. ⎜ 2 1
. Multiply R by 2
. ⎜0 1 .
⎟ b + 27 b2 ⎟⎠
−3 2 27 −1 2
⎝0 2
27
2 1
b + b2 ⎠ ⎝ 9 1
⎛1 0 2
b + 27
9 1
5
b2 ⎞
Add 52 R2 to R1. ⎜ This system is consistent for all values of b1 and b2.
⎝0 1 −1
9 1
b + 27 b2 ⎟⎠
2
⎡ 1 −2 −1 b1 ⎤
⎢ ⎥
⎢ −4 5 2 b2 ⎥
16. ⎢ ⎥⎦ The augmented matrix for the system.
⎣ −4 7 4 b3
⎡ 1 −2 −1 b1 ⎤
⎢ ⎥
⎢ 0 −3 −2 4b1 b2 ⎥
⎢⎣ 0 −1 0 4b1 b3 ⎥⎦ times the first row was added to the
second row and to the third row.
⎡ 1 −2 −1 b1 ⎤
⎢ ⎥
⎢ 0 −1 0 4b1 b3 ⎥ The second and third rows were
⎢⎣ 0 −3 −2 4b1 b2 ⎥⎦ interchanged.

⎡ 1 −2 −1 b1 ⎤
⎢ ⎥
⎢ 0 1 0 −4b1 − b3 ⎥
⎢⎣ 0 −3 −2 4b1 b2 ⎥⎦ The second row was multiplied by 1.

⎡ 1 −2 −1 b1 ⎤
⎢ ⎥
⎢0 1 0 −4b1 − b3 ⎥ times the second row was added to
⎢⎣ 0 0 −2 −8b1 b2 − 3b3 ⎥⎦ the third row.

⎡ 1 −2 −1 b1 ⎤
⎢ ⎥
⎢0 1 0 −4b1 − b3 ⎥
⎢⎣ 0 0 1 4b1 − 12 b2 32 b3 ⎥⎦ The third row was multiplied by .

The system is consistent for all values of , , and .


⎛ 1 3 −1 2 b1 ⎞ ⎛ 1 3 −1 2 b1 ⎞
⎜ −2 1 5 1 b ⎟ ⎜0 7 3 5 2b1 b2 ⎟
17. The augmented matrix ⎜ 2
⎟ row reduces to ⎜ ⎟ .
⎜ 3 −2 −2 1 b3 ⎟ ⎜ 0 −11 1 −5 −3b1 b3 ⎟
⎜ ⎟ ⎜ ⎟
⎝ 5 −7 −3 0 b4 ⎠ ⎝0 0 0 0 b1 − 2b3 b4 ⎠
There is no need to reduce this to row echelon form. Thus the system is consistent only if
b1 − 2b3 b4 0, or b1 2b3 − b4.
18. (a) The equation can be rewritten as , which yields and

.
This is a matrix form of a homogeneous linear system – to solve it, we reduce its augmented
matrix to a row echelon form.
⎡1 1 2 0⎤
⎢ ⎥
⎢2 1 −2 0⎥
⎢⎣3 The augmented matrix for the homogeneous
1 0 0⎥⎦ system .
⎡1 1 2 0⎤
⎢ ⎥
⎢0 −1 −6 0⎥ 2 times the first row was added to the
⎢⎣0 −2 −6 0⎥⎦ second row and 3 times the first row was

⎡1 1 2 0⎤
⎢ ⎥
⎢ 0 1 6 0⎥
⎢⎣0 −2 −6 0⎥⎦ The second row was multiplied by 1.

⎡1 1 2 0⎤
⎢ ⎥
⎢0 1 6 0⎥ 2 times the second row was added to the third
⎢⎣ 0 0 6 0 ⎥⎦ row.

⎡1 1 2 0⎤
⎢ ⎥
⎢0 1 6 0⎥
⎢⎣ 0 The third row was multiplied by .
0 1 0 ⎥⎦

Using back‐substitution, we obtain the unique solution: 0.
(b) As was done in part (a), the equation 4 can be rewritten as 4 . We

solve the latter system by Gauss‐Jordan elimination

⎡ −2 1 2 0 ⎤
⎢ ⎥
⎢ 2 −2 −2 0 ⎥
⎢⎣ 3 1 −3 0⎥⎦ The augmented matrix for the homogeneous
system 4 .
⎡ 2 −2 −2 0 ⎤
⎢ ⎥
⎢ −2 1 2 0 ⎥
⎢⎣ 3 1 −3 0⎥⎦ The first and second rows were interchanged.

⎡ 1 −1 −1 0⎤
⎢ ⎥
⎢ −2 1 2 0⎥
⎢⎣ 3 1 −3 0⎥⎦ The first row was multiplied by .

⎡ 1 −1 −1 0⎤
⎢ ⎥
⎢ 0 −1 0 0⎥ 2 times the first row was added to the second
⎢⎣ 0 4 0 0⎥⎦ row and 3 times the first row was added to

the third row.
⎡1 −1 −1 0⎤
⎢ ⎥
⎢0 1 0 0 ⎥
⎢⎣0 4 0 0⎥⎦ The second row was multiplied by 1.

⎡1 0 −1 0 ⎤
⎢ ⎥
⎢0 1 0 0⎥ 4 times the second row was added to the
⎢⎣0 0 0 0 ⎥⎦ third row and the second row was added to

the first row.

, 0, and .
⎛ 1 2 3⎞ ⎛ −56 16 9 ⎞
19. The inverse of ⎜ 3 7 6⎟ is ⎜ 18 −5 −3⎟ , so multiplying the equation on the left by this
⎜ ⎟ ⎜ ⎟
⎝ 1 0 8⎠ ⎝ 7 −2 −1⎠
⎛ −56 16 9 ⎞ ⎛ 1 4 −2 0 3⎞ ⎛ −83 −186 264 113 −56⎞

matrix gives X ⎜ 18 −5 −3⎟ ⎜ 0 −1 5 2 7⎟ ⎜ 27 59 −85 −37 19 ⎟
⎜ ⎟⎜ ⎟ ⎜ ⎟
⎝ 7 −2 −1⎠ ⎝ −3 6 8 9 0⎠ ⎝ 10 24 −32 −13 7 ⎠

2 0 1 4 3 2 1 2 0 1
20. 0 1 1 6 7 8 9 . Let us find 0 1 1 :
1 1 4 1 3 7 9 1 1 4
⎡ −2 0 1 1 0 0 ⎤
⎢ ⎥
⎢ 0 −1 −1 0 1 0 ⎥

⎢⎣ 1 1 −4 0 0 1 ⎥⎦ The identity matrix was adjoined to the matrix.

⎡ 1 1 −4 0 0 1 ⎤
⎢ ⎥
⎢ 0 −1 −1 0 1 0 ⎥

⎢⎣ −2 0 1 1 0 0 ⎥⎦ The first and third rows were interchanged.

⎡ 1 1 −4 0 0 1 ⎤
⎢ ⎥
⎢ 0 −1 −1 0 1 0 ⎥
⎢⎣ 0 2 −7 1 0 2 ⎥⎦ 2 times the first row was added to the third row.

⎡ 1 1 −4 0 0 1 ⎤
⎢ ⎥
⎢ 0 1 1 0 −1 0 ⎥
⎢⎣ 0 2 −7 1 0 2 ⎥⎦ The second row was multiplied by 1 .

⎡ 1 1 −4 0 0 1 ⎤
⎢ ⎥
⎢ 0 1 1 0 −1 0 ⎥ 2 times the second row was added to the third
⎢⎣ 0 0 −9 1 2 2 ⎥⎦ row.

⎡1 1 − 4 0 0 1⎤
⎢ ⎥
⎢0 1 1 0 − 1 0⎥
⎢⎣0 0 1 − 19 − 92 − 92 ⎥⎦ The third row was multiplied by .

⎡1 1 0 − 49 − 89 1
9 ⎤
⎢ ⎥
⎢0 1 0 9
1
− 79 2
9 ⎥
1 times the third row was added to the second
⎢⎣0 0 1 − 19 − 29 − ⎥⎦
2
row and 4 times the third row was added to the
9
first row.
⎡1 0 0 − 59 − 19 − 19 ⎤
⎢ 2⎥
⎢0 1 0
1
9 − 79 9⎥
1 times the second row was added to the first
⎢⎣0 0 1 − 19 − 29 2⎥
− 9⎦ row.


2 0 1 ⎡ − 59 − 19 − 19 ⎤
⎢ 1 2⎥
Using 0 1 1 ⎢ 9 − 79 9⎥
we obtain
1 1 4 ⎢⎣ − 19 − 29 − 29 ⎥⎦
3
⎡ − 59 − 19 − 19 ⎤ 4 3 2 1
⎢ 1 2⎥ 4
⎢ 9 − 79 9⎥ 6 7 8 9
⎢⎣ − 19 − 92 − 92 ⎥⎦ 1 3 7 9
2
−1
25. (g) True. Let X be AB . Then AB X A BX I, so by theorem 1.6.3, A−1 BX. Similarly,
since I X AB XA B, B−1 XA.
1.7 Diagonal, Triangular, and Symmetric Matrices
1. Since all of the diagonal entries are nonzero, the matrix is invertible.
2. The matrix is not invertible because one diagonal entry is 0.
4. A diagonal matrix is invertible if and only if its diagonal entries are all nonzero. All four diagonal
entries of this diagonal matrix are nonzero, therefore the matrix is invertible.
6. The first column of the first matrix is multiplied by 7, the 2nd column of the first matrix is
multiplied by −1 and the third column of the first matrix is multiplied by 12 . Thus,
⎛ 7 0 0⎞
⎛ −3 2 8⎞ ⎜ ⎛ −21 −2 4⎞
0 −1 0⎟ ⎜⎝ 28 −1 3⎠⎟ .
⎝⎜ 4 1 6⎠⎟ ⎜⎜ ⎟
⎝ 0 0 12⎟⎠
2 0 0 4 1 3 3 0 0 2 4 3 2 1 5 2 3 2
8. 0 1 0 1 2 0 0 5 0 1 1 3 1 2 5 1 0 2
0 0 4 5 1 2 0 0 2 4 5 3 4 1 5 4 2 2
24 10 12
3 10 0
60 20 16
⎛2 0 ⎞ ⎛ 22 0 ⎞ ⎛ 4 0⎞ −2 ⎛ 14 0⎞ −k
⎛ 21k 0 ⎞
9. If A ⎜⎝ 0 −1⎟⎠ , A
2
⎜ ⎟ ⎜⎝ 0 1⎟⎠ , A ⎜⎝ 0 1⎟⎠ , A ⎜ ⎟ .
⎝0 ( −1)2 ⎠ ⎝0 (−1)k ⎠

36 0 0 0 0 6 0 0
10. 0 9 0 , 0 0 , 0 3 0
0 0 25 0 0 0 0 5
⎛ 3 0 0⎞ ⎛9 0 0⎞ ⎛ 19 0 0 ⎞ ⎛ 31k 0 0 ⎞
⎜ 0 1 0⎟ , A2 ⎜0 1 ⎜ ⎟
11. A 0 ⎟ , A −2 ⎜ 0 4 0 ⎟ , A − k
⎜0 2k 0 ⎟ .
⎜ 2 ⎟ ⎜ 4 ⎟ ⎜ ⎟
⎜⎝ 0 0 1 ⎟⎠ ⎜⎝ 0 0 1⎟
⎠ ⎜⎝ 0 0 25⎟⎠ ⎜ ⎟
5 25 ⎜⎝ 0 0 25k ⎟⎠
0 0 0 2 0 0 0
4 0 0 0
0 16 0 0 0 0 0 0 4 0 0
12. , ,
0 0 9 0 0 0 0 0 0 3 0
0 0 0 4 0 0 0 0 0 0 2
13. Symmetric
14. Not symmetric since a12 ≠ a21
16. Symmetric
17. Symmetric
18. Symmetric
20. Not invertible since this triangular matrix has a zero on the diagonal.
21. Invertible.
22. From part (c) of Theorem 1.7.1, a triangular matrix is invertible if and only if its diagonal entries
are all nonzero. Since this lower triangular matrix has a 0 on its diagonal, it is not invertible.
⎛ −3 a2 ⎞
23. For ⎜ ⎟ to be symmetric, a2 must equal 4, so a = 2, a = −2.
⎝ 4 0⎠
24. The matrix is symmetric if and only if the following equations must be satisfied
2 2 3
2 0
2
We solve this system by Gauss‐Jordan elimination


⎡1 −2 2 3⎤
⎢ ⎥
⎢2 1 1 0⎥
⎢⎣1 0 1 − 2⎥⎦ The augmented matrix for the system.

⎡1 0 1 − 2⎤
⎢ ⎥
⎢2 1 1 0⎥
⎢⎣1 −2 2 3⎥⎦ The first and third rows were interchanged.

⎡1 0 1 − 2⎤
⎢ ⎥
⎢0 1 −1 4 ⎥ 2 times the first row was added to the
⎢⎣0 −2 1 5⎥⎦ second row and 1 times the first row was

⎡1 0 1 − 2⎤
⎢ ⎥
⎢0 1 −1 4 ⎥ 2 times the second row was added to the third
⎢⎣0 0 −1 13⎥⎦ row.

⎡1 0 1 −2⎤
⎢ ⎥
⎢0 1 −1 4⎥
⎢⎣0 0 1 −13⎥⎦ The third row was multiplied by 1.

⎡1 0 0 11⎤
⎢ ⎥
⎢0 1 0 −9⎥ The third row was added to the second row
⎢⎣0 0 1 −13⎥⎦ and 1 times the third row was added to the

first row.

In order for to be symmetric, we must have 11, 9, and 13.
⎛2 − x x2 ⎞
5
25. For A
⎜ 0 x 3 x − 1⎟⎟ to be invertible, all of the diagonal entries need to be different
⎜
⎜⎝ 0 0 x ⎟⎠
from 0, so as long as x ≠ 2, x ≠ −3, and x ≠ 0, the matrix will be invertible.
26. From part (c) of Theorem 1.7.1, a triangular matrix is invertible if and only if its diagonal entries
are all nonzero. Therefore, the given lower triangular matrix is invertible for any real number
such that , , and .


0 0 0 0
28. For example 0 0 (there are seven other possible answers, e.g., 0 0 ,
0 0 1 0 0 1
0 0
0 0 , etc.)
0 0 1
⎛ 2 0 0⎞ ⎛ −1 0 0⎞ ⎛ −2 0 0 ⎞
29. AB ⎜ 1 1 0⎟ ⎜ 6 2 0⎟ ⎜ 5 2 0 ⎟ . Thus for these two lower triangle matrices, it is
⎜ ⎟⎜ ⎟ ⎜ ⎟
⎝ −3 4 5⎠ ⎝ 1 1 5⎠ ⎝ 32 13 25⎠
true that the product is again a lower triangular matrix.
⎛ 2 0 0 1 0 0⎞
30. To find A , we row reduce ( A I )
−1 ⎜ 1 1 0 0 1 0⎟ to get
⎜ ⎟
⎝ −3 4 5 0 0 1⎠
⎛1 0 0 1
2
0 0⎞ ⎛ 1 0 0 1
2
0 0⎞ ⎛ 1 0 0 1
2
0 0⎞
⎜0 1 0 −1
1 0⎟ → ⎜ 0 1 0 −1
1 0⎟ → ⎜ 0 1 0 −1
1 0⎟
⎜ 2 ⎟ ⎜ 2 ⎟ ⎜ 2 ⎟
⎜⎝ 0 4 5 3
0 1⎟⎠ ⎜⎝ 0 0 5 7
−4 1⎟⎠ ⎜⎝ 0 0 1 7
− 54 15 ⎟⎠
2 2 10
⎛ 12 0 0⎞ ⎛ −1 0 0⎞
Thus A −1 ⎜ − 1 1 0⎟ , similarly, B −1 ⎜ 3 1
0⎟ . We see that the inverse of this
⎜ 2 ⎟ ⎜ 2 ⎟
⎜⎝ 7 − 4 1 ⎟⎠ ⎜⎝ − 2 − 1 1 ⎟⎠
10 5 5 5 10 5
invertible lower triangular matrix is lower triangular.
32. (a) Theorem 1.4.8(e) states that (if the multiplication can be performed).

Therefore,

is
symmetric
which shows that is symmetric.
(b) 2 3 2 3 2 3 2 3
Th. Th. and
1.4.8 1.4.8 are
b‐d e symmetric
which shows that 2 3 is symmetric.
0 0
34. All 3 3 diagonal matrices have a form 0 0 .
0 0

⎡a 0 0 ⎤ ⎡a 0 0 ⎤ ⎡a 0 0 ⎤ ⎡1 0 0⎤
A − 3A − 4I
2 ⎢0 b 0 ⎥ ⎢0 b 0 ⎥ − 3 ⎢0 b 0 ⎥ − 4 ⎢0 1 0⎥
⎢ ⎥⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎢⎣0 0 c ⎥⎦ ⎢⎣0 0 c ⎥⎦ ⎢⎣0 0 c ⎥⎦ ⎢⎣0 0 1⎥⎦
⎡a 2 0 0 ⎤ ⎡3a 0 0 ⎤ ⎡4 0 0 ⎤
⎢ ⎥
⎢0 b
2
0 ⎥ ⎢⎢ 0 3b 0 ⎥⎥ − ⎢⎢0 4 0 ⎥⎥
⎢ 0 0 c 2 ⎥ ⎢⎣ 0 0 3c ⎥⎦ ⎢⎣0 0 4 ⎥⎦
⎣ ⎦

⎡a − 3a − 4
2
0 0 ⎤
⎢ ⎥
⎢ 0 b 2 − 3b − 4 0 ⎥
⎢ 0 0 c 2
− 3c − 4 ⎥
⎣ ⎦
⎡ a −4 a 1 0 0 ⎤
⎢ 0 b −4 b 1 0 ⎥
⎢ ⎥
⎢⎣ 0 0 c − 4 c 1 ⎥⎦
This is a zero matrix whenever the value of , , and is either 4 or 1. We conclude that the

following are all 3 3 diagonal matrices that satisfy the equation:
4 0 0 4 0 0 4 0 0 1 0 0
0 4 0 , 0 4 0 , 0 1 0 , 0 4 0 ,
0 0 4 0 0 1 0 0 4 0 0 4
4 0 0 1 0 0 1 0 0 1 0 0
0 1 0 , 0 4 0 , 0 1 0 , 0 1 0
0 0 1 0 0 1 0 0 4 0 0 1
0 0 4
38. 0 0 1
4 1 0
40. The condition is equivalent to the linear system
2 3 2
3 5 5 3

5 8 6 5
0
2 3 1 0 2
3 5 5 0 3
The augmented matrix has the reduced row echelon form
5 8 6 0 5
0 0 0 1 0
1 0 10 0 1
0 1 7 0 0
.
0 0 0 1 0
0 0 0 0 0
If we assign the arbitrary value , the general solution is given by the formulas
1 10 , 7 , , 0.


1 0 0 1
42. (a) Step 1. Solve 2 3 0 2
2 4 1 0
The first equation is 1.
The second equation 2 1 3 2 yields 0.
The third equation 2 1 4 0 1 0 yields 2.
2 1 3 1
Step 2. Solve 0 1 2 0 using back‐substitution:
0 0 4 2
The third equation 4 2 yields .
The second equation 1 2 0 yields 1.
The first equation 2 1 1 3 1 yields .
2 0 0 4
(b) Step 1. Solve 4 1 0 5
3 2 3 2
The first equation 2 4 yields 2 .
The second equation 4 2 1 5 yields 13.
The third equation 3 2 2 13 3 2 yields 6 .
3 5 2 2
Step 2. Solve 0 4 1 13 using back‐substitution:
0 0 2 6
The third equation 2 6 yields 3 .
The second equation 4 1 3 13 yields .
The first equation 3 5 2 3 2 yields .
⎛ d 11 0 ⎞ ⎛8 0 ⎞
43. If A ⎜⎝ d ⎟ , then the diagonal entries of A3 3 3
⎜⎝ 9 −1⎟⎠ will be d 11 and d 22 . Thus
21 d 22 ⎠
3 3
d 11 8 and d 22 −1 , so d11 2 and d22 −1. Now, we find d21:
3
3 ⎛ 2 0⎞ ⎛ 2 0⎞ ⎛2 0 ⎞
A ⎜⎝ d . Since 3d21 9, d21 3, and we have found that A ⎜⎝ 3 −1⎟⎠ .
21 −1⎟⎠ ⎜⎝ 3d
21 −1⎟⎠


1.8 Applications of Linear Systems
2. (a) There are five nodes – each of them corresponds to an equation.
Network node Flow In Flow Out

top left 200
top right 150

bottom left 25
bottom middle 175
bottom right 200
This system can be rearranged as follows
200
150
25
175
200
(b) The augmented matrix of the linear system obtained in part (a) has the reduced row echelon
1 0 0 1 0 1 150
0 1 0 1 0 1 175
form 0 0 1 1 0 1 50 . If we assign and the arbitrary values and
0 0 0 0 1 1 200
0 0 0 0 0 0 0
, respectively, the general solution is given by the formulas
150 , 175 , 50 , , 200 ,
(c) When 50 and 0, the remaining flow rates become 100, 125,

100, and 200. The directions of the flow agree with the arrow orientations in the
diagram.
4. (a) There are six intersections – each of them corresponds to an equation.
Intersection Flow In Flow Out

top left 500 300
top middle 200
top right 100 600
bottom left 400 350
bottom middle 600
bottom right 450 400
We rewrite the system as follows

800
200
500

750
600
50
(b) The augmented matrix of the linear system obtained in part (a) has the reduced row echelon
1 0 0 0 0 1 0 50
0 1 0 0 0 0 1 450
0 0 1 0 0 1 0 750
form . If we assign and the arbitrary values
0 0 0 1 0 1 1 600
0 0 0 0 1 0 1 50
0 0 0 0 0 0 0 0
and , respectively, the general solution is given by the formulas
50 , 450 , 750 , 600 , 50 , ,
subject to the restriction that all seven values must be nonnegative. Obviously, we need
both 0 and 0,
750 − s > 0
750 − s = 0
which in turn imply 0 and
0. Additionally imposing the
0
t>
0
t=
t
s+
three inequalities
s+
−
0
−
60
750 0, 0
60
600 0, and
50 0
150 −50 + t > 0
results in the set of allowable and 50 −50 + t = 0
600 750 s
values depicted in the grey region on
the right.
(c) Setting 0 in the general solution obtained in part (b) would result in the negative

value 50 which is not allowed (the traffic would flow in a wrong way along the
street marked as .)
6. From Kirchhoff's current law, we have 0. Kirchhoff's voltage law yields
Voltage Rises Voltage Drops
Left Inside Loop 1 4 6

Right Inside Loop 2 4 2
Outside Loop 3 6 2
The corresponding linear system can be rewritten as

0
4 6 1

4 2 2
6 2 3
1 0 0
0 1 0
Its augmented matrix has the reduced row echelon form .
0 0 1
0 0 0 0
The solution is A , A, and A .
Since is negative, this current is opposite to the direction shown in the diagram.
8. From Kirchhoff's current law, we have 0. Kirchhoff's voltage law yields
Voltage Rises Voltage Drops
Top Inside Loop 5 4 3 4

Bottom Inside Loop 3 4 4 5
Outside Loop 5 3 3 5
The corresponding linear system can be rewritten as
0
3 4 9

4 5 1
3 5 8
1 0 0
0 1 0
Its augmented matrix has the reduced row echelon form .
0 0 1
0 0 0 0
The solution is A , A, and A .
10. We are looking for positive integers , , and such that
C H O CO C H OH
The number of atoms of carbon, hydrogen, and oxygen on both sides must equal:
Left Side Right Side
Carbon 6 2

Hydrogen 12 6
Oxygen 6 2


The linear system
6 2 0
12 6 0
6 2 0
1 0 0
has the augmented matrix whose reduced row echelon form is 0 1 1 0 . The general
0 0 0 0
solution is
, ,
where is arbitrary. The smallest positive integer values for the unknowns occur when 2 ,

which yields the solution 1, 2, 2. The balanced equation is
C H O 2CO 2C H OH
12. We are looking for positive integers , , , and such that
CO H O C H O O
The number of atoms of carbon, hydrogen, and oxygen on both sides must equal:
Left Side Right Side
Carbon 6

Hydrogen 2 12
Oxygen 2 6 2
The linear system
6 0
2 12 0
2 6 2 0
1 0 0 1 0
has the augmented matrix whose reduced row echelon form is 0 1 0 1 0 . The general
0 0 1 0
solution is
, , ,


where is arbitrary. The smallest positive integer values for the unknowns occur when 6 ,

which yields the solution 6, 6, 1, 6. The balanced equation is
6CO 6H O C H O 6O
13. The three points must satisfy the quadratic equation y = ax2 + bx + c, giving us 3 equations in
three unknowns a, b, c.
c −1
a b c 2
a−b c 0
⎛ 0 0 1⎞ ⎛ a⎞ ⎛ −1⎞
Solving the linear system ⎜ 1 1 1⎟ ⎜ b⎟ ⎜ 2 ⎟ , yields
⎜ ⎟⎜ ⎟ ⎜ ⎟
⎝ 1 −1 1⎠ ⎝ c ⎠ ⎝ 0⎠
⎛ a⎞ ⎛ −1⎞ ⎛ −1 12 12 ⎞ ⎛ −1⎞ ⎛ 2⎞
⎜ b⎟ A −1 ⎜
2⎟ ⎜ 0 1 − 1⎟ ⎜ 2 ⎟ ⎜ 1 ⎟ .
⎜ ⎟ ⎜ ⎟ ⎜ 2 2⎟
⎜ ⎟ ⎜ ⎟
⎝ c⎠ ⎝ 0⎠ ⎝⎜ 1 0 0 ⎠⎟ ⎝ 0 ⎠ ⎝ −1⎠
Thus the quadratic equation is y = 2x2 + x − 1.
14. We are looking for a polynomial of the form
such that 0 0, 1 1, and 1 1. We obtain a linear system
0
1
1
1 0 0 0
Its augmented matrix has the reduced row echelon form 0 1 0 0 .
0 0 1 1
There is a unique solution 0, 0, 1. The quadratic polynomial is .
16. The graph goes through the points −1, 1 , 0, 4 , 1, 3 , and 2, 4 . Writing the cubic equations

(y = ax3 + bx2 + cx + d) satisfied by these three points and forming the corresponding linear

⎛ −1 1 −1 1⎞ ⎛ a⎞ ⎛ 1⎞
⎜0 0 0 1⎟ ⎜ b⎟ ⎜ 4⎟
system we get ⎜ ⎟⎜ ⎟ ⎜ ⎟ . Solving using A−1, we get
⎜1 1 1 1⎟ ⎜ c ⎟ ⎜ 3⎟
⎜⎝ 8 4 2 1⎟⎠ ⎜⎝ d ⎟⎠ ⎜⎝ 4⎟⎠
⎛ a⎞ ⎛ − 16 1
2
− 12 1
6
⎞ ⎛ 1⎞ ⎛ 1 ⎞
⎜ b⎟ ⎜ 1 −1 1 ⎟
0 ⎜ 4⎟ ⎜ −2⎟
⎜ ⎟ =⎜ 2 2 ⎟ ⎜ ⎟ = ⎜ ⎟ .
⎜ c ⎟ ⎜ − 13 − 12 1 − 16 ⎟ ⎜ 3⎟ ⎜ 0 ⎟
⎜⎝ d ⎟⎠ ⎜ 0 ⎟
0 ⎠ ⎜⎝ 4⎟⎠ ⎜⎝ 4 ⎟⎠
⎝ 1 0
The cubic equation is y = x3 − 2x2 + 4.
1.9 Leontief InputOutput Models
1. (a) The columns of the consumption matrix list the inputs required by C and P, respectively, to
⎛ 0.1 0.2⎞
produce $1 worth of output, so C ⎜⎝ 0.3 0.1⎟⎠ .
(b) Solving the system x − C x d, where d is the demand, means solving I − C x d.
⎛ 0.9 −0.2⎞ 4⎛
0.9 0.2⎞
⎜⎝ −0.3 0.9 ⎟⎠ , use ( I − C )
−1 −1
Since I − C 3⎜ , to get x I − C
⎝ 0.3 0.9⎟⎠
⎛ 9000⎞ ⎛ 12400⎞
⎜⎝ 6000⎟⎠ ⎜⎝ 10800⎟⎠ , so the copy store needs to produce $12,400 and the paper company
needs to produce $10,800.
0.30 0.20
2. (a)
0.10 0.60
1 0 0.30 0.20 0.70 0.20

(b) The Leontief matrix is ;
0 1 0.10 0.60 0.10 0.40
130, 000
the outside demand vector is .
130, 000
The Leontief equation leads to the linear system with the augmented matrix
0.70 0.20 130, 000 1 0 300, 000
. Its reduced row echelon form is .
0.10 0.40 130, 000 0 1 400, 000

To meet the consumer demand, the economy must produce $300,000 worth of food and
$400,000 worth of housing.
⎛ 0.2 0.6 0.5⎞

3. (a) C ⎜ 0.4 0.2 0.2⎟
⎜ ⎟
⎝ 0.2 0.1 0.2⎠
⎛ 1 − 0.2 −0.6 −0.5 6000⎞

(b) The augmented matrix for the system I − C x d is −0.4 1 − 0.2 −0.2 3000⎟ and
⎜
⎜ ⎟
⎝ −0.2 −0.1 1 − 0.2 2000⎠
⎛ 1 0 0 35277.8⎞
it row reduces to ⎜ 0 1 0 25000 ⎟ . The economy should produce $35,277.80 of housing,
⎜ ⎟
⎝ 0 0 1 14444.4⎠
$25,000 of food, and $14,444.40 of utilities.
0.40 0.20 0.45

4. (a) 0.30 0.35 0.30
0.15 0.10 0.20
(b) The Leontief matrix is
1 0 0 0.40 0.20 0.45 0.60 0.20 0.45
0 1 0 0.30 0.35 0.30 0.30 0.65 0.30 ;
0 0 1 0.15 0.10 0.20 0.15 0.10 0.80
5400
the outside demand vector is 2700 .
900
The Leontief equation leads to the linear system with the augmented matrix
0.60 0.20 0.45 5400
0.30 0.65 0.30 2700 .
0.15 0.10 0.80 900
1 0 0
1 0 0 19578.29
Its reduced row echelon form is 0 1 0 0 1 0 16346.56 .
0 0 1 6839.25
0 0 1
To meet the consumer demand, the company must produce approximately $19,578.29 worth of
Web design, $16,346.56 worth of software, and $6839.25 worth of networking.

0.7 0.1 0.3 0.1

6. ;
0.3 0.3 0.3 0.7
22 44.45

14 91.11
7. Since the row sums are all less than 1, the economy is productive.
8.
If the open sector demands dollars worth from each product‐producing sector, i.e., the
outside demand vector is . The Leontief equation leads to the linear
system with the augmented matrix . Its reduced row echelon form is
1 0 0 18
0 1 0 16 .
0 0 1 16
We conclude that the first sector must produce the greatest dollar value to meet the specified
open sector demand.
Chapter 1 Supplementary Exercises
⎡ 1 4 −1⎤
⎢ −2 −8 2⎥
2. ⎢ ⎥
⎢ 3 12 −3⎥ The original augmented matrix.
⎢ ⎥
⎣ 0 0 0⎦
⎡ 1 4 −1 ⎤
⎢ 0 0 0⎥
⎢ 0 0 0⎥ row and 3 times the first row was added to
⎢ ⎥
⎣ 0 0 0⎦ the third row.

This matrix is both in row echelon form and in reduced row echelon form. It corresponds to the
system of equations
4 1
0 0

0 0
0 0
1 4 ,
⎡ 3 1 −2⎤
⎢ −9 −3 6⎥
4. ⎢ ⎥
The original augmented matrix.
⎣⎢ 6 2 1⎥⎦
⎡ 3 1 −2 ⎤
⎢ 0 0 0 ⎥⎥ 3 times the first row was added to the second
⎢
row and 2 times the first row was added to
⎢⎣ 0 0 5 ⎥⎦ the third row.

Although this matrix is not in row echelon form yet, clearly it corresponds to an inconsistent
linear system
3 2
0 0
0 5
since the third equation is contradictory. (We could have performed additional elementary row
1
operations to obtain a matrix in row echelon form 0 0 1 .)
0 0 0
6. We break up the solution into three cases:
Case I: cos 0 and sin 0
⎡cosθ − sinθ x⎤
⎢ sinθ
y ⎥⎦
The augmented matrix corresponding to the
⎣ cosθ
system.


⎡ 1 − cos
sinθ
θ
x
cosθ ⎤
⎢sinθ
y ⎥⎦

⎣ cosθ The first row was multiplied by .

⎡1 − cos
sinθ
θ
x
cosθ ⎤
⎢ ⎥ sin times the first row was added to the
⎣0
1
cosθ y −x sinθ
cosθ ⎦
second row ( ).
⎡1 − cos
sinθ
θ cosθ ⎤
x
⎢0
1 y cosθ − x sinθ ⎥⎦

⎣ The second row was multiplied by cos .

⎡1 0 x cosθ y sinθ ⎤
⎢0 times the second row was added to the
y cosθ − x sinθ ⎥⎦

⎣ 1
first row ( cos .

The system has exactly one solution: cos sin and sin cos .
Case II: cos 0 which implies sin 1. The original system becomes sin ,

sin . Multiplying both sides of the each equation by sin yields sin ,
sin .
Case III: sin 0, which implies cos 1. The original system becomes cos ,

cos . Multiplying both sides of each equation by cos yields cos ,
cos .
Notice that the solution found in Case I
cos sin and sin cos .
actually applies to all three cases.
8. Let , , and denote the number of pennies, nickels, and dimes, respectively. Since there are

13 coins, we must have
13.
On the other hand, the total value of the coins is 83 cents so that
5 10 83.

1 1 1 13
The resulting system of equations has the augmented matrix whose reduced
1 5 10 83
1 0
row echelon form is
0 1
9 5 35 9
, ,
2 4 2 4
However, all three unknowns must be nonnegative integers.
The nonnegativity of requires the inequality 0, i.e., .
Likewise for , 0 yields .
When , all three variables are nonnegative. Of the four integer values inside this
interval (4, 5, 6, and 7), only 6 yields integer values for , , and .
We conclude that the box has to contain 3 pennies, 4 nickels, and 6 dimes.
⎡1 1 1 4 ⎤
⎢0 0 1 2 ⎥⎥
10. ⎢
The augmented matrix for the system.
⎢⎣0 0 a 2 − 4 a − 2⎥⎦
⎡1 1 1 4 ⎤
⎢0 0 1 2 ⎥
⎢ ⎥ 4 times the second row was added to
⎢⎣0 0 0 −2a a
2
6⎥⎦ the third row.

From quadratic formula we have 2 6 2 2 .
The system has no solutions when 2 and (since the third row of our last matrix
would then correspond to a contradictory equation).
The system has infinitely many solutions when 2 or .
No values of result in a system with exactly one solution.
12. Substituting the values 1, 1, and 2 into the original system yields a system of

three equations in the unknowns , , and :

3 2 3
2 1 2 1
3 1 2 3
that can be rewritten as
3
2 1
2 0
1 0 0 2
The augmented matrix of this system has the reduced row echelon form 0 1 0 1 . We
0 0 1 1
conclude that for the original system to have 1, 1, and 2 as its solution, we must
let 2, 1, and 1.
(Note that it can also be shown that the system with 2, 1, and 1 has 1,

1, and 2 as its only solution. One way to do that would be to verify that the reduced
row echelon form of the coefficient matrix of the original system with these specific values of
, and is the identity matrix.)
14. (a) From Theorem 1.4.1, the properties (page 41) and the assumption 0,

we have
This shows that .
(b) From Theorem 1.4.1, the properties (page 41) and the assumption 0,

we have

16. Since 1 0 and 2 9 we have the equations 0 and 4 2

9.
From calculus, the derivative of is 2 .

For the tangent to be horizontal, the derivative 2 4 must equal zero. This leads to
the equation 4 0.
We proceed to solve the resulting system of two equations:
0
4 2 9
4 0
1 0 0 1
The reduced row echelon form of the augmented matrix of this system is 0 1 0 4 .
0 0 1 5
Therefore, the values 1, 4, and 5 result in a polynomial that satisfies the
conditions specified.

알기쉬운 선형대수 1장

Uploaded by

Copyright:

Available Formats

알기쉬운 선형대수 1장

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

알기쉬운 선형대수 1장

Uploaded by

Copyright:

Available Formats

What are some examples of systems of linear equations given in the text?

What are some examples of systems of linear equations given in the text?

How can Gaussian elimination be used to solve systems of linear equations?

How can Gaussian elimination be used to solve systems of linear equations?

CHAPTER

3. (a) Not linear because of the term x2 x3. (b) Linear

4. (b) We can solve this system by inspection since the second equation is a multiple of the first.

(c) An easy way to find an example of a solution of this system would be by letting 0 first,

which is solved by and . Together with 0, this is a solution of the original

(d) We add 6 times the first equation to the third, then proceed to add the first equation to

5. (b) Subtracting the first equation from the second gives 2x − 4z 0, or x 2z and the first

9. (a) Solving the equation for y, we get y 3

10. (a) , , where and are arbitrary values

(b) , , , , where , , , and are arbitrary values

11. (a) 2x 5 y 6 (c) x1 5x2 7x3 − x4 3

12. (a) (b) (c) (d)

(e) True.

2. (a) Row echelon form only; Property 4 is not satisfied.

4. (a) x1 0, x2 −2, x3 4.

(b) Because the column representing x4 does not have a leading 1, we parameterize it, x4 t.

and the first equation is x1 2 − 3t. Thus, the parameterized solution is x1 2 − 3t, x2 −t,

(d) The bottom row corresponds to the equation 0 1, so there are no solutions.

If we assign an arbitrary value , the general solution is given by the formulas

Then back‐substitution gives z 1 4t. Row 2 becomes y − 1 4t 5t −1, so y −t.

The only solution is the trivial solution x1 0, x2 0, x3 0.

Parameterize x3 s and x4 t. Then x 2 13

x2 13S 5T and x1 −8S − 7T.

, 3 2 , ,

0, 0, 0, 0

, , , 0,

The system will have no solutions if a −1, as this would make the equation for R3: 0 −3.

For all remaining values of (i.e., √2 and √2 ) the system has exactly one solution.

If a −2, R3 becomes 0 −4, so the system is inconsistent.

If a 2, R3 becomes 0 0 so the third variable would be parameterized, and the system has

The system has exactly one solution when 3 and 3.

34. We begin by substituting sin , cos , and tan so that the system becomes

The only angles , , and that satisfy the inequalities 0 2 , 0 2 , 0

sin 1, cos 1, tan 0

are , , and 0.

36. We begin by substituting , , and so that the system becomes

If we assign an arbitrary value , the general solution is given by the formulas

, , ,

(For instance, letting the free variable have the value 29 yields 1, 2, and

40. (a) 3 (this will be the number of leading 1's if the matrix has no rows of zeros)

(b) 5 (if all entries in are 0)

42. (a) Either the three lines properly intersect at the origin, or two of them completely overlap and

2. (a) Defined; 1 1 matrix

(b) Undefined (A 3 1 matrix cannot be multiplied by a 6 3 matrix )

(c) Defined; 6 1 matrix

(d) Undefined (2 is a 3 1 matrix, which cannot be added to a 6 2 matrix )

(e) Defined; 2 3 matrix

(f) Undefined ( is a 6 6 matrix, which cannot be added to a 6 1 matrix )

(g) Defined; 3 6 matrix

(h) Undefined ( is a 2 2 matrix, which cannot be added to a 1 1 matrix )

(j) −2 (k) Undefined since B is not square. (l) 8

4. (a) Not possible.

(k) The addition ATCT 2ET is not defined.

6. (a) not possible

(f) DTET − ED T 0 (the 3 × 3 matrix of all zeros)

14. (a) 3 2 2