November 12, 2018 13:09 C01 Sheet number 53 Page number 53 cyan magenta yellow black © 2018, Anton

ow black © 2018, Anton Textbooks, Inc., All rights rese

1.5 Elementary Matrices and a Method for Finding A−1 53

55. Theorem 1.4.2(c) 56. Theorem 1.4.2(b) Working with Technology

57. Theorem 1.4.8(d) 58. Theorem 1.4.8(e) T1. Let 𝐴 be the matrix
1 1
0 2 3⎤
⎡
True-False Exercises ⎢1 1⎥
𝐴 = ⎢4 0 5⎥
TF. In parts (a)–(k) determine whether the statement is true or ⎢1 1 ⎥
false, and justify your answer. ⎣6 7 0⎦
a. Two n × n matrices, 𝐴 and 𝐵, are inverses of one another
Discuss the behavior of 𝐴k as k increases indefinitely, that is,
if and only if 𝐴𝐵 = 𝐵 𝐴 = 0.
as k → ∞.
b. For all square matrices 𝐴 and 𝐵 of the same size, it is true
T2. In each part use your technology utility to make a conjecture
that (𝐴 + 𝐵)2 = 𝐴2 + 2𝐴𝐵 + 𝐵 2 .
about the form of 𝐴n for positive integer powers of n.
c. For all square matrices 𝐴 and 𝐵 of the same size, it is true
a 1 cos 𝜃 sin 𝜃
that 𝐴2 − 𝐵 2 = (𝐴 − 𝐵)(𝐴 + 𝐵). a. 𝐴 = [ ] b. 𝐴 = [ ]
0 a − sin 𝜃 cos 𝜃
d. If 𝐴 and 𝐵 are invertible matrices of the same size, then
𝐴𝐵 is invertible and (𝐴𝐵)−1 = 𝐴−1 𝐵 −1 . T3. The Fibonacci sequence (named for the Italian mathemati-
cian Leonardo Fibonacci 1170–1250) is
e. If 𝐴 and 𝐵 are matrices such that 𝐴𝐵 is defined, then it
is true that (𝐴𝐵)𝑇 = 𝐴𝑇 𝐵 𝑇 . 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, . . .
f. The matrix the terms of which are commonly denoted as
a b
𝐴=[ ] 𝐹0 , 𝐹1 , 𝐹2 , 𝐹3 , . . . , 𝐹 n , . . .
c d
is invertible if and only if ad − bc ≠ 0. After the initial terms 𝐹0 = 0 and 𝐹1 = 1, each term is the
g. If 𝐴 and 𝐵 are matrices of the same size and k is a con- sum of the previous two; that is,
stant, then (k𝐴 + 𝐵)𝑇 = k𝐴𝑇 + 𝐵 𝑇 .
𝐹n = 𝐹n−1 + 𝐹n−2
h. If 𝐴 is an invertible matrix, then so is 𝐴𝑇 .
Confirm that if
i. If p(x) = a0 + a1 x + a2 x 2 + ⋅ ⋅ ⋅ + am x m and 𝐼 is an iden-
tity matrix, then p(𝐼) = a0 + a1 + a2 + ⋅ ⋅ ⋅ + am . 𝐹2 𝐹1 1 1
𝑄=[ ]=[ ]
𝐹1 𝐹0 1 0
j. A square matrix containing a row or column of zeros can-
not be invertible. then
k. The sum of two invertible matrices of the same size must 𝐹n+1 𝐹n
𝑄n = [ ]
be invertible. 𝐹n 𝐹0

1.5 Elementary Matrices and a Method for

Finding A−1
In this section we will develop an algorithm for finding the inverse of a matrix, and we
will discuss some of the basic properties of invertible matrices.

Elementary Matrices
In Section 1.1 we defined three elementary row operations on a matrix 𝐴:

1. Multiply a row by a nonzero constant c.

2. Interchange two rows.
3. Add a constant c times one row to another.
November 12, 2018 13:09 C01 Sheet number 54 Page number 54 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

54 CH A PT E R 1 Systems of Linear Equations and Matrices

It should be evident that if we let 𝐵 be the matrix that results from 𝐴 by performing one of
the operations in this list, then the matrix 𝐴 can be recovered from 𝐵 by performing the
corresponding operation in the following list:

