Chapter 2

Systems of linear equations

2.1 Systems of linear equations

2.1.1 Definition
A linear equation in the variable x1 , x2 , . . . , xn , is an equation that cam be
written in the following form:

a1 x 1 + a2 x 2 + · · · + an x n = b

I In which b and the coefficients (a1 , a2 , . . . , an ) are a real constants.

Example:

1
x1 + x2 = −4x2 is linear equation.
2

but the eq: 4x1 x2 − x3 = 5 is not linear.

Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

2.1.2 Definition
A system of a linear equations or a linear system is a collection of one or more
linear equations, involving the same variables.
ex: 


 a11 x1 + a12 x2 + a13 x3 + · · · + a1n xn = b1

 a21 x1 + a22 x2 + a23 x3 + · · · + a2n xn = b2


(S)  .
.
 .


am1 x1 + am2 x2 + am3 x3 + · · · + amn xn = bm




I (S) is the system of m linear equation in n unknowns.

I The set of values xi (x1 , x2 , . . . , xn ) is unknowns.(also called variables).
I (aij ) 16i6n called the coefficients of the linear system and bi (i = 1, . . . , m)
16j6m
be a real numbers.
I A vector ~x = (x1 , x2 , . . . , xn ) that satisfy all The equations of (S) is called:
Solution of the system.

2.2 Representing system of linear equations

using Matrices
Consider a system of m linear equation in n unknowns




 a11 x1 + a12 x2 + a13 x3 + · · · + a1n xn = b1 .
a21 x1 + a22 x2 + a23 x3 + · · · + a2n xn = b2

(S1 )

..
.am1 xn + am2 x2 + am3 x3 + · · · amn xn = bn .




In matrix form, we can write the system of equations (S1 ) as :

    
a a12 · · · a1n x b
 11  1   1
 a21

a22 · · · a2n  x2   b2 
   
 .. .. ..  ..  =  .. 
.. 
    
 .
 . . .   . 
 
 . 
 
am1 am2 · · · amn xn bm
A X B
I AX = B.

Where A, B and X are respectively called the coefficient matrix, require-

Page 2
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

ment vector and The solution vector.

2.3 Non-Homogeneous and Homogeneous sys-

tems of linear Equations:
The system of equations given by (S1 ) is said to be the system of non-homogeneous
linear equations if ar least one bi 6= 0 ie B 6= 0 and it is called homogeneous if
each bp = 0,
Thus matrix form of homogeneous linear equations is AX = 0

2.4 Square system of equations:

A linear system of equations in which the number of variable equals the number
of equations ( m = n) -ie The coefficient matrix ( A ) of a square system is a
square matrix.

2.5 Rectangular System of equations:

A linear system of equations in which The number of variables not equals the
number of equations. (m 6= n). ie. A is a Rectangular matrix.

Note:
A system of linear equations has exactly one of the following excursive conclu-
sion:

(a) no solution.

(b) exactly one solution.

(c) infinitely many solutions.

Page 3
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

2.6 Methods to solve a system of equations:

2.6.1 Cramer’s systeme:
Definition. A Cramer’s systeme is a system in which the number of variable
equal the number of equations (m = n) and |A| =
6 0.
The Cramer’s system has exactly one solution.

Method to solve Cramer’s system

→ for solving Cramer’s system one of These can be used:

• Cramer’s rule (or using of determinant).

• Matrix Inversion method.

• Gauss elimination method.

Consider a Cramer’s system AX = B . . . (S)

(1) Cramer’s rule:

Cramer’s rule is a method of solving a System of linear equations. AX = B
using determine Cramer’s rule is giving by the equation:

|Ai |
xi =
|A|

Where |Ai | is the same determinant as |A| where ith column is replaced
with B and Xi=1,...n is solution of the system (S).
Example 1: using Crane’s rule, solve


 21 x1 − x2 = 5
 x 1 + x2 = 4

Solution: let us write These equations in The Matrix forme:

 
2 −1  x1 5
! !
=
4

1 1 x2

1- We calculate |A| : |A| = 2 + 1 = 3. and m = 2

