12- Matrix Algebra VU

Lecture 12

The Inverse of a Matrix

In this lecture and the coming next, we consider only square matrices and we investigate
the matrix analogue of the reciprocal or multiplicative inverse of a nonzero real number.

Inverse of a square Matrix

If A is an n × n matrix, a matrix C of order n × n is called multiplicative inverse of A if

AC = CA = I where I is the n × n identity matrix.

Invertible Matrix

If the inverse of a square matrix exist. It is called an invertible matrix.

In this case, we say that A is invertible and we call C an inverse of A.

Note: If B is another inverse of A, then we would have

B = BI = B ( AC ) = ( BA)C = IC = C .

Thus when A is invertible, its inverse is unique.

The inverse of A is denoted by A-1, so that

AA−1 = I and A−1 A = I

Note: A matrix that is not invertible is sometime called a singular matrix, and an
invertible matrix is called a non-singular matrix.

⎡2 5⎤ ⎡ −7 −5⎤
Example 1: If A = ⎢ ⎥ and C=⎢ ⎥ , then
⎣ −3 −7 ⎦ ⎣3 2⎦

⎡ 2 5 ⎤ ⎡ −7 −5⎤ ⎡ −14 + 15 −10 + 10 ⎤ ⎡1 0⎤

AC = ⎢ ⎥⎢ ⎥=⎢ ⎥=⎢ ⎥ and
⎣ −3 −7 ⎦ ⎣ 3 2 ⎦ ⎣ 21 − 21 15 − 14 ⎦ ⎣ 0 1 ⎦

⎡ −7 −5⎤ ⎡ 2 5 ⎤ ⎡ −14 + 15 −35 + 35⎤ ⎡1 0 ⎤

CA = ⎢ ⎥⎢ ⎥=⎢ =
⎣ 3 2 ⎦ ⎣ −3 −7 ⎦ ⎣ 6 − 6 15 − 14 ⎥⎦ ⎢⎣ 0 1 ⎥⎦
Thus C = A-1.

1
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

⎡a b ⎤
Theorem Let A = ⎢ ⎥.
⎣c d ⎦
1 ⎡ d −b ⎤
If ad − bc ≠ 0 , then A is invertible or non singular and A−1 =
ad − bc ⎢⎣ −c a ⎥⎦
If ad − bc = 0 , then A is not invertible or singular.

The quantity ad − bc is called the determinant of A, and we write

det A = ad − bc

This implies that a 2 × 2 matrix A is invertible if and only if det A ≠ 0.

⎡3 4 ⎤
Example 2 Find the inverse of A = ⎢ ⎥.
⎣5 6 ⎦

Solution We have det A = 3(6) – 4(5) = −2 ≠ 0.

1 ⎡ 6 −4 ⎤ ⎡ 6 /(−2) −4 /(−2) ⎤ ⎡ −3 2 ⎤
Hence A is invertible A−1 = =⎢ =⎢
−2 ⎣ −5 3 ⎦ ⎣ −5 /(−2) 3 /(−2) ⎦ ⎣5 / 2 −3 / 2 ⎦⎥
⎢ ⎥ ⎥

The next theorem provides three useful facts about invertible matrices.

Theorem
a. If A is an invertible matrix, then A-1 is invertible and ( A−1 ) −1 = A

b. If A and B are n × n invertible matrices, then so is AB, and the inverse of AB is

the product of the inverses of A and B in the reverse order. That is
( AB) −1 = B −1 A−1

c. If A is an invertible matrix, then so is AT, and the inverse of AT is the transpose of

A-1. That is ( AT ) −1 = ( A−1 )T

Proof:
(a) We must find a matrix C such that A − 1C = I and C A −1 = I

However, we already know that these equations are satisfied with A in place of C. Hence
A-1 is invertible and A is its inverse.

(b) We use the associative law for multiplication:

2
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

( A B )( B − 1 A − 1 ) = A ( B B − 1 ) A − 1
= A IA − 1
= A A −1
= I

A similar calculation shows that ( B −1 A−1 )( AB ) = I .

