Invertible Matrices Note
Invertible Matrices Note
ax = b
(a −1a )x = a −1b
(1)x = a −1b
x = a −1b
The number a −1 is the multiplicative inverse of a because a −1a = 1 (the identity element for multiplication). The
definition of the multiplicative inverse of a matrix is similar.
Nonsquare matrices do not have inverses. To see this, note that if A is of size m × n and B is of size n × m
(where m ≠ n), then the products AB and BA are of different sizes and cannot be equal to each other. Not all
square matrices have inverses. (See Example 4.) The next theorem, however, states that if a matrix does have an
inverse, then that inverse is unique.
PROOF
If A is invertible, then it has at least one inverse B such that
AB = I = BA.
Assume that A has another inverse C such that
AC = I = CA.
Demonstrate that B and C are equal, as shown on the next page.
AB = I
C(AB) = CI
(CA)B = C
IB = C
B=C
Consequently B = C, and it follows that the inverse of a matrix is unique.
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 2
[−1 −2
] [11 ]
2
A= and B= .
−1 1 −1
SOLUTION
Using the definition of an inverse matrix, show that B is the inverse of A by showing
that AB = I = BA.
−1 −2 −1 + 2 2−2
[−1 ][1 ] [ ] [ ]
2 1 1 0
AB = = =
1 −1 −1 + 1 2−1 0 1
REMARK
−2 −1 −1 + 2 2−2
[ ][ ] [ ] [ ]
1 2 1 0
BA = = = Recall that it is not always true
1 −1 −1 1 −1 + 1 2−1 0 1
that AB = BA, even when both
products are defined. If A and
B are both square matrices and
AB = In , however, then it can
be shown that BA = In . (The
proof of this is omitted.) So,
in Example 1, you need only
check that AB = I2.
[−1 ]
1 4
A= .
−3
SOLUTION
To find the inverse of A, solve the matrix equation AX = I for X.
][xx x12
[−11 ] [ ]
4 1 0
11
=
−3 21 x22 0 1
[−31 −4
X = A−1 =
1
. ]
Use matrix multiplication to check this result.
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 3
[−11 ] [−11 ]
4 1 4 0
and
−3 0 −3 1
separately, solve them simultaneously by adjoining the identity matrix to the coeficient
matrix to obtain
[−11 ]
4 1 0
.
−3 0 1
By applying Gauss-Jordan elimination to this matrix, solve both systems with a single
elimination process, as shown below.
[0 ]
1 4 1 0
1 1 1 R2 + R1 → R2
−3 −4 R1 + (−4)R2 → R1
[10 ]
0
1 1 1
Applying Gauss-Jordan elimination to the “doubly augmented” matrix [A I], you
obtain the matrix [I A−1].
−3 −4
[−11 ] [10 ]
4 1 0 0
−3 0 1 1 1 1
A I I A−1
This procedure (or algorithm) works for an arbitrary n × n matrix. If A cannot be row
reduced to In, then A is noninvertible (or singular). This procedure will be formally justified in the next
section, after introducing the concept of an elementary matrix. For
now, a summary of the algorithm is shown below.
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 4
[ ]
1 −1 0
A= 1 0 −1
−6 2 3
SOLUTION
Begin by adjoining the identity matrix to A to form the matrix
[ ]
1 −1 0 1 0 0
[A I] = 1 0 −1 0 1 0 .
−6 2 3 0 0 1
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 5
A Singular Matrix
[ ]
1 2 0
A= 3 −1 2
−2 3 −2
SOLUTION
Adjoin the identity matrix to A to form
[ ]
1 2 0 1 0 0
[A I] = 3 −1 2 0 1 0
−2 3 −2 0 0 1
and apply Gauss-Jordan elimination to obtain
[ ]
1 2 0 1 0 0
0 −7 2 −3 1 0 .
0 0 0 −1 1 1
Note that the “A portion” of the matrix has a row of zeros. So it is not possible to
rewrite the matrix [A I] in the form [I A−1]. This means that A has no inverse, or is noninvertible (or
singular).
SOLUTION
a. For the matrix A, apply the formula for the inverse of a 2 × 2 matrix to obtain
ad − bc = (3)(2) − (−1)(−2) = 4. This quantity is not zero, so A is invertible.
Form the inverse by interchanging the entries on the main diagonal, changing the
signs of the other two entries, and multiplying by the scalar 14, as shown below.
[ ]
1 1
[ ]
2 1 2 4
A−1 = 14 = 1 3
2 3 2 4
b. For the matrix B, you have ad − bc = (3)(2) − (−1)(−6) = 0, which means that
B is noninvertible.
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 6
PROPERTIES OF INVERSES
Theorem 2.8 below lists important properties of inverse matrices.
k factors
1
3. (cA)−1 = A−1 4. (AT )−1 = (A−1)T
c
PROOF
The key to the proofs of Properties 1, 3, and 4 is the fact that the inverse of a matrix is
unique (Theorem 2.7). That is, if BC = CB = I, then C is the inverse of B.
Property 1 states that the inverse of A−1 is A itself. To prove this, observe that
A A = AA−1 = I, which means that A is the inverse of A−1. Thus, A = (A−1)−1.
−1
1
Similarly, Property 3 states that A−1 is the inverse of (cA), c ≠ 0. To prove this,
c
use the properties of scalar multiplication given in Theorems 2.1 and 2.3.
1 1
So A−1 is the inverse of (cA), which implies that (cA)−1 = A−1. Properties 2 and 4
c c
are left for you to prove. (See Exercises 63 and 64.)
For nonsingular matrices, the exponential notation used for repeated multiplication
of square matrices can be extended to include exponents that are negative integers. This
may be done by defining A−k to be
k factors
Using this convention you can show that the properties AjAk = Aj +k and (Aj )k = Ajk are true for any integers j
and k.
−1
Let A = [11 2
3 ] and B = [21 −1
. ]
Find (AB )−1, A−1B −1, and B −1A−1.
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 7
Compute A−2 two different ways and show that the results are equal.
[2 ]
1 1
A=
4
SOLUTION
One way to find A−2 is to find (A2)−1 by squaring the matrix A to obtain
[103 ]
5
A2 =
18
and using the formula for the inverse of a 2 × 2 matrix to obtain
[ ]
9
−5 − 54
[ ]
1 18 2
A2 −1
( ) = = .
4
−10 3 − 52
3
4
[ ]
−1 2 − 12
[ ]
1 4
A−1 = =
2
−2 1 −1
1
2
[ ]
9
2 − 54
( A−1 2 ) = .
− 52
3
4
PROOF
To show that B−1A−1 is the inverse of AB, you need only show that it conforms to the
definition of an inverse matrix. That is,
(AB)(B−1A−1) = A(BB −1)A−1 = A(I)A−1 = (AI)A−1 = AA−1 = I.
In a similar way, (B−1A−1)(AB) = I. So, AB is invertible and its inverse is B−1A−1.
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 8
[ ] [ ]
1 3 3 1 2 3
A= 1 4 3 and B= 1 3 3
1 3 4 2 4 3
[ ] [ ]
7 −3 −3 1 −2 1
A−1 = −1 1 0 and B−1 = −1 1 0 .
2
−1 0 1 3 0 − 13
SOLUTION
Using Theorem 2.9 produces
(AB)−1 = B−1A−1
[ ][ ]
1 −2 1 7 −3 −3
= −1 1 0 −1 1 0
2
3 0 − 13 −1 0 1
[ ]
8 −5 −2
= −8 4 3 .
5 −2 − 73
PROOF
To prove Property 1, use the fact that C is invertible and write
AC = BC
(AC)C−1 = (BC)C−1
A(CC−1) = B(CC−1)
AI = BI
A = B.
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Inverse of a Matrix 9
SYSTEMS OF EQUATIONS
For square systems of equations (those having the same number of equations as variables),
you can use the theorem below to determine whether the system has a unique solution.
PROOF
The matrix A is nonsingular, so the steps shown below are valid.
Ax = b
A−1Ax = A−1b
Ix = A−1b
x = A−1b
This solution is unique because if x1 and x2 were two solutions, then you could apply
the cancellation property to the equation Ax1 = b = Ax2 to conclude that x1 = x2.
[ ]
2 3 1
First note that the coefficient matrix for each system is A = 3 3 1 .
2 4 1
[ ]
−1 1 0
Using Gauss-Jordan elimination, A−1 = −1 0 1 .
6 −2 −3
[ ][ ] [ ]
−1 1 0 −1 2
a. x = A−1b = −1 0 1 1 = −1 The solution is x = 2,
y = −1, and z = −2.
6 −2 −3 −2 −2
[ ][ ] [ ]
−1 1 0 4 4
b. x = A−1b = −1 0 1 8 = 1 The solution is x = 4,
y = 1, and z = −7.
6 −2 −3 5 −7
[ ][ ] [ ]
−1 1 0 0 0
The solution is trivial:
c. x = A−1b = −1 0 1 0 = 0
x = 0, y = 0, and z = 0.
6 −2 −3 0 0
Copyright 2017 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.