0% found this document useful (0 votes)
30 views

Module 7

Uploaded by

descarl38
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views

Module 7

Uploaded by

descarl38
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

MODULE 5

LESSON 9
INVERSE OF A MATRIX
Learning Outcomes

At the end of the lesson, the students should be able to:


1. Solve the inverse of a matrix using two methods, and

2. Apply the concept of inverse of a matrix to solve systems of linear


algebraic equations.

Recall the concept of a multiplicative inverse in the real number system. For any
nonzero number 𝑎, there exists a number 𝑏 such that 𝑎𝑏 = 𝑏𝑎 = 1. The
number 𝑏 is called the multiplicative inverse of the number 𝑎, and is oftentimes
denoted by 𝑎 −1.

Extending this concept to matrices, for any square matrix 𝑨, there exists a matrix
𝑩 of the same order as 𝑨 such that 𝑨𝑩 = 𝑩𝑨 = 𝑰, where 𝑰 is the identity
matrix. If this is the case, we say that the matrix 𝑨 is nonsingular or invertible.
Also, the matrix 𝑩 is said to be the the inverse of 𝑨.

Properties of the Inverse of a Matrix


Let 𝑨 and 𝑩 be nonsingular matrices; then

1. (𝑨−1 )−1 = 𝑨
2. (𝑨𝑩)−1 = 𝑩−1 𝑨−1
3. (𝑨𝑇 )−1 = (𝑨−1 )𝑇

Solving the Inverse of a Matrix

1. Adjoint Method. Let 𝑨 be an 𝑛 𝑥 𝑛 matrix. If det 𝑨 ≠ 0, then

1
𝑨−1 = ( ) (adj 𝑨)
det 𝑨

where adj 𝑨 is the adjoint of matrix 𝑨.


Adjoint Matrix. Let 𝑨 be an 𝑛 𝑥 𝑛 matrix. The ajoint of 𝑨 is the
matrix that is the transpose of the matrix of cofactors corresponding to
the entries of 𝑨.

𝐶11 𝐶12 ⋯ 𝐶1𝑛 𝑇 𝐶11 𝐶21 ⋯ 𝐶𝑛1


𝐶 𝐶22 ⋯ 𝐶2𝑛 𝐶 𝐶22 ⋯ 𝐶𝑛2
adj 𝑨 = [ 21 ] = [ 12 ]
⋮ ⋮ ⋮ ⋮
𝐶𝑛1 𝐶𝑛2 ⋯ 𝐶𝑛𝑛 𝐶1𝑛 𝐶2𝑛 ⋯ 𝐶𝑛𝑛

2. Row Operations Method. If an 𝑛 𝑥 𝑛 matrix 𝑨 can be transformed


into the 𝑛 𝑥 𝑛 identity matrix 𝑰 by a sequence of elementary row
operations, then 𝑨 is said to be nonsingular. In solving for the inverse
using this method, the augmented matrix [𝑨 | 𝑰] should be transformed
into the augmented matrix [𝑰 | 𝑨−1 ] via row operations.

Example Solve the inverse of the following matrices using the two methods
9.1. discussed above.

1 2
1. 𝑨 = [ ]
3 4

(a) Adjoint Method

Get the determinant of 𝑨 first.


1 2
det 𝑨 = | |
3 4
= 1(4) − 2(3)
=4−6
= −2

Get the cofactor matrix.


1 2
𝐶11 = (−1)1+1 | |
3 4
= (−1)2 (4)
=4

1 2
𝐶12 = (−1)1+2 | |
3 4
= (−1)3 (3)
= −3
1 2
𝐶21 = (−1)2+1 | |
3 4
= (−1)3 (2)
= −2

1 2
𝐶22 = (−1)2+2 | |
3 4
= (−1)4 (1)
=1

𝐶11 𝐶12
Cofactor 𝑨 = [ ]
𝐶21 𝐶22
4 −3
=[ ]
−2 1

Get the adjoint of 𝑨.


