Matrices

©2007 Pearson Education Asia

 Matrices
• A matrix consisting of m horizontal rows and n
vertical columns is called an m×n matrix or a
matrix of size m×n.
 a 11 a 12 ... a 1n 
 
a a 12 ... a2n
 21 
 . . ... . 
 
 . . ... . 
 . . ... . 
 
 a m 1 am 2 ... a mn 
• For the entry aij, we call i the row subscript and j
the column subscript.

©2007 Pearson Education Asia

 Example 1 – Size of a Matrix

a. The matrix 1 2 0  has size 1 3 .

1 − 6
 
b. The matrix 
5 1

has size 3  2 .
 9 4 

c. The matrix 7  has size 1 1 .

1 3 7 −2 4
d. The matrix   has size3  5 .
9 11 5 6 8
 
 6 −2 −1 1 1 

©2007 Pearson Education Asia

Equality of Matrices
• Matrices A = [aij ] and B = [bij] are equal if they
have the same size and aij = bij for each i and j.

Transpose of a Matrix
• A transpose matrix is denoted by AT.
Example 3 – Constructing Matrices
1 2 3
If A =  
, find A T .
4 5 6

1 4
Solution: A
T 
= 2 5

 
 3 6 

Observe that (A ) T T
= A .
©2007 Pearson Education Asia
 Matrix Addition and Scalar Multiplication
Matrix Addition
• Sum A + B is the m × n matrix obtained by adding
corresponding entries of A and B.

Example 1 – Matrix Addition

a.  1 4  7 − 2 1 + 7 2 − 2  8 0
       
2 5 + −6 4 = 3−6 4+4 = −3 8
       
 3 6   3 0   5 + 3 6 + 0   8 6 

1 2  2 
b.  +   is impossible as matrices are not of the same
3 4  1
size.
©2007 Pearson Education Asia
Example 3 – Demand Vectors for an Economy

Demand for the consumers is

D1 = 3 2 5  D 2 = 0 17 1 D 3 = 4 6 12 
For the industries is
DC = 0 1 4 D E = 20 0 8 D S = 30 5 0
What is the total demand for consumers and the
industries?
Solution:
D1 + D 2 + D 3 = 3 2 5  + 0 17 1 + 4 6 12  = 7 25 18 

DC + D E + D S = 0 1 4  + 20 0 8  + 30 5 0  = 50 6 12 

Total: 7 25 18  + 50 6 12  = 57 31 30 

©2007 Pearson Education Asia

Scalar Multiplication
• Properties of Scalar Multiplication:

Subtraction of Matrices
• Property of subtraction is − A = (− 1) A

©2007 Pearson Education Asia

Example 5 – Matrix Subtraction

a. 2 6  6 − 2  2 − 6 6 + 2 − 4 8 
       
−4 1 − 4 1 = −4−4 1− 1 = − 8 0
       
 3 2   0 3   3 + 0 2 − 3   3 − 1

6 2  6 − 6  0 8 
b. A
T
− 2B =  −  =  
0 − 1  2 4  − 2 − 5

©2007 Pearson Education Asia

 Matrix Multiplication
• AB is the m× p matrix C whose entry cij is given by
n

c ij = a ik
b kj = a i 1b1 j +a i 2 b 2 j + ... + a in b nj
k =1

Example 1 – Sizes of Matrices and Their Product

A = 3 × 5 matrix
B = 5 × 3 matrix
AB = 3 × 3 matrix but BA = 5 × 5 matrix.

C = 3 × 5 matrix
D = 7 × 3 matrix
CD = undefined but DC = 7 × 5 matrix.

©2007 Pearson Education Asia

Example 3 – Matrix Products

4
 
a. 1 2 3  5 = 32 
 
 6 

1  1 6
   
b. 2 1 6 = 2 12
   
 3   3 18 

 1 3 0  1 0 2   16 −3 11 
    
−2 2 1 −2 −1 3 = 10 −1 0
c.     
 1 0 − 4   2 1 − 2   − 7 −4 10 

