MATRICES
Introduction
MATRICES - INTRODUCTION
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
Definition:
A matrix is a set or group of numbers arranged in a square or
rectangular array enclosed by two brackets.
4 2 a b
1 − 1 − 3 0 c d
MATRICES - INTRODUCTION
Properties:
▪ A specified number of rows and a specified number of
columns
▪ Two numbers (rows x columns) describe the
dimensions or size of the matrix.
Examples:
3x3 matrix 1 2 4
2x4 matrix
4 − 1 5 1 1
3 − 3
1 − 1
1x2 matrix 3 3 3 0 0 3 2
MATRICES - INTRODUCTION
A matrix is denoted by a bold capital letter and the elements
within the matrix are denoted by lower case letters, e.g. matrix
[A] with elements aij.
a11 a12 ... aij ain
a a ... a
a2 n
Amxn= 21 22 ij
am1 am 2 aij amn
i goes from 1 to m
j goes from 1 to n
MATRICES - INTRODUCTION
TYPES OF MATRICES
1. Column matrix or vector
➢ The number of rows may be any positive integer, but the
number of columns is always 1
1 a11
4 1 a21
− 3
2
am1
MATRICES - INTRODUCTION
TYPES OF MATRICES
2. Row matrix or vector
➢ Any number of columns but only one row
1 1 6 0 3 5 2
a11 a12 a13 a1n
MATRICES - INTRODUCTION
TYPES OF MATRICES
3. Rectangular matrix
➢ Contains more than one element and number of rows is
not equal to the number of columns
1 1
3 7 1 1 1 0 0
2 0 3 3 0
7 − 7
7 6
mn
MATRICES - INTRODUCTION
TYPES OF MATRICES
4. Square matrix
➢ The number of rows is equal to the number of columns
(a square matrix Am x m has an order of m)
1 1 1 1 1
9 9 0
3 0
6 6 1
The principal or main diagonal of a square matrix is composed of all
elements aij for which I = j
MATRICES - INTRODUCTION
TYPES OF MATRICES
5. Diagonal matrix
➢ A square matrix where all the elements are zero except those
on the main diagonal
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
i.e. aij 0 for all i = j
aij = 0 for some or all i j
MATRICES - INTRODUCTION
TYPES OF MATRICES
6. Unit or Identity matrix (I)
➢ A diagonal matrix with ones on the main diagonal
1 0 0 0
0 1 0
0
1 0 aij 0
0 0 1 0 0 1 0
aij
0 0 0 1
i.e. aij = 0 for all i j
aij = 1 for some or all i = j
MATRICES - INTRODUCTION
TYPES OF MATRICES
7. Null (zero) matrix (0)
➢ All elements in the matrix are zero
0 0 0 0
0 0 0 0
0
0 0 0
aij = 0 For all i,j
MATRICES - INTRODUCTION
TYPES OF MATRICES
8. Triangular matrix
➢ A square matrix whose elements above or below the main
diagonal are all zero
1 0 0 1 0 0 1 8 9
2 1 0 2 1 0 0 1 6
5 2 3 5 2 3 0 0 3
MATRICES - INTRODUCTION
TYPES OF MATRICES
8a. Upper triangular matrix
➢ A square matrix whose elements below the main
diagonal are all zero
1 7 4 4
aij aij aij 1 8 7 0
0 1 8 1 7 4
0 aij aij
0
0 0 7 8
0 aij 0 0 3
0 0 0 3
i.e. aij = 0 for all i > j
MATRICES - INTRODUCTION
TYPES OF MATRICES
8b. Lower triangular matrix
➢ A square matrix whose elements above the main diagonal are
all zero
aij 0 0 1 0 0
2 1 0
aij aij 0
aij aij aij 5 2 3
i.e. aij = 0 for all i < j
MATRICES – INTRODUCTION
TYPES OF MATRICES
9. Scalar matrix
➢ A diagonal matrix whose main diagonal elements are equal to
the same scalar
➢ A scalar (a) is defined as a single number or constant
aij 0 0 1 0 0 6 0 0 0
0 1 0 0
0 aij 0 6 0 0
0 0 aij 0 0 1
0 0 6 0
i.e. aij = 0 for all i j
aij = a for all i = j 0 0 0 6
MATRICES
Matrix Operations
MATRICES - OPERATIONS
EQUALITY OF MATRICES
• Two matrices are said to be equal only when all
corresponding elements are equal
• Therefore, their size or dimensions are equal as well
1 0 0 1 0 0
A = 2 1 0 B=
2 1 0 A=B
5 2 3 5 2 3
MATRICES - OPERATIONS
Some properties of equality:
▪ If A = B, then B = A for all A and B
▪ If A = B and B = C, then A = C for all A, B and C
1 0 0 b11 b12 b13
A=
2 1 0 B=
b21 b22 b23
5 2 3 b31 b32 b33
If A = B then aij = bij
MATRICES - OPERATIONS
ADDITION AND SUBTRACTION OF MATRICES
The sum or difference of two matrices, A and B of the same
size yields a matrix C of the same size
cij = aij + bij
Matrices of different sizes cannot be added or subtracted
MATRICES - OPERATIONS
Commutative Law:
A+B=B+A
Associative Law:
A + (B + C) = (A + B) + C = A + B + C
7 3 − 1 1 5 6 8 8 5
2 − 5 6 + − 4 − 2 3 = − 2 − 7 9
A B C
2x3 2x3 2x3
MATRICES - OPERATIONS
A+0=0+A=A
A + (-A) = 0 (where –A is the matrix composed of –aij as elements)
6 4 2 1 2 0 5 2 2
3 2 7 − 1 0 8 = 2 2 − 1
MATRICES - OPERATIONS
SCALAR MULTIPLICATION OF MATRICES
➢ Matrices can be multiplied by a scalar (constant or single
element)
➢ Let k be a scalar quantity; then
kA = Ak
Ex. If k = 4 and
3 − 1
2 1
A=
2 − 3
4 1
MATRICES - OPERATIONS
3 − 1 3 − 1 12 − 4
2 1 2 1 8 4
4 = 4 =
2 − 3 2 − 3 8 − 12
4 1 4 1 16 4
Properties:
• k (A + B) = kA + kB
• (k + g)A = kA + gA
• k(AB) = (kA)B = A(k)B
• k(gA) = (kg)A
MATRICES - OPERATIONS
MULTIPLICATION OF MATRICES
➢ The product of two matrices is another matrix
➢ Two matrices A and B must be conformable for multiplication
to be possible, i.e., the number of columns of A must equal the
number of rows of B
Example.
A x B = C
(1x3) (3x1) (1x1)
MATRICES - OPERATIONS
B x A = Not possible!
(2x1) (4x2)
A x B = Not possible!
(6x2) (6x3)
Example
A x B = C
(2x3) (3x2) (2x2)
MATRICES - OPERATIONS
b11 b12
a11 a12 a13 c11 c12
a b21 b22 =
21 a22 a23
b31 b32 c21 c22
(a11 b11 ) + (a12 b21 ) + (a13 b31 ) = c11
(a11 b12 ) + (a12 b22 ) + (a13 b32 ) = c12
(a21 b11 ) + (a22 b21 ) + (a23 b31 ) = c21
(a21 b12 ) + (a22 b22 ) + (a23 b32 ) = c22
Successive multiplication of row i of A with column j of
B – row by column multiplication
MATRICES - OPERATIONS
4 8
1 2 3 (1 4) + (2 6) + (3 5) (1 8) + (2 2) + (3 3)
4 2 7 6 2 = (4 4) + (2 6) + (7 5) (4 8) + (2 2) + (7 3)
5 3
31 21
=
63 57
Remember also:
IA = A
1 0 31 21 31 21
0 1 63 57 = 63 57
MATRICES - OPERATIONS
Assuming that matrices A, B and C are conformable for
the operations indicated, the following are true:
1. AI = IA = A
2. A(BC) = (AB)C = ABC - (associative law)
3. A(B+C) = AB + AC - (first distributive law)
4. (A+B)C = AC + BC - (second distributive law)
Caution!
1. AB not generally equal to BA, BA may not be conformable
2. If AB = 0, neither A nor B necessarily = 0
3. If AB = AC, B not necessarily = C
MATRICES - OPERATIONS
AB not generally equal to BA, BA may not be conformable
1 2
T =
5 0
3 4
S=
0 2
1 2 3 4 3 8
TS = =
5 0 0 2 15 20
3 4 1 2 23 6
ST = =
0 2 5 0 10 0
MATRICES - OPERATIONS
If AB = 0, neither A nor B necessarily = 0
1 1 2 3 0 0
0 0 − 2 − 3 = 0 0
MATRICES - OPERATIONS
TRANSPOSE OF A MATRIX
If :
2 4 7
𝐴=
5 3 1
Then transpose of A, denoted AT is:
2 5
𝐴𝑇 = 4 3
7 1
aij = a T
ji for all i and j
MATRICES - OPERATIONS
To transpose:
➢ Interchange rows and columns
The dimensions of AT are the reverse of the dimensions of A
2 4 7
A= 2 A =
3
2x3
5 3 1
2 5
A =3 A
T T2
= 4 3
3x2
7 1
MATRICES - OPERATIONS
Properties of transposed matrices:
1. (A+B)T = AT + BT
2. (AB)T = BT AT
3. (kA)T = kAT
4. (AT)T = A
MATRICES - OPERATIONS
1. (A+B)T = AT + BT
7 3 − 1 1 5 6 8 8 5 8 − 2
2 − 5 6 + − 4 − 2 3 = − 2 − 7 9 8 − 7
5 9
7 2 1 − 4 8 − 2
3 − 5 + 5 − 2 = 8 − 7
− 1 6 6 3 5 9
MATRICES - OPERATIONS
(AB)T = BT AT
1
1 1 0 2
0 2 3 1 = 8 2 8
2
1 0
1 1 21 2 = 2 8
0 3
MATRICES - OPERATIONS
SYMMETRIC MATRICES
➢ A Square matrix is symmetric if it is equal to its
transpose:
A = AT
a b
A=
b d
a b
A =
T
b d
MATRICES - OPERATIONS
When the original matrix is square, transposition does not
affect the elements of the main diagonal
a b
A=
c d
a c
A =
T
b d
The identity matrix, I, a diagonal matrix D, and a scalar matrix, K,
are equal to their transpose since the diagonal is unaffected.
