College of Natural and Computational Science

Department of Mathematics

Course Title Project tow (2)

Summer IV Section C 2017 E.C

INTRODUCTION TO MATRICES AND DETERMINANTS

Full Name ID No Section

1.Muesho Meresa kkkkkkkk AKU0911 Maths C

2.Musie kkkkkkkkk bbbbbb AKU0911 Maths C
3.Negassi Mesfin Bisrat AKU0911697 Maths C
Acknowledgement
First of all greatly than as our God, the whole being of me all time existence.

Secondly, we are particularly owe especially thanks to my advisor Teacher Tesfay Hailu for his
valuable help and the time we devoted in correcting diving supposition and guide me all the step
of the project.

i
Table of Contents
Acknowledgement ......................................................................................................................................... i
Introduction ................................................................................................................................................... 1
Chapter One .................................................................................................................................................. 3
1. Introduction to matrices ........................................................................................................................ 3
1.1. Equality of Matrices ...................................................................................................................... 3
1.2. Types of matrices .......................................................................................................................... 3
1.3. Equivalence Matrices .................................................................................................................... 6
Chapter Two.................................................................................................................................................. 7
2. Operations with Matrices ...................................................................................................................... 7
2.1. Addition/Subtraction of Matrices.................................................................................................. 7
2.1.1. Properties of Matrices Addition ............................................................................................ 7
2.2. Matrices Multiplication ................................................................................................................. 8
2.2.1. Properties of matrices Multiplication .................................................................................... 9
2.3. Transpose of Matrices ................................................................................................................... 9
2.4. Elementary Row/or Column Operations ..................................................................................... 10
2.4.1. Row echelon form (REF) .................................................................................................... 10
2.4.2. Row Reduced echelon form (RREF) .................................................................................. 10
Chapter Three.............................................................................................................................................. 12
3. Determinants and Inverse Matrices..................................................................................................... 12
3.1. Determinant of the third order .................................................................................................... 12
3.1.1. Minors and cofactors........................................................................................................... 13
3.1.2. Properties of Determinates .................................................................................................. 14
3.2. Determinants of Diagonal and Triangular Matrices.................................................................... 15
3.3. Inverse of a matrices ................................................................................................................... 15
Summery ................................................................................................................................................. 17
References ................................................................................................................................................... 18
Introduction
Matrices plas a center role in this topic. They form an important part of the theory and many
concrete examples are based on them.

Therefore it is essential to develop facility in matrices manipulation. Since matrices pervade

much of mathematics, the techniques needed here are sure to be useful elsewhere.

General Objectives of Matrices and Determinants

 Understand the meaning of matrix’s and determinants

Specific Objectives

Define the meaning of matrix

Identify the properties of matrices
Calculate about examples of matrix
Define the meaning of determinant
Identify the properties of determinant

Significant of Matrix and Determinant

Matrices are rectangular arrays of numbers that play a crucial role in various fields due to their
ability to represent and manipulate data efficiency.

They are fundamental in linear algebra, where they represent linear transformations and solve
systems of equations. Beyond mathematics, matrices find applications in computer graphs,
animations, data analysis and even cryptography

Linear Algebra: - matrices are the core of linear algebra, where they are used to represent linear
transformations, solve systems of equations and perform various vector and matrix operations.

Computer Graphs – in computer graphs, matrices are used to represent transformations like
rotations, scaling and translation of objects in 2D and 3D Spaces.

Data Analysis – matrices are used to represent and analyze large data sets, enabling various
statistician operations and machine learning algorithms.

1
Computer Animation – matrices are essential for animating objects, allowing for complex
transformations and movements to be defined and controlled.

Cryptography – in cryptography, matrices are used in various encryption techniques, making

then an important tool for securing data.

Other applications- matrices also have applications in fields like engineering, physics, economics
and statistics.

