Chapter

Three:
Matrices

Department of
Mathematics

Chapter Three: Matrices

Department of Mathematics

Adama Science and Technology University

November 9, 2025
 Chapter
Three:
Matrices

Department of
Mathematics

First Draft

This slide may contain a few typographical or formatting errors.

Your comments and feedback are highly appreciated and will
help us improve the presentation for future use. Thank you for
your understanding and support!
 Chapter
Three:
Matrices

Department of
Mathematics Introduction
This chapter investigates matrices and algebraic
operations defined on them.
These matrices may be viewed as rectangular arrays of
elements where each entry depends on two subscripts (as
compared with vectors, where each entry depended on
only one subscript).
Systems of linear equations and their solutions may be
efficiently investigated using the language of matrices
 Chapter
Three:
Matrices

Department of Definition and Examples

Mathematics

Definition
A matrix A over a field K is a rectangular array of scalars from
K presented in the following form
 
a11 a12 · · · a1n
 a21 a22 · · · a2n 
A= .
 
.. .. 
 .. . ··· . 
am1 am2 · · · amn
 Chapter
Three:
Matrices
The rows of such a matrix A are the m horizontal lists of
Department of scalars:
Mathematics

(a11 , a12 , · · · , a1n ), (a21 , a22 , · · · , a2n ) · · · , (am1 , am2 , · · · , amn )

The columns of A are the n vertical lists of scalars

     
a11 a12 a1n
 a21   a22   a2n 
, , · · · ,
     
 ..   ..   .. 
 .   .   . 
am1 am2 amn

The element aij is called the ij − entry or the ij − element,

appears in row i and column j .
We frequently use the notation A = (aij )m×n
 Chapter
Three: A matrix with m rows and n columns is called an
Matrices
m by n matrix, written m × n
Department of
Mathematics
The pair of numbers m and n is called the size of the
matrix.
Two matrices A and B are equal, written A = B, if they
have the same size and if corresponding elements are
equal, i.e A = (aij )m×n and B = (bi j)m×n are equal iff

aij = bij ∀i, j

A matrix with only one row is called a row matrix or row

vector, and a matrix with only one column is called a
column matrix or column vector.
A matrix whose entries are all zero is called a zero matrix
and will usually be denoted by 0.
 Chapter
Three:
Matrices
Examples:
Department of
Mathematics
1. The rectangular array
 
−1 2 3
A=
2 4 −2

is a 2 × 3 matrix. List all columns and rows of A.

2. The 3 × 4 zero matrix is
 
0 0 0 0
A = 0 0 0 0
0 0 0 0
 Chapter
Three:
Matrices 3. Find x, y , z, t such
Department of
Mathematics
   
x +y 2z + t 5 9
=
x −y z −t 3 3

Solution: Equating the matrices yields the following

system of equations

x +y =5
x −y =3
2z + t = 6
z −t =3

Solving the system yields x = 4, y = 1, z = 3, t = 0

 Chapter
Three:
Matrices 3.1 Operation with Matrices
Department of Matrix Addition and Scalar Multiplication:
Mathematics

Definition
Let A = (aij )m×n and B = (bij )m×n be two matrices and k ∈ K
be a scalar
The sum A + B is defined as

A + B = (aij + bij )m×n

The scaar multiple of matrix A, by a scalar k, is defined as

kA = (kaij )m × n
 Chapter
Three:
Matrices

Department of
Mathematics

Remark:
We also define
−A = (−1)A and
A − B = A + (−B)
The matrix −A is called the negative of the matrix A, and
A − B is called the difference of the matrix A and B.
The sum of matrices with different sizes is not defined
 Chapter
Three:
Matrices

Department of Exercise:    
Mathematics
−1 2 −3 1 2 −1 4 3
1. Let A = and B =
2 0 4 1 −1 2 −2 1
Then find
a. A + B
b. 3A − 2B
   