1. Multiply the same row by 1/c.

2. Interchange the same two rows.
3. If 𝐵 resulted by adding c times row ri of 𝐴 to row rj , then add −c times rj to ri .

It follows that if 𝐵 is obtained from 𝐴 by performing a sequence of elementary row opera-

tions, then there is a second sequence of elementary row operations, which when applied
to 𝐵 recovers 𝐴. Accordingly, we make the following definition.

Definition 1

Matrices 𝐴 and 𝐵 are said to be row equivalent if either (hence each) can be obtained
from the other by a sequence of elementary row operations.

Our next goal is to show how matrix multiplication can be used to carry out an ele-
mentary row operation.

Definition 2

A matrix 𝐸 is called an elementary matrix if it can be obtained from an identity

matrix by performing a single elementary row operation.

EXAMPLE 1 | Elementary Matrices and Row Operations

Listed below are four elementary matrices and the operations that produce them.

⎡1 0 0 0⎤
1 0 ⎢0 0 0 1⎥ ⎡1 0 3⎤ ⎡1 0 0⎤
[ ] ⎢ ⎥ ⎢0 1 0⎥ ⎢0 1 0⎥
0 −3 ⎢0 0 1 0⎥ ⎢ ⎥ ⎢ ⎥
⎢0 0 1⎥ ⎢0 0 1⎥
⎢ ⎥ ⎣ ⎦ ⎣ ⎦
⎣0 1 0 0⎦


Multiply the Interchange the Add 3 times Multiply the

second row of second and fourth the third row of first row of
𝐼2 by −3. rows of 𝐼4 . 𝐼3 to the first row. 𝐼3 by 1.

The following theorem, whose proof is left as an exercise, shows that when a matrix 𝐴
is multiplied on the left by an elementary matrix 𝐸, the effect is to perform an elementary
row operation on 𝐴.

Theorem 1.5.1 will be a

Theorem 1.5.1
useful tool for developing
new results about matrices, Row Operations by Matrix Multiplication
but as a practical matter If the elementary matrix 𝐸 results from performing a certain row operation on 𝐼m
it is usually preferable to and if 𝐴 is an m × n matrix, then the product 𝐸𝐴 is the matrix that results when
perform row operations this same row operation is performed on 𝐴.
directly.
November 12, 2018 13:09 C01 Sheet number 55 Page number 55 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

1.5 Elementary Matrices and a Method for Finding A−1 55

EXAMPLE 2 | Using Elementary Matrices

Consider the matrix

1 0 2 3
𝐴 = [2 −1 3 6]
1 4 4 0
and consider the elementary matrix
1 0 0
𝐸 = [0 1 0]
3 0 1
which results from adding 3 times the first row of 𝐼3 to the third row. The product 𝐸𝐴 is
1 0 2 3
𝐸𝐴 = [2 −1 3 6]
4 4 10 9
which is precisely the matrix that results when we add 3 times the first row of 𝐴 to the
third row.

We know from the discussion at the beginning of this section that if 𝐸 is an elementary
matrix that results from performing an elementary row operation on an identity matrix
𝐼, then there is a second elementary row operation, which when applied to 𝐸 produces 𝐼
back again. Table 1 lists these operations. The operations on the right side of the table are
called the inverse operations of the corresponding operations on the left.

TA B L E 1

Row Operation on I Row Operation on E

That Produces E That Reproduces I
Multiply row i by c ≠ 0 Multiply row i by 1/c

Interchange rows i and j Interchange rows i and j

Add c times row i to row j Add −c times row i to row j

EXAMPLE 3 | Row Operations and Inverse Row Operations

In each of the following, an elementary row operation is applied to the 2 × 2 identity matrix
to obtain an elementary matrix 𝐸, then 𝐸 is restored to the identity matrix by applying the
inverse row operation.
1 0 1 0 1 0
[ ] ⟶ [ ] ⟶ [ ]
0 1 0 7 0 1


Multiply the second Multiply the second

row by 7. 1
row by .
7
November 12, 2018 13:09 C01 Sheet number 56 Page number 56 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

56 CH A PT E R 1 Systems of Linear Equations and Matrices

1 0 0 1 1 0
[ ] ⟶ [ ] ⟶ [ ]
0 1 1 0 0 1