The Determinant of Matrices is a single number that can be calculated from the elements of a
square matrix. It provides information about matrices properties including its invariability and
the nature of solutions to systems of linear equations. A determinant is a fundamental concept in
linear algebra with applications in various fields like geometry, physics and calculus.

2
 Chapter One

1. Introduction to matrices
A matrices (plural matrices) is a rectangular array of numbers, symbols or expressions (object),
arranged in rows and column enclosed by brackets [ ] or parenthesis ( ), the individual items in a
matrices are called elements or entries.

Matrices can be denoted by an upper case (Capital) letter such as A, B, C … or matrices can be
denoted by a rectangular array of numbers as

�11 �12 �13 ⋯ �1�

⎛ �21 �22 �23 ⋯ �2�
⋯ �3� ⎞ ��� ������
⎜ �31 �32 �33 ⋯ ⎟
⋮ ⋮ ⋮ ⋮
��1 ��2 ��3 ⋯ ���
⎝ ⎠

We call this matrix as matrices of order (size) or dimension � �� � �� ��� matrices in R, if all
elements found in the � row and � column. The matrices are primarily real matrices, meaning
the entries contain real numbers and they are used to solve systems of linear equations.

4 4 1
3 3
Example: - A= is 2x3 matrices, and B= 3 0 is 3x2 matrices are examples of real
1 0 2 3 2
matrices.

1.1. Equality of Matrices