1 −1 −2 3
2. Let A =  2 1  and B =  1 −2. Then find
−1 3 −1 4
a. 4A, − 5B
b. 4A + 5B
c. 5A − 2B
 Chapter Basic properties of matrix addition and scalar multiplication:
Three:
Matrices We have the following theorem
Department of
Mathematics Theorem
Consider any matrices A, B, C (with the same size) and any
scalars k and k 0 . Then
1 A + (B + C ) = (A + B) + C
2 A+0=0+A=A
3 A + (−A) = (−A) + A = 0
4 A+B =B +A
5 k(A + B) = kA + kB
6 (k + k 0 )A = kA + k 0 A
7 (kk 0 A) = k(k 0 A)
8 1A = A
where 0 is the zero matrix.
 Chapter
Three: Matrix Multiplication
Matrices

Department of
The product of matrices A and B, written AB, is
Mathematics somewhat complicated. For this reason, we first begin
with a special case.
Consider a row matrix A = (aj )1×n and a column matrix
B = (bj )n×1 , then the product
 
b1
b2 

 
AB = a1 a2 · · · an  . 
 .. 
bn
n
X
= a1 b1 + a2 b2 + · · · + an bn = aj bj
j=1
 Chapter
Three:
Matrices

Department of
Examples
Mathematics
 

3
1. 1 2 3 2 = 1(3) + 2(2) + 3(1) = 10
1
2.
 
2

−2
−2 3 4 1  1  = −2(2) + 3(−2) + 4(1) + 1(4)


4
= −2
 Chapter
Three:
Matrices We are now ready to define matrix multiplication in general.
Department of
Mathematics
Definition
Suppose A = (aik )n×p and B = (bkj )p×m be two matrices such
that the number of columns of A are equal to the number of
rows of B , then the product AB is the n × m matrix whose
ij − entry of AB is obtanined by multiplying the i th − row of A
and the j th column of B.i.e.

AB = (cij )n×m

where
cij = ai1 b1j + ai2 b2j + · · · + ain bnj
 Chapter
Three:
Matrices

Department of
Mathematics Graphically, we have

The product AB is not defined if A is an n × p matrix and

B is a q × m matrix where p 6= q.
 Chapter
Three:
Matrices Examples:
Department of
Mathematics 1. Identify if the product AB is possible if
   
1 2 3 −1 2 1
a. A = and B =
0 1 2 2 3 2
 
  1 2
−1 −1 −2 3 3 4
b. A = and B = 
−1

4 2 1 1 −2
1 5
   
2 1 2 3 4 1
2. Find AB if A = and B=
−2 −1 −1 2 −1 2
 
1 2  
0 1 2
3. Compute CD, where C = −2
 4 and D =

1 2 0
1 0
 Chapter
Three:
Matrices

Department of
Mathematics

Remark    
1 2 5 6
Suppose A = and B = , then
3 4 0 −2
   
5 2 23 34
AB = and BA =
15 10 −6 −8

For any two matrices A and B, AB 6= BA

 Chapter
Three:
Matrices Matrix multiplication has the following properties
Department of
Mathematics
Theorem
Let A, B, C be matrices. Then, whenever product and sum are
defined
(i.) A(BC ) = (AB)C (associative law)
(ii.) A(B + C ) = AB + AC (left distributive)
(iii.) (B + C )A = BA + CA(right distributive law)
(iv.) k(AB) = (kA)B = A(kB), where k is a scalar.

We note that 0A = 0 and A0 = 0, where 0 is the zero

matrix.
 Chapter
Three:
Matrices

Department of
Mathematics
Transpose of a Matrix
Definition
The transpose of a matrix A, denoted by AT , is the matrix
obtanied by writing the columns, in order, as rows and vice
versa.i.e if A = (aij )n × m, then

AT = (aji )m×n
 Chapter
Three:
Matrices

Department of
Mathematics

Example:
 
  1 4
1 2 3
1 Let A = , then AT = 2 5
4 5 6
3 6
   
