Professional Documents
Culture Documents
Tutorial 1
Department of Mathematics
Indian Institute of Technology Delhi
a1 x + b1 y = c1
a2 x + b2 y = c2
a3 x + b3 y = c3
L1 : x + y = −2
L2 : x + y = 0
L3 : x + y = 2
L1 : x + y = 0
L2 : x + y = 0
L3 : x + y = 2
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
L1 : x − 2y = 1
L2 : 2x − y = −4
L3 : x + y = 2
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
a1 x + b1 y + c1 z = d1
a2 x + b2 y + c2 z = d2
a3 x + b3 y + c3 z = d3
P1 : x − 2y + z = −2
P2 : x − 2y + z = 1
P3 : x − 2y + z = 5
P1 : x − 2y + z = −2
P2 : x − 2y + z = 5
P3 : x − 2y + z = 5
P1 : x + y − z = 1
P2 : x − 2y + z = 1
P3 : x − 2y + z = 5
P1 : z = 0
P2 : y = 0
P3 : y + z = 2
P1 : x = 0
P2 : y = 0
P3 : z = 0
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.
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
a1 x + b1 y + c1 z = d1
a2 x + b2 y + c2 z = d2
P1 : x − 2y + z = −2
P2 : x − 2y + z = 5
P1 : x − 2y + z = 5
P2 : x − 2y + z = 5
P1 : x + y − z = 1
P2 : x − 2y + z = 5
~ = ~y = A~x = A(B w
Cw ~ ) = (AB)~
w.
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
= 0.
Solution:
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
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
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
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.
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
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 ).
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
1 −1 2 ! x1 ! 1 !
2 0 2 x2 = 1
1 −3 4 x3 2
1 7 1 ! x1 ! 4 !
1 −2 1 x2 = 0
−4 5 9 x3 −9
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
0 1 5 ! x1 ! −4 !
1 4 3 x2 = −2 .
2 7 1 x3 −1
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
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.
−2 −3 4 ! x1 ! 5 !
0 1 −1 x2 = 4
1 3 −1 x3 2
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.
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
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.
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)
As det(A) = a11 a22 − a21 a12 and det(B) = b11 b22 − b21 b12 .
Now,
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
f (n) = nf (n − 1) + n