MAT1320-Linear Algebra

Lecture Notes
System of Linear Equations, Gauss-Jordan Elimination Method

Mehmet E. KÖROĞLU
Spring 2022
Yıldız Technical University, Department of Mathematics
[email protected]
Table of contents

1. System of Linear Equations

2. The Rank of A Matrix

3. Gauss-Jordan Elimination Method

4. Homogenous System of Linear Equations

Mehmet E. KÖROĞLU 1
System of Linear Equations
System of Linear Equations




 a11 x1 + a12 x2 + · · · + a1n xn = b1


 a21 x1 + a22 x2 + · · · + a2n xn = b2
.. (1)




.
 a x +a x +···+a x = b

m1 1 m2 2 mn n m

is a system of linear equations of m equations in n unknowns.

Mehmet E. KÖROĞLU 2
System of Linear Equations




 a11 x1 + a12 x2 + · · · + a1n xn = b1


 a21 x1 + a22 x2 + · · · + a2n xn = b2
.. (1)




.
 a x +a x +···+a x = b

m1 1 m2 2 mn n m

is a system of linear equations of m equations in n unknowns. The

matrix  
a11 a12 ... a1n
 
 a21 a22 ... a2n 
A= .
 
 .. .. .. .. 
 . . . 
am1 am2 . . . amn
is called the coefficient matrix of the system.

Mehmet E. KÖROĞLU 2
System of Linear Equations

   
x1 b1
 .  .. 
Then for X =  .. 

 and b =   the system given in (1) can
. 
 

xn bm
be written as
AX = b

Mehmet E. KÖROĞLU 3
System of Linear Equations

   
x1 b1
 .  .. 
Then for X =  .. 

 and b =   the system given in (1) can
. 
 

xn bm
be written as
AX = b

where X is called the vector of unknowns and b is called the vector

of constants.

Mehmet E. KÖROĞLU 3
System of Linear Equations

   
x1 b1
 .  .. 
Then for X =  .. 

 and b =   the system given in (1) can
. 
 

xn bm
be written as
AX = b

where X is called the vector of unknowns and b is called the vector

of constants.
Definition
The augmented matrix of the system is denoted by [A|b] and
obtained by appending the vector of constants b as the (n + 1)-th
column to the coefficient matrix A.

Mehmet E. KÖROĞLU 3
The Rank of A Matrix
The Rank of A Matrix

Definition
Let REF or RREF of the matrix A be the C . The number of
nonzero rows of C is called rank of A and denoted by rank (A) .

Mehmet E. KÖROĞLU 4
The Rank of A Matrix

Definition
Let REF or RREF of the matrix A be the C . The number of
nonzero rows of C is called rank of A and denoted by rank (A) .

Example
The matrix A and its RREF C is given below.
   
1 0 1 0 1 1 0 1 0 1
1 −1 1
   
2 0 2 0 2
 0 1
A=
1 −1 0 ∼C = 
 1 0

0
 0 0 0 0
2 −2 0 2 0 0 0 0 0 0

Then rank(A) = 2.

Mehmet E. KÖROĞLU 4
Gauss-Jordan Elimination Method
Gauss-Jordan Elimination Method

Let AX = b be the system of linear equation with m equations in

n unknowns given in (1).

Mehmet E. KÖROĞLU 5
Gauss-Jordan Elimination Method

Let AX = b be the system of linear equation with m equations in

n unknowns given in (1). Let [A|b] be the augmented matrix of
the system.

Mehmet E. KÖROĞLU 5
Gauss-Jordan Elimination Method

Let AX = b be the system of linear equation with m equations in

n unknowns given in (1). Let [A|b] be the augmented matrix of
the system. Examination of the solutions of a system of linear
equations by transforming augmented matrix of the system [A|b]
into RREF is called Gauss-Jordan Elimination Method.

Mehmet E. KÖROĞLU 5
Gauss-Jordan Elimination Method

Let AX = b be the system of linear equation with m equations in

n unknowns given in (1). Let [A|b] be the augmented matrix of
the system. Examination of the solutions of a system of linear
equations by transforming augmented matrix of the system [A|b]
into RREF is called Gauss-Jordan Elimination Method. In the
Gauss-Jordan Elimination Method we have the following cases:
1. If rank(A) ̸=rank([A|b]) , then the system has no solution. In
this case we called system as inconsistent.