Hence AB is invertible, and its inverse is B −1 A−1 i.e ( AB) −1 = B −1 A−1
Generalization
Similarly we can prove the same results for more than two matrices i.e
( ( A1 )( A2 )( A3 )...( An ) )
−1
= An −1 An−1−1... A3−1 A2 −1 A1−1

The product of n × n invertible matrices is invertible, and the inverse is the product of
their inverses in the reverse order.

Example 3: (Inverse of a Transpose). Consider a general 2 × 2 invertible matrix and its

transpose:
⎡a b ⎤ ⎡a c ⎤
A=⎢ ⎥ and At = ⎢ ⎥
⎣c d ⎦ ⎣b d ⎦
Since A is invertible, its determinant (ad – bc) is nonzero. But the determinant of At is
also (ad – bc ), so At is also invertible. It follows that
⎡ d c ⎤
⎢ −
ad − bc ad − bc ⎥
( At ) −1 = ⎢ ⎥ ---------------(1)
⎢− b a ⎥
⎢⎣ ad − bc ad − bc ⎥⎦
⎡ d b ⎤
⎢ −
ad − bc ad − bc ⎥
Now A−1 = ⎢ ⎥
⎢− c a ⎥
⎢⎣ ad − bc ad − bc ⎥⎦
⎡ d c ⎤
⎢ −
ad − bc ad − bc ⎥
Therefore, ( A−1 )t = ⎢ ⎥ -----------------(2)
⎢− b a ⎥
⎢⎣ ad − bc ad − bc ⎥⎦
From (1) and (2), we have
(At)–1 = (A–1)t .

Example 4: (The Inverse of a Product). Consider the matrices

⎡1 2 ⎤ ⎡3 2⎤
A=⎢ ⎥ , B=⎢ ⎥
⎣1 3 ⎦ ⎣2 2⎦

3
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

⎡7 6⎤
AB = ⎢ ⎥,
⎣9 8 ⎦
Here
1 1 ⎡ 8 −6 ⎤ ⎡ 4 −3⎤
( AB ) −1 = Adj ( AB) = =⎢ 7 ⎥
| AB | −2 ⎢⎣ −9 7 ⎥⎦ ⎣ − 92 2 ⎦

1 1 ⎡ 3 −2 ⎤ ⎡ 3 −2 ⎤
A−1 = Adj ( A) = ⎢ =
1 ⎣ −1 1 ⎥⎦ ⎢⎣ −1 1 ⎥⎦
,
| A|
1 1 ⎡ 2 −2 ⎤ ⎡ 1 −1⎤
B −1 = Adj ( B) = ⎢ =⎢ ⎥,
|B| 2 ⎣ −2 3 ⎥⎦ ⎣ −1 32 ⎦
⎡ 1 −1⎤ ⎡ 3 −2 ⎤ ⎡ 4 −3⎤
B −1 A−1 = ⎢ 3 ⎥⎢ ⎥=⎢ 9 7 ⎥
⎣ −1 2 ⎦ ⎣ −1 1 ⎦ ⎣ − 2 2 ⎦
Thus, ( AB) −1 = B −1 A−1

Theorem: If A is invertible and n is a nonnegative integer, then:

(a) An is invertible and (An)–1 = A-n = (A–1)n
(b) kA is invertible for any nonzero scalar k, and (kA)-1 = k-1A-1.

Example 5 (Related to above theorem)

(a) Let
⎡1 2 ⎤ 1 1 ⎡ 3 −2 ⎤ ⎡ 3 −2 ⎤
A=⎢ ⎥ then A−1 = Adj ( A) = ⎢ =
⎣1 3 ⎦ | A| 1 ⎣ −1 1 ⎥⎦ ⎢⎣ −1 1 ⎥⎦