Any two matrices of the same order are said to be equal if their corresponding entries are
equal. That is, matrices � = (��� ��� � = (���) of order (size) ��� are said to be equal if
and only if ��� = ��� for all1 ≤ � ≤ � ��� 1 ≤ � ≤ �.
2 3 4 2 3 4
Example:� = 2�3 ��� � = 2�3 are equal matrices.
5 0 1 5 0 1

1.2. Types of matrices

Column Matrices is a matrices formed by a single column, or if the size of the given
matrices is��1, it is called column matrices or simply a vector.

3
 1 5
Example: � = 2 3�1 ��� � = 0 4�1 are column matrices.
2
3
1

Row Matrices: Are matrices containing only one row, or if the size of the given matrices
is1��, then it is called row matrices or simply called a row vector. The matrices has only one
row.

Example: � = (5 5 3) 1�3 ��� � = (2 0 1 5)1�4 are row matrices.

Zero Matrices: are matrices of size ��� with all elements are zero, and it is denoted by
����.

0 0 0
0 0 0 0 0
Let say, , ��� 0 0 0 are zero matrices.
0 0 0 0 0
0 0 0

Square Matrices: square matrices are a matrix which has the same number of row and
Column. If the number of rows/columns is n, then its order is��� �� ������� �. The
elements ��� �(�ℎ��� � = � �� ������ ���) of the matrices represent the principal (main)
diagonal. The second diagonal is formed by the elements ���, such that � + � = � + 1.

0 0 0 0
5 1 5
1 2 4 1 3 0
For Example: 1 0 2 are square matrices.
3 0 0 1 2 0
3 4 5 2 3 4 1

Diagonal Matrices: it is square matrices are square matrices in which all elements above and
below the main diagonal are all zeros, symbolically��� = 0 �� � ≠ �, here there is no any
information about the elements in the main diagonal ���.

�. �. The elements in the main diagonal may or may not be zero.

1 0 0
1 0 1 0 0 0
For instance: , , ��� 0 4 0 are diagonal matrices.
0 3 0 0 0 0
0 0 0

Scale Matrices: it is a diagonal matrices in which the principal diagonal elements are all
� 0
equal. For example1: ��� ��� � ∈ |�. Zero square matrices is also scalar matrices.
0 �

4
 5 1 10 2
Example 2: � = , �ℎ�� 2� = , then 2 is a scalar matrices.
0 2 0 4

Unit (Identity) Matrices: it is diagonal matrices (or scalar matrices) in which the principal
diagonal’s elements all are equal to one.

1 0 0 0
1 0 0
1 0 0 1 0 0
Example: , 0 1 0 ��� are unit (identity) matrices.
0 1 0 0 1 0
0 0 1
0 0 0 1

Triangular Matrices: we can classify triangular matrices into two, those are…

Upper Triangular Matrices: Upper triangular matrices a square matrix whose elements
located below the main diagonal are all zero. We can express upper triangular matrices.
Symbolically as � = (���) ���ℎ �ℎ�� ��� = 0 �� � > �. here, there is no any information
about the other elements.

1 5 2 3 2 0
3 0
Example: 0 1 2 , ��� 0 2 1 are upper triangular
0 2
0 0 4 0 0 1
matrices.

Lower Triangular Matrices: A Square matrix is called Lower Triangular matrix if it has all
zero entries above its main diagonal. We can express lower triangular matrices symbolically
as � = (���) such that ��� = 0 �� � < �.

1 0 0
2 0
Example: A = 2 0 0 and are lower triangular matrices.
0 1
2 1 4

A diagonal matrices is both upper and lower triangular matrices.

Regular (Non – Singular) Matrices: is a square matrix that has an inverse and singular
matrix is a square matrix that has no inverse.

Let A and B be two matrices, such that the product �� = �� = �(�������� ��������), then
matrix B is the inverse of matrix A denoted by � .

5
Systematic Matrices: a square matrix � = (���) of order n is said to be systematic matrix if
��� = ��� ∀� ∗ � or it is a square matrices what satisfies � = � , �ℎ��� � is the transpose.

2 5 1 2 5 1
Example: A= 5 2 3 , then A = 5 2 3 Are examples of systematic matrices.
1 3 2 1 3 2

Skew –Systematic Matrices: A matrix � = (���) of order n is said to be a skew systematic

matrices if ��� = −��� or it is a square matrix that satisfy� = � .

The elements in the main diagonal of a skew systematic matrix are all zeros.

�. � ��� = 0

0 0 0 0 0 0
Example: � = 0 0 0 then − A 0 0 0 is a skew systematic matrix.
0 0 0 0 0 0

1.3. Equivalence Matrices

Let A and B be any two matrices ��� matrices. Then matrices B is row/column equivalent
with A, denoted by� ≅ �. If B is obtained from A using finite number of elementary
row/column operation.
2 3 4 1 2 4
Example: � = ��� � = are equivalent matrices.
5 2 1 3 2 1

6
 Chapter Two

2. Operations with Matrices

2.1. Addition/Subtraction of Matrices

We can add/subtract two matrices of the same size by adding/subtracting their corresponding
elements. If � = (���) ��� ��� � = (���)��� are matrices of size ���. Then their sum is
also ��� matrices given by � + � = (��� + ���)���

The sum of two matrices of different sizes is undetermined.

2 1 3 1 0 2
Example: 1. � = , �= then
4 5 2 2 6 1

2 1 3 1 0 2 3 1 5
�+� = + =
4 5 2 2 6 1 6 11 3

3 4 1 0 1
Example: 2. � = 5 2 0 , � = 3 4 doesn’t exist because of their size.
1 2 3 2 1

5 2 0 1 5 1
Example: 3. � = ,� = , �ℎ�� � − � =
3 4 2 1 1 3

Scalar Multiplication

If � = (���) is a matrices and � is any number (or simply a scalar), then the scalar
multiplication of � �� � is the matrices given by �� = ����.

3 2 1 9 6 3
Example: Let � = 5 0 1 , �ℎ�� 3� = 15 0 3
2 3 4 6 9 12

∴ 3 �� � ������ �������� �� �.

2.1.1. Properties of Matrices Addition

�, � ��� � are ��� matrices and � ��� � are scalars, then the following properties hold
true.

1) � + � = � + � (����������� �������� ��������)

2) � + (� + �) = (� + �) + � (����������� �������� �� ��������)