Mehmet E. KÖROĞLU 5
Gauss-Jordan Elimination Method

Let AX = b be the system of linear equation with m equations in

n unknowns given in (1). Let [A|b] be the augmented matrix of
the system. Examination of the solutions of a system of linear
equations by transforming augmented matrix of the system [A|b]
into RREF is called Gauss-Jordan Elimination Method. In the
Gauss-Jordan Elimination Method we have the following cases:
1. If rank(A) ̸=rank([A|b]) , then the system has no solution. In
this case we called system as inconsistent.
2. If rank(A) =rank([A|b]) , then the system has solution.

Mehmet E. KÖROĞLU 5
Gauss-Jordan Elimination Method

Let AX = b be the system of linear equation with m equations in

n unknowns given in (1). Let [A|b] be the augmented matrix of
the system. Examination of the solutions of a system of linear
equations by transforming augmented matrix of the system [A|b]
into RREF is called Gauss-Jordan Elimination Method. In the
Gauss-Jordan Elimination Method we have the following cases:
1. If rank(A) ̸=rank([A|b]) , then the system has no solution. In
this case we called system as inconsistent.
2. If rank(A) =rank([A|b]) , then the system has solution.
2.1 If rank(A) = n, i.e., the number of unknowns and the number
of equations are equal, then the system has a unique solution.

Mehmet E. KÖROĞLU 5
Gauss-Jordan Elimination Method

Let AX = b be the system of linear equation with m equations in

n unknowns given in (1). Let [A|b] be the augmented matrix of
the system. Examination of the solutions of a system of linear
equations by transforming augmented matrix of the system [A|b]
into RREF is called Gauss-Jordan Elimination Method. In the
Gauss-Jordan Elimination Method we have the following cases:
1. If rank(A) ̸=rank([A|b]) , then the system has no solution. In
this case we called system as inconsistent.
2. If rank(A) =rank([A|b]) , then the system has solution.
2.1 If rank(A) = n, i.e., the number of unknowns and the number
of equations are equal, then the system has a unique solution.
2.2 If rank(A) = r < n, i.e., the number of unknowns is greater
than the number of equations, then the system has infinitely
many solutions depending on n − r parameters.
Mehmet E. KÖROĞLU 5
Gauss-Jordan Elimination Method

Example (Gauss-Jordan Elimination)

Let the system of linear equations x − y + 3z = 1, y = −2x + 5,
9z − x − 5y + 7 = 0 be given.

Mehmet E. KÖROĞLU 6
Gauss-Jordan Elimination Method

Example (Gauss-Jordan Elimination)

Let the system of linear equations x − y + 3z = 1, y = −2x + 5,
9z − x − 5y + 7 = 0 be given.
 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.

Mehmet E. KÖROĞLU 6
Gauss-Jordan Elimination Method

Example (Gauss-Jordan Elimination)

Let the system of linear equations x − y + 3z = 1, y = −2x + 5,
9z − x − 5y + 7 = 0 be given.
 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.
2. Write the augmented matrix of the given system and put it
into RREF.

Mehmet E. KÖROĞLU 6
Gauss-Jordan Elimination Method

Example (Gauss-Jordan Elimination)

Let the system of linear equations x − y + 3z = 1, y = −2x + 5,
9z − x − 5y + 7 = 0 be given.
 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.
2. Write the augmented matrix of the given system and put it
into RREF.
3. Find rank (A) and rank ([A|b]) .

Mehmet E. KÖROĞLU 6
Gauss-Jordan Elimination Method

Example (Gauss-Jordan Elimination)

Let the system of linear equations x − y + 3z = 1, y = −2x + 5,
9z − x − 5y + 7 = 0 be given.
 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.
2. Write the augmented matrix of the given system and put it
into RREF.
3. Find rank (A) and rank ([A|b]) .
4. If any, find all solutions of the system.

Mehmet E. KÖROĞLU 6
Çözüm:1

1. The given system can be arranged as follows.