Page 4
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

so the system has a unique solution (Cramrs’ system) We have:

5 −1
4 1 9
x1 = = =3
3 3
.

2 5
1 4 3
x2 = = =1
3 3

Therefore:

3
!
X=
1

Example 2: using Cramer’s rule solve:

x1 − x2 + x3 = 4





2x1 + x2 − 3x3 = 0
x1 + x2 + x3 = 2



Solution: let us write These equations in The Matrix forme:

1 −1 1 4
    
x1
 2 1 −3   x  =  0  (S)
    
  2   
1 1 1 x3 2

we have: |A| = 10 and m = n.((S) is Cramer’s system).

⇒ using Cramer’s Rule we find:

Page 5
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

4 −1 1
0 1 −3
2 1 1 20
x1 = = =2
10 10
1 4 1
2 0 −3
1 2 1 −10
x2 = = = −1
10 10
1 −1 4
2 1 0
1 1 2 10
x3 = = =1
10 10

2
 

Therefore The given system has unique Solve as : X =  −1 

.
 


1
(2) Matrix Inversion method:

Firstly you have to write a Cramer’s system as Matrix forme AX = B,

you can solve for X by multipling each side of system by A−1 on the left
ie:

AX = B ⇒ A−1 AX = A−1 B
⇒ IX = A−1 B ⇒ X = A−1 B

I Then the system is consistent and has unique solution given by:
X = A−1 B Where A−1 is matrix inverse of matrix A.
Example :
use Matrix inversion method to solve
 2x1 − x2 + 3x3 = 9


 −3x + 4x = 5


1 2
(S1 ) and (S2 ) x1 + x2 + x3 = 6
 2x1 − x2 = −10 
x1 − x2 + x3 = 2



1-for (S1 ) :

Begin by writing The linear system in matrix form

Page 6
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

 
−3 4  x1 5
! !
 =
2 −1 x2 −10

1 4
 

• calculate A−1 : A−1 = 5 5 

 
 2 3 
5 5
Finally, multiply the matrix B by A−1

1 4
 
5
! !
5 5  −7
X=A−1 B =  3  −10 = −4
 
 4
5 5

2 − for (S2 ) :
writing (S2 ) in Matrix form
2 −1 3 9
    
x1
 1 1 1   x2  =  6
    
    
 
1 −1 1 x3 2
• Calculate A−1 :
 
−1 1 2 
1 1 

= 0

A−1
 − 
2 2 
1 3 
 
1

− −
2 2
• Multiply B by A−1

 
−1 1 2   
9 1

1 1   

 0

−  6 = 2 =X

2 2 
    
1 3  2
  

1 − − 3
2 2

Page 7
 Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

(2) Gauss Eliminations Method:

Consider the Cramer’s system, AX = B · · · (1)
I In This method, apply row elementary transforms transformation for matrix
on both A and B So that the Matrix à = (A | B) is reduced to the upper
triangular form. In this process we change A to A1 and B to B1 , Then AX = B
given A1 X = B1 . In When it’s solved by back substitution gives The required
solution of the given system of equation 1.
Example :
Solve the system

x1 − 2x2 + 3x3 = 2





2x1 − 3x3 = 3
x 1 + x2 + x3 = 0



By Gauss elimination method.

Solution :
the matrix form is :

1 −2 3 2
    
x1
 2 0 −3   x  =  3 
    
  2   
1 1 1 x3 0
1 3 2
 
−2
R2 − 2R1 → 
 0 4
 
−9 −1 
1 −2 3 2
  
1 1 1 0
A =  2 0 −3 3 
 
e 
1 3 2
 

−2
1 1 1 0
 0 4
 
R3 − R1 →  −9 −1 
0 3 −2 −2
1 −2 3 2 x1 − 2x2 + 3x3 = 2
  

3


 0 4 −9 −1  4x2 − 9x3 = −1
  
R3 − R2 →  ⇒
4  19 5   19 5
0 0 x3 = −

−


4 4 4 4
21
 

 19 
 
16
X=
 
 −

19 
5 
 

