You are on page 1of 55

MTL101::Linear Algebra and Differential Equations

Tutorial 1

Department of Mathematics
Indian Institute of Technology Delhi

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 1 / 55


Question 1
Suppose we have a system of three linear equations in real coefficients and
in two unknowns:

a1 x + b1 y = c1
a2 x + b2 y = c2
a3 x + b3 y = c3

Interpret geometrically the following statements:


(a) the system has no solutions.
(b) the system has a unique solution.
(c) the system has an infinitely many solutions.
Further, provide values to ai , bi , ci ∈ R, (i = 1, 2, 3), so that the above
statements hold.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 2 / 55


Question 1(a)
Solution: (a) The system has no solutions
All three lines are parallel.

L1 : x + y = −2
L2 : x + y = 0
L3 : x + y = 2

Two lines coincide and other line is parallel to them.

L1 : x + y = 0
L2 : x + y = 0
L3 : x + y = 2

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 3 / 55


Question 1(a) Contd.

Two lines are parallel and the third line intersects the other two lines.

L1 : x − 2y = 1
L2 : x + y = 0
L3 : x + y = 2

Three lines intersect at three different points.

L1 : x − 2y = 1
L2 : 2x − y = −4
L3 : x + y = 2

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 4 / 55


Question 1(b), 1(c)

(b) The system has a unique solution


All the three lines have only one common point of intersection.

L1 : x + y = 4
L2 : 3x + y = 7
L3 : x − y = −1
(c) The system has an infinitely many solutions.
All three lines coincide.

L1 : x + y = 1
L2 : x + y = 1
L3 : x + y = 1

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 5 / 55


Question 2
Suppose we have a system of three linear equations in real coefficients and
in three unknowns:

a1 x + b1 y + c1 z = d1
a2 x + b2 y + c2 z = d2
a3 x + b3 y + c3 z = d3

Interpret geometrically the following statements:


(a) the system has no solutions.
(b) the system has a unique solution.
(c) the system has an infinitely many solutions.
Further, provide values to ai , bi , ci , di ∈ R, (i = 1, 2, 3), so that the above
statements hold.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 6 / 55


Question 2(a)
Solution: (a) The system has no solutions.
All three planes are parallel.

P1 : x − 2y + z = −2
P2 : x − 2y + z = 1
P3 : x − 2y + z = 5

Two planes coincide and other plane is parallel.

P1 : x − 2y + z = −2
P2 : x − 2y + z = 5
P3 : x − 2y + z = 5

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 7 / 55


Question 2(a) Contd.
Two planes are parallel and the third plane intersects the other two
planes.

P1 : x + y − z = 1
P2 : x − 2y + z = 1
P3 : x − 2y + z = 5

Line of intersection of two planes is parallel to the third plane.

P1 : z = 0
P2 : y = 0
P3 : y + z = 2

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 8 / 55


Question 2(b), 2(c)
(b) The system has a unique solution.
Line of intersection of two planes intersects the third plane.

P1 : x = 0
P2 : y = 0
P3 : z = 0

(c) The system has an infinitely many solutions.


Line of intersection of two planes completely lie on the third plane.