x −y +3z = 1
2x +y = 5
−x −5y +9z = −7

Mehmet E. KÖROĞLU 7
Çözüm:1

1. The given system can be arranged as follows.

x −y +3z = 1
2x +y = 5
−x −5y +9z = −7

Then     
1 −1 3 x 1
    
 2
 1 0  y  =  5 
   

−1 −5 9 z −7

Mehmet E. KÖROĞLU 7
Çözüm:2
 
1 −1 3 1
 
2. The augmented matrix of the system is 
 2 1 0 5 .
−1 −5 9 −7

Mehmet E. KÖROĞLU 8
Çözüm:2
 
1 −1 3 1
 
2. The augmented matrix of the system is 
 2 1 0 5  .
−1 −5 9 −7
Apply elementary row operations to the augmented matrix to get
REF and RREF.
 
1 −1 3 1 H21 (−2)
 
 2
 1 0 5  H31 (1)

−1 −5 9 −7 ∼

Mehmet E. KÖROĞLU 8
Çözüm:2
 
1 −1 3 1
 
2. The augmented matrix of the system is 
 2 1 0 5  .
−1 −5 9 −7
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 1 H21 (−2) 1 −1 3 1 H2
  3 
1 0 5  H31 (1)  0 3 −6 3  H3 −1
  
 2   
 6
−1 −5 9 −7 ∼ 0 −6 12 −6 ∼

Mehmet E. KÖROĞLU 8
Çözüm:2
 
1 −1 3 1
 
2. The augmented matrix of the system is 
 2 1 0 5  .
−1 −5 9 −7
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 1 H21 (−2) 1 −1 3 1 H2
  3 
1 0 5  H31 (1)  0 3 −6 3  H3 −1
  
 2   
 6
−1 −5 9 −7 ∼ 0 −6 12 −6 ∼
 
1 −1 3 1
 0 1 −2 1  H32 (−1)
 
  ∼
0 1 −2 1

Mehmet E. KÖROĞLU 8
Çözüm:2
 
1 −1 3 1
 
2. The augmented matrix of the system is 
 2 1 0 5  .
−1 −5 9 −7
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 1 H21 (−2) 1 −1 3 1 H2
  3 
1 0 5  H31 (1)  0 3 −6 3  H3 −1
  
 2   
 6
−1 −5 9 −7 ∼ 0 −6 12 −6 ∼
   
1 −1 3 1 1 −1 3 1
 0 1 −2 1  H32 (−1)  0 1 −2 1  H12 (1)
   
  ∼   ∼
0 1 −2 1 0 0 0 0

Mehmet E. KÖROĞLU 8
Çözüm:2
 
1 −1 3 1
 
2. The augmented matrix of the system is 
 2 1 0 5  .
−1 −5 9 −7
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 1 H21 (−2) 1 −1 3 1 H2
  3 
1 0 5  H31 (1)  0 3 −6 3  H3 −1
  
 2   
 6
−1 −5 9 −7 ∼ 0 −6 12 −6 ∼
   
1 −1 3 1 1 −1 3 1
 0 1 −2 1  H32 (−1)  0 1 −2 1  H12 (1)
   
  ∼   ∼
0 1 −2 1 0 0 0 0
 
1 0 1 2
 
 0 1 −2 1  .
 
Mehmet E. KÖROĞLU 8
0 0 0 0
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

Mehmet E. KÖROĞLU 9
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

 
1 0 1 2
 
4. Since [A|b] ∼  0 1 −2 1 


0 0 0 0

Mehmet E. KÖROĞLU 9
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

 
1 0 1 2
  x = 2−z
4. Since [A|b] ∼  0 1 −2 1 

 we have y = 1 + 2z .
0 0 0 0

Mehmet E. KÖROĞLU 9
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

 
1 0 1 2
  x = 2−z
4. Since [A|b] ∼  0 1 −2 1 

 we have y = 1 + 2z . Then
0 0 0 0
x = 2−t
for arbitrary parameter z = t ∈ R we have y = 1 + 2t . Then
z =t
     
x 2 −1
     
x =  y  =  1 +t 2 
    
 is the solution of the system.
z 0 1