7
 3) (��)� = �(��)(����������� �� ������ ��������������)
4) �(� + �) = �� + ��(���� ������������ �������� ���� ��������.
5) (� + �)� = �� + ��(���ℎ� ������������ �������� �� ��������.
6) 1� = �
7) A+0=0+A=A (Identity) this means one important property of addition of real
numbers is that the number 0 serves as the addition identity.

Property of Zero matrices: if A is a matrix of order ��� ��� � , is a scalar, then the following
properties hold.

1) � + ���� = �
2) � + (−�) = ����, �ℎ�� – � is called the additive inverse of A.
3) �� �� = ����, then either � = 0 �� � = ����.

2.2. Matrices Multiplication

The third basic operation on matrices is matrices multiplication. This operation is associated
with dot product of two vectors.
 If � = (� )�� �� ��� matrices and � = � �� �� ��� �������� (that is the
number of column of matrices A is equal to the number of row of B, then the product AB
is a matrices of order ��� given by �� = � = � ���,

Where ��� = ∑ ��� ��� = ��1�1� + ��2�2� + ��3�3� + ⋯ + ������.

1 0 �11 �12 �13

1 2 0
Example: let � = 4 2 ��� � = , then � ∗ � = �21 �22 �23 so that
1 2 2
5 0 �31 �32 �33

1 0
1 2 0
�∗� = 4 2 ∗
1 2 2
5 0

�11 = 1(1) + 0(1) = 1

�12 = 1(2) + 0(2) = 2

�31 = 5(1) + 0(2) = 5 �13 = 1(0) + 0(2) = 0

8
 �32 = 5(2) + 0(2) = 10 �21 = 4(1) + 2(1) = 6

�33 = 5(0) + 0(2) = 0 �22 = 4(2) + 2(2) = 12

�23 = 4(0) + 2(2) = 4

1 0 1 2 0
1 2 0
Therefore � ∗ � = 4 2 ∗ = 6 12 4
1 2 2
5 0 5 10 0

2.2.1. Properties of matrices Multiplication

If A, B and C are matrices (with size such that the given matrices products are
defined).
� Is identity matrix and � is a scalar, then the following are true.
1) �(��) = (��)� (Associative property multiplication)
2) �(� + �) = �� + �� (left distributive property of multiplication over addition)
3) (� + �)� = �� + ��(right distributive of multiplication over addition)
4) �(��) = (��)� = �(��)
5) �� = � �� �� = � if it exists

2.3. Transpose of Matrices

Let A be a matrices, the transpose A is other new matrices, where the elements in the
columns and rows have been swapped. In other words, the row became the column and the
column becomes the rows. The transpose of matrices � = (���)���, denoted and given
by� = (���)���, is the matrices formed by interchanging columns and rows of A as
shown below.
�11 �12 �13 ⋯ �1� �11 �21 �31 ⋯ ��1
⎛ �21 �22 �23 ⋯ �2� ⎞ ⎛�12 �22 �32 ⋯ ��2⎞
⎜ �31 �32 �33 ⋯ �3� ⎟ , �ℎ�� � = ⎜�13 �23 �33 ⋯ ��3⎟
⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋯ ⋮
⋯ ⋯ ���
⎝��1 ��2 ��3 ���⎠ ⎝�1� �2� �3� ⎠

2 3 4 2 5 3
Example: � = 5 2 1 , �ℎ�� � = 3 2 4
3 4 1 4 1 1

If A&B are matrices with sizes such that the given matrices operations are defined and � is a
scalar, then the following properties are true.

9
 1) (� ) = � (Transpose of a transpose)
2) (� + �) = � + � (Transpose of sum)
3) (��) = �� (Transpose of a scalar multiple)
4) (��) = � � (Transpose of a product)
5) (�� ) = ��

2.4. Elementary Row/or Column Operations