adj 𝑨 = [Cofactor 𝑨]𝑇
4 −2
=[ ]
−3 1

Solve for the inverse of matrix 𝑨.

1
𝑨−1 = (det 𝑨) (adj 𝑨)
1 4 −2
= (−2) [ ]
−3 1
1 4 −2
= −2[ ]
−3 1
−2 1
=[ 3 −2 ]
1
2

(b) Row Operations Method.

Start with the augmented matrix [𝑨 | 𝑰].


1 2 1 0
[ ]
3 4 0 1

Transform the augmented matrix [𝑨 | 𝑰] into


[𝑰 | 𝑨−1 ] using row operations.
1 2 1 0
[ ]
3 4 0 1
𝑅2 ∗ = 𝑅2 − 3𝑅1
1 2 1 0
[ ]
0 −2 −3 1
1
𝑅2 ∗ = − 2 𝑅2

1 2 13 0
[ − 2]
1
0 1 2

𝑅1 ∗ = 𝑅1 − 2𝑅2
1 0 −2 1
[ 3
− 2]
1
0 1 2

We already have the augmented matrix [𝑰 | 𝑨−1 ].


Therefore,
−2 1
𝑨−1 = [ 3 − ].
1
2 2

2 1 2
2. 𝑨 = [3 4 7]
8 1 −5

(a) Adjoint Method

Get the determinant of 𝑨 first.

2 1 2
det 𝑨 = |3 4 7|
8 1 −5
2 1 2 2 1
= |3 4 7 3 4|
8 1 −5 8 1
(Use basketweave method)
= [2(4)(−5) + 1(7)(8) + 2(3)(1)] −
[2(4)(8) + 2(7)(1) + 1(3)(−5)]
= (−40 + 56 + 6) − (64 + 14 − 15)
= 22 − 63
= −41

Get the cofactor matrix.


2 1 2
𝐶11 = (−1)1+1 | 3 4 7 |
8 1 −5
4 7
= (−1)2 | |
1 −5
= (4(−5) − 7(1))
= −20 − 7
= −27

2 1 2
(−1)1+2
𝐶12 = | 3 4 7 |
8 1 −5
3 7
= (−1)3 | |
8 −5
= −(3(−5) − 7(8))
= −(−15 − 56)
= 71

2 1 2
𝐶13 = (−1)1+3 | 3 4 7|
8 1 −5
3 4
= (−1)4 | |
8 1
= (3(1) − 4(8))
= 3 − 32
= −29
2 1 2
𝐶21 = (−1)2+1 | 3 4 7 |
8 1 −5
1 2
= (−1)3 | |
1 −5
= −(1(−5) − 2(1))
= −(−5 − 2)
=7

2 1 2
(−1) 2+2
𝐶22 = | 3 4 7 |
8 1 −5
2 2
= (−1)4 | |
8 −5
= (2(−5) − 2(8))
= −10 − 16
= −26

2 1 2
𝐶23 = (−1)2+3 | 3 4 7|
8 1 −5
2 1
= (−1)5 | |
8 1
= −(2(1) − 1(8))
= −(2 − 8)
=6

2 1 2
𝐶31 = (−1)3+1 | 3 4 7 |
8 1 −5
1 2
= (−1)4 | |
4 7
= (1(7) − 2(4))
= (7 − 8)
= −1

2 1 2
𝐶32 = (−1)3+2 | 3 4 7 |
8 1 −5
2 2
= (−1)5 | |
3 7
= −(2(7) − 2(3))
= −(14 − 6)
= −8

2 1 2
𝐶33 = (−1)3+3 | 3 4 7|
8 1 −5
2 1
= (−1)6 | |
3 4
= (2(4) − 1(3))
= (8 − 3)
=5

𝐶11 𝐶12 𝐶13


Cofactor 𝑨 = [𝐶21 𝐶22 𝐶23 ]
𝐶31 𝐶32 𝐶33
−27 71 −29
=[ 7 −26 6 ]
−1 −8 5

Get the adjoint of 𝑨.