Interchange the first Interchange the first
and second rows. and second rows.
1 0 1 5 1 0
[ ] ⟶ [ ] ⟶ [ ]
0 1 0 1 0 1


Add 5 times the Add −5 times the
second row to second row to the
the first. first.

The next theorem is a key result about invertibility of elementary matrices. It will be
a building block for many results that follow.

Theorem 1.5.2

Every elementary matrix is invertible, and the inverse is also an elementary matrix.

Proof If 𝐸 is an elementary matrix, then 𝐸 results by performing some row operation on

𝐼. Let 𝐸0 be the matrix that results when the inverse of that operation is performed on 𝐼.
Applying Theorem 1.5.1 and using the fact that inverse row operations cancel the effect
of each other, it follows that

𝐸0 𝐸 = 𝐼 and 𝐸𝐸0 = 𝐼

Thus, the elementary matrix 𝐸0 is the inverse of 𝐸.

Equivalence Theorem
One of our objectives as we progress through this text is to show how seemingly diverse
ideas in linear algebra are related. The following theorem, which relates results we have
obtained about invertibility of matrices, homogeneous linear systems, reduced row ech-
elon forms, and elementary matrices, is our first step in that direction. As we study new
topics, more statements will be added to this theorem.

Theorem 1.5.3

Equivalent Statements
If 𝐴 is an n × n matrix, then the following statements are equivalent, that is, all true
or all false.
(a) 𝐴 is invertible.
(b) 𝐴x = 0 has only the trivial solution.
(c) The reduced row echelon form of 𝐴 is 𝐼n .
(d) 𝐴 is expressible as a product of elementary matrices.
November 12, 2018 13:09 C01 Sheet number 57 Page number 57 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

1.5 Elementary Matrices and a Method for Finding A−1 57

Proof We will prove the equivalence by establishing the chain of implications: The following figure
(a) ⇒ (b) ⇒ (c) ⇒ (d) ⇒ (a). illustrates that the sequence
of implications

(a) ⇒ (b) Assume 𝐴 is invertible and let x0 be any solution of 𝐴x = 0. Multiplying both (a) ⇒ (b) ⇒ (c) ⇒ (d) ⇒ (a)
sides of this equation by 𝐴−1 gives implies that
(𝐴−1 𝐴)x0 = 𝐴−1 0
(d) ⇒ (c) ⇒ (b) ⇒ (a)
from which it follows that x0 = 0, so 𝐴x = 0 has only the trivial solution.
and hence that
(a) ⇔ (b) ⇔ (c) ⇔ (d)
(b) ⇒ (c) Let 𝐴x = 0 be the matrix form of the system
(see Appendix A).
a11 x 1 + a12 x 2 + ⋅ ⋅ ⋅ + a1n x n = 0
(a)
a21 x 1 + a22 x 2 + ⋅ ⋅ ⋅ + a2n x n = 0
.. .. .. .. (1)
. . . .
an1 x 1 + an2 x 2 + ⋅ ⋅ ⋅ + ann x n = 0 (d) (b)

and assume that the system has only the trivial solution. If we solve by Gauss–Jordan
elimination, then the system of equations corresponding to the reduced row echelon form
(c)
of the augmented matrix will be
x1 =0
x2 =0 (2)
..
.
xn = 0
Thus, the augmented matrix
a a12 ⋅⋅⋅ a1n 0
⎡ 11 ⎤
⎢ a21 a22 ⋅⋅⋅ a2n 0⎥
⎢ .. .. .. .. ⎥
⎢ . . . .⎥
⎣ an1 an2 ⋅⋅⋅ ann 0⎦
for (1) can be reduced to the augmented matrix
1 0 0 0 ⋅⋅⋅ 0
⎡ ⎤
⎢0 1 0 0⎥⋅⋅⋅ 0
⎢0 0 1 0⎥⋅⋅⋅ 0
⎢ ⎥
⎢ .. .. .. .. ⎥ ..
⎢. . . .⎥ .
⎣0 0 0
⋅ ⋅ ⋅ 1 0⎦
for (2) by a sequence of elementary row operations. If we disregard the last column (all
zeros) in each of these matrices, we can conclude that the reduced row echelon form of 𝐴
is 𝐼n .