Mehmet E. KÖROĞLU 9
Homogenous System of Linear
Equations
Homogenous System of Linear Equations




 a11 x1 + a12 x2 + · · · + a1n xn = 0

 a21 x1 + a22 x2 + · · · + a2n xn = 0

.. (2)




.
am1 x1 + am2 x2 + · · · + amn xn = 0



is a homogeneous linear system of m equations in n unknowns.

Mehmet E. KÖROĞLU 10
Homogenous System of Linear Equations




 a11 x1 + a12 x2 + · · · + a1n xn = 0

 a21 x1 + a22 x2 + · · · + a2n xn = 0

.. (2)




.
am1 x1 + am2 x2 + · · · + amn xn = 0



is a homogeneous linear system of m equations in n unknowns.

A homogenous system always has solution, because
rank(A) =rank([A|b]) .

Mehmet E. KÖROĞLU 10
Homogenous System of Linear Equations




 a11 x1 + a12 x2 + · · · + a1n xn = 0

 a21 x1 + a22 x2 + · · · + a2n xn = 0

.. (2)




.
am1 x1 + am2 x2 + · · · + amn xn = 0



is a homogeneous linear system of m equations in n unknowns.

A homogenous system always has solution, because
rank(A) =rank([A|b]) .
1. If rank(A) = n, i.e., the number of unknowns and the number
of equations are equal, then the system has zero solution as
the unique solution.

Mehmet E. KÖROĞLU 10
Homogenous System of Linear Equations




 a11 x1 + a12 x2 + · · · + a1n xn = 0

 a21 x1 + a22 x2 + · · · + a2n xn = 0

.. (2)




.
am1 x1 + am2 x2 + · · · + amn xn = 0



is a homogeneous linear system of m equations in n unknowns.

A homogenous system always has solution, because
rank(A) =rank([A|b]) .
1. If rank(A) = n, i.e., the number of unknowns and the number
of equations are equal, then the system has zero solution as
the unique solution.
2. If rank(A) = r < n, i.e., the number of unknowns is greater
than the number of equations, then the system has infinitely
many solutions depending on n − r parameters.
Mehmet E. KÖROĞLU 10
Homogenous System of Linear Equations

Example 


 x − y + 3z = 0
Let the homogenous system 2x + y = 0 be given.

 −x − 5y + 9z = 0


Mehmet E. KÖROĞLU 11
Homogenous System of Linear Equations

Example 


 x − y + 3z = 0
Let the homogenous system 2x + y = 0 be given.

 −x − 5y + 9z = 0


 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.

Mehmet E. KÖROĞLU 11
Homogenous System of Linear Equations

Example 


 x − y + 3z = 0
Let the homogenous system 2x + y = 0 be given.

 −x − 5y + 9z = 0


 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.
2. Write the augmented matrix of the given system and put it
into RREF.

Mehmet E. KÖROĞLU 11
Homogenous System of Linear Equations

Example 


 x − y + 3z = 0
Let the homogenous system 2x + y = 0 be given.

 −x − 5y + 9z = 0


 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.
2. Write the augmented matrix of the given system and put it
into RREF.
3. Find rank (A) and rank ([A|b]) .

Mehmet E. KÖROĞLU 11
Homogenous System of Linear Equations

Example 


x − y + 3z = 0
Let the homogenous system 2x + y = 0 be given.

 −x − 5y + 9z = 0


 
x
 
1. For the vector of unknowns x = 
 y  , state the system as

z
Ax = b.
2. Write the augmented matrix of the given system and put it
into RREF.
3. Find rank (A) and rank ([A|b]) .
4. Find all the solutions of the system.

Mehmet E. KÖROĞLU 11
Çözüm:1

1. We rearrange the system as follows:

x −y +3z = 0
2x +y = 0
−x −5y +9z = 0

Mehmet E. KÖROĞLU 12
Çözüm:1

1. We rearrange the system as follows:

x −y +3z = 0
2x +y = 0
−x −5y +9z = 0

Then     
1 −1 3 x 0
    
 2
 1 0  y  =  0 
   
.
−1 −5 9 z 0

Mehmet E. KÖROĞLU 12
Çözüm:2
 