⎡ 3 −2 ⎤ ⎡ 3 −2 ⎤ ⎡ 3 −2 ⎤ ⎡ 41 −30 ⎤
A−3 = ( A−1 ) = ⎢
3
Now ⎥⎢ ⎥⎢ ⎥=⎢ ⎥
⎣ −1 1 ⎦ ⎣ −1 1 ⎦ ⎣ −1 1 ⎦ ⎣ −15 11 ⎦
⎡1 2 ⎤ ⎡1 2 ⎤ ⎡1 2 ⎤ ⎡11 30⎤
Also, A3 = ⎢ ⎥⎢ ⎥⎢ ⎥=⎢ ⎥
⎣1 3 ⎦ ⎣1 3 ⎦ ⎣1 3 ⎦ ⎣15 41⎦
1 ⎡ 41 −30 ⎤ ⎡ 41 −30 ⎤
( A3 ) −1 = ⎢ ⎥ =⎢ ⎥ = ( A−1 )3
(11)(41) − (30)(15) ⎣ −15 11 ⎦ ⎣ −15 11 ⎦
(b)
⎡1 2 ⎤
Take A= ⎢ ⎥ and k=3
⎣3 1 ⎦
⎡3 6 ⎤ 1 ⎡ 3 −6 ⎤ ⎡ −1/15 2 /15 ⎤
kA=3A= ⎢ ⎥, (kA) −1 = (3 A) −1 = =
9 − 54 ⎢⎣ −9 3 ⎥⎦ ⎢⎣ 1/ 5 −1/15⎥⎦
------(1)
⎣9 3 ⎦
1 ⎡ 1 −2 ⎤
A−1 = − ⎢
5 ⎣ −3 1 ⎥⎦
1 −1 ⎡ 1 −2 ⎤ ⎡ −1/15 2 /15 ⎤
A= So k -1A -1 =3-1A -1 = . ⎢ =
3 5 ⎣ −3 1 ⎥⎦ ⎢⎣ 1/ 5 −1/15⎥⎦
-----------------------(2)

4
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

From (1) and (2), we have

(3 A) −1 = 3−1 A−1

There is an important connection between invertible matrices and row operations that
leads to a method for computing inverses. As we shall see, an invertible matrix A is row
equivalent to an identity matrix, and we can find A-1 by watching the row reduction of A
to I.

Elementary Matrices
As we have studied that there are three types of elementary row operations that can be
performed on a matrix:
There are three types of elementary operations
• Interchanging of any two rows
• Multiplication to a row by a nonzero constant
• Adding a multiple of one row to another

Elementary matrix

An elementary matrix is a matrix that results from applying a single elementary row
operation to an identity matrix.

Some examples are given below:

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

Multiply the Interchange the Add 3 times the Multiply the

second row second and third row of I3 to first row of
of I2 by -3. fourth rows of I4. the first row. I3 by 1.

From Def it is clear that elementary matrices are always square.

Elementary matrices are important because they can be used to execute elementary row
operations by matrix multiplication.

Theorem: If A is an n × n identity matrix, and if the elementary matrix E results by

performing a certain row operation on the identity matrix, then the product EA is the
matrix that results when the same row operation is performed on A.

In short, this theorem states that an elementary row operation can be performed on a
matrix A using a left multiplication by and appropriate elementary matrix.

Example 6: (Performing Row Operations by Matrix Multiplication). Consider the

5
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

⎡1 0 2 3⎤
matrix A = ⎢⎢ 2 −1 3 6 ⎥⎥
⎢⎣1 4 4 0 ⎥⎦
Find an elementary matrix E such that EA is the matrix that results by adding 4 times the
first row of A to the third row.

Solution: The matrix E must be 3 × 3 to conform for the product EA. Thus, we obtain E
⎡1 0 0⎤
by adding 4 times the first row of I 3 to the third row. This gives us E = ⎢⎢ 0 1 0 ⎥⎥
⎢⎣ 4 0 1 ⎥⎦
⎡1 0 0 ⎤ ⎡1 0 2 3⎤ ⎡1 0 2 3 ⎤
As a check, the product EA is EA = ⎢⎢ 0 1 0 ⎥⎥ ⎢⎢ 2 −1 3 6 ⎥⎥ = ⎢⎢ 2 −1 3 6 ⎥⎥
⎢⎣ 4 0 1 ⎥⎦ ⎢⎣1 4 4 0 ⎥⎦ ⎢⎣ 5 4 12 12 ⎥⎦
So left multiplication by E does, in fact, add 4 times the first row of A to the third row.

If an elementary row operation is applied to an identity matrix I to produce an elementary

matrix E, then there is a second row operation that, when applied to E, produces I back
again.