d.  a 11 a 12   b11 b12   a 11 b11 + a 12 b 21 a 11 b12 + a 12 b 22 

   =  
 a 21 a 22   b 21 b 22   a 21 b11 + a 22 b 21 a 21 b12 + a 22 b 22 

©2007 Pearson Education Asia

Example 5 – Cost Vector

Given the price and the quantities, calculate the total

cost.  7  units of A
P = 2 4  
3 Q = 5 units of B
 
11  units of C
Solution:
The cost vector is
7
 
PQ = 2 3 4  5 = 73 
 
11 

©2007 Pearson Education Asia

Example 7 – Associative Property
1 0
 1 − 2 3 0 − 1  
If A =   B =   C = 0

2

− 3 − 4 1 1 2 
 1 1 

compute ABC in two ways.

Solution 1: Solution 2: 1 0
 1 0   1 − 2  3 1  
− 2   3 
0 
 1
A (BC ) = 
0 1  ( AB )C = 
 −3     0 2
   0 2 
− 4 1 
− 3 − 4  1 1 2  
  1 2 
 1
 1 1   1 

 1 − 2  2 − 1  − 4 − 9 1 0
=    =    1 −2 − 5  − 4 − 9
− 3 − 4  3 4   6 19  =   0 2 =  
− 5 4 11   
 6 19 
 1 
1
Note that A(BC) = (AB)C.

©2007 Pearson Education Asia

Example 9 – Raw Materials and Cost

Find QRC when  2500 

 
5 20 16 7 17 

1200

 
Q = 5 7 9 R = 7 18 12 9 21 C =  800 
   
 6 25 8 5 13   150 
 1500 
 
Solution:
 2500 
 
5 20 16 7 17  1200  75850 
 
   
RC = 7 18 12 9 21  800  = 81550
   
 
 6 25 8 5 13   150  
  71650 
 1500 
 

 75850 
 
QRC = Q (RC ) = 5 7 12  81550 = 1,809 ,900 
 
 71650 

©2007 Pearson Education Asia

Example 11 – Matrix Operations Involving I and O
3 2  52 − 51  1 0 0 0
If A =   B =  1 3 
I =   O =  
1 4  − 10 10  0 1 0 0

compute each of the following.

Solution:
1 0  3 2 − 2 − 2
a. I − A =  −  =  
0 1 1 4 −1 − 3

 3 2 1 0   3 2  2 0   3 6
b. 3 ( A − 2 I ) = 3    − 2   = 3  −   =  
 1  1
 4 0 1   4  0 2   3 6

3 2  0 0
c. AO =    =O
1 4  0 0

3 2   52 − 51   1 0
d. AB =   3 
=   =I
1 4   − 101 10  0 1

©2007 Pearson Education Asia

Example 13 – Matrix Form of a System Using Matrix Multiplication

2 x1 + 5 x 2 = 4
Write the system 
8 x1 + 3 x 2 = 7

in matrix form by using matrix multiplication.

Solution:
2 5   x1  4
If A =   X =   B =  
8 3 x2  7 

then the single matrix equation is

AX = B
2 5   x1  4 
   =  
8 3   x 2  7 
©2007 Pearson Education Asia
 Solving Systems by Reducing Matrices
Elementary Row Operations
1. Interchanging two rows of a matrix
2. Multiplying a row of a matrix by a nonzero number
3. Adding a multiple of one row of a matrix to a
different row of that matrix

©2007 Pearson Education Asia

Properties of a Reduced Matrix
• All zero-rows at the bottom.
• For each nonzero-row, leading entry is 1 and the
rest zeros.
• Leading entry in each row is to the right of the
leading entry in any row above it.

©2007 Pearson Education Asia

 Example 1 – Reduced Matrices

For each of the following matrices, determine whether

it is reduced or not reduced.
1 0 1 0 0 0 1
a.   b.   c.  
0 3 0 1 0 1 0

1 0 0 0 1 0 3
0 0 0    
d.   e. 0 0 0 f. 0 0 1 2
   
0 0 0
 0 1 0   0 0 0 0 
Solution:
a. Not reduced b. Reduced
c. Not reduced d. Reduced
e. Not reduced f. Reduced

©2007 Pearson Education Asia

Example 3 – Solving a System by Reduction