P1 : y + z = 0
P2 : y = 0
P3 : z = 0
(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 9 / 55
Question 2(c) Contd.

All three planes coincide.

P1 : x − 2y + z = 5
P2 : x − 2y + z = 5
P3 : x − 2y + z = 5

Two planes coincide and the third plane intersects these planes.

P1 : x + y − z = 1
P2 : x − 2y + z = 5
P3 : x − 2y + z = 5

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 10 / 55


Question 3
Suppose we have a system of two linear equations in real coefficients and
three unknowns:

a1 x + b1 y + c1 z = d1
a2 x + b2 y + c2 z = d2

Interpret geometrically the following statements:


(a) the system has no solutions.
(c) the system has an infinitely many solutions.
Further, provide values to ai , bi , ci , di ∈ R, (i = 1, 2, 3), so that the above
statements hold. Can you have unique solution ?

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 11 / 55


Question 3(a)
Solution: (a) The system has no solution
Two planes are parallel.

P1 : x − 2y + z = −2
P2 : x − 2y + z = 5

(c) The system has an infinitely many solutions


Two planes coincide.

P1 : x − 2y + z = 5
P2 : x − 2y + z = 5

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 12 / 55


Question 3(c) Contd.

Two planes intersects each other.

P1 : x + y − z = 1
P2 : x − 2y + z = 5

As the number of unknown variables are greater than the number of


equations, the system cannot have a unique solution.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 13 / 55


Question 4
Let ~y = A~x and ~x = B w ~ with A and B being 2 × 2 matrices and
~ ∈ R2 . If ~y = C w
~x , ~y , w ~ , then find the relation between A, B and C .
h x i h y i h w i
1 1 1
Solution: Let ~x = , ~y = ,w~ = .
x2 y2 w2
The y1 y2 -coordinate system is related to the x1 x2 -coordinate system
by the formula ~y = A~x .
The x1 x2 -coordinate system is related to the w1 w2 -coordinate system
by the formula ~x = B w~.
The y1 y2 -coordinate system is related to the w1 w2 -coordinate system
by the formula ~y = C w ~ ∈ R2 ,
~ . Therefore for every w

~ = ~y = A~x = A(B w
Cw ~ ) = (AB)~
w.

Consequently, we have C = AB.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 14 / 55


Question 5
Let L1 , L2 are lower triangular and U1 , U2 are upper triangular, then which
of the following matrices are lower triangular and upper triangular ?
(a) L1 + L2 (b) U1 + L2 (c) U12 (d) L1 U1 (e) U1 L2

Recall: A = [aij ] and B = [bij ] are n × n real matrices.


A is lower triangular matrix if aij = 0 for i < j.
B is upper triangular matrix if bij = 0 for i > j.
If C = A + B and C = [cij ], then cij = aij + bij.
If D = AB and D = [dij ], then
n
X
dij = aik bkj .
k=1

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 15 / 55


Question 5(a), 5(b)

Solution: (a) L1 + L2
Let L1 = [pij ], L2 = [qij ] and L1 + L2 = [lij ].
As L1 , L2 are lower triangular matrices, pij = 0 and qij = 0 for i < j.
lij = pij + qij = 0 for i < j.
Hence, L1 + L2 is a lower triangular matrix.
Solution: (b) U1 + L2
U1 + L2 may neither be a lower triangular nor upper triangular matrix.
Consider    
1 2 1 0
U1 = , L2 = .
0 2 1 1

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 16 / 55


Question 5(c)

Solution: (c) U12


Let U1 = [uij ] and U12 = [vij ].
As U1 is upper triangular, uij = 0 for i > j.
For i > j
n
X
vij = uik ukj
k=1
Xj n
X
= uik ukj + uik ukj
k=1 k=j+1

= 0.

Hence, U12 is an upper triangular matrix.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 17 / 55


Question 5(d), 5(e)

Solution: (d) L1 U1 , (e) U1 L2


Both L1 U1 and U1 L2 may neither be an upper triangular matrix nor a
lower triangular matrix.
Consider    
1 2 1 0
U1 = , L1 = L2 = .
0 2 1 1
Then
 
1 2
L1 U1 = ,
1 4
 
3 2
U1 L2 = .
2 2

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 18 / 55


Question 6
Let ~x , ~y ∈ R2 and
   
cos α − sin α cos β − sin β
A= and B = .
sin α cos α sin β cos β

Show that ~y = A~x is the rotation of vector ~x counter clockwise by angle α.


Also compute ~y = An ~x and ~y = AB~x . Interpret the results geometrically.

Solution:

Let θ be the angle between


 x   1 
1
~x = and e~1 = .
x2 0
Then x1 = |~x | cos θ and
x2 = |~x | sin θ.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 19 / 55


Question 6 Contd.
 y 
1
~y = is a new position of ~x after rotating counter clockwise by
y2
an angle α.
Angle between ~y and e~1 is θ + α.
Therefore,

y1 = |~y | cos(θ + α) y2 = |~y | sin(θ + α)


= |~x | cos θ cos α − |~x | sin θ sin α = |~x | sin θ cos α + |~x | cos θ sin α
= x1 cos α − x2 sin α = x1 sin α + x2 cos α
Hence,
 y   cos α − sin α  x 
1 1
~y = = = A~x
y2 sin α cos α x2

Therefore, A rotates vector ~x by angle α.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 20 / 55


Question 6 Contd.

To understand the behavior of ~y = AB~x on ~x , note that


The product,
 cos α − sin α  cos β − sin β 
AB =
sin α cos α sin β cos β
cos(α + β) − sin(α + β)
 
=
sin(α + β) cos(α + β)

Hence, AB rotates the vector ~x counter clockwise by angle α + β.


To understand the behavior of ~y = An ~x on ~x , note that
 cos 2α − sin 2α 
A2 = and using induction
sin 2α cos 2α
cos nα − sin nα
 
An = .
sin nα cos nα
Hence, An rotates the vector ~x counter clockwise by angle nα.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 21 / 55


Question 7
Which of the following matrices are row echelon and row reduced echelon
matrix. Give a reason when the matrix is not row reduced echelon.
       
1 0 5 1 0 5 0 1 0 0 1 0
 0 2 3 ,  0 1 3 ,  0 0 0 ,  0 0 1 .
0 0 0 0 0 0 0 0 1 0 0 0

Recall: Row echelon matrix


All zero-rows are at the bottom.
The leading coefficient of a non-zero row is always strictly left to the
leading coefficient of the next row.
Row reduced echelon matrix
It is a row echelon matrix.
The leading entry in each non-zero row is equal to 1.
Each column containing a leading 1 has zeros in all its other entries.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 22 / 55


Question 7

Solution:
 
1 0 5
 0 2 3  is a row echelon matrix. It is not a row reduced echelon
0 0 0
matrix as the leading coefficient of the second row is not equal to 1.
 
1 0 5
 0 1 3  is a row reduced echelon matrix.
0 0 0
 
0 1 0
 0 0 0  is not a row echelon matrix as a zero row is lying
0 0 1
above
 a non-zero
 row.
0 1 0
 0 0 1  is a row reduced echelon matrix.
0 0 0

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 23 / 55


Question 8
Find row reduced echelon matrix which is row equivalent to the matrices
in the previous question and their transposes.

Recall: A is row equivalent to the matrix B if A can be obtained from B


by finitely many row operations.
Solution:
   
1 0 5 1
R → R2
1 0 5
 0 2 3  −−2−−2−→  0 1 3 
2
0 0 0 0 0 0
   
0 1 0 0 1 0
R2 ↔R3
 0 0 0 − −−−→  0 0 1 
0 0 1 0 0 0

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 24 / 55


Question 8

Row reduced echelon matrix of transpose matrix


 T    
1 0 5 1 0 0 1
R → R2
1 0 0
 0 2 3  =  0 2 0  −−2−−2−→  0 1 0 
0 0 0 5 3 0 5 3 0
   
1 0 0 1 0 0
R →R −5R1 R3 →R3 −3R2
−−3−−−3−−−→  0 1 0 − −−−−−−− → 0 1 0 
0 3 0 0 0 0
 T  
1 0 5 1 0 0
 0 1 3  =  0 1 0 , then proceed as above.
0 0 0 5 3 0

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 25 / 55


Question 8 Contd.

 T    
0 1 0 0 0 0 1 0 0
R1 ↔R2
 0 0 0  =  1 0 0  −− −−→  0 0 0 
0 0 1 0 0 1 0 0 1
 
1 0 0
R2 ↔R3
−−−−→  0 0 1 
0 0 0
 T    
0 1 0 0 0 0 1 0 0
R1 ↔R2
 0 0 1  =  1 0 0  −− −−→  0 0 0 
0 0 0 0 1 0 0 1 0
 
1 0 0
R2 ↔R3
−− −−→  0 1 0 
0 0 0

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 26 / 55


Question 9
Show that every elementary matrix is invertible and inverse is an elementary matrix

Recall:
1 A square matrix E of size n is called an elementary matrix if there is an elementary
row operation q such that E = q(In ).
2 Let q be an elementary row operation, then, for A ∈ Mm×n (R)

q(A) = q(Im )A

3 If matrix A is obtained from identity matrix I by a certain row operation q then


A−1 is obtained from I by its inverse operation q −1 , i.e.,
If q is swapping operation then q −1 = q.
If q is multiplication of a row by x (where x 6= 0) then q −1 is
multiplication of a row by x −1 .
If q is an adding operation i.e RI → RI + xRj , then q −1 will be
RI → RI − xRj .

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 27 / 55


Question 9
Solution:
Let E be an elementary matrix. Therefore, E = q(I ) for some
elemenatry operation q.
Define F = q −1 (I ), where q −1 is the reverse operation of q.
Then,
I = (q −1 ◦ q)(I ) = q −1 ◦ (q(I ))
= q −1 (E )
= q −1 (I )E (see ’Recall, point-2’)
= FE
Similarly,
I = (q ◦ q −1 )(I ) = q ◦ (q −1 (I ))
= q(F )
= q(I )F (see ’Recall, point-2’)
= EF
(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 28 / 55
Question 9 Contd.

Thus I = FE = EF , i.e., E is invertible and the inverse is given by F .


As, by definition, F is obtained by a single row operation applied on I ,
therefore F is an elementary matrix.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 29 / 55


Question 10
Compute the rank of the following matrices. Using the rank determine
which of these matrices are invertible.
     
1 1 2 1 2 −4 1 3 −4
 2 3 8  ,  −1 −1 5  ,  1 5 −1  .
−3 −1 2 2 7 −3 3 13 −6

Recall:
The rank of a matrix A is the number of non-zero rows in the Row
Echelon form of A.
A matrix An×n is invertible ⇐⇒ Rank(A) = n.
Row-equivalent matrices have the same rank.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 30 / 55


Question 10

Solution: Using elementary row operations we have,


1 1 2 ! 1 1 2 !
R →R −2R1 R3 →R3 −2R2
2 3 8 −−2−−−2−−−→ 0 1 4 −−−−−−−−→
R3 →R3 +3R1
−3 −1 2 0 2 8
1 1 2 !
0 1 4
0 0 0

As the rank A = 2, the above matrix is not invertible.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 31 / 55


Question 10 Contd.
1 2 −4 ! 1 2 −4 !
R2 →R2 +R1 R →R −3R2
−1 −1 5 −−− −−−−− → 0 1 1 −−3−−−3−−−→
R3 →R3 −2R1
2 7 −3 0 3 5
1 2 −4 !
0 1 1
0 0 2

As the rank A = 3, the above matrix is invertible.


1 3 −4 ! 1 3 −4 !
R2 →R2 −R1 R3 →R3 −2R2
1 5 −1 −−−−−−−− → 0 2 3 −−−−−−−−→
R3 →R3 −3R1
3 13 −6 0 4 6
1 3 −4 !
0 2 3
0 0 0

As the rank A = 2, the above matrix is not invertible.


(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 32 / 55
Question 11
Find the inverse of the invertible matrices in the previous question by
reducing the matrix to row reduced echelon form (identity matrix).

Solution:
Consider [A|I ], where A is the matrix considered in Question 10(b)
and I is the 3 × 3 identity matrix.
" 1 2 −4 1 0 0 # " 1 2 −4 1 0 0 #
R2 →R2 +R1
−1 −1 5 0 1 0 − −−−−−−− → 0 1 1 1 1 0
R3 →R3 −2R1
2 7 −3 0 0 1 0 3 5 −2 0 1
" 1 0 −6 −1 −2 0 #
R1 →R1 −2R2 R1 →R1 +3R3
−−−−−−−− → 0 1 1 1 1 0 − −−−−−−−→
R3 →R3 −3R2 R3 → 21 R3
0 0 2 −5 −3 1

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 33 / 55


Question 11

" 1 0 0 −16 −11 3 # " 1 0 0 −16 −11 3 #


R2 →R2 −R3 7 5
0 1 1 1 1 0 −−−−−−−→ 0 1 0 2 2 − 12
0 0 1 − 25 − 32 12 0 0 1 − 52 − 32 1
2
 
−16 −11 3
Therefore, A−1 =  7
2
5
2 − 21 
− 52 − 32 1
2

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 34 / 55


Question 12
Write down the following matrices as the product of elementary matrices
(whenever possible).
   
1 2 3 1 1 2
 0 1 4 ,  2 3 8 .
0 0 1 −3 −1 2

Recall:
A is row equivalent to I if and only if I is row equivalent to A. If
I = (qs ◦ ... ◦ q2 ◦ q1 )(A), then A = (q1−1 ◦ ... ◦ qs−1
−1
◦ qs−1 )(I ).
That is, A = E1−1 E2−1 . . . Es−1 , where Ek = qk (I ).

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 35 / 55


Question 12
Solution:
1 2 3 ! 1 2 3 !
q1 :R2 →R2 −4R3 q2 :R1 →R1 −2R2
0 1 4 −−−−−−−−−→ 0 1 0 −−−−−−−−−→
0 0 1 0 0 1
1 0 3 ! 1 0 0 !
q3 :R1 →R1 −3R3
0 1 0 −−−−−−−−−→ 0 1 0
0 0 1 0 0 1

Hence, A is row equivalent to I , and A = E1−1 E2−1 E3−1 , where

1 0 0 ! 1 −2 0 ! 1 0 −3 !
E1 = q1 (I ) = 0 1 −4 , E2 = 0 1 0 , E3 = 0 1 0 .
0 0 1 0 0 1 0 0 1
 
1 1 2
 2 3 8  is not invertible since rank is 2, see Question 10.
−3 −1 2

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 36 / 55


Question 13
Solve the following systems of equations by reducing the augmented
matrix to the row reduced echelon form:
a) x1 − x2 + 2x3 = 1, 2x1 + 2x3 = 1, x1 − 3x2 + 4x3 = 2,
b) x1 + 7x2 + x3 = 4, x1 − 2x2 + x3 = 0, −4x1 + 5x2 + 9x3 = −9,
c) x2 + 5x3 = −4, x1 + 4x2 + 3x3 = −2, 2x1 + 7x2 + x3 = −1,
d) −2x1 − 3x2 + 4x3 = 5, x2 − x3 = 4, x1 + 3x2 − x3 = 2.