For example, if E is obtained by multiplying the i-th row of I by a nonzero scalar c, then
I can be recovered by multiplying the i-th row of E by 1/c. The following table explains
how to recover the identity matrix from an elementary matrix for each of the three
elementary row operations. The operations on the right side of this table are called the
inverse operations of the corresponding operations on the left side.

Row operation on I that produces E Row operation on 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 7: (Recovering Identity Matrices from Elementary Matrices). Here are

three examples that use inverses of row operations to recover the identity matrix from

⎡1 0⎤ ⎡1 0 ⎤ ⎡1 0⎤
⎢0 ⎥ → ⎢ ⎥ → ⎢
⎣ 1⎦ ⎣0 7 ⎦ ⎣0 1 ⎥⎦
Multiply Multiply
the second the second
row by 7. row by 1/7.

6
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

⎡1 0⎤ ⎡0 1⎤ ⎡1 0⎤
⎢0 → →
⎣ 1 ⎦ Interchange ⎢⎣ 1
⎥ 0 ⎦ Interchange ⎢⎣ 0
⎥ 1 ⎥⎦
the first and the first and
second rows. second rows.

⎡1 0⎤ ⎡1 5⎤ ⎡1 0 ⎤
⎢0 ⎥ → ⎢ ⎥→ ⎢0 1 ⎥
⎣ 1⎦ ⎣0 1⎦ ⎣ ⎦
Add 5 times Add -5 times
the second row the second row
to the first. to the first.

The next theorem is the basic result on the invertibility of elementary matrices.

Theorem: An elementary matrix is invertible and the inverse is also an elementary

matrix.

⎡ 1 0 0⎤ ⎡0 1 0 ⎤ ⎡1 0 0 ⎤
Example 8: Let E1 = ⎢⎢ 0 1 0 ⎥⎥ , E2 = ⎢⎢1 0 0 ⎥⎥ , E3 = ⎢⎢0 1 0 ⎥⎥
⎢⎣ −4 0 1 ⎥⎦ ⎢⎣0 0 1 ⎥⎦ ⎢⎣0 0 5 ⎥⎦
⎡a b c ⎤
A = ⎢⎢ d e f ⎥⎥
⎣⎢ g h i ⎦⎥

Compute E1A, E2A, E3A and describe how these products can be obtained by elementary
row operations on A.

Solution We have
⎡ a b c ⎤ ⎡d e f⎤ ⎡ a b c⎤
⎢
E1 A = ⎢ d e f ⎥⎥ , E2 A = ⎢⎢ a b ⎥
c ⎥ , E3 A = ⎢⎢ d e f ⎥⎥
⎢⎣ g − 4a h − 4b i − 4c ⎥⎦ ⎢⎣ g h i ⎥⎦ ⎢⎣5 g 5h 5i ⎥⎦

Addition of (–4) times row 1 of A to row 3 produces E1A. (This is a row replacement
operation.) An interchange of rows 1 and 2 of A produces E2A and multiplication of row
3 of A by 5 produces E3A.

Left-multiplication (that is, multiplication on the left) by E1 in Example 8 has the same
effect on any 3 × n matrix. It adds – 4 times row 1 to row 3. In particular, since E1 I = E1,
we see that E1 itself is produced by the same row operation on the identity. Thus
Example 8 illustrates the following general fact about elementary matrices.

7
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

Note: Since row operations are reversible, elementary matrices are invertible, for if E is
produced by a row operation on I, then there is another row operation of the same type
that changes E back into I. Hence there is an elementary matrix F such that FE = I. Since
E and F correspond to reverse operations, EF = I.

Each elementary matrix E is invertible. The inverse of E is the elementary matrix of the
same type that transforms E back into I.

⎡ 1 0 0⎤
Example Find the inverse of E1 = ⎢⎢ 0 1 0 ⎥⎥ .
⎢⎣ −4 0 1 ⎥⎦

Solution: To transform E1 into I, add + 4 times row 1 to row 3.

⎡ 1 0 0⎤
The elementary matrix that does that is E1 = ⎢⎢ 0 1 0 ⎥⎥
−1

⎢⎣ +4 0 1 ⎥⎦

Theorem An n × n matrix A is invertible if and only if A is row equivalent to In, and in

