0% found this document useful (0 votes)
44 views3 pages

c1 Ms

Uploaded by

prakhar agrawal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
44 views3 pages

c1 Ms

Uploaded by

prakhar agrawal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Indian Institute of Information Technology Allahabad

Foundation of Mathematics for Data-Science-2021


C1 Review Test

Date: March 06, 2021 (11:00 AM-12:00 PM IST) Total Marks: 30


Important Instructions:

1. Attempt all the questions. There is no credit for a solution if the appropriate
work is not shown, even if the answer is correct. All the notations are standard
and same as used in the lecture notes.
2. Write down your name and enrolment number. Write the solutions clearly with
all the steps in details.
3. Submit the solution in PDF format through Google Classroom. Name the
PDF as DMF C1 EnrolmentNumber. We will not accept the solution
through emails.

1. True/False, justify your answer. [5*2=10]


(a) Let A, B ∈ Mn (R). If B is invertible, then RREF (A) = RREF (BA).
Solution: True. Since B is invertible, B = E1 · · · Ek , where Ei are elemen-
tary matrices. Hence, A and BA are row equivalent and so have the same
RREF.  
1 1
(b) Let A = . For λ 6= 0, the system Ax = λx has no non-zero solution.
1 1
Solution: False. The system has a non-zero solution for λ = 2.
(c) If a system Ax = b has a unique solution for some b, then A must be a
square matrix.
 
1 0
Solution: False. A = 0 1, for any b = (x, y, 0) has a unique solution.
0 0
(d) W = {A ∈ Mn (R) | det(A) = 0}. Then W is a subspace of Mn (R) over R.
   
1 0 0 0
Solution: False. Let A = and B = , A + B 6∈ W.
0 0 0 1
(e) T : R3 → R3 given by T (x, y, z) = (x − y, y − z, z − x). Then T is singular.
Solution: True. ker(T ); {(x, y, z) | T (x, y, z) = (0, 0, 0)} = {(x, y, z) | x =
6 {(0, 0, 0)}.
y, y = z, z = x} =
2. Find the condition on a so that the linear system
x + 2y − az = 0, 2x + 2ay + 14z = 0, 1x − 2y + 7z = 0
has a non-zero solution. Corresponding to conditions on a, find the solution
set and a basis of the solution set. [8]
   
1 2 −a 1 2 −a
R2 →R2 −2R1 ,R3 →R3 −R1
Solution: A = 2 2a 14
  ∼  0 2(a − 2) 14 + 2a
1 −2 7 0 −4 7+a
−a
   
1 2 −a 1 2
R2 ↔R3 R2 →R2 /(−4),R3 →R3 /2 −(7+a) 
∼ 0 −4 7+a  ∼ 0 1 4
0 2(a − 2) 2(7 + a) 0 a−2 7+a
−a
 
1 2
R3 →R3 −(a−2)R2 −(7+a)
∼ 0 1
4
. [2]
0 0 (7 + a)(a + 2)/4
To have a non-zero solution, the number of non-zero rows must be less than
number of variables Therefore, (7 + a)(a + 2)/2 = 0 ⇒ a = −7 or a = −2. [2]
When a = −7, the solution set is {(x, y, z) | y = 0, x = −7z}. [1]
The basis of the solution space is {(−7, 0, 1)} [1]
When a = −2, the solution set is {(x, y, z) | z ∈ R, x = −9z/2, y = 5z/4}. [1]
The basis of the solution space is {(−18, 5, 4)} [1]
3. Let T be a linear map on a finite dimensional vector space V . Then prove that
(a) Range(T ) ∩ Ker(T ) = {0} if and only if T 2 x = 0 ⇒ T x = 0. [3]
(b) If Rank(T 2 ) = Rank(T ), then Range(T ) ∩ Ker(T ) = {0}. [3]
Solution: (a) Let Range(T )∩Ker(T ) = {0}, if T 2 x = 0 ⇒ T (x) ∈ Range(T )∩
Ker(T ) = {0} ⇒ T (x) = 0. [1]
Conversely, Let x ∈ Range(T ) ∩ Ker(T ) = {0}, then T x = 0 and there exists
a vector y such that T (y) = x so that T 2 y = T x = 0 ⇒ T (y) = 0 ⇒ x = 0. [2]
(b) Let Rank(T 2 ) = Rank(T ). Then nullity (T 2 )=nullity(T ). [1]
Note that ker(T ) ⊆ ker(T 2 ). Since the dimension of both the spaces are the
same, ker(T ) = ker(T 2 ). [1]
By part (a), Range(T ) ∩ Ker(T ) = {0}. [1]
4. Let T : R3 −→ R3 be the linear map defined by T (x1 , x2 , x3 ) = (3x1 +x3 , 12x1 +
x2 , −x1 + 2x2 + 4x3 ). Find ker(T ), range(T ), a basis of ker(T ), a basis of
range(T ), nullity(T ) and rank(T ). [8]

2
Solution: ker(T ) = {(x1 , x2 , x3 ) | T (x1 , x2 , x3 ) = (0, 0, 0)}
= {(x1 , x2 , x3 ) | (3x1 + x3 , 12x1 + x2 , −x1 + 2x2 + 4x3 ) = (0, 0, 0)}
= {(x1 , x2 , x3 ) | (3x1 + x3 = 0,12x1 + x2= 0, −x1 + 2x2 + 4x  3 = 0)}
3 0 1 1 −2 −4
The corresponding matrix is  12 1 0 ∼ 12 1 0 
−1 2 4 3 0 1
       
1 −2 −4 1 −2 −4 1 −2 −4 1 0 0
∼ 0 25 48  ∼ 0 1 48/25 ∼ 0 1 48/25  ∼ 0 1 0 [2]
0 6 13 0 1 13/6 0 0 37/150 0 0 1
ker(T ) = {((0, 0, 0))} [1]
basis of ker(T ) is the empty set. [1]
nullty(T)=0 [1]
By rank-nullity theorem range(T ) = R3 . [1]
Basis of range(T ) is {e1 , e2 , e3 }. [1]
rank(T)=3 [1]

You might also like