MAT 102

BASIC CONCEPTS OF MATRICES

INTRODUCTION TO MATRICES
 Definition of Matrix
 Dimension of Matrix
 Classification of Matrix with Examples
 Diagonal and Trace of a Matrix
 Transpose of a Matrix
 Determinant
 Difference between Matrix and Determinant

Advantages:
Matrix algebra has at least two advantages:
• Reduces complicated systems of equations to simple expressions

• Adaptable to systematic method of mathematical treatment and well suited to computers

2
INTRODUCTION TO MATRICES
 A matrix is a rectangular arrangement of numbers, expressions or symbols in rows
and columns enclosed by ( ), [ ] or || ||.
 Rows run horizontally and columns run vertically.

 4 2 a b
1  1  
 3 0  c d
 The dimensions, or size, of a matrix are:
# of rows X # of columns.
Example:
1 2 4 
1 1 3  3
4  1 5
  0 0 3 2  1  1
3 3 3  

3x3 matrix 2x4 matrix 1x2 matrix

3
INTRODUCTION TO MATRICES
 A matrix is usually denoted by a capital letter and the elements within the matrix are
denoted by lower case letters
 e.g. matrix [A] with elements 𝑎𝑖𝑗

 a11 a12 a1 j a1n 

a a2 n 
 21 a22 a2 j
 
Amn  
 ai1 ai 2 aij ain 
 
 
 am1 am 2 amj amn 
𝑖 goes from 1 to 𝑚
𝑗 goes from 1 to 𝑛
4
TYPES OF MATRICES (1)
 Row Matrix: A matrix which has only one row is called a row matrix.
Example:

1 1 6 0 3 5 2

a11 a12 a13  a1n 

 Column Matrix: A matrix which has only one column is called a column matrix.
Example:
1   a11 
 4 1  a21 
   3  
2    
am1  5
FIND THE DIMENSION OF EACH MATRIX
1 
2 1 2 
  2. B =  
1. A = 0 5  3 
 8   
4  4 
Dimension: 3 × 2 Dimension: 4 × 1

 0 5 3 1
3. C =  
 2 0 9 6 
Dimension: 2 × 4
6
TYPES OF MATRICES (2)
 Rectangular Matrix: A matrix where number of rows is not equal to the number of
columns is called rectangular matrix.
Example:
1 1 1 0 0 
 2 0 3 3 0
 
 Square Matrix: A matrix which has the same number of rows and columns is called
square matrix.
Example:
1 1 1 1 1
9 9 0
3 0  
  6 6 1
7
TYPES OF MATRICES (3)
 Diagonal Matrix: A square matrix where all the elements are zero except those on
the main diagonal.
Example: 3 0 0 0
1 0 0 0 3 0 0
0 2 0  
  0 0 5 0
0 0 1  
0 0 0 9

 Identity/Unit Matrix: An identity matrix is a square matrix that has 1’s along the main
diagonal and 0’s everywhere else. Notation : 𝐼𝑛 for 𝑛 × 𝑛 unit matrix.
Example:
1 0 0 
1 0 
I 3  0 1 0  I2   
 0 1 
0 0 1 
8
TYPES OF MATRICES (4) Unit matrix
 Scalar Matrix: A diagonal matrix whose main diagonal elements are equal
Scalar matrix
Example: 6 0 0 0
0 6 0 0 Diagonal matrix

0 0 6 0
 
0 0 0 6

Diagonal matrix: Scalar matrix: Identity matrix:

4 0 0 0 4 0 0 0 1 0 0 0
 0 5 0 0  0 4 0 0  0 1 0 0 
M  M  M 
0 0 0 0 0 0 4 0 0 0 1 0
     
0 0 0 3 0 0 0 4 0 0 0 1

9
DIAGONAL AND TRACE

Only a square matrix posses the An example (5×5):

diagonal & the trace.

3 1 2 0 1 
 0 2 1 1 2 
 diag(M) = { 3, -2, 2.7, 0, -8.5 }
 
 tr (M) = 3 + (-2) + 2.7 +0 + (-8.5) M   2 1 2.7 2 0 
 
= -4.8 1 1 1 0 2 
 6 4 3 2 8.5

10
TYPES OF Example:
MATRICES (5)
 Zero/Null/Void matrix :
