College of Basic Education

Rank of a matrix

Definition 3.2.43:

The rank of an matrix is equal to the number of nonzero rows of final reduced row echelon
form of that matrix.

Example 3.2.44:

Find the rank of [ ].

Solution:

[ ]→ [ ]→ [ ]

→ [ ]→ [ ]

Rank of

Remark 3.2.45 Rank of , (identity matrix) is .

Q: Find the rank of [ ], [ ] [ ]

1
 College of Basic Education

Chapter Three

System of linear equation

Section – Three:

System of linear equation

Definition 3.3.1: A linear equation of m equations in the n unknowns is usually

⁞ ⁞ ⁞ ⁞

----------------------------------------------(1)

by a solution of the system is means any set of values which satisfy simultaneously the
equation, when the system has a solution, it is said to be consistent ,otherwise the system is said to be
inconsistent.

Remark 3.3.2:

Two systems of linear equations in the same number of unknowns are called equivalent if every solution
of either system is a solution of the other.

In matrix notation the system of linear equations (1) may be written as where

A=[ ] is the coefficient matrix [ ], [ ] for the system (1) ,the matrix

(( )| ) ( | ) is called the augmented matrix.

2
 College of Basic Education

Theorem 3.3.3:

A system of linear equations in unknowns is consistent if and only if the coefficient matrix
and the augmented matrix of the system have the same rank.

Definition 3.3.4:

A linear system of the form

----------- (*)

Is called a homogeneous system, Also (*) can be written in matrix form as .

A solution , to the homogeneous system (*) is called trivial solution.

A solution to a homogeneous system in which not all the are zero is called a
nontrivial solution.

Theorem 3.3.5: A homogeneous system of equation in n unknowns always has a nontrivial solution
if .

Definition 3.3.6:

A linear system

Is called non-homogeneous system if not all the are zero.

Theorem 3.3.7:

A non-homogeneous system of in linear equations in unknowns has a unique solution if and

3
 College of Basic Education

Methods of solving linear system

1) Gauss elimination:

Gaussian Elimination consists of two steps:

Step 1: the transformation the augmented matrix [ ] in row echelon form using elementary row
operation.

Step 2: solution of linear system corresponding to the augmented matrix using back substitution.

Example 3.3.8: Solve the following system by gauss elimination.

Solution:

This system can now be solved by back-substitution in the lost equation.

4
 College of Basic Education

[ ] [ ]

Example 3.3.9: Solve the following system by Gauss-elimination:

Solution:

( | )→ ( | )

→ ( | )→ ( | )

→ ( | )

Since we have 5 unknowns and 3 equation free variable

Let , we have a , b

= , for example let a=1, b=2

[ ] [ ]

5
 College of Basic Education

We get: =

[ ] [ ]

2) Gauss - Jordan elimination:

Solution:

( | )→ ( | )

→ ( | )→ ( | )→ ( | )

→ ( | ) → ( | )

Example 3.3.11: Solve the system by gauss-Jordan elimination:

6
 College of Basic Education

Solution:

( | )→ ( | )

→ ( | )→ ( | )

( | )

Three equation and 4 unknowns 4-3=1 arbitrary unknowns.

Let w=a where,

7
 College of Basic Education

Example 3.3.12:

Solve the homogeneous system

Solution:

( | ) → ( | )→ ( | )

→ ( | )→ ( | )→ ( | )

Example 3.3.13: Solve the system

Solution:

( | ) → ( | )

→ ( | ) ( | )

8
 College of Basic Education

Three equation and 4 unknown 4-3=1 arbitrary unknowns.

Let