Solution of Linear System:

Existence and Uniqueness theorem: A linear system is consistent if and only if the rightmost column of
the augmented matrix is not pivot column i.e. if and only if an echelon form of the augmented matrix
has no row of the form [ 0……………..0 b]; b≠0

If a linear system is consistent, then the solution set contains either (i) a unique solution, when there is
free variable or (ii) infinitely many solutions, when there is at least one free variable.

Free variable is the variable corresponding to non pivot column of coefficient matrix of given linear
system.

Case I If the last row of augmented matrix in echelon form has the form

[ 0……………..0 b]; b≠0; no solution(inconsistent).

Case II If the last row of augmented matrix in echelon form has the form

[ 0……………..b c]; b≠0; consistent and unique solution.

Case III If the last row of augmented matrix in echelon form has the form

[ 0……………..0 0]; consistent and infinitely many solution.

Q. 1 Determine if the following system is consistent:

a. x1 – 2x2 + x3 = 0; 2x2 – 8 x3 = 8; - 4x1 + 5x2 + 9x3 = - 9

1 −2 1 0
Its augmented matrix is 0
[
−4 5
2 −8 8
9 −9 ]
We first reduce it into echelon form:

For we apply R3 → R3 + 4 R1

1 −2 1 0

[
~ 0 2 −8 8
0 −3 13 −9 ]
3
Again R3 → R3 + R
2 2

1 −2 1 0

[
~ 0
0 0
2 −8 8
1 3 ]
Solution exists so the system is consistent. To find solution we further change into reduced echelon
form. For: R2 → R2 +8 R3 ; R1 → R1−R3

1 −2 0 −3

[
~ 0 2 0 32
0 0 1 3 ]
1
. R2 → R
2 2

1 −2 0 −3

[
~ 0 1 0 16
0 0 1 3 ]
. R1 → R1 +2 R2

1 0 0 29

[
~ 0 1 0 16
0 0 13 ]
\x1 = 29; x2 = 16 and x3 = 3

b. x2 - 4x3 = 8; 2x1 – 3x2 + 2x3 = 1; 5x1 - 8x2 + 7x3 = 1

0 1−4 8
Its augmented matrix is 2 −3
[ 2 1
5 −8 2 1 ]
We first reduce it into echelon form:

For we apply R1 ↔ R2

2 −3 2 1

[
~ 0 1 −4 8
5 −8 7 1 ]
5
Again R3 → R3 + R
2 1

2 −3 2 1

[
~ 0 1 −4 8
0 −1 /2 2 3/2 ]
1
Again R3 → R3 + R
2 2
 2 −3 2 1

[
~ 0
0 0
1 −4 8
0 5/2 ]
Solution does not exist since 0 = 5/2 which is impossible, so the system is inconsistent.

c. x2 + 4x3 = - 5; x1 + 3x2 + 5x3 = - 2; 3x1 + 7x2 + 7x3 = 6 ans. (Inconsistent)

d. x1- 3x3 = 8; 2x1 + 2x2 + 9x3 = 7; x2 + 5x3 = -2 ans. (5,3,-1)

Q. 2 Write a system of linear equations that is equivalent to the following vector equation and solve
them.

6 −3 1

[ ] [ ][ ]
a. x 1 −1 + x 2 4 = −7
5 0 −5
b. x 1 [−23]+ x [85 ]+ x [−61 ]=[ 00]
2 3

Solution:

a. The linear system corresponding to given vector equation is

6x1 + 3x2 = 1; - x1 + 4x2 = 7; 5x1 + 0x2 = -5

6 −3 1
To solve: The augmented matrix for the system is −1 4 −7
5 0 −5 [ ]
We change it into echelon form

6 −3 1

[ ] 1
~ 0 7 /2 −41/6 [ R2 → R2 + R1]
0 5 /2 −35 /6
6

6 −3 1

[ ] 5
~ 0 7 / 2 −41/ 6 [ R3 → R2 + R2]
0 0 −265 /21
7

This gives that 0 = -265/21 which is impossible, so the given system has no solution i.e. the system is
inconsistent.

b. The linear system corresponding to given vector equation is

- 2x1 + 8x2 +x3= 0; 3 x1 + 5x2 – 6x3= 0;

8 1 0
To solve: The augmented matrix for the system [−23 5 −6 0 ]
We change it into echelon form

3
R2→ R 2+ R
2 2

8 1 0
~[−20 17 −9 /2 0 ]
We further change into reduced echelon form

1
R2→ R
17 2

8 1 0
~[−20 1 −9 /34 0 ]
R1 → R 1−8 R2

0 53/34 0
~[−20 1 −9 /34 0 ]
−1
R1 → R
2 1

~[ 10 0 53 /34 0
1 −9 /34 0 ]
9 9
From last row x2 - x3 = 0 or, x2 = x3
34 34