−
19

Page 8
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

2.6.2 Non Cramer’s system

The system is non Cramer’s system if

• The number of variables 6= The number of equation.

• or |A| = 0

Method to solve the non Cramer’s system

I we can solve the previous system using Gauss elimination method.

Types of non Cramer’s systems

1. More equations Than variables: (m > n) :

A linear system with more equations Than variables is called overdeter-

mined.

such a system usually has no solution or one solution or infinitely many

solution.

Example 1: Solve The system using Gauss Method

2x1 − 3x2 = 0 2 −3   0
    

 x1


In matrix form: 
2x1 + x2 = 8 −−−−−−−−→ 2 1  = 8
 
    
 x 2

5x1 − 2x2 = 7 5 −2 7



Solution:

using Gauss elimination method:

2 −3 0
 
2 −3 0 2 −3 0
   
 R2 − R1 → R2  0 4 11
8
 
 2 1 8  5  0 4 8 
  
 R3 − R2 → R3 

11 7

R3 − R1 → R3
    
5 −2 7 2 0 7 0 0 −4
2

As you can see, The final row states that:

0x1 + 0x2 = − 4 ? ⇒ No solutions.
which impossible

Page 9
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

Example 2:

2x1 − 3x2 = 0 2 −3 0
  



Gauss.M. 
2x1 + x2 = 8 −−−−−−→  2 1 8 


 
5x1 − 2x2 = 11. 5 −2 11



2 −3 0
 
2 −3 0
 
R2 → R2 − R1 
 0 4 11 
8

5 0 4 8

 R3 → R3 − R2 
 
11 8

R3 → R3 − R1    
2 0 11 0 0 0
2

 2x1 − 3x2 = 0
we have one solution: x1 = 3 , x2 = 2.
 4x2 = 8

3
!
X=
2

Example 3:

x1 + x2 = 1 1 1 1 1 1 1
    
 R3 → R2 − 2R1 



G.E.M. 
2x + 2x = 2 2 2 2  0 0 0 

1 2 −−−−−→  
  
R2 → R3  
3x1 + 3x2 = 3 3 3 3 0 0 0



n
x1 = 1 − x2 ⇒ We have infinitely many solutions

 
1 − x2 
X= , ∀x2 ∈ R.
x2

Activity: Solve The following system using Gauss:

3x1 + 3x2 + 2x3 = 1





x1 + 2x2 = 4







x1 + 10x2 + 3x3 = −2
2x1 − 3x2 − x3 = 5



Page 10
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

2. More Variables Than equations ( n > m ):

(1) A linear system with fewer equations than variables is called un-
derdetermined such a system usually has infinitely many different
solutions.

Example :

  
 x1 
x1 + 3x2 + 2x3 = 2 1 3 2  2

 !

 x =

2 
4

in Matrix form
 x1 + x2 + x3 = 4

 −−−−−−−−→ 1 1 1 
x2

using Gauss-elimination Method:

   
1 3 2 2  1 3 2 2 
 R2 → R2 − R1 
1 1 1 4 0 −2 −1 2

− (2 + x3 )

x2 =


2
 
x1 + 3x2 + 2x3 = 2


 
⇒
 −2x2 − x3 = 2
⇒ and
10 − x3


 x1 =



2

We have infinitely many solutions

10 − x3
 

2
 
−2 − x3
 
X= 
  , ∀x3

∈R
2
 
 
x3

3. if |A| = 0 and (m = n) :

Let’ s suppose you have 2 systems:

x1 + x2 + x3 = 2 −3x1 − 5x2 + 36x3 = 10

 

 

 
(S1 ) x2 − 3x3 = 1 , (S2 ) −x1 + 7x3 = 5
 
2x1 + x2 + 5x3 = 0 x1 + x2 − 10x3 = −4

 


Page 11
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

Solve a system using Gauss-elimination Method

Solution: for ( S1 ):
(S1 )
−−→ in Matrix form :

1 1 1 2
    
x1
and|A| = 0 + 2(−4)
 0 1 −3   x  =  1 
    
 2 
=0
  