By using matrix reduction, solve the system

2 x + 3 y = −1

 2x + y = 5
 x+y =1

Solution:
Reducing the augmented coefficient matrix of the
system,
2 3 − 1 1 0 4 
   
2 1 5 
0 1 − 3
1 1 1  0
  0 0 

 x = 4
We have 
y = −3
©2007 Pearson Education Asia
Example 5 – Parametric Form of a Solution

Using matrix reduction, solve

2 x1 + 3 x 2 + 2 x 3 + 6 x 4 = 0

 x2 + 2x3 + x4 = 2
 3 x1 − 3 x 3 + 6 x 4 = 9


Solution:
Reducing the matrix of the system,
2 3 2 6 10  1 0 0 5
4
  
2

0 1 2 1 2 
0 1 0 0 0
3 0 −3 6 9  0 1 

1
 0 1 2

 x 1 = 4 − 52 x 4
We have 
x2 = 0
and x4 takes on any real value.
x = 1− 1 x
 3 2 4

©2007 Pearson Education Asia

Solving Systems by Reducing Matrices (continued)
Example 1 – Two-Parameter Family of Solutions

Using matrix reduction, solve

 x1 + 2 x 2 + 5 x 3 + 5 x 4 = −3

 x1 + x 2 + 3 x 3 + 4 x 4 = −1
x − x − x + 2x = 3
 1 2 3 4

Solution:
1 0 1 3 1 
The matrix is reduced to  0 1 2

1 − 2
0 0 0 0 0 


The solution is  x1 = 1 − r − 3s

x2 = −2 − 2r − s

x3 = r
x =s
 4

©2007 Pearson Education Asia

• The system  a 11 x 1 + a 12 x 2

+ ... + a 1n x n = c 1
.


 .

 .
 .


a m 1x1 + a m 2 x 2 + ... + a mn x n = c m

is called a homogeneous system if c1 = c2 = …

= cm = 0.
• The system is non-homogeneous if at least one
of the c’s is not equal to 0.
Concept for number of solutions:
1. k < n ➔ infinite solutions
2. k = n ➔ unique solution
©2007 Pearson Education Asia
Example 3 – Number of Solutions of a Homogeneous System

Determine whether the system has a unique solution

or infinitely many solutions.
 x + y − 2z = 0

2 x + 2 y − 4 z = 0
Solution:
2 equations (k), homogeneous system, 3 unknowns
(n).
The system has infinitely many solutions.

©2007 Pearson Education Asia

Inverses

• When matrix CA = I, C is an inverse of A and A is

invertible.
Example 1 – Inverse of a Matrix

1 2 − 2
Let A =   and C =  7 
. Determine whether C is
3 7 − 3 1 

an inverse of A.

 7 − 2 1 2 1 0
Solution: CA =    =   =I
− 3 1  3 7  0 1

Thus, matrix C is an inverse of A.

©2007 Pearson Education Asia

Method to Find the Inverse of a Matrix
• When matrix is reduced, A I  →  → R B  ,
- If R = I, A is invertible and A−1 = B.
- If R  I, A is not invertible.
Example 3 – Determining the Invertibility of a Matrix

1 0
Determine if A =   is invertible.
2 2
Solution: We have
1 0 1 0 1 0
A I  =  = I B 
0 1
  1
2 20 1 0 1 −1 2

−1
 1 0
Matrix A is invertible where A =  1
− 1 2

©2007 Pearson Education Asia

Example 5 – Using the Inverse to Solve a System

Solve the system by finding the inverse of the

coefficient matrix. x − 2 x =1  1 3

4 x1 − 2 x 2 + x 3 = 2
 x + 2 x − 10 x = − 1
 1 2 3

Solution:  1 0 −2 

We have A =  4 −2 1


 1 2 − 10 

− 9 2 2
For inverse, A −1  9
= 412 4
 2

 − 5 1 1 
 x1   − 9 2 2  1   − 7 
The solution is given by X = A−1B:    41
x = −
 2  2
4 9 
2 
2
 
=
 
− 17


 x 3   − 5 1 1   − 1  − 4 

©2007 Pearson Education Asia