53 −53
And from first row x1 + x3 = 0 or, x1 = x3
38 34

−53

[ ]
x
x1 34 3

[]
−53
So x= x 2 = 9
x3
x
34 3
x3
1
34 3
34 [ ]
= x 9 where x3 is free variable. This consistent system has infinitely

many solutions.

Q. 3 Write a vector equation that is equivalent to the given system of equations and solve if consistent.

a. 8x2 +5x3= 0; 4 x1 + 6x2 – x3= 0; - x1 + 3x2 - 8x3= 0

b. x1 + 3x2 +x3= 1; - x1 - 9x2 + 2x3= -1; -3 x2 – 6 x3= - 3

Solution:

a. The given system is 8x2 +5x3= 0; 4 x1 + 6x2 – x3= 0; - x1 + 3x2 - 8x3= 0

The vector equation that is equivalent to the given system of equations is

0 8 5 0

[ ] [] [ ][]
x 1 4 + x 2 6 + x 3 −1 = 0
−1 3 −8 0

0 8 5 0

[
The augmented matrix for given system is 4 6 −1 0
−1 3 −8 0 ]
We first change into echelon form:

R3 ↔ R1

−1 3 −8 0

[
~ 4 6 −1 0
0 8 5 0 ]
R2 →R2 + 4R1

−1 3 −8 0

[
~ 0 18 −33 0
0 8 5 0 ]
4
R3 → R3 - R1
9

−1 3 −8 0
[
~ 0 18 −33 0
0 0 59/3 0 ]
It has a solution. We further change into reduced echelon form

3
R3 → R3
59

−1 3 −8 0

[
~ 0 18 −33 0
0 0 1 0 ]
R2 → R 2+ 33R3 ; R1 → R 1+ 8R3
 −1 3 00
~ 0
[ 0
18 0 0
0 10 ]
1
R2 → R2
18

−1 3 0 0

[
~ 0 1 00
0 0 10 ]
R1 → R 1−3R2

−1 0 0 0
~ 0
[ 1 00
0 0 10 ]
R1 →−R 1

1 0 00
~ 0
[ 1 00
0 0 10 ]
Hence, x1 = 0, x2 = 0 and x3 = 0

This is the case of unique solution.

b. Given system is x1 + 3x2 +x3= 1; - x1 - 9x2 + 2x3= -1; -3 x2 – 6 x3= - 3

The vector equation that is equivalent to the given system of equations is

1 3 1 1

0 [ ] [ ] [ ][ ]
x 1 −4 + x 2 −9 + x 3 2 = −1
−3 −6 −3

The augmented matrix for given system is

1 3 1 1

[ −4 −9 2 −1
0 −3 −6 −3 ]
We first change into echelon form:

R2 →R2 + 4R1
 1 3 1 1

[
~ 0 3 6 3
0 −3 −6 −3 ]
R3 → R3 + R 2

1 3 11

[
~ 0 3 63
0 0 00 ]
It has a solution. We further change it into reduced echelon form:

1
R2 → R2
3

1 3 11

[
~ 0 1 21
0 0 00 ]
R1 → R 1−3R2

1 0 −5 −2

[
~ 0 1 2 1
0 0 0 0 ]
Since the third column is non-pivot column x 3 is free variable and x2 and x1 are basic variables being first
and second columns are pivot columns.

From second row; x2 + 2x3 = 1 or, x2 = 1 – 2x3

And, x1 – 5 x3 = -2 or, x1 = -2 + 5x3

x 1 −2+5 x 3 −2+ 5 x 3 −2 5 x3 5

[ ][ ][ ][ ][ ][ ] [ ]
−2
Now, x= x 2
= 1−2 x 3
= 1−2 x 3
= 1 + −2 x 3
= 1 + x 3 −2
x3 x3 0+1 x 3 0 x3 0 1

Here we are free to choose the value of x3. Different values of x3 give different x so we can get infinitely
many solutions. For example,

−2 5 −2+5 3

[ ] [ ][ ][ ]
1. We take x3 = 1, x= 1 +1 −2 = 1−2 = −1
0 1 0+1 1
 −2 5 −2

[][][]
2. We take x3 =0, x= 1 +0 −2 =¿ 1
0 1 0
etc.

This is the case of infinitely many solutions.

Homogeneous Linear system: a linear system is called homogeneous if it can be written in the form of A

x1

⃗x =0 where A is m´n matrix,

⃗ x
⃗ =
.

.
xn
[]
. and 0⃗ zero vector.

⃗ ⃗
.

.
0
[]
Trivial and nontrivial solution: The linear system A ⃗x =0 always has one solution ⃗x =0= . . This

solution is called trivial solution. The nonzero solution if exists is called the nontrivial solution.

Nontrivial solution exists iff the echelon form of augmented matrix of A ⃗x =0⃗ has a row of the form [0……
0 0].