Elementary row/column operation: we can have three types of elementary row operations.
1) Rescaling:- multiply the � row/column by a non zero scalar �, ������� �� �� →
��� �� �� → ���
2) Pivoting:- add a scalar multiple of the � row/column to the � row/column where
� ≠ �, ������� �� �� → �� + ���, �� �� → �� + ���.
3) Swapping: - interchange the � and � rows/columns, where� ≠ �.
�� ↔ ��, �� �� ↔ ��

2.4.1. Row echelon form (REF)

Let A be any matrices, then the matrices A is in row echelon form (REF) if it satisfies
the following properties.
1) All rows consisting entirely of zeros occur at the bottom of the matrices (if any) called as
zero rows.
2) The first non zero element in every non zero row is 1. It is known as leading 1.
3) In any two successive (non zero) rows, the leading 1 in the lower row lies to the right of
the leading 1 in the previous row.

Example: - reduce the given matrices into row echelon form (REF)

1 2 1 2
�= , �������� �2 = 3�1 − �2 Now, it is in row echelon form.
3 2 0 4

1 1 2
�2 = �2 =
4 0 1

2.4.2. Row Reduced echelon form (RREF)

A given matrices A is said to be in row reduced echelon form (RREF), if it satisfies
the following conditions.

10
 1) Matrices A is in row echelon form
2) If a column in the given matrices contains a leading 1, then all other entries in this
column are zeros.
3) If a matrix is in row reduced echelon form, then it also is in row echelon form.
4) Every matrices has unique equivalence matrices in row reduced echelon form,
5) Every matrix can be brought form by a series of elementary row operation.

Example: - reduce the given matrix into row reduced echelon form.

1 2 1
�= 2 2 2
1 0 1
Solution

 �2 → −(�2 − 2�1) 1 2 1
0 2 0
�3 → −(�3 − �1) 0 2 0

�1 → �1 − �2
1 0 1
�3 → �3 − �2 0 1 0 This is in row reduced echelon form.
0 0 0
�2 → 0.5�2

11
 Chapter Three

3. Determinants and Inverse Matrices

Every square matrix A has a number associated to its determinants. In this section we will define
the determinants drive some of its properties. The determinants of a matrix A will be denoted by
det(�).

The matrix of A is 1�1 matrix so the determinant of A is a unique entry. det(�) = �

Example1. � = (2) then |�| = 2

2. � = (−0.5), �ℎ�� |�| = −0.5

� �
The determinant of a 2�2 matrix is given by the formula = �� − ��.
� �

−2 0
Example1: let � = , �ℎ�� |�| = (−2�4) − (0�1), |�| = −8 − 0 = −8
1 4

3.1. Determinant of the third order

A determinant of the third order is a number designated by a square array of nine elements
arranged in three rows and three columns and enclosed with in vertical bars.

�1 �1 �1
Let � = �2 �2 �2 is 3x3 matrixes, and then the determinant of A is defined as the
�3 �3 �3
�2 �2 �2 �2 �2 �2
quantity det(�) = �1 − �1 + �1 or as the quantity
�3 �3 �3 �3 �3 �3

det(�) = (�1�2�3 − ��2�3) − �1�2�3 + �1�2�3 + �1�2�3 − �1�2�3

1 2 4
Example: let� = 4 3 6 , and then find the determinant of A?
−1 5 2

Solution

3 6 4 6 4 3
det(A) = 1 −2 +4
5 2 −1 2 −1 5

12
det(A) = 1(6 − 30) − 2(8 + 6) + 4(20 + 3)

det(A) = 1(−24) − 2(14) + 4(23)

det(A) = −24 − 28 + 92

det(A) = ��

3.1.1. Minors and cofactors

LetA = (���)mxn, then

i. The determinant of the matrices obtained by deleting the � row and � column is
called the minor of ���
ii. The cofactor of ��� = (−1) ��� or���.

The matrices obtained by deleting the � row and � column is denoted by .