(c) ⇒ (d ) Assume that the reduced row echelon form of 𝐴 is 𝐼n , so that 𝐴 can be reduced
to 𝐼n by a finite sequence of elementary row operations. By Theorem 1.5.1, each of these
operations can be accomplished by multiplying on the left by an appropriate elementary
matrix. Thus we can find elementary matrices 𝐸1 , 𝐸2 , . . . , 𝐸k such that
𝐸k ⋅ ⋅ ⋅ 𝐸2 𝐸1 𝐴 = 𝐼n (3)
By Theorem 1.5.2, 𝐸1 , 𝐸2 , . . . , 𝐸k are invertible. Multiplying both sides of Equation (3) on
the left successively by 𝐸k−1 , . . . , 𝐸2−1 , 𝐸1−1 we obtain

𝐴 = 𝐸1−1 𝐸2−1 ⋅ ⋅ ⋅ 𝐸k−1 𝐼n = 𝐸1−1 𝐸2−1 ⋅ ⋅ ⋅ 𝐸k−1 (4)

By Theorem 1.5.2, this equation expresses 𝐴 as a product of elementary matrices.

(d ) ⇒ (a) If 𝐴 is a product of elementary matrices, then from Theorems 1.4.6 and 1.5.2,
the matrix 𝐴 is a product of invertible matrices and hence is invertible.
November 12, 2018 13:09 C01 Sheet number 58 Page number 58 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

58 CH A PT E R 1 Systems of Linear Equations and Matrices

A Method for Inverting Matrices

As a first application of Theorem 1.5.3, we will develop a procedure (or algorithm) that can
be used to tell whether a given matrix is invertible, and if so, produce its inverse. To derive
this algorithm, assume for the moment, that 𝐴 is an invertible n × n matrix. In Equation
(3), the elementary matrices execute a sequence of row operations that reduce 𝐴 to 𝐼n . If
we multiply both sides of this equation on the right by 𝐴−1 and simplify, we obtain

𝐴−1 = 𝐸k ⋅ ⋅ ⋅ 𝐸2 𝐸1 𝐼n

But this equation tells us that the same sequence of row operations that reduces 𝐴 to 𝐼n will
transform 𝐼n to 𝐴−1 . Thus, we have established the following result.

Inversion Algorithm To find the inverse of an invertible matrix 𝐴, find a sequence of

elementary row operations that reduces 𝐴 to the identity and then perform that same
sequence of operations on 𝐼n to obtain 𝐴−1 .

A simple method for carrying out this procedure is given in the following example.

EXAMPLE 4 | Using Row Operations to Find A−1

Find the inverse of

1 2 3
𝐴 = [2 5 3]
1 0 8

Solution We want to reduce 𝐴 to the identity matrix by row operations and simultaneously
apply these operations to 𝐼 to produce 𝐴−1 . To accomplish this we will adjoin the identity
matrix to the right side of 𝐴, thereby producing a partitioned matrix of the form

[𝐴 ∣ 𝐼]
Then we will apply row operations to this matrix until the left side is reduced to 𝐼; these
operations will convert the right side to 𝐴−1 , so the final matrix will have the form
[𝐼 ∣ 𝐴−1 ]
The computations are as follows:
1 2 3 1 0 0
⎡ ⎤
⎢2 5 3 0 1 0⎥
⎢ ⎥
⎣1 0 8 0 0 1⎦

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

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

1 2 3 1 0 0
⎡ ⎤
⎢0 1 −3 −2 1 0⎥ We multiplied the
⎢ ⎥ third row by −1.
⎣0 0 1 5 −2 −1⎦
November 12, 2018 13:09 C01 Sheet number 59 Page number 59 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

1.5 Elementary Matrices and a Method for Finding A−1 59

1 2 0 −14 6 3
⎡ ⎤
⎢0 1 0 13 −5 −3⎥ We added 3 times the third
⎢ ⎥ row to the second and −3 times
⎣0 0 1 5 −2 −1⎦ the third row to the first.

1 0 0 −40 16 9
⎡ ⎤
⎢0 1 0 13 −5 −3⎥ We added −2 times the
⎢ ⎥ second row to the first.
⎣0 0 1 5 −2 −1⎦
Thus,
−40 16 9
𝐴−1 = [ 13 −5 −3]
5 −2 −1

