Systems of Linear Equations Matrices: Section 5 Inverse of A Square Matrix

Chapter 4
Systems of
Linear Equations;
Matrices
Section 5
Inverse of a
Square Matrix
Copyrightfor
Barnett, Finite Mathematics © 2015, 2011, and
Business, 2008 Pearson
Economics, Education, Inc.
Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 1
Definition Identity Matrix
The identity element for multiplication for the set of all
square matrices of order n is the square matrix of order n,
denoted by I, with 1’s along the principal diagonal (upper
left corner to lower right corner) and 0’s elsewhere.
1 0 
0 1  is the identity matrix for all square matrices of order 2.
 
1 0 0 
0 1 0  is the identity matrix for all square matrices of order 3.
 
0 0 1 
Barnett, Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Calculator Command for
Generating the Identity Matrix
Most graphing calculators have a built-in command for
generating the identity matrix of a given order.
Example 1 Identity Matrix
Multiplication (A) & (B)
1 0 0   3 2 5   3 2 5 
(A) 0 1 0   0 2 3   0 2 3
0 0 1   1 4 2   1 4 2 
 3 2 5  1 0 0   3 2 5 
(B)  0 2 3 0 1 0    0 2 3
 1 4 2  0 0 1   1 4 2 
Multiplication of a square matrix by the identity matrix is

commutative, that is A×I = I×A.
Example 1 Identity Matrix
Multiplication (C) & (D)
1 0   2 1 3   2 1 3 
(C)      
 0 1  2 0 4   2 0 4 
1 0 0 
 2 1 3     2 1 3 
(D)    0 1 0   
 2 0 4   2 0 4 
 0 0 1 

When matrix A is an m×n matrix that is not square, it is
possible to multiply A on the left and the right by an
identity matrix, but not with the same identity matrix.
When multiplication is possible, multiplication of a matrix
by the identity matrix is commutative, that is A×I = I×A.
We restrict our attention in this section to square matrices.
Definition Inverse of
a Square Matrix
Let M be a square matrix of order n and I be the identity

matrix of order n.
If there exists a matrix M–1 (read “M inverse”) such that
M–1M = M M–1 = I
then M–1 is called the multiplicative inverse of M or, more
simply, the inverse of M.
If no such matrix exists, then M is said to be a singular
matrix.
Example 2 Finding the Inverse of
a Matrix
Find the inverse, if it exists, of the matrix
1 1 1 
M   0 2 1
 2 3 0 
Solution The inverse matrix M 1 (if it exists)

has the property that MM 1  I , that is
1 1 1   a d g  1 0 0  a d g
 0 2 1  b e h    0 1 0  for M 1   b e h 
 
 2 3 0   c f i   0 0 1   c f i 
a Matrix continued
1 1 1   a d g  1 0 0 
 0 2 1  b e h   0 1 0  gives the systems
 
 2 3 0   c f i  0 0 1 
 a  b  c  1  d  e  f  0
 
 2b  c  0  2e  f  1
2a  3b  0  2d  3e  0
 
and
 g  h  i  0

 2h  i  0
2 g  3h  1

a Matrix continued
Write augmented matrices for each of the three systems:
First Second Third
 1 1 1 1  1 1 1 0   1 1 1 0 
     
 0 2 1 0   0 2 1 1   0 2 1 1
 2 3 0 0   2 3 0 0   2 3 0 0 
Each matrix to the left of the vertical bar is the same so the
same row operations can be used on each augmented matrix
to transform it into a reduced form.
a Matrix continued
Combine all three matrices into a single augmented matrix:

 1 1 1 1 0 0 
 
 0 2 1 0 1 0  =  M I 
 2 3 0 0 0 1
a Matrix continued
We perform row operations on the augmented matrix:
 1 1 1 1 0 0 
 
 0 2 1 0 1 0  =  M I 
 2 3 0 0 0 1
until we obtain a row–equivalent matrix of the form

1 0 0 a d g
 
0 1 0 b e h  =  I B 
0 0 1 c f i 
If this can be done, the matrix B to the right of the vertical bar
will be M–1.
a Matrix continued
 1 1 1 1 0 0 
 
 0 2 1 0 1 0  ( 2) R1  R3  R3
 2 3 0 0 0 1
 1 1 1 1 0 0 
 
0 2 1 0 1 0  1
2 R2  R2
0 5 2 2 0 1
 1 1 1 1 0 0
  R2  R1  R1
0 1  12 0 12 0 
(5) R2  R3  R3
0 5 2 2 0 1
a Matrix continued
1 0 1
2 1 1
2 0
 
0 1  12 0 1
2 0  2 R3  R3
0 0 1
2  5
1
 2 2
1 0 1
1 1
0

2 2
 ( 12 ) R3  R1  R1
0 1  12 0 1
0 
2
( 12 ) R3  R2  R2
0 0 1 4 5 2 

 1 0 0 3 3 1
 
0 1 0 2 2 1 =  I B 
0 0 1 4 5 2 
a Matrix continued
 1 0 0 3 3 1
 
0 1 0 2 2 1 =  I B 
0 0 1 4 5 2 
gives
a  3 d  3 g  1
b  2 e  2 h  1
c  4 f  5 i  2
It follows that
 3 3 1
M 1  B   2 2 1
 4 5 2 
