SYSTEM OF LINEAR EQUATIONS

Prof. Dr. Shailendra R. Bandewar

LINEAR SYSTEMS IN TWO UNKNOWNS
Equations of the type
a1 x + b1 y = c1
a2 x + b2 y = c2
are linear equation in 2-Dimension.
Each equation geometrically represents a straight line.
we say that the system is consistant iff we have some
real numbers x, y such that both equations are satisfied
for these values of x and y. i.e. the system of equations
have a solution. The question arrises is when we have a
solution? and if it has a solution is it really unique?
Consider two equations in two unknowns
a1 x + b1 y = c1
a2 x + b2 y = c2
a1 b1 c1
The system is inconsistent if =  .
a2 b2 c2
a1 b1
The system has unique solution if  .
a2 b2
The system has infinite number of solutions
a1 b1 c1
if = = .
a2 b2 c2
GEOMETRY OF SOLUTIONS OF LINEAR
SYSTEMS IN TWO UNKNOWNS
 LINEAR SYSTEMS IN THREE UNKNOWNS
Equations of the type
a1 x + b1 y + c1 z = d1
a2 x + b2 y + c2 z = d 2
a3 x + b3 y + c3 z = d 3
are linear equation in 3-Dimension.
Each equation geometrically represents a Plane. we say
that the system is consistent iff we have some real
numbers x, y,z such that all equations are satisfied for
these values of x, y and z. i.e. the system of equations
have a solution. So the question arrises is when we have
a solution? and if it has a solution is it really unique?
LINEAR SYSTEMS IN THREE UNKNOWNS
In case of three equations in three unknowns it is really
difficult to answer whether the system is consistent or not
and if consistent what kind of solutions do we have can
not be decided just by observing the coefficients.
Geometrically there are 3-distinct ways to have infinite
number of solutions and 4 distinct ways where we have no
solution.

How this can be decided?

➢ This is the difficulty level in 3 equations in three
unknowns, but in actual models we may have m
equations in n unknowns. How to dealt with such
situations is the objective of this topic.
 DIFFICULTY IN ANALYZING THE SYSTEM
GEOMETRICALLY

 We have experience the difficulty of

analyzing the solution of system of linear
equations.
 So, natural question is how to decide
weather the system is consistent or not?
if consistent what kind of solution do we
have?
 Therefore I am Introducing the concept of
rank of a matrix, and how it helps to
find the answers to the above questions?
 RANK
 Rank of a Matrix : Let Amn be any matrix, r is
said to a rank of the matrix A denoted by  ( A) if
the matrix has at least one non-zero minor of
order r.
and all the minors of order r+1 are zero.
OR
 The order of highest order non-vanishing minor is
the rank of the matrix.

Rank of A is denoted by =  ( A)
Consder the follwoing matrix
1 1 −1 2 
A =  2 2 −2 4 
 2 2 −2 1 
There is one non-zero minor of order 1, ρ(A)=1, if
all the minors of order 2 are zero.
There are 18 minors of order 2,
−2 4
but one of the minor =6  0,   (A)  1.
−2 1
  (A)=2 if all the minors of order 3 are zero.
and there are 4 minors of order 3
1 1 −1 1 1 2
2 2 −2 = 0, 2 2 4 =0
2 2 −2 2 2 1
1 −1 2 1 −1 2
2 −2 4 = 0, 2 −2 4 = 0
2 −2 1 2 −2 1
  ( A) = 2
It involves too many calculations and it is time
consuming to find rank by using the definition.
Elementary Transformations:
1. Interchange of any two rows or columns
R or ( R  R )
ij i , C or (C  C ) .
j ij i j

2. Multiplying any row or column by a non-zero constant ,

 Ri ,  C j ,   0
3. Adding in i th row a scalar multiple of corresponding elements
of j row (similarly for column) R +  R , C +  C
th
i j i j
Theorem: Elementary transformations do not alter the rank of
the matrix.
Echelon Form (Row reduced form)
(To reduce a matrix into an Echelon form, only row
transformations are permitted.)

1. All the non-zero rows are above any rows of zeros.

2. Each leading entry of a row is in a column of the right of the
leading entry of the row above it.
3. All entries in a column below the leading entry all zeros.
If the matrix in the echelon form satisfies the following
Additional conditions, then it is said to be reduced
echelon form
4. Leading entry in each nonzero row is one
5. Each leading 1 is the nonzero entry in its column.
Example : Determine which of the following matrices
are in echelon form and which are reduced echelon
form:
1 2 3 4  1 1 −1 0 2 
  
(i) 0 1 0 2  (ii) 0 0 0 2 7  
0 0 0 2  0 0 0 0 0 
→ Echelon form
1 0 3 0  1 1 −1 0 2 
(iii ) 0 1 0 0  (iv) 0 0 0 1 7 
0 0 0 1  0 0 0 0 0 
→ Re duced Echelon form
ALGORITHM TO REDUCE THE MATRIX INTO
ECHELON MATRIX
 a11 a12 . . a1n 
a a22 . . a2 n 
A =  21
 . . . . . 
 
 am1 am 2 . . Amn 

Step 1: Make a11 → 1 by rowtransformation.

Step 2 : Make a21 , a31 ,..., am1 → 0.
Step 3 : If you observed that any two rows
prportionate make one or more rows zero.
Step 3 : Make a22 → 1
step 4 : Make a32 , a42 ,..., am 2 → 0.
continue the procedure till it reduces to echlon form
EXAMPLES
1. F in d the rank of a matrix
5 5 5 5
6 7 8 9
by reducing it to echelon form A =  
11 12 13 14 
 