−1 2 −1 −1 3 0
2 Let B =  3 1 2 , then B T =  2 1 1
0 1 2 −1 2 2
 Chapter
Three:
Matrices

Department of The next theorem lists the basic properties of the transpose
Mathematics
operation.
Theorem
Let A and B be matrices and let k be a scalar. Then, whenever
the sum and product are defined,
1 (A + B)T = AT + B T
2 (AT )T = A
3 (kA)T = kAT
4 (AB)T = B T AT
 Chapter
Three: Square Matrices
Matrices

Department of Definition
Mathematics
A matrix A is said to be a square matrix if it has the same rows
as columns.
Example: The following are square matrices
 
  −1 2 1
1 2 
(2), , 2 1 3 , e.t.c.
3 4
1 1 2

Any square matrix of order n × n is said to be of order n.

The operations of addition, multiplication, scalar
multiplication, and transpose can be performed on any
n × n matrices, and the result is again an n × n matrix.
 Chapter
Three:
Matrices
Diagonal and Trace
Department of
Mathematics
Let A = (aij ) be an n − square matrix.
The diagonal or main diagonal of A consists of the
elements with the same subscripts that is,

a11 , a22 , · · · , ann

The trace of A, denoted by tr (A), is defined as the sum of

the diagonal elements, i.e.

tr (A) = a11 + a22 + · · · + ann

The following theorem applies:

 Chapter
Three:
Matrices

Department of
Mathematics
Theorem
Suppose A = (aij ) and B = (bij ) be an n − square matrices and
k a scalar. Then
1 tr (A + B) = tr (A) + tr (B)
2 tr (kA) = [Link] (A)
3 tr (AT ) = tr (A)
4 tr (AB) = tr (BA)
 Chapter
Three: Examples
Matrices    
Department of
1 2 1 −2 3 1
Mathematics 1. Let A =  3 0 4  and B =  3 4 2  Then
−1 2 −3 1 1 −2
Diagonal(A) = [1, 0, −3] and Diagonal(B) = [−2, 4, −2]
tr (A) = 1 + 0 + (−3) = −2 and
tr (B) = (−2) + 4 + (−2) = 0
Using this example verify the above theorem.
   
3 2 1 3 1 5
2. Let A = 1 4 −2 and B = −1 2 5. Then find
5 1 4 2 1 1
a. tr (A + B)
b. tr (3A)
c. tr (4A + 3B)
d. tr (2A + 3B)T
 Chapter
Three:
Matrices 3.2 Special Types of matrices
Department of
Mathematics 1. Identity Matrix: The n − square identity or unit matrix,
denoted by In , or simply I , is the n − square matrix with
10 s on the diagonal and 00 s elsewhere. i.e.
 
1 0 0 ··· 0
0 1 0 · · · 0
In =  . . .
 
.
 .. .. .. · · · .. 
0 0 0 ··· 1

Here, for any n − sqare matrix A, we have

AIn = A = In A
 Chapter
Three:
Matrices

Department of
Mathematics
Example
The following are identity matrices
 
  1 0 0 0
  1 0 0
1 0  0 1 0 0
, 0 1 0 ,   , etc
0 1 0 0 1 0
0 0 1
0 0 0 1
 Chapter
Three:
Matrices

Department of 2. Scalar Matrix:: An n − square matrix A is said to be