1 −1 3 0
 
2. The augmented matrix of the system is 
 2 .
1 0 0 
−1 −5 9 0

Mehmet E. KÖROĞLU 13
Çözüm:2
 
1 −1 3 0
 
2. The augmented matrix of the system is 
 2 1 0 .
0 
−1 −5 9 0
Apply elementary row operations to the augmented matrix to get
REF and RREF.

Mehmet E. KÖROĞLU 13
Çözüm:2
 
1 −1 3 0
 
2. The augmented matrix of the system is 
 2 1 0 .
0 
−1 −5 9 0
Apply elementary row operations to the augmented matrix to get
REF and RREF.
 
1 −1 3 0 H21 (−2)
 
 2
 1 0 0  H31 (1)

−1 −5 9 0 ∼

Mehmet E. KÖROĞLU 13
Çözüm:2
 
1 −1 3 0
 
2. The augmented matrix of the system is 
 2 1 0 .
0 
−1 −5 9 0
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 0 H21 (−2) 1 −1 3 0 H2
  3 
1 0 0  H31 (1)  0 3 −6 0  H3 −1
  
 2   
 6
−1 −5 9 0 ∼ 0 −6 12 0 ∼

Mehmet E. KÖROĞLU 13
Çözüm:2
 
1 −1 3 0
 
2. The augmented matrix of the system is 
 2 1 0 .
0 
−1 −5 9 0
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 0 H21 (−2) 1 −1 3 0 H2
  3 
1 0 0  H31 (1)  0 3 −6 0  H3 −1
  
 2   
 6
−1 −5 9 0 ∼ 0 −6 12 0 ∼
 
1 −1 3 0
 0 1 −2 0  H32 (−1)
 
  ∼
0 1 −2 0

Mehmet E. KÖROĞLU 13
Çözüm:2
 
1 −1 3 0
 
2. The augmented matrix of the system is 
 2 1 0 .
0 
−1 −5 9 0
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 0 H21 (−2) 1 −1 3 0 H2
  3 
1 0 0  H31 (1)  0 3 −6 0  H3 −1
  
 2   
 6
−1 −5 9 0 ∼ 0 −6 12 0 ∼
   
1 −1 3 0 1 −1 3 0
 0 1 −2 0  H32 (−1)  0 1 −2 0  H12 (1)
   
  ∼   ∼
0 1 −2 0 0 0 0 0

Mehmet E. KÖROĞLU 13
Çözüm:2
 
1 −1 3 0
 
2. The augmented matrix of the system is 
 2 1 0 .
0 
−1 −5 9 0
Apply elementary row operations to the augmented matrix to get
REF and RREF.
     
1
1 −1 3 0 H21 (−2) 1 −1 3 0 H2
  3 
1 0 0  H31 (1)  0 3 −6 0  H3 −1
  
 2   
 6
−1 −5 9 0 ∼ 0 −6 12 0 ∼
   
1 −1 3 0 1 −1 3 0
 0 1 −2 0  H32 (−1)  0 1 −2 0  H12 (1)
   
  ∼   ∼
0 1 −2 0 0 0 0 0
 
1 0 1 0
 
 0 1 −2 0  .
 
Mehmet E. KÖROĞLU 13
0 0 0 0
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

Mehmet E. KÖROĞLU 14
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

 
1 0 1 0
 
4. Since [A|b] ∼  0 1 −2 0 

 we have
0 0 0 0

Mehmet E. KÖROĞLU 14
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

 
1 0 1 0
  x = −z
4. Since [A|b] ∼  0 1 −2 0 

 we have y = 2z
0 0 0 0

Mehmet E. KÖROĞLU 14
Çözüm:

3. rank (A) = rank ([A|b]) = 2.

 
1 0 1 0
  x = −z
4. Since [A|b] ∼  0 1 −2 0 

 we have Then for
y = 2z
0 0 0 0
x = −t
arbitrary parameter z = t ∈ R we get y = 2t . Thus, all
z =t
   
x −1
   
solutions are of the form x =  y  = t  2 
  
.
z 1

Mehmet E. KÖROĞLU 14
 ?

Mehmet E. KÖROĞLU 14