adj 𝑨 = [Cofactor 𝑨]𝑇


−27 7 −1
= [ 71 −26 −8]
−29 6 5

Solve for the inverse of matrix 𝑨.

1
𝑨−1 = (det 𝑨) (adj 𝑨)
−27 7 −1
1
= (−41) [ 71 −26 −8]
−29 6 5
−27 7 −1
1
= − 41 [ 71 −26 −8]
−29 6 5
27 7 1
− 41
41 41
71 26 8
= − 41 41 41
29 6 5
[ − 41 − 41 ]
41

(b) Row Operations Method.

Start with the augmented matrix [𝑨 | 𝑰].


2 1 2 1 0 0
[3 4 7 0 1 0 ]
8 1 −5 0 0 1

Transform the augmented matrix [𝑨 | 𝑰] into


[𝑰 | 𝑨−1 ] using row operations.
2 1 2 1 0 0
[3 4 7 0 1 0 ]
8 1 −5 0 0 1
1
𝑅1 ∗ = 2 𝑅1
1 1
1 2 1 2 0 0
[3 4 7 0 1 0 ]
8 1 −5 0 0 1

𝑅2 ∗ = 𝑅2 − 3𝑅1
1 1
1 1 0 0
2 2
[0 5
4 − 1
3
0]
2 2
8 1 −5 0 0 1

𝑅3 ∗ = 𝑅3 − 8𝑅1
1 1
1 1 0 0
2 2
[0 5
4 −2 1
3
0]
2
0 −3 −13 −4 0 1
2
𝑅2 ∗ = 𝑅
5 2
1 1
1 1 0 0
2 2
[0 1
8
−5
3 2
0]
5 5
0 −3 −13 −4 0 1
1
𝑅1 ∗ = 𝑅1 − 𝑅2
2
1 4 1
1 0 −5 0
5 5
[0 1
8

3 2
0]
5 5 5
0 −3 −13 −4 0 1

𝑅3 ∗ = 𝑅3 + 3𝑅2
1 4 1
1 0 −5 0
5 5
8 3 2
0 1 −5 0
5 5
41 29 6
[0 0 − 5
− 5 5
1]

5
𝑅3 ∗ = − 𝑅
41 3
4 1
1 0
1 −5 0
5
5 3 2
0 1
8 −5 0
5
5 29 6 5
[0 0 1 − 41 − 41]
41

1
𝑅1 ∗ = 𝑅1 − 𝑅3
5
27 7 1
− 41
1 0 0 41 41
8 3 2
0 1 −5 0
5 5
0 0 1 29