Often it will not be known in advance if a given n × n matrix 𝐴 is invertible. However,

if it is not, then by parts (a) and (c) of Theorem 1.5.3 it will be impossible to reduce 𝐴 to
𝐼n by elementary row operations. This will be signaled by a row of zeros appearing on the
left side of the partition at some stage of the inversion algorithm. If this occurs, then you
can stop the computations and conclude that 𝐴 is not invertible.

EXAMPLE 5 | Showing That a Matrix Is Not Invertible

Consider the matrix

1 6 4
𝐴=[ 2 4 −1]
−1 2 5
Applying the procedure of Example 4 yields
1 6 4 1 0 0
[ 2 4 −1 0 1 0]
−1 2 5 0 0 1

1 6 4 1 0 0
[ 0 −8 −9 −2 1 0] We added −2 times the first
row to the second and added
0 8 9 1 0 1 the first row to the third.

1 6 4 1 0 0
[ 0 −8 −9 −2 1 0] We added the second
row to the third.
0 0 0 −1 1 1
Since we have obtained a row of zeros on the left side, 𝐴 is not invertible.

EXAMPLE 6 | Analyzing Homogeneous Systems

Use Theorem 1.5.3 to determine whether the given homogeneous system has nontrivial
solutions.
(a) x 1 + 2x 2 + 3x 3 = 0 (b) x 1 + 6x 2 + 4x 3 = 0
2x 1 + 5x 2 + 3x 3 = 0 2x 1 + 4x 2 − x 3 = 0
x1 + 8x 3 = 0 −x 1 + 2x 2 + 5x 3 = 0
Solution From parts (a) and (b) of Theorem 1.5.3 a homogeneous linear system has only
the trivial solution if and only if its coefficient matrix is invertible. From Examples 4 and 5
the coefficient matrix of system (a) is invertible and that of system (b) is not. Thus, system
(a) has only the trivial solution while system (b) has nontrivial solutions.
November 12, 2018 13:09 C01 Sheet number 60 Page number 60 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

60 CH A PT E R 1 Systems of Linear Equations and Matrices

Exercise Set 1.5

In Exercises 1–2, determine whether the given matrix is elementary. 1 0 0 1 4