this case, any sequence of elementary row operations that reduces A to In also transforms
In into A-1.

An Algorithm for Finding A-1: If we place A and I side-by-side to form an augmented

matrix [A I], then row operations on this matrix produce identical operations on A and I.
Then either there are row operations that transform A to In, and In to A-1, or else A is not
invertible.

Algorithm for Finding A-1

Row reduce the augmented matrix [A I]. If A is row equivalent to I, then [A I] is

row equivalent to [I A-1]. Otherwise, A does not have an inverse.

⎡0 1 2⎤
Example 9 Find the inverse of the matrix A = ⎢⎢1 0 3⎥⎥ , if it exists.
⎢⎣ 4 −3 8 ⎥⎦
⎡0 1 2 1 0 0⎤ ⎡1 0 3 0 1 0⎤
Solution [ A I ] = ⎢⎢1 0 3 0 1 0 ⎥⎥ ∼ ⎢⎢ 0 1 2 1 0 0⎥⎥ R12
⎢⎣ 4 −3 8 0 0 1 ⎥⎦ ⎢⎣ 4 −3 8 0 0 1 ⎥⎦

8
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

− 4 R1 + R3 3R2 + R3
⎡1 0 3 0 1 0 ⎤ ⎡ 1 0 3 0 1 0 ⎤
∼ ⎢⎢0 1 2 1 0 0 ⎥⎥ ∼ ⎢⎢ 0 1 2 1 0 0 ⎥⎥
⎢⎣0 −3 −4 0 −4 1 ⎥⎦ ⎢⎣ 0 0 2 3 −4 1 ⎥⎦

−2 R3 + R2 − 3R3 + R1
⎡1 0 3 0 1 0 ⎤ ⎡1 0 0 −9 / 2 7 −3 / 2 ⎤
⎢
∼ ⎢0 1 2 1 0 0 ⎥⎥ ∼ ⎢⎢0 1 0 −2 4 −1 ⎥⎥
⎢⎣0 0 1 3 / 2 −2 1/ 2 ⎥⎦ ⎢⎣ 0 0 1 3 / 2 −2 1/ 2 ⎥⎦

⎡ −9 / 2 7 −3 / 2 ⎤
Since A ∼ I, we conclude that A is invertible, and A = ⎢⎢ −2
−1
4 −1 ⎥⎥
⎢⎣ 3 / 2 −2 1/ 2 ⎥⎦

It is a good idea to check the final answer:

⎡ 0 1 2 ⎤ ⎡ −9 / 2 7 −3 / 2⎤ ⎡1 0 0⎤
AA = ⎢⎢1 0 3 ⎥⎥ ⎢⎢ −2
−1
4 −1 ⎥⎥ = ⎢⎢0 1 0⎥⎥
⎢⎣ 4 −3 8 ⎥⎦ ⎢⎣ 3 / 2 −2 1/ 2 ⎥⎦ ⎢⎣0 0 1 ⎥⎦

It is not necessary to check that A-1A = I since A is invertible.

⎡1 2 -3 1 ⎤
⎢ ⎥
⎢-1 3 -3 -2 ⎥
Example 10 Find the inverse of the matrix A= ⎢ ⎥ , if it exists.
⎢2 0 1 5⎥
⎢ ⎥
⎣3 1 -2 5 ⎦
1 2 -3 1 1 2 -3 1
-1 3 -3 -2 0 5 -6 -1
Consider detA= =
2 0 1 5 0 -4 7 3
3 1 -2 5 0 -5 7 2
operating R + R ,R - 2R ,R -3R
2 1 3 1 4 1
5 -6 -1 5 -6 -1
Expand from first column = -4 7 3 = 1 1 2 = 5(1- 2) + 6(1- 0) -1(1- 0) = 0
-5 7 2 0 1 1
As the given matrix is singular, so it is not invertible.

9
@copyright of Virtual University of Pakistan
12- Matrix Algebra VU

⎡1 0 1⎤
Example 11 Find the inverse of the given matrix if possible A = ⎢⎢2 1 1⎥⎥
⎢⎣3 1 1⎥⎦
1 0 1
Solution: det A = 2 1 1 = −1
3 1 1