�11 �12 �13

�22 �23
If � = �21 �22 �23 , �ℎ�� � , the minor of � = |�|.
�32 �33
�31 �32 �33

�22 �23
Its cofactor is (−1) = (−1) ∗ |�|.
�32 �33

−1 6 2
Example: let = 0 −5 7 , find the determinant of B.
3 −2 4

Solution

−5 7 0 7 0 −5
det(�) = −1 −6 +2
−2 4 3 4 3 −2

det(�) = −1(−20 + 14) − 6(0 − 21) + 2(0 + 15)

det(�) = −(−6) − 6(−21) + 2(15) = 6 + 126 + 30

det(�) = 162

13
 3.1.2. Properties of Determinates

The following properties of determinants are greatly helpful to minimize the labor and time
needed to evaluate determinants and also to avoid arithmetic mistakes.

1) If every element in a row or column of a square matrices is 0, then the determinant of the
matrices is 0.
3 4 −2 1 3 0
Example: � = 0 0 0 ��� � = 2 4 0 . Then find |A| and |B|
1 2 5 −3 2 0
Solution
0 0 0 0 0 0
|�| = 3 −4 + (−2)
2 5 1 5 1 2
|�| = 3(0 ∗ 5 − 0 ∗ 2) − 4(0 ∗ 5 − 0 ∗ 1) − 2(0 ∗ 2 − 0 ∗ 1)
|�| = 3(0) − 4(0) − 2(0) = 0
4 0 2 0 2 4
|�| = 1 −3 +0
2 0 −3 0 −3 2
|�| = 1(4 ∗ 0 − 2 ∗ 0) − 3(2 ∗ 0 − 0 ∗ −3) + 0(4 + 12)
|�| = 1(0) − 3(0) + 0(16) = 0
2) A common factor that appears in all entries in row of matrices can be factored out of the
row when evaluating the determinant of the matrices.
8 6 4 3
Example 1. =2 2 �� �ℎ� ������ �� �ℎ� ����� ���.
3 7 3 7
2 1 7 2 1 7
2- 9 6 12 = 3 3 2 4.
5 2 9 5 2 9
Note that 3 is a common factor to be elements of the second row.
If each elements of any two or column of a square matrix A is multiplied by a constant K,
then the new determinant is K|A|.
3) If two (not necessarily adjacent) rows of a square matrix are interchanged, the values of
the determinants of the two matrices differ only by their algebraic sign.
� � � �
=−
� � � �
2 5 5 2
Example: =−
3 1 1 3

14
 2 5 5 2
Solution: determinant of �� 2 − 15 = −13 ��� �ℎ� ����������� �� is
3 1 1 3
2 5 5 2
−15 − 2) = −(13) = −13 �ℎ�� =− .
3 1 1 3
4) The determinant of matrices A and its transpose � are the same.
5) If a matrix A contains two identical rows or row identical columns. Then det � �� |�| =
0
3 4
Example 1) ����������� �� 12 − 12 = 0
3 4
5 5
2) ����������� �� 15 − 15 = 0
3 3
4 5 4
3) 6 4 6 = 0, �ℎ� ����� ������ ��� �ℎ� �ℎ��� ������ ��� ��������� ������.
3 9 3
6) If a non zero multiple of one row (or one column) of a square matrices the value of the
determinant is unaltered.
�11 �12 �13
�. � ��� � = �21 �22 �23 �� ��� ��� � � �������� �� �ℎ� ����� ��� �� �ℎ� ,
�31 �32 �33
�11 �12 �13
������ ��� �ℎ�� �21 + ��11 �22 + ��12 + �23 +��13 is |A|. This means |A|
�31 �32 �33
=|� |. the same result of determinants.

3.2. Determinants of Diagonal and Triangular Matrices

