MATRICES

Introduction
Types of Matrices
Operation
 INTRODUCTION
Definition 2.1
A matrix is a rectangular array of elements or entries aij
involving m rows and n columns
Columns, n

 a11 a12 a13  a1 j  Rows, m

a a22 a23  
a2 j 
 21
A   a31 a32 a33   
a3 j   aij mn
 
     
 ai1 ai 2 ai 3  aij 

 INTRODUCTION
Definition 2.2
i.2 matrices A  aij  M mn and B  bij   M r s are said to be
equal iff m = r and n = s then A = B.
ii.If aij for i = j, then the entries a11,a22,a33,… are called the
diagonal of matrix A
Example 2
Find the values for the variables so that the matrices in
each exercise are equal.

x y  3 12 5
2 z   
 8   6 8
 TYPES OF MATRICES
Square Matrix
Matrix with order n x n

1 2 3
1 2
A  B  4 5 6
3 4  22 7 8 9 33
 TYPES OF MATRICES
Diagonal Matrix
Matrix with order n x n with aii ≠ 0 and aij = 0 for i ≠ j

1 0 0
A  0 1 0
0 0 2
 TYPES OF MATRICES
Scalar Matrix (n x n)
A diagonal matrix in which the diagonal elements are equal,
aii = k and aij = 0 for i ≠ j where k is a scalar

2 0 0 1 0 0
   
A   0 2 0   2 0 1 0  , k  2
0 0 2 0 0 1
 TYPES OF MATRICES
Identity Matrix (n x n )
A diagonal matrix in which the diagonal elements are ‘1’,
aii = 1 and aij ≠ 0 for i ≠ j

1 0 0
  1 0
A  0 1 0  B 
 0 1 
0 0 1
 TYPES OF MATRICES
Zero Matrix m x n
A matrix which contains only zero elements, aij = 0

0 0 0 
0 0 
A  0 0 0 B 
 0 0 
0 0 0
 TYPES OF MATRICES
Negative Matrix
A negative matrix of A =[aij] denoted by –A where -A =[-aij]

1 0 2   1 0  2
  
A   0 0  3   A   0 0 3 
 4 6 1   4  6  1 
 TYPES OF MATRICES

Upper Triangular Matrix n x n

If every elements below the main diagonal is zero or aij = 0,
i>j

1 2 2
A  0 1 3
0 0 1 
DIAGONAL
 TYPES OF MATRICES
Lower Triangular Matrix n x n
If every elements above the main diagonal is zero or aij = 0,
i<j

 1 0 0
 
A    2 1 0
 3 4 1
DIAGONAL
 TYPES OF MATRICES

Transpose of Matrix m x n
If A =[aij] is an m x n matrix, then the transpose of A, AT
=[aij]T is the n x m matrix defined by [aij] = [aji]T

 1 1 2 1  2 3 
 
A   2 1 5  T 
A  1 1 4  
 3 4 1  2 5 1 
 TYPES OF MATRICES
Properties Transposition Operation
Let A and B matrices and k, k  R . Then,

i) A 
T T
A
ii ) kA  kAT
T

iii )  A  B   AT  BT
T
 TYPES OF MATRICES
Example 3:

1 2 3  1
 
If A    and B   3, find
 4 5 2 
 2 

i)  AT

ii )  2 B 
T

iii )  AB 
T
 TYPES OF MATRICES
Answer:

1 4 
 A  2  5
T
i)
3 2 
ii )  2 B    2 6
T
 4
iii )  AB   1 23
T
 TYPES OF MATRICES
Symmetric Matrix n x n
An If AT = A, where the elements obey the rule aij = aji

5 1 4 5 1 4
A  1 2  2  AT  1 2  2
4  2 3  4  2 3 
 TYPES OF MATRICES
Skew Symmetric Matrix n x n
If AT = - A, where the elements obey the rule aij = - aji, so
that the main diagonal must contain zeroes.

0 1  4
A   1 0 7 
 4  7 0 
 TYPES OF MATRICES
Skew Symmetric Matrix
0 1  4
A   1 0 7 
 4  7 0 
 0 1 4 
AT   1 0  7
 4 7 0 
0 1  4
   1 0 7    A
 4  7 0 
 TYPES OF MATRICES
Row Echelon Form (REF) m x n
Matrix A is said to be in REF if it satisfies the following
properties:
• Any rows consisting entirely zeroes occur at the bottom
of the matrix.
• For each row that doesn’t consist entirely of zeroes, the
1st nonzero is 1.
• For each non zero row, number 1 appear to the right
of the leading 1 of the previous row.
 TYPES OF MATRICES
LEADING 1

1 1  4

A  0 1 7  
0 0 0  ZEROS ROW AT THE BOTTOM

1 2 4

B  0 1 3   LEADING 1

0 0 1 
 TYPES OF MATRICES
Reduced Row Echelon Form (RREF) m x n
Matrix A is said to be in RREF if it satisfies the following
properties:
• Rows consisting entirely zeroes occur at the bottom of
the matrix.
• For each row that doesn’t consist entirely of zeroes, the
1st nonzero is 1.
• For each non zero row, number 1 appear to the right
of the leading 1 of the previous row.
• If a column contains a leading 1, then all other entries
in the column are zero
TYPES OF MATRICES
LEADING 1

1 0  4

A  0 1 7  
0 0 0  ZEROS ROW AT THE
BOTTOM

1 0 0

B  0 1 0  LEADING 1

0 0 1
Definition 2.15
   
Let A  aij and B  bij are matrices of order mxn.
 
Matrices C=A+B is defined by C  cij which is cij  aij  bij
,1  i  m and 1  j  n. Two matrices A and B will be said
conformable for addition only if they are both of the same
order.
Definition 2.16
   
Let A  aij and B  bij are matrices of order mxn.
 
Matrices C=A-B is defined by C  cij which is cij  aij  bij
,1  i  m and 1  j  n. Two matrices A and B will be said
conformable for subtraction only if they are both of the same
order.
Properties of Addition and Subtraction
~
If A, B, C , 0  M mn , then
a) A B  B  A
b) A  B  C    A  B   C
~
c) A0  A
~
d) A   A  0
Definition 2.17
 
Let A  aij is an mxn matrix,  R, then the scalar
 
multiplication is denoted A where A   aij
Properties of Scalar Multiplication
~
If A, B, C , 0  M mn , and  ,   R, then
a )   A  B   A  B
b)    A  A  A
c)  A   A
d ) IA  A
~
d) 0A  0
Definition 2.18
Suppose A is an mxn matrix and B is a pxq matrix. For he
product AB to exist, it must be that n=p, that is the number of
columns in A must be the same as the number of rows in B.
Properties of Matrix Multiplication
~
If A, B and C are matrices, I, identity matrix and 0 , zero
matrix, then

a) AB  C   AB  AC (distributive law)

b) B  C A  BA  CA (distributive law)
c) ABC    AB C (associative law)
d)   AB   AB
Example 4:

4 1  5 9
Given A    B , find:
 3 2 8 7
i) A B
ii ) 2 A  3B
iii ) AB
iv)  AB  T
  9 10
i) A  B   
11 9 
  7  25
ii ) 2 A  3B   
 18  17 
28 43
iii ) AB   
 31 41
28 31
iv)  AB 
T
 
 43 41