Solution: a) x1 − x2 + 2x3 = 1, 2x1 + 2x3 = 1, x1 − 3x2 + 4x3 = 2


Above system of equations can be written as Ax = b, i.e.,

1 −1 2 ! x1 ! 1 !
2 0 2 x2 = 1
1 −3 4 x3 2

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 37 / 55


Question 13(a)
Using elementary row transformations on augmented matrix (A|B) we
have,
1 −1 2 1 ! 1 −1 2 1 !
R2 →R2 −2R1
2 0 2 1 −−−−−−−− → 0 2 −2 −1
R3 →R3 −R1
1 −3 4 2 0 −2 2 1
1 −1 2 1 !
R →R +R2
−−3−−−3−−→ 0 1 −1 − 12
R2 →R2 /2
0 0 0 0
Since, rank A = 2 and rank (A|b) = 2. Also, rank A = rank
(A|b) < 3, above system of equations have infinite solutions.
Here x3 is the free variable. Let x3 = a. We have,
1
x1 − x2 + 2x3 = 1, x2 − x3 = −
2
 T
1 1
Therefore, (x1 x2 x3 )T = 2 −a a− 2 a
(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 38 / 55
Question 13(b)

(b) x1 + 7x2 + x3 = 4, x1 − 2x2 + x3 = 0, −4x1 + 5x2 + 9x3 = −9


Above system of equations can be written as Ax = b, i.e.,

1 7 1 ! x1 ! 4 !
1 −2 1 x2 = 0
−4 5 9 x3 −9

Using elementary row operations on augmented matrix (A|B) we


have,
1 7 1 4 ! 1 7 1 4 !
R2 →R2 −R1
1 −2 1 0 −
−−−−−−− → 0 −9 0 −4
R3 →R3 +4R1
−4 5 9 −9 0 33 13 7
1 7 1 4 !
R2 →R2 /9 R3 →R3 +33R2
−−−−−−→ 0 −1 0 − 94 −− −−−−−−→
0 33 13 7

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 39 / 55


Question 13(b) Contd.

1 7 1 4 ! 1 7 1 4 !
R3 →R3 /13
0 −1 0 − 49 −−−−−−→ 0 −1 0 − 94
0 0 13 −23/39 0 0 1 −23/39
As rank A = rank (A|b) = 3, above system of equations has a unique
solution. Hence, we have
4 23
x1 + 7x2 + x3 = 4, − x2 = − , x3 = − .
9 39
So, by backward substitution we get,
 173 4 23 T
(x1 x2 x3 )T = −
117 9 39

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 40 / 55


Question 13 (c)

(c) x2 + 5x3 = −4, x1 + 4x2 + 3x3 = −2, 2x1 + 7x2 + x3 = −1


Above system of equations can be written as Ax = b, i.e.,

0 1 5 ! x1 ! −4 !
1 4 3 x2 = −2 .
2 7 1 x3 −1

Using elementary row operations on augmented matrix (A|b) we have,

0 1 5 −4 ! 1 4 3 −2 !
R1 ↔R2
1 4 3 −2 −− −−→ 0 1 5 −4
2 7 1 −1 2 7 1 −1

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 41 / 55


Question 13(c) Contd.

1 4 3 −2 ! 1 4 3 −2 !
R3 →R3 −2R1
0 1 5 −4 −− −−−−−→ 0 1 5 −4
2 7 1 −1 0 −1 −5 3
1 4 3 −2 !
R →R +R
−3−−−3−−
− →2
0 1 5 −4
0 0 0 −1

Hence, rank A = 2 and rank (A|b) = 3. As, rank A 6= rank (A|b), above system of
equation has no solution.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 42 / 55


Question 13(d)

(d) −2x1 − 3x2 + 4x3 = 5, x2 − x3 = 4, x1 + 3x2 − x3 = 2


Above system of equations can be written as Ax = b, i.e.,

−2 −3 4 ! x1 ! 5 !
0 1 −1 x2 = 4
1 3 −1 x3 2

Using elementary row operations on augmented matrix (A|B) we


have,
−2 −3 4 5 ! 1 3 −1 2 !
R1 ↔R3
0 1 −1 4 −−−−→ 0 1 −1 4
1 3 −1 2 −2 −3 4 5
1 3 −1 2 !
R3 →R3 +2R1 R3 →R3 −3R2
−−−−−−−−→ 0 1 −1 4 −
−−−−−−− →
0 3 2 9

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 43 / 55


Question 13(d) Contd.

1 3 −1 2 ! 1 3 −1 2 !
R3 →R3 /5
0 1 −1 4 −−−−−−→ 0 1 −1 4
0 0 5 −3 0 0 1 − 35
As rank A = rank (A|B) = 3, above system of equations have a
unique solution. Hence, we have

x3 = −3/5, x2 − x3 = 4, x1 + 3x2 − x3 = 2.

So, by backward substitution we get,


 44 17 3 T
(x1 x2 x3 )T = − −
5 5 5

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 44 / 55


Question 14
Consider the following system of equations:

x + 2y + z = 3, ay + 5z = 10, 2x + 7y + az = b.

a) Find all values of a for which the following system of equations has a
unique solution. b) Find all pairs (a, b) for which the system has more
than one solution.
Solution:
Above system of equations can be written as Ax = b, i.e.,