Let � = (���) be a diagonal matrices of order n. then |�| = �11 �22 �33 − − − ���.
�2 0
Example: Evaluate the determinant of � =
0 �2
Solution
Determinant � = |�| = (�1��2 − 0�0)
det(�) = �1�2 − 0 = �1�2

3.3. Inverse of a matrices

 A square matrix of order n said to be invertible if it is non – singular. The
inverse of A is �� = � � = �.
 The inverse of square matrices of order 2

15
  The following is a formula used to find the inverse of a non – singular matrices
of order 2.

� � � −�
Let � = , �ℎ� � = , |�| ≠ 0.
� � ( ) � �

3 2
Example: Let � = , �ℎ�� ���� �
4 1

Solution

1 1 −2 1 1 −2 −1 1 −2
� = →� = →�
|�| −4 3 (3 − 8) −4 3 5 −4 3

−1 2
� = 5 5
4 3
5 5

Finding � using elementary row/ or column operation.

 Given a matrices A, the following operations are said to be elementary row

operations.
1. Interchanging two rows. �� ↔ ��
2. Multiplying a row by a non zero constant ��� ↔ ��
3. Adding a multiple of one row to another row. ��� + ��� → ��

Finding the inverse of a matrices A using |A| and Ad joint of A. ���(�)

�1 �2 �3 �1 �1 �1
Let = �1 �2 �3 ���ℎ |�| ≠ 0, �ℎ�� � = �2 �2 �2 , where �� is the cofactor
| |
�1 �2 �3 �3 �3 �3
of ���� is the cofactor of �� ��� �� is the cofactor of ��.

�1 �1 �1
� = �2 �2 �2 is called the ad joint of A. denoted by ���(�)
�3 �3 �3

1 3 −2 37 10 2
Example: Let � = 0 1 5 → |�| 1
= 3 , (���) = 9 3 0 ,
−2 −6 7 17 5 1

16
 37 −10 2 37 −9 17
(���) = −9 3 0 ��� ���(�) = (���) = −10 3 −5
17 −5 1 2 0 1

37 −3 17
37 −9 17 3 3
⎛−10 −5 ⎞
Thus, � = | | ���(�) = −10 3 −5 = ⎜ 3 1 3⎟
2 0 1 2 1
3 0 3⎠
⎝

Summery
Let � ��� � be natural number. An ��� array of number arranged � �
���� ��� � ������� � is called a matrix. Such a matrices A is usually written as
�11 �12 �13 ⋯ �1�
�21 �22 �23 ⋯ �2� where 1 ≤ � ≤ � ��� 1 ≤ � ≤ � ��� specify the order of
⋮ ⋮ ⋮ ⋯ ⋮
��1 ��2 ��3 ⋯ ���
the matrices.

 Types of matrices are row matrix, column matrix, identity matrix, scalar matrix, diagonal
matrix, square matrix, regular matrix, triangular matrix, zero matrices … etc.
 Let � = (���)��� ��� � = (���)��� matrices of the same order, then
 The sum � + � = (��� + ���)��� the sum of the corresponding elements.
 The difference � − � = (��� − ���)���. the different of the corresponding elements.
 Matrices multiplication is not commutative.
 If A is a square matrices of order n, then �� = � � = �
 The determinant of 1�1 matrices is a unique.
 The minor of ��� obtained deleting the � ��� ��� � ������ and the cofactor of ��� is
(−1) �. �ℎ��� � �� �ℎ� ����� �� ���.
 A square matrix of order n is said to be invertible if it is non – singular the inverse of A
denoted by � . �� =� �=�

17
References
 Muir, A treatise on the theory of determinant, Dover, New York, 1960
 M.A. MUNEM AND D.I foulis (1986). Algebra and Trigonometry
 Raymond A. BARNETT. Micheal R. Zieglek, and KAR E. BYLEEN (2001)
seven edition, Algebra with Trigonometry
 Galaxy mathematics
 Target mathematics
 Linear Algebra
 Mathematics Grade 11 textbook.

18