2 1 5 x3 0

The augmented matrix is:

1 1 1 2 1 1 1 2
   

 0 1 −3 1  R3 → R3 − 2R1  0 1 −3 1 
   
   
2 1 5 0 0 −1 3 −4

1 1 1 2
 

R3 → R3 + R2  0 1 −3 1  . As you can see, the final row states

 


0 0 0 −3
that:
0x1 + 0x2 + 0x3 = −3

Which impossible, 0 6= −3, Therefore This system of 3 equations has No

solution.

for ( S2 ):
−3 −5 36 10
    
x1
(S2 )
−−→ in Matrix form  0 7  x  =  5 
    
 −1  2   
1 1 −10 x3 −4

|A| = 0

The augmented matrix is:

−3 −5 36 10
 

 −1 0 7 5 
 
 
1 1 −10 −4

Page 12
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

−3 −5 36 10
 
R2 → R2 + R3 
 0 1 −3 1

1

R3 → R3 + R1  2 2
 

3 0 − 2 −
3 3
2
R3 → R3 + R2
3

−3 −5 36 10
 

 −3x − 5x + 36x = 10
1 2 3
;⇒ 
 0 1 −3 1 
 

x2 − 3x3 = 1
0 0 0 0

⇒ x2 = 1 + 3x3 and x1 = −5 + 7x3

Therefore this system of 3 equations has infinitely many solutions.

−5 + 7x3
 

X =  1 + x3 
 
 , ∀x3 ∈ R


x3

2.6.3 Solving Homogeneous system of linear equations:

The homogeneous system is always consistent (have a solution) and there are
only two different solution:

1. a unique solution (the trivial solution).

2. infinitely many solution.

Example : Solve this following systems using Gauss method:

x1 + 2x2 − x3 = 0 2x1 − x2 + 3x3 = 0

 

 

 
(S1 )  2x2 + 3x3 = 0 (S2 )  x1 + x2 + x3 = 0
x1 + 4x2 + 2x3 = 0 x1 − x2 + x3 = 0

 


 x1 + 3x2 − 2x3 = 0
(S3 )
 x1 + 3x2 − 4x3 = 0

Solution :
→ for (S1 ): (S1 ) in Matrix form:

Page 13
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

1 2 −1 0
    
x1
 0 2 3  x  =  0  |A| = −8+8 = 0(S1 ) is non Cramer’s system
    
  2   
1 4 2 x3 0

The augmented matrix is:

1 2 −1 0 1 2 −1 0
   

 0 2 3 0  R3 → R3 − R1  0 2 3 0 
   
 
 
1 4 2 0 0 2 3 0
1 2 −1 0
 

 x + 2x − x = 0
1 2 3
0 2 3 0
 
R3 → R3 − R2  ⇒
   2x2 + 3x3 = 0
0 0 0 0
We have:
3
⇒ x2 = − x3 and x1 = 4x3
2

4x3
 
 −3 
There are infinitely many solution X =  x3 ; ∀x3 ∈ R
 
2

 
x3
one in particular is a trivial solution.

→ for (S2 ) :

(S2 ) in Matrix form:

2 −1 3 0   m=n
    
x1

 1 1 1  x  =  0 
  |A| = −2 6= 0
   
  2  
1 −1 1 0  (S2 ) is a Cramer’s system

x3

Then The homogeneous system has unique Solution x1 = 0, x2 = 0, x3 = 0

(or trivial solution)
0
 

X=  0 
 


0
for (S3 ):

Page 14
Chapter 2. Systems of linear equations Author: Dr. Guechi Meriem

  
1 3 −2   x1  0
!
S3 in matrix form:  =
1 3 4 x2 0
m 6= n (S3 ) is non Cramer’s system.
x1 = −3x2

   
1 3 0 1 3 0

−2 −2


  R2 → R2 − R1  ⇒ x2 = x2 There are
1 3 4 0 0 0 6 0 
x3 = 0


 
−3x2
infinitely many solution X =  x2   ; ∀x3 ∈ R
 


0
one in particular is a trivial solution.

Page 15