a Matrix continued
We check this result using the graphing calculator.
 3 3 1  1 1 1
M 1M   2 2 1  0 2 1
 4 5 2   2 3 0 
Thus, M–1M = I.
Theorem 1 Inverse of a Square
Matrix M
If [M | I ] is transformed by row operations into [I | B ], then

the resulting matrix B is M–1.
However, if we obtain all 0’s in one or more rows to the left

of the vertical line then M–1 does not exist.
Example 3 Finding a Matrix
Inverse
1  4 1
Find M , given M    .
 6 2 
 4 1 1 0 
Solution  
1
R1  R1
 6 2 0 1 
4
 1  14 14 0 
  6 R1  R2  R2
 6 2 0 1
1  14 14 0 
  2 R2  R2
0 2 2 1
1 3
1  14 14 0 
 
1
4 R2  R1  R1
 0 1 3 2 
1 0 1 12  1  1 2
1
  Therefore M   
 0 1 3 2  3 2 
Example 4 Finding a Matrix
Inverse
1  2 4 
Find M , given M    .
 3 6 
 2 4 1 0 
Solution  
1
R1  R1
 3 6 0 1 
2
 1 2 12 0 
  3R1  R2  R2
 3 6 0 1
 1 2 1
2 0
 
0 0
3
2 1
We have all 0’s in the second row to the left of the vertical
bar; therefore, the inverse does not exist.
Singular Matrices
Square matrices that do not have inverses are called singular
matrices.
Graphing calculators recognize singular matrices and
generally respond with some type of error message when
trying to find the inverse of a singular matrix.
Singular Matrices
Square matrices that do not have inverses are called singular
matrices.
Computer spreadsheets recognize singular matrices and
generally respond with some type of error message when
trying to find the inverse of a singular matrix.
Matrices and Cryptography
Matrix inverses provide a simple and effective procedure for
encoding and decoding messages. Each letter of the alphabet
is assigned to the numbers 1–26, with 0 assigned to a blank
for spacing between words.
(More sophisticated coding can be done.)
Blank-0 A 1 B2 C 3 D4 E 5 F 6
G7 H 8 I 9 J  11 K  11 L  12 M  13
N  14 O  15 P  16 Q  17 R  18 S  19 T  20
U  21 V  22 W  23 X  24 Y  25 Z  26
The message “SECRET CODE” corresponds to the sequence

19 5 3 18 5 20 0 3 15 4 5
Any matrix whose elements are positive integers and whose
inverse exists can be used as an encoding matrix.
 4 3
In this example, the 2  2 matrix A    will be used as
 1 1
an encoding matrix.
Divide the numbers in the sequence
19 5 3 18 5 20 0 3 15 4 5
into groups of 2 and use these groups as the columns of a
matrix B with 2 rows proceeding down the columns, not
across the rows.
19 3 5 0 15 5
B 
 5 18 20 3 4 0 
Notice that a blank was added for the space between words
and at the end to make the columns come out even.
Multiply this matrix on the left by A.

4 3 19 3 5 0 15 5
AB  
1 1  5 18 20 3 4 0 
 91 66 80 9 72 20 

 24 21 25 3 19 5
The coded message is

91 24 66 21 80 25 9 3 72 19 20 5
The message can be decoded by putting it back into matrix

form and multiplying on the left by the decoding matrix A–1.
Example 5 Cryptography
The message
46 84 85 28 47 46 4 5 10 30 48 72 29 57 38 38 57 95
was encoded with the matrix A. Decode this message.
1 1 1 
A   2 1 2 
 2 3 1 
Solution Since the encoding matrix A is 3×3, we begin by
entering the coded message into the columns of a matrix C
with three rows.
 46 28 4 30 29 38
C   84 47 5 48 57 57 
 85 46 10 72 38 95
continued
If B is the matrix containing the uncoded message, then B and C
are related by C = AB.
To recover B, we find A–1 and multiply both sides of the
equation C = AB by A–1 to obtain B = A–1C.
 5 2 1   46 28 4 30 29 38
A1C   2 1 0   84 47 5 48 57 57 
 4 1 1  85 46 10 72 38 95
 23 0 0 18 7 19 
  8 9 3 12 1 19 
15 19 1 0 21 0 
continued
 23 0 0 18 7 19 
B   8 9 3 12 1 19 
15 19 1 0 21 0 
The decoded message is

23 8 15 0 9 19 0 3 1 18 12 0 7 1 21 19 19 0
W H O I S C A R L G AU S S

Systems of Linear Equations Matrices: Section 5 Inverse of A Square Matrix

Uploaded by

Document Information

Original Title

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

Systems of Linear Equations Matrices: Section 5 Inverse of A Square Matrix

Uploaded by

Copyright:

Available Formats

Chapter 4

Multiplication of a square matrix by the identity matrix is

Let M be a square matrix of order n and I be the identity

Solution The inverse matrix M 1 (if it exists)

Combine all three matrices into a single augmented matrix:

until we obtain a row–equivalent matrix of the form

If [M | I ] is transformed by row operations into [I | B ], then

However, if we obtain all 0’s in one or more rows to the left

The message “SECRET CODE” corresponds to the sequence

Multiply this matrix on the left by A.

The coded message is

The message can be decoded by putting it back into matrix

The decoded message is

You might also like