6
− ]
5
[ 41 41 41

8
𝑅1 ∗ = 𝑅2 − 𝑅3
5
27 7 1
− 41
1 0 0 41 41
71 26 8
0 1 0 − 41 41 41
0 0 1 29 6 5
[ − 41 − 41]
41

We already have the augmented matrix [𝑰 | 𝑨−1 ].


Therefore,
27 7 1
− 41
41 41
−1 71 26 8
𝑨 = − 41 41 41
29 6 5
[ − − ]
41 41 41

Using Inverse of a Matrix to Solve Systems of Equations

A system of 𝑚 linear equations in 𝑛 variables

𝑎11 𝑥1 + 𝑎12 𝑥2 + ⋯ + 𝑎1𝑛 𝑥𝑛 = 𝑏1


𝑎21 𝑥1 + 𝑎22 𝑥2 + ⋯ + 𝑎2𝑛 𝑥𝑛 = 𝑏2
⋮ ⋮
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + ⋯ + 𝑎𝑚𝑛 𝑥𝑛 = 𝑏𝑚

can be written as a matrix equation 𝑨𝑿 = 𝑩 where

𝑎11 𝑎12 ⋯ 𝑎1𝑛 𝑥1 𝑏1


𝑎21 𝑎22 ⋯ 𝑎2𝑛 𝑥2 𝑏2
⋮ ], 𝑿=[ ⋮ ],
𝑨=[ ⋮ 𝑩=[ ]

𝑎𝑚1 𝑎𝑚2 ⋯ 𝑎𝑚𝑛 𝑥𝑛 𝑏𝑚

For a nonsingular 𝑛 𝑥 𝑛 matrix 𝑨, the equation 𝑨𝑿 = 𝑩 can be


multiplied with 𝑨−1 to solve for the unknown matrix 𝑩. This is illustrated
below.

𝑨−1 𝑨𝑿 = 𝑨−1 𝑩
(𝑨−1 𝑨)𝑿 = 𝑨−1 𝑩
𝑰𝑿 = 𝑨−1 𝑩 where 𝑰 is the identity matrix
𝑿 = 𝑨−1 𝑩
It is useful to understand some properties of the Identity Matrix, 𝑰.

1. An identity matrix is always a square matrix.


2. Multiplying any matrix by the identity matrix gives the matrix itself.

𝑨𝑰 = 𝑰𝑨 = 𝑨
3. Multiplying a matrix by its inverse results in an identity matrix.
𝑨𝑨−1 = 𝑨−1 𝑨 = 𝑰

Example Solve the following systems of equations using the concept of


9.2. inverse of a matrix.

1. 4𝑥 + 3𝑦 = 7
2𝑥 − 5𝑦 = 1

The matrix equation 𝑨𝑿 = 𝑩 is given below.

4 3 𝑥 7
[ ][ ] = [ ]
2 −5 𝑦 1
4 3 𝑥 7
where 𝑨 = [ ] , 𝑿 = [𝑦] , and 𝑩 = [ ].
2 −5 1

To compute for the values of 𝑥 and 𝑦, we have 𝑿 =


𝑨−1 𝑩.

Solve for 𝑨−1 . Using adjoint method,

4 3
det 𝑨 = | |
2 −5
= 4(−5) − 3(2)
= −20 − 6
= −26
For the cofactor matrix,
4 3
𝐶11 = (−1)1+1 | |
2 −5
= (−1)2 (−5)
= −5
4 3
𝐶12 = (−1)1+2 | |
2 −5
= (−1)3 (2)
= −2

4 3
𝐶21 = (−1)2+1 | |
2 −5
= (−1)3 (3)
= −3

4 3
𝐶22 = (−1)2+2 | |
2 −5
= (−1)4 (4)
=4

−5 −2
Cofactor 𝑨 = [ ]
−3 4

−5 −3
adj 𝑨 = [ ]
−2 4
1 −5 −3
𝑨−1 = −26 [ ]
−2 4
5 3
26 26
= [1 2]
13
− 13

Solve for 𝑿.
𝑿 = 𝑨−1 𝑩
5 3
26 7
= [26
1 2 ] [1]

13 13
5 3
(7) + (1)
= [26
1
26
2 ]
(7) − (1)
13 13
19

= [13
5]
13

19
𝑥
𝑿 = [𝑦] = [13
5]
13

19 5
Therefore, 𝑥 = 13 and 𝑦 = 13.

2. 𝑎 + 𝑐 = −4
𝑎+𝑏+𝑐 =0
5𝑎 − 𝑏 = 6

The matrix equation 𝑨𝑿 = 𝑩 is given below.

1 0 1 𝑎 −4
[1 1 1] [𝑏 ] = [ 0 ]
5 −1 0 𝑐 6
1 0 1 𝑎 −4
where 𝑨 = [1 1 1] , 𝑿 = [𝑏 ] , and 𝑩 = [ 0 ].
5 −1 0 𝑐 6

To compute for the values of 𝑎, 𝑏 and 𝑐, we have 𝑿 =


𝑨−1 𝑩.
Solve for 𝑨−1 . Using row operations method,

The augmented matrix [𝑨 | 𝑰] is


1 0 1 1 0 0
[1 1 1 0 1 0 ]
5 −1 0 0 0 1

Transform the augmented matrix [𝑨 | 𝑰] into


[𝑰 | 𝑨−1 ].
1 0 1 1 0 0
[1 1 1 0 1 0 ]
5 −1 0 0 0 1
𝑅2 ∗ = 𝑅2 − 𝑅1
1 0 1 1 0 0
[0 1 0 −1 1 0]
5 −1 0 0 0 1
𝑅3 ∗ = 𝑅3 − 5𝑅1
1 0 1 1 0 0
[0 1 0 −1 1 0]
0 −1 −5 −5 0 1

𝑅3 ∗ = 𝑅3 + 𝑅2
1 0 1 1 0 0
[0 1 0 −1 1 0]
0 0 −5 −6 1 1
1
𝑅3 ∗ = − 𝑅3
5
1 0 1 1 0 0
[0 1 0 −1 1 0]
6 1 1
0 0 1 −5 −5
5

𝑅1 ∗ = 𝑅1 − 𝑅3
1 1 1
1 0 0 −5 5 5
[0 1 0 −1 1 0]
6 1 1
0 0 1 −5 −5
5
1 1 1
−5 5 5
−1
𝑨 = [−1 1 0]
6 1 1
5
−5 −5

Solve for 𝑿.
𝑿 = 𝑨−1 𝑩
1 1 1
−5 −4
5 5
= [−1 1 0] [ 0]
6 1 1
−5 − 6
5 5
1 1 1
− 5 (−4) + 5 (0) + 5 (6)
= [ −1(−4) + 1(0) + 0(6) ]
6 1 1
(−4) − (0) − (6)
5 5 5
2
= [ 4]
−6
𝑎 2
𝑿 = [𝑏 ] = [ 4 ]
𝑐 −6

Therefore, 𝑎 = 2 , 𝑏 = 4 and 𝑐 = −6.

Example Solve for [𝑨]. Given [𝑨] [


3 3
] + [𝑨] = [
2 3
].
9.3. 4 5 5 1

[𝑨] [3 3 2 3
] + [𝑨] = [ ]
4 5 5 1

Rewrite the given. Use Property No. 2 of Identity matrix.

[𝑨] [3 3 1 0 2 3
] + [𝑨] [ ]=[ ]
4 5 0 1 5 1
[𝑨] ([3 3 1 0 2 3
]+[ ]) = [ ]
4 5 0 1 5 1
[𝑨] [4 3 2 3
]=[ ]
4 6 5 1

Use Property No. 3 of Identity matrix.


3 4 3 −1 2 3 4 3 −1
[𝑨] [4 ][ ] =[ ][ ]
4 6 4 6 5 1 4 6
3 4 3 −1
[𝑨] [1 0 2
]=[ ][ ]
0 1 5 1 4 6
3 −1
[𝑨] = [2 3] [4 ]
5 1 4 6

4 3 −1
Evaluate the inverse matrix [ ] first.
4 6
4 3 1 0
[ ]
4 6 0 1
1
𝑅1 ∗ = 4 𝑅1
3 1
1 0
[ 4 ] 4
4 6 0 1

𝑅2 ∗ = 𝑅2 − 4𝑅1
3 1
1 0
[ 4 ] 4
0 3 −1 1
1
𝑅2 ∗ = 3 𝑅2
1
3
1 4 0
4
[ 1 1]
0 1 −3 3

3
𝑅1 ∗ = 𝑅1 − 4 𝑅2
1 1
1 0 −4
2
[ 1]
0 1 −1
3 3
1 1
4 3 −1 −4
Therefore, [ ] = [ 21 1]
4 6 −3 3

Solving for [𝑨],


3 −1
[𝑨] = [2 3] [4 ]
5 1 4 6
1 1
−4
[𝑨] = [2 3] [ 21 1]
5 1 −
3 3
1 1 1 1
2 (2) + 3 (− 3) 2 (− 4) + 3 (3)
[𝑨] = [ 1 1 1 1
]
5 (2) + 1 (− 3) 5 (− 4) + 1 (3)
1
0 2
[𝑨] = [13 11]
− 12
6

You might also like