As the given matrix is non singular therefore, inverse is possible.

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

⎡1 0 1 ⎤ ⎡ 1 0 0⎤
⎢ 0 1 −1⎥ ⎢ −2 1 0 ⎥
⎢ ⎥ ⎢ ⎥
⎢⎣ 0 1 −2⎥⎦ ⎢⎣ −3 0 1 ⎥⎦
R2 − 2 R1 , R3 − 3R1

⎡1 0 1 ⎤ ⎡ 1 0 0⎤
⎢ 0 1 −1⎥ ⎢ −2 1 0 ⎥
⎢ ⎥ ⎢ ⎥
⎢⎣ 0 0 −1⎥⎦ ⎢⎣ −1 −1 1 ⎥⎦
R3 − R2

⎡1 0 1 ⎤ ⎡1 0 0⎤
⎢ 0 1 −1⎥ ⎢ −2 1 0 ⎥
⎢ ⎥ ⎢ ⎥
⎢⎣ 0 0 1 ⎦⎥ ⎢⎣ 1 1 −1⎦⎥
MultiplyR3 by − 1

⎡1 0 0 ⎤ ⎡ 0 −1 1 ⎤
⎢ ⎥ ⎢ ⎥
⎢0 1 0⎥ ⎢ −1 2 −1⎥
⎣⎢ 0 0 1 ⎦⎥ ⎣⎢ 1 1 −1⎦⎥
R1 − R3 , R2 + R3

10 @copyright of Virtual University of Pakistan

12- Matrix Algebra VU

⎡ 0 −1 1 ⎤
Hence the inverse of matrix A is A = ⎢⎢− 1 2 − 1⎥⎥
−1

⎢⎣ 1 1 − 1⎥⎦

⎡1 2 2 ⎤
Example 12 Find the inverse of the matrix A = ⎢⎢2 2 3⎥⎥
⎢⎣5 2 3⎥⎦
1 2 2
Solution det A = 2 2 3 = 6
5 2 3
As the given matrix is non singular, therefore, inverse of the matrix is possible.
We reduce it to reduce echelon form.

⎡1 2 2⎤ ⎡1 0 0 ⎤
⎢ 2 2 3⎥ ⎢0 1 0⎥
⎢ ⎥ ⎢ ⎥
⎢⎣ 5 2 3 ⎥⎦ ⎢⎣0 0 1 ⎥⎦

⎡1 2 2 ⎤ ⎡ 1 0 0⎤
⎢ 0 −2 −1⎥ ⎢ −2 1 0 ⎥
⎢ ⎥ ⎢ ⎥
⎢⎣ 0 −8 −7 ⎥⎦ ⎢⎣ −5 0 1 ⎥⎦
R2 − 2 R1 , R3 − 5R1

⎡1 2 2 ⎤ ⎡1 0 0⎤
⎢ 0 1 1/ 2 ⎥ ⎢ 1 −1/ 2 0 ⎥
⎢ ⎥ ⎢ ⎥
⎢⎣ 0 −8 −7 ⎥⎦ ⎢⎣ −5 0 1 ⎥⎦
multiply 2nd row by -1/2
⎡1 2 2 ⎤ ⎡1 0 0⎤
⎢ 0 1 1/ 2 ⎥ ⎢1 −1/ 2 0 ⎥
⎢ ⎥ ⎢ ⎥
⎣⎢ 0 0 −3 ⎥⎦ ⎣⎢3 −4 1 ⎥⎦
R3 + 8 R2

⎡1 2 2 ⎤ ⎡1 0 0 ⎤
⎢ 0 1 1/ 2 ⎥ ⎢ 1 −1/ 2 0 ⎥⎥
⎢ ⎥ ⎢
⎣⎢ 0 0 1 ⎥⎦ ⎣⎢ −1 4 / 3 −1/ 3⎥⎦
Multiply 3rd row by -1/3

11 @copyright of Virtual University of Pakistan

12- Matrix Algebra VU

⎡ 8 2 ⎤
⎢ 3 −
⎡1 2 0 ⎤ 3 3 ⎥
⎢0 1 0⎥ ⎢ ⎥
⎢ ⎥ ⎢3 / 2 −7 / 6 1/ 6 ⎥
⎢⎣ 0 0 1 ⎥⎦ ⎢ −1 4 / 3 −1/ 3⎥
⎢ ⎥
⎣ ⎦