Q. No. 4 Determine if the following homogeneous has a nontrivial solution.

a. x1- 3x2 +7x3= 0; -2 x1 + x2 – 4x3= 0; x1 + 2x2 + 9x3= 0

b. 2x1- 5x2 +8x3= 0; -2 x1 - 7x2 + x3= 0; 4x1 + 2x2 + 7x3= 0

Solution:

a. Given linear system is x1- 3x2 +7x3= 0; -2 x1 + x2 – 4x3= 0; x1 + 2x2 + 9x3= 0

1 −3 7 0
Its augmented matrix is −2
[ 1
1 −4 0
2 9 0 ]
We transform it into echelon form

R2→R2 +2R1; R3→R3 - R1

1 −2 70

[
~ 0 −5 10 0
0 5 20 ]
R3→R3 – R2

1 −2 7 0

[
~ 0 −5 10 0
0 0 12 0 ]
It has no nontrivial solution because it has no free variable since there is no non-pivot column.

b. 2x1- 5x2 +8x3= 0; -2 x1 - 7x2 + x3= 0; 4x1 + 2x2 + 7x3= 0

Solution: Given linear system is 2x1- 5x2 +8x3= 0; -2 x1 - 7x2 + x3= 0; 4x1 + 2x2 + 7x3= 0

2 −5 8 0
Its augmented matrix is −2 −7
[ 4
10
2 70 ]
We transform it into echelon form

R2→R2 +R1; R3→R3 -2 R1

2 −5 8 0
~
[0 −12 9 0
0 12 −9 0 ]
R3→R3 + R2

2 −5 80

[
~ 0 −12
0 0
90
00 ]
It has a nontrivial solution since column third is non-pivot and thus x 3 is free variable.

To find the nontrivial solution we further change it into reduced echelon form;

1
R2→− R2
12

2 −5 8 0

[
~ 0 1 −3 /4 0
0 0 0 0 ]
R1→ R1 +5R2

2 0 17 /4 0

[
~ 0 1 −3 /4 0
0 0 0 0 ]
 1
R1→ R1
2

1 0 17 /8 0

[
~ 0 1 −3 /4 0
0 0 0 0 ]
X3 is free variable.

3 3
From second row, x2 - x3 = 0 or, x2 = x3
4 4

17 −17
From first row, x1 + x3 = 0 or, x1 = x3
8 8

−17

[ ][
x
x1 8 3

[]
−17 /8
x= x 2 = 3
x3
x
4 3
x3
=x 3 3/4
1 ]
Q. No. 5 Determine the solution of following non-homogeneous linear system:

a. x1-+ 3x2 +x3= 1; -4 x1 - 9x2 +2x3= -1; -3x2 - x3= 0

b. 2x1 +5x2 +6x3= 13; 3 x1 + x2 - 4x3= 0; x1 - 3x2 - 8x3= -10

Solution: Given linear system:

2x1 +5x2 +6x3= 13; 3 x1 + x2 - 4x3= 0; x1 - 3x2 - 8x3= -10

2 5 6 13

[
Its augmented matrix is 3 1 −4 0
1 −3 −8 −10 ]
We transform it into echelon form

R1↔R3

1 −3 −8 −10

[
~ 3 1 −4 0
2 5 6 13 ]
R2→R2 - 3R1; R3→R3 -2 R1
 1 −3 −8 −10

[
~ 0 10 20 30
0 11 22 33 ]
11
R3→R3 + R2
10

1 −3 −8 −10

[
~ 0 10 20 30
0 0 0 0 ]
Since column third is non-pivot, so x 3 is free variable. The system has infinitely many solutions.

To find the solutions we further change it into reduced echelon form;

1
R2→ R2
10

1 −3 −8 −10

[
~ 0
0 0
1 2 3
0 0 ]
R1→ R1 + 3R2

1 0 −2 −1

[
~ 0 1 2 3
0 0 0 0 ]
X3 is free variable.

From second row, x2 - 2x3 = 3 or, x2 = 3 + 2x3

From first row, x1 + 2x3 = - 1 or, x1 = −1 - 2x3

x 1 −1+2 x3 −1 2

x3 [][ ][ ] [ ]
Hence, x= x 2 = 3−2 x 3 = 3 + x3 −2 Here different choices of x3 give different solution and we
x3 0
get infinitely many solutions.
1

A linear system has infinitely many solution if

1. Any row of the echelon form of augmented matrix is zero row

I.e. there is a row of the form [0 0 0 0 0]
 2. Or, there is at least one non pivot column in the matrix A
(coefficient matrix) I.e. there is at least one free variable.
HW Q. No. 15, 16, 12, 14 of exercise 1.1 pg. 10 book

Pg 37 Q. No. 10 Example 3 pg 52

Pg 55 Q. No. 15 and 16