0 0 0  0 0 0
0 0 0  2 1 0
each entry is zero(0).    
 Nonzero matrix : 0 0 0  0 0 3
at least 1 nonzero ( ≠ 0 ) entry
Zero matrix Nonzero matrix
Sparse matrix :

#( zeroes) > #(nonzeroes)

Dense matrix : 1 4 0  1 1 1
#( zeroes) < #(nonzeroes) 0 2 0  9 9 0
N.B. A Sparse/Dense matrix    
must have zeroes and 0 0 1  6 6 1
nonzeroes as entries.
Sparse matrix Dense matrix
11
TYPES OF MATRICES (6)
 Triangular Matrix: A square matrix whose elements above or below the main diagonal are all zero.
Example:
1 0 0  1 8 9
 2 1 0 0 1 6 
   
5 2 3 0 0 3

 Upper Triangular Matrix: A square matrix whose elements below the main diagonal are all zero.
Example: 1 8 7 
0 1 8 
 
0 0 3

 Lower Triangular Matrix: A square matrix whose elements above the main diagonal are all zero.
Example:
1 0 0 
 2 1 0
 
5 2 3 12
PERMUTATION MATRIX
A permutation matrix (P) looks very similar to an identity Matrix. A permutation Matrix (P):
 Is a square matrix
 Consists of only 1’s and 0’s
 Each row must consist of a single 1
 Each column must consist of a single 1

1 0 0  1 0 0  0 1 0 
0 0 1  0 0 1  1 0 0 
     
0 1 0  0 1 0  0 0 1 
Matrix 𝑃1 Matrix 𝑃2 Matrix 𝑃3
13
TRANSPOSE OF A MATRIX
 Matrix Transpose: Transpose of a matrix A is a matrix obtained by interchanging the
rows and columns of A.
 Denoted by: AT or , A '

12 
9
X   X '  12 9 4 0
4 x1  4  1x 4
 
0

 21 44 77 
 21 62 33 93 62 95 38 
A   44 95 66 13  A'  
3x4 4 x3  33 66 79 
77 38 79 33  
 93 13 33  14
DETERMINANT (1)
 A Determinant is a number associated with a matrix. Only SQUARE matrices have a
determinant.
 The symbol for a determinant can be the phrase “det” in front of a matrix variable,
det(A); or vertical bars around a matrix, |A|

C   4 C 4
1 x1

 a1 b1 
C   C   a1 * b2    b1 * a2 
2x2
 a2 b2 
3 2 
C   C   3*1   2*5   3  10  7
2x2
5 1 
15
DIFFERENCE BETWEEN MATRIX AND DETERMINANT

Matrix Determinant
A matrix cannot be reduced to a A determinant can be reduced to a
single number. single number
In a matrix, the number of rows In a determinant, the number of rows
may not be equal to the number of must be equal to the number of
columns. columns.
An interchange of rows or columns
An interchange of rows or columns
gives the same determinant with +ve
gives a different matrix.
or –ve sign.

Examples: Examples:
1 2 3
1 2  1 2 3 1 2
    2 1 0
3 4  4 5 6 3 4
2 3 4
16
DETERMINANT (2)

Let M be a matrix & |M| be the

corresponding determinant.

Rectangular | M | undefined

Singular |M| = 0

Nonsingular |M| ≠ 0

17
PRACTICE ⤑ PERFECTION

You can justify your understanding by answering the following questions

 Write 1 difference between Matrix and Give examples:

Determinant.
 Upper triangular matrix (6×6)
 Why is it impossible to write a determinant with
33 entries?  Lower triangular matrix (6×7)

 What is the trace of –5I132?  Unit matrix (6×6)

 Every diagonal matrix is a scalar matrix: True or  Unit matrix (5×7)

False?  Permutation matrix (5×5)
 Every scalar matrix is a diagonal matrix: True or  Permutation matrix (5×6)
False?
 Scalar matrix (5×6)
 What will be the type of transpose of a 55 × 55
diagonal matrix?  Diagonal matrix (6×6)
 What is the trace of a zero matrix ?  Column matrix with 11 entries
 What is the trace of a square zero matrix ?  Row matrix with 13 entries
 17 tr ( I23) – tr (22 I17) =?  7×2 column matrix

18
ANY QUESTION???

19