⎡1 0 0 ⎤ ⎡ 0 −1/ 3 1/ 3 ⎤
⎢0 1 0⎥ ⎢3 / 2 −7 / 6 1/ 6 ⎥
⎢ ⎥ ⎢ ⎥
⎢⎣ 0 0 1 ⎥⎦ ⎢⎣ −1 4 / 3 −1/ 3⎥⎦
R2 − (1/ 2) R3 , R1 − 2 R3

⎡ 0 − 1/ 3 1/ 3 ⎤
Hence the inverse of the original matrix A = ⎢3 / 2 − 7 / 6 1 / 6 ⎥⎥
⎢−1

⎢⎣ − 1 4 / 3 − 1 / 3⎥⎦

12 @copyright of Virtual University of Pakistan

12- Matrix Algebra VU

Exercises
In exercises 1 to 4, find the inverses of the matrices, if they exist. Use elementary row
operations.

⎡1 0 5 ⎤
⎡1 2 ⎤
1. ⎢ ⎥ 2. ⎢⎢1 1 0 ⎥⎥
⎣5 9 ⎦ ⎢⎣3 2 6 ⎥⎦

⎡1 4 −3⎤ ⎡ 1 3 −1⎤
3. ⎢ −2 −7 6 ⎥⎥
⎢ 4. ⎢⎢ 0 1 2 ⎥⎥
⎢⎣ 1 7 −2 ⎥⎦ ⎢⎣ −1 0 8 ⎥⎦

⎡ 3 4 −1⎤ ⎡ −1 3 −4 ⎤
5. ⎢⎢ 1 0 3 ⎥⎥ 6. ⎢⎢ 2 4 1 ⎥⎥
⎢⎣ 2 5 −4 ⎥⎦ ⎢⎣ −4 2 −9 ⎥⎦

⎡ −1 −5 −7 ⎤
7. Let A = ⎢⎢ 2 5 6 ⎥⎥ . Find the third column of A-1 without computing the other
⎢⎣ 1 3 4 ⎥⎦
columns.

⎡ −25 −9 −27 ⎤
8. Let A = ⎢⎢ 546 180 537 ⎥⎥ . Find the second and third columns of A-1 without
⎢⎣154 50 149 ⎥⎦
computing the first column.

9. Find an elementary matrix E that satisfies the equation.

(a) EA = B (b) EB = A (c) EA = C (d) EC = A
⎡3 4 1 ⎤ ⎡8 1 5 ⎤ ⎡3 4 1 ⎤
where A = ⎢ 2 −7 −1⎥ , B = ⎢ 2 −7 −1⎥ , C = ⎢⎢ 2 −7 −1⎥⎥ .
⎢ ⎥ ⎢ ⎥
⎢⎣8 1 5 ⎥⎦ ⎢⎣ 3 4 1 ⎥⎦ ⎢⎣ 2 −7 3 ⎥⎦

⎡1 0 −2 ⎤
10. Consider the matrix A = ⎢⎢0 1 0 ⎥⎥ .
⎢⎣0 0 2 ⎥⎦

13 @copyright of Virtual University of Pakistan

12- Matrix Algebra VU

(a) Find elementary matrices E1 and E2 such that E2E1A=I.

(b) Write A-1 as a product of two elementary matrices.
(c) Write A as a product of two elementary matrices.
In exercises 11 and 12, express A and A-1 as products of elementary matrices.

⎡2 1 1⎤ ⎡1 1 0 ⎤
11. A = ⎢⎢1 2 1 ⎥⎥ 12. A = ⎢⎢1 1 1 ⎥⎥
⎢⎣1 1 2 ⎥⎦ ⎢⎣0 1 1 ⎥⎦

⎡0 1 7 8⎤
13. Factor the matrix A = ⎢⎢ 1 3 3 8 ⎥⎥ as A = EFGR, where E, F, and G are
⎢⎣ −2 −5 1 −8⎥⎦
elementary matrices and R is in row echelon form.

14 @copyright of Virtual University of Pakistan