1 2 1 ! x1 ! 3 !
0 a 5 x2 = 10
2 7 a x3 b

The system of equations will have a unique solution iff |A| =


6 0.
Since, |A| = a2 − 2a − 15 = (a − 5)(a + 3). Therefore, the above
system of equation has a unique solution iff a 6= 5, −3.
(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 45 / 55
Question 14 Contd.

Case 1 : When a=-3


Using elementary row operations on augmented matrix we have,
1 2 1 3 ! 1 2 1 3 !
R3 →R3 −2R1
0 −3 5 10 −−−−−−−− → 0 −3 5 10
2 7 −3 b 0 3 −5 b − 6
1 2 1 3 !
R →R +R2
−−3−−−3−−→ 0 −3 5 10
0 0 0 b+4
rank A = 2. Above system of equation will have infinite solutions iff
rank A =rank (A|B) < 3. This implies that rank (A|B) = 2.
This gives, b + 4 = 0, i.e., b = −4.
Hence, for (a, b) = (−3, −4) the system has more than one solution.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 46 / 55


Question 14 Contd.

Case 2 : When a = 5
Using elementary row transformations on augmented matrix (A|B) we
1 2 1 3 ! 1 2 1 3 !
R3 →R3 −2R1
have, 0 5 5 10 −−−−−−−− → 0 5 5 10
2 7 5 b 0 3 3 b−6
1 2 1 3 ! 1 2 1 3 !
R2 →R2 /5 R3 →R3 −R2
−−−−−−→ 0 1 1 2 −−−−−−−→ 0 1 1 2
R3 →R3 /3
0 1 1 b−6 3 0 0 0 b−12
3
rank A = 2. Above system of equation will have infinite solutions ifF
rank A =rank (A|B) < 3. This implies that rank (A|B) = 2.
b−12
Therefore, 3 = 0, i.e., b = 12.
Hence, for (a, b) = (5, 12) the system has more than one solution.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 47 / 55


Question 15
Find a, b, c, p, q ∈ R such that the following system has a solution:
    
1 2 3 x a
 0 1 p   y  =  b .
0 0 q z c

Solution: The system of equation written in the form of Ax = b has a


solution if
rank A =rank (A|b) = 3. In this case it will have a unique solution.
rank A = rank (A|b) < 3. In this case it will have infinite solutions.
Case 1: Unique Solution
The system will have a unique solution iff A is invertible, equivalently
|A| =
6 0.
|A| = q, therefore the system of equation has a unique solution iff
q 6= 0 and p, a, b, c ∈ R.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 48 / 55


Question 15

Case 2 : Infinite Solutions


For this case, we must have rank A = rank (A|b) < 3.
Now, rank A < 3 iff q = 0, and in that case rank A = 2 because A
has two non zero pivot columns.
Consider (A|b) when q = 0
 
1 2 3 a
 0 1 p b 
0 0 0 c

Now, rank (A|b) = 2 when c = 0.


Hence, the system of equations have infinite solutions if c = q = 0
and p, a, b ∈ R.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 49 / 55


Question 16
Assume A, B are square matrices os same size, then,
(a) trace(A + B) = trace(A) + trace(B) and trace(AB) = trace(BA).
(b) Let A, B are 2 × 2 matrices, then det(AB) = det(A)det(B).
(c) Find A, B such that det(A + B) 6= det(A) + det(B)

Solution: (a) trace(A + B) = trace(A) + trace(B)


Let A = [aij ] and B = [bij ] be n × n matrix.
Then
n
X n
X
trace(A) + trace(B) = aii + bii
i=1 i=1
Xn
= (aii + bii )
i=1
= trace(A + B)

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 50 / 55


Question 16 (a)

trace(AB) = trace(BA)
n
(i, j)th entry of matrix AB is given by (AB)ij =
P
aik bkj .
k=1

Consider
n
X
trace(AB) = (AB)ii
i=1
n X
X n
= aik bki
i=1 k=1
Xn X n
= bki aik
i=1 k=1
= trace(BA)

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 51 / 55


Question 16 (b)

(b) Let A, B are 2 × 2 matrices, then det(AB) = det(A)det(B).


Solution:
Let    
a11 a12 b11 b12
A= and B =
a21 a22 b21 b22

As det(A) = a11 a22 − a21 a12 and det(B) = b11 b22 − b21 b12 .
Now,

det(AB) = (a11 b11 + a12 b21 )(a21 b12 + a22 b22 )


− (a21 b11 + a22 b21 )(a11 b12 + a12 b22 )
= a11 a22 (b11 b22 − b21 b12 ) − a12 a21 (b11 b22 − b21 b12 )
= (a11 a22 − a21 a12 )(b11 b22 − b21 b12 )
= det(A)det(B).

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 52 / 55


Question 16 (c)

(c) Find A, B such that det(A + B) 6= det(A) + det(B)


     
1 0 −1 0 0 0
Let A = , B= A+B =
0 1 0 −1 0 0

Then det(A) = 1, det(B) = 1 and det(A + B) = 0.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 53 / 55


Question 17
Show that computation of nth order determinant using expansion needs
atleast n! multiplication. If a multiplication takes 10−9 sec on a computer,
compute the time needed for computing determinant of a 25 × 25 matrix.

Solution:
Let f (n) be the numbers of multiplications required to find the
determinant of a n × n matrix using cofactor expansion.
n−1
P n!
We claim that f (n) = k! , for n > 1
k=1
Cofactor expansion of determinant of n × n matrix A along j th row is
n
X
det(A) = ajk (−1)j+k detAjk
k=1

where Ajk is the matrix formed by removing j th row and k th column.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 54 / 55


Question 17

Since each minor Ajk is of size n − 1 × n − 1, it requires f (n − 1)


multiplications.
There are total of n minors.
Also there are n more multiplications of each element of j th row with
the corresponding minor.
By the above reasoning and absorbing multiplications of (−1)i+j in
the addition, we have the following recursive formulae,

f (n) = nf (n − 1) + n

Now, using mathematical induction on f (n).


Hence, we obtain that f (n) ≥ n!.
As 25! ≈ 1025 . Therefore, time needed to compute the determinant
of a 25 × 25 matrix will be 1016 seconds ≈ 3 × 109 years.

(Maths Dept., IIT Delhi) MTL101, Tutorial-1 Semester-II, 2020-21 55 / 55

You might also like