16 17 18 19 
5 5 5 5
6 7 8 9 
Solution : A =  (− R1 + R2 )
11 12 13 14 
 
16 17 18 19 
1 2 3 4
6 7 8 9 
 ( R2 − 6 R1 , R3 − 11R1 , R4 − 16 R1 )
11 12 13 14 
 
16 17 18 19 
1 2 3 4
0 5 10 15 
 R3 − 2 R2 , R4 − 3R2
0 10 20 30 
 
0 15 30 45
1 2 3 4
0 5 10 15  1 
 R2  
0 0 0 0  5
 
0 0 0 0
1 2 3 4
0 1 2 3 
  ( A) = 2
0 0 0 0
 
0 0 0 0
2. Reduce the Matrix to its echelon form and
 2 3 −1 −1
1 −1 −2 −4 
hence find its rank A =  .
 3 1 3 −2 
 
 6 3 0 −7 
 2 3 −1 −1
1 −1 −2 −4 
Solution : A =   R1 − R2 
 3 1 3 −2 
 
 6 3 0 −7 
1 4 1 3
1 −1 −2 −4 
  R2 − R1 , R3 − 3R1 , R4 − 6 R1 
 3 1 3 −2 
 
 6 3 0 −7 
 1 4 1 3 
0 −5 −3 −7 
  R2  −1 R3
0 −11 0 −11 11
 
0 −21 −6 −25
1 4 1 3 
0 1 0 1 
  R3 + 5 R2 , R4 + 21R2
0 −5 −3 −7 
 
0 −21 −6 −25
1 4 1 3 1 4 1 3
0 1 0 1  0 1 0 1 
  R4 − 2 R3 
0 0 −3 −2  0 0 −3 −2 
   
0 0 −6 −4  0 0 0 0
 ( A) = 3
Elementary Matrix
A matrix obtained by a sin gle elementary
row transformation on identity matrix is
called Elementary Matrix.
Note :
(1) A single row transformation on a matrix
is equvalent to premultiplication by
corresponding Elementary Matrix.
(2) Inverse of an Elementary Matrix is
Elementary Matrix.
Express A as product of elementary matrices
1 3  R2 −5 R1 1 3 
let A =   ⎯⎯⎯→  A  
5 7  0 −8
1 0  R2 −5 R1  1 0
I =  ⎯⎯⎯→  E1 =  
0 1   −5 1 
 1 0  1 3   1 3 
Observe E1 A =     = 
 −5 1  5 7   0 −8 
 1 3  R2 ( −1/8)  1 3
A   → A  
 0 −8  0 1
1 0  R2 ( −1/8) 1 0 
I =  ⎯⎯⎯⎯ →  E1 =  
0 1  0 −1 / 8
1 0   1 0  1 3 
Observe E2 E1 A =      
 0 −1 / 8  −5 1  5 7 
 1 3
= 
 0 1
 1 3 R1 −3 R2 1 0 
A   → A  
 0 1 0 1 
1 0  R1 −3 R2 1 −3
I =  ⎯⎯⎯→  E3 =  
0 1  0 1
 E3 E2 E1 A
1 −3 1 0   1 0  1 3 
=       
0 1  0 −1 / 8  −5 1  5 7 
1 0 
= 
0 1 
−1 −1 −1
 A = E1 E2 E3 I
1. Express the matrix as a product of elementary
1 4 
matrices, A=  
2 9
Solution: A can be reduced to I as follows:
1 4  R2 − 2 R1 1 4 R1 −4 R2 1 0
 2 9  ⎯⎯⎯→ 0 1  ⎯⎯⎯→ 0 1 
     
The two succssesive row operations can
be performed on the left successively by
  1 0 1 −4
E1 =   , E2 =  
 −2 1  0 1 
 E2 E1 A = I
−1 1 0  1 4 
−1
A = E E = 
1 2   
 2 1  0 1 
Examples :
1. Find the echelon form and the rank of the
following matrices.
(a ) A 3  4 matrix of 1' s.
(b) A 4  4 matrix with aij = ( −1)i + j .
(c) A 4  4 matrix with aij = ( −1)ij .
(d ) A 3  4 matrix with aij = ( −1) . j
2. 𝑓𝑖𝑛𝑑 𝑡ℎ𝑒 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛𝑜𝑛 ′𝑎 ′ 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 (𝑖𝑓𝑝𝑜𝑠𝑠𝑖𝑏𝑙𝑒)
𝐴, 𝐵 𝑎𝑛𝑑 𝐶 ℎ𝑎𝑣𝑒 𝑟𝑎𝑛𝑘𝑠 1)1 𝑜𝑟2)2 𝑜𝑟3)3?

2 4 6 2 4 6 2 4 6
𝐴= 1 2 3 . B= 1 2 𝑏 C= 1 𝑏 3
3 6 𝑎 3 6 𝑎 3 6 𝑎
3. Determine the rank of the following matrices by
reducing it to an Echelon form.
 3 −2 0 −1 −7 
0 2 2 1 −5 
(a) A = 
1 −2 −3 −2 1 
 
0 1 2 1 −6 
1 2 1 0
3 2 1 2

(b) A = 1 3 −1 −3
 
 2 −1 2 5
 5 6 3 2 
REFERENCES
 Linear algebra and its applications, By Gilbert
strang, Cengage Learning India Edition. (Fourth
Edition)
 Linear algebra and its applications, By David
C. lay, Pearson (Third Edition).
 Advanced Engineering Mathematics, by Erwin
Creyszig,