Mathematics
scalar matrix if every element on the diagonal are equal
and elsewhere 00 s.i.e. A = (aij )n×n is scalar matrix if
(
k if i = j
aij =
0 if i 6= j

Examples: The following are scalar matrices

   
1 0 0   5 0 0
0 1 0 , 2 0 , 0 5 0 , e.t.c
0 2
0 0 1 0 0 5
 Chapter
Three:
Matrices

Department of
Mathematics 3. Invertible(Nonsinguar) matrices: An n − square matrix
A is said to be non singular if there exist an n − square
matrix B such that

AB = In = BA

Examples: The following are nonsingular matrices

   −5 3

2 3
A= and its inverse is B = 2 2
4 5
  2 −1
1 3
The matrix C = has no inverse.
2 6
 Chapter
Three:
Matrices

Department of
Mathematics
4. Upper Triangular matrices: An n − square matrix A is
siad to be upper triangular if all the elements below the
main diagonal are zero.
Examples: The following are upper triangular matrices:
 
  −1 0 2 0
1 2 0  
0 0 1 , 2 4 ,  0 0 0 1
 
0 1  0 0 3 1
0 0 2
0 0 0 2
 Chapter
Three:
Matrices

Department of
Mathematics
5. Lower Triangular matrices: An n − square matrix A is
said to be lower triangular if all the elements above the
main diagonal are zero.
Examples: The following are lower triangular matrices
   
1 0 0   2 0 0
2 0 
0 1 0 , , 1 3 0 , · · ·
1 4
0 0 1 1 2 4
 Chapter
Three:
Matrices
6. Diagonal matrix: An n − square matrix A is said to be
Department of
Mathematics diagonal matrix if all its nondiagonal matrices are zero.
Examples: The following are diagonal matrices
     
0 0 0 1 0 0 2 0 0
0 0 0 , 0 1 0 , 0 4 0 , · · ·
0 0 0 0 0 1 0 0 2

7. Symmetric/Skew-Symmetric matrix: An n − square

matrix A is said to be
symmetric if AT = A
skew symmetric if AT = −A
.
 Chapter
Three:
Matrices Example
Department of
Mathematics
1 The matrices  
  2 3 4
1 2 
, 3 5 6
2 3
4 6 7
are symmetric matrices.
2 The matrices
 
  0 2 −3
0 2 
, −2 0 4
−2 0
3 −4 0

are skew symmetric matrices.

 Chapter 3.3 Non-singularity
Three:
Matrices
Definition
Department of
Mathematics A square matrix A is said to be invertible or nonsingular if
there exists a matrix B such that

AB = BA = I

where I is the identity matrix.

Remark:
i. Such a matrix B is unique. In fact, if AB1 = B1 A = I and
AB2 = B2 A = I , then we have
B1 = B1 I = B1 (AB2 ) = (B1 A)B2 = IB2 = B2
We call such a matrix B, the inverse of A, and is denoted
by A−1 .
 Chapter
Three:
Matrices ii. Observe that the above relation is symmetric, i.e., if B is
Department of
Mathematics
the inverse of A, then A is the inverse of B.

Example
   
2 5 3 −5
Suppose A = and B = , then
1 3 −1 2
   
6 − 5 −10 + 10 1 0
AB = =
3 − 3 −5 + 6 0 1

and    
6 − 5 15 − 15 1 0
BA = =
−2 + 2 −5 + 6 0 1
Hence, A and B are inverses of each other.
 Chapter
Three:
Matrices
Theorem
Department of Suppose A and B are invertible(of same size), then AB is
Mathematics
invertible and
(AB)−1 = B −1 A−1

Proof: Here

(AB)(B −1 A−1 ) = A(BB −1 )A−1 = A(I )A−1 = AA−1 = I

Hence
B −1 A−1 is inverse of AB
But, (AB)−1 is inverse of AB
So ,
(AB)−1 = B −1 A−1 (by uniqueness)
 Chapter
Three:
In general, if A1 , A2 , · · · , An are invertible matrices (of
Matrices
same sizes), then A1 A2 · · · An is invertible and
Department of
−1 −1
Mathematics
(A1 A2 · · · An )−1 = A−1
n · · · A2 A1

Inverse of a 2× 2 matrix:


a b
Suppose A = be an arbitrary 2 × 2 invertible matrix.
c d
We want to find the inverse of A, say
 
x x
B = A−1 = 1 2
y1 y2
Then     
a b x1 x2 ax1 + by1 ax2 + by2
AB = = =
c d y1 y2 cx1 + dy1 cx2 + dy2
 
1 0
0 1
 Chapter
Three:
Matrices These yields the equations
Department of
Mathematics
ax1 + by1 = 1
cx1 + dy1 = 0

and

ax2 + by2 = 0
cx2 + dy2 = 1

The solution to the system are

d −c −b a
x1 = , y1 = , x2 = , y2 =
|A| |A| |A| |A|
 Chapter
Three:
Matrices

Department of
Mathematics That means,  
−1 1 d −b
A =
|A| −c a
Hence, if |A| =
6 0,then to find the inverse of a 2 × 2
matrix, we have these simple steps
Interchange the elements on the main diagonal
Multiply the other two elements by −1
1
Multiply the resulting matrix by |A| , or Equivalently, divide
each element by |A|
If |A| = 0, the matrix has no inverse.
 Chapter
Three:
Matrices

Department of
Mathematics
Exercises: Find the inverses of the following matrices
 
1 3
1 A=
2 5
 
3 4
2 B =
2 5
 
1 2
3 C =
2 3
 Chapter
Three:
Matrices

Department of
Mathematics

Inverse of an n × n matrix:
Suppose A is an n − square matrix
Finding its inverse, A−1 , to finding the solution of a
collection of n × n systems of linear equations.
We will study an effcient method in finding A−1 in chapter
4.
 Chapter
Three:
Matrices

Department of
Mathematics

3.4 Elementary Row and Column operations on Matrices:

One way to solve a system of linear equations is by working
with its augmented matrix M rather than the system itself.
This section introduces the necessary matrix concepts for
such a discussion.
These concepts, such as echelon matrices and elementary
row operations, are also of independent interest.
 Chapter
Three:
Matrices Echelon Matrices
Department of
Mathematics Definition
A matrix A is called an echelon matrix, or is said to be in
echelon form, if the following two conditions hold (where a
leading nonzero element of a row of A is the first nonzero
element in the row):
1. All zero rows, if any, are at the bottom of the matrix.
2. Each leading nonzero entry in a row is to the right of the
leading nonzero entry in the preceding row.
The entries in each row which are the leading nonzero elements
in their respective rows, are called the pivots of the echelon
matrix.
 Chapter
Three:
Matrices

Department of
Mathematics
Examples: The following matrices are in echelon form, where
the pivots are circled.
 
1 2 3 4    
1 0 0 0 3 4 2 1
 0 2 0 4 
 
, 0 0 ,
2  0 0 0 1 2 
  

 0 0 3 −1
0 0 0 0 0 0 0 1
0 0 0 0
 Chapter
Three:
Matrices Exercise: Identify which of the following matrices are in
Department of echelon form:
Mathematics  
0 1 2 0 4
0 0 3 1 2
1 A= 
0 0 0 0 1
0 0 0 0 0
 
2 1 3 1 −1
0 0 0 0 0 
2 B = 
0 0 2 0 −2
0 0 0 0 2
 
1 2 3
3 C = 0 2 1
2 0 3
 Chapter
Three: Row Canonical Form:
Matrices

Department of
Definition
Mathematics
A matrix A is said to be in row canonical form (or row-reduced
echelon form) if it is an echelon matrix that is, if it satisfies the
above properties (1) and (2), and if it satisfies the following
additional two properties:
3. Each pivot (leading nonzero entry) is equal to 1.
4. Each pivot is the only nonzero entry in its column.

Question:
1 What is the major difference b/ n echelon form and Row
cannonical form? Explain !
2 Is the zero matrix 0 of any size in row cannonical form?
What a bout the identity matrix I of any size?
 Chapter Elementary Row Operations
Three:
Matrices
Suppose A is a matrix with rows R1 , R2 , · · · , Rm . The following
Department of
Mathematics operations on A are said to be elementary row operation
[E1 ] (Row Interchange): Interchange rows Ri and Rj . This
may be written as
Ri ↔ Rj
[E2 ] (Row scaling) Replace row Ri by a nonzero multiple kRi
of itself. This may be written as

kRi → Ri

[E3 ] (Row Addition): Replace row Rj by the sum of a

multiple kRi of a row Ri and itself. This may be written as

kRi + Rj → Rj
 Chapter
Three:
Matrices

Department of
Mathematics
Row Equivalence
Definition
A matrix A is said to be row equivalent to a matrix B, written

A∼B

if B can be obtained from A by a sequence of elementary row

operations. In the case that, B is also an echelon matrix, B is
called an echelon form of A.
The following are two basic results on row equivalence.
 Chapter
Three:
Matrices

Department of
Mathematics Theorem
Suppose A = (aij ) and B = (bij ) are row equivalent echelon
matrices with respective pivot entries

a1j1 , a2j2 , · · · , arjr and b1j1 , b2j2 , · · · , brjr

Then A and B have the same number of nonzero rows - that is,
r = s−and the pivot entries are in the same positions-that is,

j1 = k1 , j2 = k2 , · · · , jr = kr
 Chapter
Three:
Matrices

Department of
Mathematics

Theorem
Every matrix A is row equivalent to a unique matrix in row
canonical form. This unique matrix is called the row cannonical
form of A.
 Chapter
Three:
Matrices
Example
Department of
Mathematics
Find the echelon form of the matrix
 
1 2 3
A = 0 0 0
2 3 4

Solution:
     
1 2 3 1 2 3 1 2 3
R2 ↔R3 −2R +R2 →R2
0 0 0  − −−−→ 2 3 4 −−−−1−−− −−→ 0 −1 2
2 3 4 0 0 0 0 0 0
 
1 2 3
Hence, 0 −1 2 is echelon form of A
0 0 0
 Chapter
Three:
Example
Matrices

Department of
Find the echelon form of the matrix
Mathematics  
1 2 −3 1 2
A = 2 4 −4 6 10
3 6 −6 9 13

Solution:
   
1 2 −3 1 2 1 2 −3 1 2
−3R +R3 →R3
A = 2 4 −4 6 10 −−−−1−−− −−→ 0 0 2 4 6
−2R1 +R2 →R2
3 6 −6 9 13 0 0 3 6 7
 
− 23 R2 +R3 →R3
1 2 −3 1 2
−−−−−−−−−→ 0 0 2 4 6 
0 0 0 0 −2
So, the matrix is in row echelon form.
 Chapter
Three:
Matrices
Exercise: Determine the row echelon form of the following
Department of
Mathematics matrices:  
1 0 2
1 A = 2 −1 3
4 1 8
 
1 2 −1 3 4
3 6 −3 9 12
2 B = 
2 4 5 2 1 
0 2 1 2 1
 
2 −2 2 1
3 C = −3 6 0 −1
1 −7 10 2
 Chapter
Three:
Matrices

Department of 3.5 Rank of a matrix

Mathematics
Definition
The rank of a matrix A, written rank(A), is equal to the
number of pivots in an echelon form of A.

Equivalently, we can define the rank of a matrix as follows:

The rank of a matrix is the maximum number of linearly
independent rows or columns in the matrix.
In other words, it tells us how many rows (or columns) of
the matrix contain unique information not repetitions or
combinations of others
 Chapter
Three:
Matrices

Department of
Mathematics
Example
 
1 2
The rank of the matrix A = is 1.
3 6
   
1 2 −3R1 +R2 →R2 1 2
Solution: −−−−−−−−−→
3 6 0 0
So, A has one pivot and hence rank(A) = 1
Equivalently, the row vectors (1, 2) and (3, 6) are linearly
dependent, hence rank(A) must be 1.
 Chapter
Three:
Matrices Example
Department of
 
Mathematics
1 2 3
Determine the rank of the matrix B = 4 5 6
7 8 9

Solution: In this matrix, all the columns of A are not linearly

independent, In fact,

C3 = −C1 + 2C2

hence, its rank < 3. But any two columns of this matrix are
linearly independent. Hence

rank(B) = 2
 Chapter
Three:
Matrices

Department of
Exercise: Determine the rank of the following matrices:
Mathematics
 
1 0 3
1 A = 0 2 0 
0 0 0
 
−1 3 2
2 B = 2 0 1
0 1 1
 
1 2 3 4
−1 2 1 1
3 C = 
 3 2 1 4
2 1 0 2
 Chapter
Three:
Matrices

Department of
Mathematics 3.6 Applications to Systems of linear Equations:
One way to solve a system of linear equations is by
working with its augmented matrix M rather than the
equations themselves.
Specifically, we reduce M to echelon form (which tells us
whether the system has a solution), and then further
reduce M to its row canonical form (which essentially gives
the solution of the original system of linear equations).
The justification for this process comes from the following
facts:
 Chapter
Three:
Matrices

Department of
(1) Any elementary row operation on the augmented matrix
Mathematics M of the system is equivalent to applying the
corresponding operation on the system itself.
(2) The system has a solution if and only if the echelon form
of the augmented matrix M does not have a row of the
form (0, 0, · · · , 0, b) with b 6= 0.
(3) In the row canonical form of the augmented matrix M
(excluding zero rows), the coefficient of each basic variable
is a pivot entry equal to 1, and it is the only nonzero entry
in its respective column; hence, the free-variable form of
the solution of the system of linear equations is obtained
by simply transferring the free variables to the other side.
 Chapter
Three: Example
Matrices

Department of Write the augmented matrix of the system of linear equations

Mathematics

x1 + x2 − 2x3 + 4x4 = 5
2x1 + 2x2 − 3x3 + x4 = 3
3x1 + 3x2 − 4x3 − x4 = 1

Solution: The augmented matrix of the system is constructed

by arranging the coefficients of the variables and the constants
from each equation into rows, hence
 
1 1 −2 4 5
M = 2 2 −3 1 3
3 3 −4 −1 1
 Chapter
Three:
Exercise: Write the augmented matrix of the following
Matrices systems
Department of
Mathematics 1

x +y +z =2
2y + 3z = 4
−x + 2y + 3z = 2

2x + 3y + z + 2t = 4
x − z + 2t = 5
3x − 4z + 4t = −4
−x − y + 2z + 4t = 2
 Chapter
Three:
Example
Matrices

Department of
Solve the system
Mathematics

x1 + x2 − 2x3 + 4x4 = 5
2x1 + 2x2 − 3x3 + x4 = 3
3x1 + 3x2 − 4x3 − x4 = 1

Solution: Here reduce the augmented matrix to echelon form as

   
1 1 −2 4 5 1 1 −2 4 5
 −3R1 +R3 →R3 
2 2 −3 1 3 −−−− −−−−→ 0 0 1 −7 −7 
 
−2R1 +R2 →R2
3 3 −4 −1 1 0 0 2 −14 −14
 
1 1 −2 −10 −9
−2R2 +R3 →R3 
−−−−−−−−→ 0 0 1 −7 −7

2R2 +R1 →R1
 Chapter
Three:
Matrices Rewrite the row canonical form in terms of a system of linear
Department of
Mathematics
equations to obtain the free variable form of the solution. That
is,

x1 + x2 − 10x4 = −9
x3 − 7x4 = −7

or

x3 = −7 + 7x4
x1 = −9 + 10x4 − x2

Hence, x2 and x4 are the free variables and x1 and x3 are the
pivot variables.
 Chapter
Three:
Example
Matrices

Department of
Solve the system of the equations
Mathematics

x + y − 2z + 3t = 4
2x + 3y + 3z − t = 3
5x + 7y + 4z + t = 5

Solution: Reduce the augmented matrix

   
1 1 −2 3 4 1 1 −2 3 4
 −2R1 +r2 →R2 
2 3 3 −1 3 −−−− −−−−→ 0 1 7 −7 −5 
 
−5R1 +R3 →R3
5 7 4 1 5 0 2 14 −14 −15
 
1 1 −2 3 4
−2R2 +R3 →R3 
−−−−−−−−→ 0 1 7 −7 −5

0 0 0 0 −5
 Chapter
Three:
Matrices

Department of
Mathematics
There is no need to continue to find the row canonical
form of M, because the echelon form already tells us that
the system has no solution.
Specifically, the third row of the echelon matrix
corresponds to the degenerate equation

0x + 0y + 0z + ot = −5

which has no solution. Thus, the system has no solution.

 Chapter
Three:
Matrices
Exercise: Solve the following system of linear equations
Department of 1.
Mathematics

x + 2y − z + 3w = 7
2x − y + 4z + w = 3
3x + y + 2z − 2w = 5

2.

2x + y + 3z − w = 4
x − 2y + z + 2x = 1
3x + y − 4z + w = 6
2x − 2y + 3x − 4w = 5
 Chapter
Three:
Matrices

Department of 3.
Mathematics

x + 2y + 3z = 1
x + 3y + 6z = 3
2x + 6y + 13z = 5

4.

x + 2y − z = 3
x + 3y + z = 5
3x + 8y + 4z = 17
 Chapter
Three:
Chapter Three: Worksheet III
Matrices    
1 −2 3 3 0 3
Department of 1. Given A = and B = . Then
Mathematics 2 −1 4 −7 1 8
compute
a. 3A − 2B
b. (2A + 3B)T
2. Find x, y , z, t such that
     
x y x 6 4 x +y
3 = +
z t −1 2t z +t t

3. Let (r × s) denote an r × s [Link] the sizes of those

matrix products that are defined:
a. (2 × 3)(3 × 4)
b. (1 × 3)(3 × 2)
c. (2 × 4)(3 × 3)
 Chapter
Three:
4. The matrices A, B, C are given below.
Matrices      
Department of −2 3 b −1 1 c
Mathematics A= , B= , C=
1 1 2 4 d 4
Given that A + B = C , find the values of a, b, c, and d.
5. Find, in terms of k, the inverse of the matrix
 
k k +1
M=
k +1 k +2
6. The 2 × 2 matrices A, B and c are given below:
     
2 x 2 1 3x + 2 7
A= , ‘B = , C=
3 1 1 4 7−x 7
Then
a. Compute AB
b. Determine the value of x given that B T AT = C
 Chapter
Three:
Matrices
7. The 2 × 2 matrices A and B are given below:
Department of
Mathematics    
5 2 9 12
A= , and B =
2 1 4 5

Find the 2 × 2 matrix X that satisfy the equation AX = B.

8. The distinct square matrices A and B have the properties

AB = B 5 A and B 6 = I

where I is the identity matrix. Prove that BAB = A

 
cos θ − sin θ
9. Let A = and A + AT = I . Find the value
sin θ cos θ
of θ.
 Chapter
Three:
Matrices

Department of 10. Find the echelon form and Row cannonical form of the
Mathematics following matrices
 
1 2 3 4
2 4 5 6
a. A = 
3 6

4 2
2 4 1 5
 
−2 1 3 4
b. B =  1 5 4 1
0 2 3 1
 
0 0 0 0
1 −1 2 1
c. C = 
−1

2 1 4
2 1 1 1
 Chapter
Three: 11. Write the augmented matrix and solve the following
Matrices
system of equations
Department of
Mathematics a.

x + 2y − z + w = 5
2x − y + 3z − 2w = 4
3x + y + 2z + w = 10
x − y + z + 2w = 3

b.

2x + 3y − w = 7
x − y + 2z + w = 4
3x + y + z − w = 5
4x − 2y + 3z + w = 10
 Chapter
Three:
Matrices c.
Department of
Mathematics
x +y +z +w =6
2x − y + 3z − w = 4
3x + 2y − z + 2w = 5
4x − 3y + 2z + w = 8

d.

2x + y − z + 3w = 9
x − 2y + 4z + w = 3
3x + 2y + z − 2w = 7
x + 3y + 2z + w = 10