c. 𝐸 = [0 5 0], 𝐴 = [2 5]
1 0 −5 1
1. a. [ ] b. [ ] 0 0 1 3 6
−5 1 1 0
2 0 0 2 In Exercises 7–8, use the following matrices and find an elementary
1 1 0 ⎡ ⎤ matrix 𝐸 that satisfies the stated equation.
⎢0 1 0 0⎥
c. [0 0 1] d. ⎢
⎢0 0 1 0⎥⎥ 3 4 1 8 1 5
0 0 0
⎣0 0 0 1⎦ 𝐴 = [2 −7 −1], 𝐵 = [2 −7 −1]
8 1 5 3 4 1
0 0 1
1 0 3 4 1 8 1 5
2. a. [ ] b. [0 1 0]
0 √3 𝐶 = [2 −7 −1], 𝐷 = [−6 21 3]
1 0 0
2 −7 3 3 4 1
1 0 0 −1 0 0
c. [0 1 9] d. [ 0 0 1] 8 1 5
0 0 1 0 1 0 𝐹 = [8 1 1]
3 4 1
In Exercises 3–4, find a row operation and the corresponding ele-
mentary matrix that will restore the given elementary matrix to the
7. a. 𝐸𝐴 = 𝐵 b. 𝐸𝐵 = 𝐴
identity matrix.
−7 0 0 c. 𝐸𝐴 = 𝐶 d. 𝐸𝐶 = 𝐴
1 −3
3. a. [ ] b. [ 0 1 0]
0 1 8. a. 𝐸𝐵 = 𝐷 b. 𝐸𝐷 = 𝐵
0 0 1
0 0 1 0 c. 𝐸𝐵 = 𝐹 d. 𝐸𝐹 = 𝐵
1 0 0 ⎡ ⎤
⎢0 1 0 0⎥
c. [ 0 1 0] d. ⎢
⎢1 0 0 0⎥⎥
In Exercises 9–10, first use Theorem 1.4.5 and then use the inversion
−5 0 1 algorithm to find 𝐴−1 , if it exists.
⎣0 0 0 1⎦
1 4 2 −4
1 0 0 9. a. 𝐴 = [ ] b. 𝐴 = [ ]
1 0 2 7 −4 8
4. a. [ ] b. [0 1 0]
−3 1 1 −5 6 4
0 0 3 10. a. 𝐴 = [ ] b. 𝐴 = [ ]
3 −16 −3 −2
0 0 0 1 1 0 − 17 0
⎡ ⎤ ⎡ ⎤
⎢0 1 0 0⎥ ⎢0 1 0 0⎥
c. ⎢ d. ⎢ In Exercises 11–12, use the inversion algorithm to find the inverse of
⎢0 0 1 0⎥⎥ ⎢0 0 1 0⎥
⎥
the matrix (if the inverse exists).
⎣1 0 0 0⎦ ⎣0 0 0 1⎦
1 2 3 −1 3 −4
⎡ ⎤ ⎡ ⎤
In Exercises 5–6 an elementary matrix 𝐸 and a matrix 𝐴 are given. 11. a. ⎢2 5 3⎥ b. ⎢ 2 4 1⎥
⎢ ⎥ ⎢ ⎥
Identify the row operation corresponding to 𝐸 and verify that the ⎣1 0 8⎦ ⎣−4 2 −9⎦
product 𝐸𝐴 results from applying the row operation to 𝐴. 1 1
− 25 1 1
− 25
0 1 −1 −2 5 −1 ⎡5 5 ⎤ ⎡5 5 ⎤
5. a. 𝐸 = [ ], 𝐴=[ ] ⎢1 1 1 ⎥ ⎢2 − 35 3 ⎥
− 10
1 0 3 −6 −6 −6 12. a. ⎢5 5 10 ⎥ b. ⎢5 ⎥
⎢1 1 ⎥ ⎢1 1 ⎥
⎣5 − 45 10 ⎦ ⎣5 − 45 10 ⎦
1 0 0 2 −1 0 −4 −4
b. 𝐸 = [0 1 0], 𝐴 = [1 −3 −1 5 3]
0 −3 1 2 0 1 3 −1 In Exercises 13–18, use the inversion algorithm to find the inverse of
the matrix (if the inverse exists).
1 0 4 1 4 1 0 1 √ 3 √2
⎡ 2 0⎤
c. 𝐸 = [0 1 0], 𝐴 = [2 5] ⎢
13. [0 1 1] 14. −4√2
⎢
√2 0⎥
⎥
0 0 1 3 6 1 1 0 ⎣ 0 0 1⎦
−6 0 −1 −2 5 −1
6. a. 𝐸 = [ ], 𝐴=[ ] 1 0 0 0
0 1 3 −6 −6 −6 2 6 6 ⎡ ⎤
⎢1 3 0 0⎥
15. [2 7 6] 16. ⎢
1 0 0 2 −1 0 −4 −4
⎢1 3 5 0⎥⎥
2 7 7
b. 𝐸 = [−4 1 0], 𝐴 = [1 −3 −1 5 3] ⎣1 3 5 7⎦
0 0 1 2 0 1 3 −1
November 12, 2018 13:09 C01 Sheet number 61 Page number 61 cyan magenta yellow black © 2018, Anton Textbooks, Inc., All rights rese

1.5 Elementary Matrices and a Method for Finding A−1 61

2 −4 0 0 0 0 2 0 Working with Proofs

⎡ ⎤ ⎡ ⎤
⎢1 2 12 0⎥ ⎢1 0 0 1⎥
17. ⎢ 18. ⎢ 31. Prove that if 𝐴 and 𝐵 are m × n matrices, then 𝐴 and 𝐵 are
⎢0 0 2 0⎥⎥ ⎢0 −1 3 0⎥⎥ row equivalent if and only if 𝐴 and 𝐵 have the same reduced
⎣0 −1 −4 −5⎦ ⎣2 1 5 −3⎦ row echelon form.

In Exercises 19–20, find the inverse of each of the following 4 × 4 32. Prove that if 𝐴 is an invertible matrix and 𝐵 is row equivalent
matrices, where k1 , k2 , k3 , k4 , and k are all nonzero. to 𝐴, then 𝐵 is also invertible.

k 0 0 0 k 1 0 0 33. Prove that if 𝐵 is obtained from 𝐴 by performing a sequence

⎡ 1 ⎤ ⎡ ⎤
⎢0 k2 0 0⎥ ⎢0 1 0 0⎥ of elementary row operations, then there is a second sequence
19. a. ⎢ b. ⎢
⎢0 0 k3 0⎥ ⎥ ⎢0 0 k 1⎥⎥
of elementary row operations, which when applied to 𝐵 recov-
ers 𝐴.
⎣0 0 0 k4 ⎦ ⎣0 0 0 1⎦

0 0 0 k1 k 0 0 0
⎡ ⎤ ⎡ ⎤ True-False Exercises
⎢0 0 k2 0⎥ ⎢1 k 0 0⎥
20. a. ⎢ b. ⎢
⎢0 k3 0 0⎥ ⎥ ⎢0 1 k 0⎥⎥
TF. In parts (a)–(g) determine whether the statement is true or
false, and justify your answer.
⎣k4 0 0 0⎦ ⎣0 0 1 k⎦
a. The product of two elementary matrices of the same size
In Exercises 21–22, find all values of c, if any, for which the given must be an elementary matrix.
matrix is invertible.
c c c c 1 0 b. Every elementary matrix is invertible.
21. [1 c c] 22. [1 c 1] c. If 𝐴 and 𝐵 are row equivalent, and if 𝐵 and 𝐶 are row
1 1 c 0 1 c equivalent, then 𝐴 and 𝐶 are row equivalent.
In Exercises 23–26, express the matrix and its inverse as products of d. If 𝐴 is an n × n matrix that is not invertible, then the lin-
elementary matrices. ear system 𝐴x = 0 has infinitely many solutions.
−3 1 1 0
23. [ ] 24. [ ] e. If 𝐴 is an n × n matrix that is not invertible, then the
2 2 −5 2
matrix obtained by interchanging two rows of 𝐴 cannot
1 0 −2 1 1 0 be invertible.
25. [0 4 3] 26. [1 1 1]
f. If 𝐴 is invertible and a multiple of the first row of 𝐴
0 0 1 0 1 1 is added to the second row, then the resulting matrix is
invertible.
In Exercises 27–28, show that the matrices 𝐴 and 𝐵 are row equiv-
alent by finding a sequence of elementary row operations that pro- g. An expression of an invertible matrix 𝐴 as a product of
duces 𝐵 from 𝐴, and then use that result to find a matrix 𝐶 such elementary matrices is unique.
that 𝐶𝐴 = 𝐵.
1 2 3 1 0 5
27. 𝐴 = [1 4 1], 𝐵 = [0 2 −2] Working with Technology
2 1 9 1 1 4 T1. It can be proved that if the partitioned matrix
2 1 0 6 9 4
28. 𝐴 = [−1 1 0], 𝐵 = [−5 −1 0] 𝐴 𝐵
[ ]
3 0 −1 −1 −2 −1 𝐶 𝐷

29. Show that if is invertible, then its inverse is

1 0 0
𝐴 = [ 0 1 0]
𝐴−1 + 𝐴−1 𝐵(𝐷 − 𝐶𝐴−1 𝐵)−1 𝐶𝐴−1 −𝐴−1 𝐵(𝐷 − 𝐶𝐴−1 𝐵)−1
a b c [ ]
is an elementary matrix, then at least one entry in the third −(𝐷 − 𝐶𝐴−1 𝐵)−1 𝐶𝐴−1 (𝐷 − 𝐶𝐴−1 𝐵)−1
row must be zero.
30. Show that provided that all of the inverses on the right side exist. Use
0 a 0 0 0 this result to find the inverse of the matrix
⎡ ⎤
⎢b 0 c 0 0⎥
⎢ ⎥
𝐴 = ⎢0 d 0 e 0⎥ 1 2 1 0
⎢0 ⎡ ⎤
0 𝑓 0 g⎥ ⎢0 −1 0 1⎥
⎢ ⎥ ⎢ ⎥
⎣0 0 0 h 0⎦ ⎢0 0 2 0⎥
⎢ ⎥
is not invertible for any values of the entries. ⎣0 0 3 3⎦