DEPARTMENT OF MATHEMATICS, IIT GUWAHATI

MA101: Mathematics I Mid Semester Exam September 26, 2014

PART I

Roll No.: Name:

Tutorial Group: T Stud. Sign: Inv. Sign:

1
1. Write TRUE or FALSE in the spaces provided for answers. Each correct answer gets a score of 2, each
incorrect answer gets a score of − 21 and each un-attempted question gets a score of 0. 4

QUESTION ANSWER
   
1 1 1 0 0 0
   
0 1 1 1 0 0
   
    5
0 0 1 and B = 1 1 0 then R = col(A) ⊕ col(B).
(i) If A =     FALSE
   
0 0 0 1 1 0
   
0 0 0 1 1 1

(ii) Let V = R and for x, y ∈ V, a ∈ R define x ⊕ y = x − y and a  x = −ax. Then V is a FALSE

vector space over R with respect to addition ⊕ and scalar multiplication .

(iii) For [x1 , x2 ]t , [y1 , y2 ]t ∈ R2 and α ∈ R, define [x1 , x2 ]t ⊕ [y1 , y2 ]t = [x1 + y1 + 1, x2 + y2 − 3]t TRUE
and α  [x1 , x2 ]t = [αx1 + α − 1, αx2 − 3α + 3]t . Then R2 is a vector space over R with respect
to addition ⊕ and scalar multiplication .

(iv) Mr. X has a set S of five polynomials in R7 [x] such that each of the polynomials in S has TRUE
a zero (root) at 1, 2, 3 and 4. Then the set S must be linearly dependent.

(v) Consider the square plates A and B in R2 whose corner points are (0, 0), (1, 0), (0, 1), (1, 1) FALSE
and (1, 1), (2, 1), (1, 2), (2, 2), respectively. Then there is a linear transformation T : R2 → R2
such that T (A) = B.

(vi) Let T : R7 [x] → R6 [x] be a linear transformation such that the set {T (u), T (v), T (w)} is TRUE
linearly independent. Then the set {u, v, w} must be linearly independent.

(vii) It is known that there are infinitely many onto functions f : R2 → R3 . Then at least two FALSE
of these functions are linear.

(viii) Let M = x ∈ R4 : z = 0 = w and N = x ∈ R4 : x = y, z = 0 , where x = [x, y, z, w]t .

 
TRUE
Then the dimension of (M + N )⊥ is 1.
 2. Write the final answer in the spaces provided for answers. Each correct answer gets a score of 1. There are
no negative marks for these questions. 7

QUESTION ANSWER
 
V O
(i) Let V and W be unitary matrices such that the matrices V ∗ AV  
O W
and W ∗ BW
 are upper triangular. Write a unitary matrix U for which
A C
U ∗ U is upper triangular.
O B
   
2 2
   
−1  0
   
   
 3 −1
(ii) Let S = {[x1 , . . . , x6 ]t ∈ R6 : 2x1 −x2 +3x3 +x4 = 0, 2x1 −x3 +x5 +x6 = { ,  }
   
 1  0
0}. Write a basis for S ⊥ .    
   
 0  1
   
0 1
 
−1
 
−2
(iii) Let W = {[x, y, z, w]t ∈ R4 : x + y + z + w = 0} and u = [1, 0, 3, 4]t .
 
 
 1
Write the point v ∈ W for which ku − vk is minimum.  
2
     
1 0 0
     
0 1 0
(iv) Consider the vectors v1 = [1, 0, 0, 0]t , v2 = [2, 3, 0, 0]t , v3 = [4, 5, 6, 0]t .  ,   ,  
     
0 0 1
Apply Gram Schmidt Ortho-normalization Process to v1 , v2 , v3 in that      
0 0 0
order. Write the final three vectors.
     
2 −1 1 1 a b
(v) Let S be a matrix such that S −1  S is diagonal. Write the   or  , a, b 6= 0
−1 2 1 −1 a −b
matrix S.
   
1 0 3 0
(vi) Take S as obtained in Part (v) and let B be the ordered basis for   or  
0 3 0 1
R2 formed by column 1 and column 2 of S. Let the linear transformation
T : R2 → R2 be defined by T ([x, y]t ) = [2x − y, 2y − x]t for all [x, y]t ∈ R2 .
Write the matrix [T ]B .
 
0 0 0 0 0
 
0 0 0 0 12
d2
(vii) Let the mapping T : R4 [x] → R3 [x] be defined by T (p(x)) = p(x)
 
dx2 
0 0 0 6 0

for all p(x) ∈ R4 [x]. Write the matrix of T with respect to the ordered  
0 0 2 0 0
bases {1, x, x2 , x3 , x4 } and {x3 , x2 , x, 1}.
 DEPARTMENT OF MATHEMATICS, IIT GUWAHATI

MA101: Mathematics I Mid Semester Exam (Maximum Marks: 35)

Date: September 26, 2014 Time: 2 pm - 5 pm
PART II

1. Let A be a 6 × 6 real matrix such that AAt = O. Show that A = O. Is the same true if A is a complex
matrix? Justify. 1+1

Solution: Let x ∈ R6 . Now we have

AAt = O ⇒ At A = O ⇒ xt At Ax = 0 ⇒ kAxk = 0 ⇒ Ax = 0.

Thus Ax = 0 for all x ∈ R6 , and hence A = O.

Aliter

Let ri be the i-th row of A. Then for 1 ≤ i ≤ 6, we have

(AAt )ii = 0 ⇒ ri rti = 0 ⇒ ri = 0 ⇒ A = O.

 
i 1 0 0 0 0
 
0 0 0 0
 0 0

 
0 0 0 0 0 0
The relation AAt = O does not imply A = O for complex matrix. For example, take A =  .
 
0 0 0 0 0 0
 
 
0 0 0 0 0 0
 
0 0 0 0 0 0

2. If A is a matrix satisfying A3 = 2I then show that the matrix A2 − 2A + 2I is invertible. 2

Solution: Let B = A(A + 2I)(A − I). Now A3 = 2I ⇒ I = (A − I)(A2 + A + I) and A3 + 8I =

10I ⇒ (A + 2I)(A2 − 4A + 4I) = 10I. These gives that det(A − I) 6= 0 and det(A + 2I) 6= 0. Also
A3 = 2I ⇒ det(A) 6= 0. Thus det(A) 6= 0, det(A − I) 6= 0, det(A + 2I) 6= 0, and hence det B 6= 0. Therefore
the matrix B = A2 − 2A + 2I is invertible.

Aliter

We have A2 − 2A + 2I = (A + aI)(A + bI), where a = −1 + i, b = −1 − i.

Therefore |A2 − 2A + 2I| = 0 ⇒ |(A + aI)(A + bI)| = 0 ⇒ |A + aI| = 0 or |A + bI| = 0.

Now |A + aI| = 0 ⇒ Ax = −ax for some x 6= 0. This gives that A3 x = −a3 x ⇒ 2Ix = −a3 x ⇒ a3 + 2 = 0.
Similarly, b3 + 2 = 0. However, a3 + 2 6= 0, b3 + 2 6= 0. Thus |A2 − 2A + 2I| =
6 0 and hence the matrix
A2 − 2A + 2I is invertible.
3. Let A and B be two matrices such that AB is defined and rank(A) = rank(AB). Show that A = ABX for
some matrix X. 2

Solution: Note that col(AB) ⊆ col(A) and therefore rank(A) = rank(AB) ⇒ col(AB) = col(A). Now if
k
P
A = [a1 , . . . , an ], AB = [b1 , . . . , bk ], then col(AB) = col(A) gives that ai = αij bj for some scalars αij .
j=1
Now if we take X = [αji ], we find that A = ABX.

4. Let M = {[x, y, z]t ∈ R3 : x + y + 4z = 0} and N = {[x, y, z]t ∈ R3 : x + y + z = 0}. Determine a basis for
M + N. 2

Solution: For any [x, y, z]t ∈ M , we have x = −y − 4z. Hence [x, y, z]t = [−y − 4z, y, z]t = y[−1, 1, 0]t +
z[−4, 0, 1]t . Also, {[−1, 1, 0]t , [−4, 0, 1]t } is linearly independent. Hence {[−1, 1, 0]t , [−4, 0, 1]t } is a basis for
M . Similarly, {[−1, 1, 0]t , [−1, 0, 1]t } is a basis for N .

Since [−1, 0, 1]t ∈

/ M , we find that {[−1, 0, 1]t , [−1, 1, 0]t , [−4, 0, 1]t } is a linearly independent subset of M +N .
Moreover, span([−1, 0, 1]t , [−1, 1, 0]t , [−4, 0, 1]t ) = M + N . Hence {[−1, 0, 1]t , [−1, 1, 0]t , [−4, 0, 1]t } is a basis
for M + N .

5. Let λ1 , . . . , λm be distinct eigenvalues of a matrix A with corresponding eigenvectors v1 , . . . , vm , respectively.

Show that the set {v1 , . . . , vm } is linearly independent. 3

Solution: Suppose, if possible, v1 , . . . , vm are linearly dependent. Then one of these vectors will be a linear
combination of the previous ones. Let k be the smallest number such that

vk+1 = c1 v1 + . . . + ck vk ······ (1).

Multiplying both sides of equation (1) by A from the left and using the fact that Avi = λi vi for each i, we
have

λk+1 vk+1 = Avk+1 = A(c1 v1 + . . . + ck vk )

= c1 Av1 + . . . + ck Avk

= c 1 λ1 v 1 + . . . + c k λk v k ······ (2).

Now multiplying both sides of equation (1) by λk+1 , we get

λk+1 vk+1 = c1 λk+1 v1 + . . . + ck λk+1 vk ······ (3).

Subtracting equation (3) from equation (2), we get

c1 (λ1 − λk+1 )v1 + . . . + ck (λk − λk+1 )vk = 0

⇒c1 (λ1 − λk+1 ) = 0, . . . . . . , ck (λk − λk+1 ) = 0, as v1 , . . . , vk are linearly independent

⇒c1 , . . . . . . ck = 0, as λi 6= λj for i 6= j

⇒vk+1 = c1 v1 + . . . ck vk = 0, a contradiction, as vk+1 6= 0.

Hence we conclude that the vectors v1 , . . . , vm are linearly independent.

  
1 1 5 6
 
−2 4 7 8
6. Determine if the matrix   is diagonalizable. 4
 
 0 0 0 −2
 
0 0 1 3

Solution: Let the given matrix be A. Then we have

|A − xI| = 0 ⇒ [(1 − x)(4 − x) + 2][(−x)(3 − x) + 2] = 0 ⇒ x = 2, 3, 1, 2.

Thus 2 is an eigenvalue of A of algebraic multiplicity 2. We now have

   
−1 1 5 6 −1 1 5 6
   
−2 2 7 8
  0 0 −3 −4
  1
A − 2I =  ≡ , R2 → R2 − 2R1 , R4 → R4 + R3

 0 0 −2 −2  0 0 −2 −2 2
   
0 0 1 1 0 0 0 0
 
−1 1 5 6
 
 0 0 −3 −4 1
≡ , R3 → − R3
 
 0 0 1 1 2
 
0 0 0 0
 
−1 1 5 6
 
 0 0 −3 −4
≡ , R3 → 3R3 + R2 .
 
 0 0 0 −1 
 
0 0 0 0

Thus rank(A − 2I) = 3 and so nullity(A − 2I) = 1. That is, the geometric multiplicity of the eigenvalue 2 is
1 which is not equal to the algebraic multiplicity of the eigenvalue 2. Hence A is not diagonalizable.

7. Find the orthogonal projection of v onto the subspace W spanned by the vectors u1 , u2 and u3 , where 2

v = [3, −2, 4, −3]t , u1 = [1, 1, 0, 0]t , u2 = [1, −1, −1, 1]t and u3 = [0, 0, 1, 1]t .

Solution: Note that {u1 , u2 , u3 } is an orthogonal basis for W . We have

     
u1 .v u2 .v u3 .v 1 2 1
projW (v) = u1 + u2 + u3 = u1 − u2 + u3 = [0, 1, 1, 0]t .
u1 .u1 u2 .u2 u3 .u3 2 4 2

8. Let {v1 , v2 , . . . , vn } be a linearly independent subset of a vector space V . Write w1 = v1 and

Pk
wk = cik vi for 2 ≤ k ≤ n such that cik > 0 for all 1 ≤ i ≤ n, 2 ≤ k ≤ n. Show that the set
i=1
{w1 , w2 , . . . , wn } is also linearly independent. 3

Solution: Let a1 w1 + a2 w2 + . . . + an wn = 0. This gives that

(a1 + a2 c12 + . . . + an c1n )v1 + (a2 c22 + . . . + an c2n )v2 + . . . + [an−1 cn−1,n−1 + an cn−1,n ]vn−1 + an cnn vn = 0.

Since {v1 , v2 , . . . , vn } is a linearly independent set, we have

 a1 + a2 c12 + . . . + an c1n = 0

a2 c22 + . . . + an c2n = 0
..
.

an−1 cn−1,n−1 + an cn−1,n = 0

an cnn = 0.

The above system of equations gives that an = an−1 = . . . = a2 = a1 = 0. Hence the set {w1 , w2 , . . . , wn } is
also linearly independent.
4
P
9. Write a basis for the subspace {[aij ] ∈ M2×4 (R) : aij = 0 for i = 1, 2}. No justification is required. 1
j=1
Solution: Take
           
 1 −1 0 0 1 0 −1 0 1 0 0 −1 0 0 0 0 0 0 0 0 0 0 0 0 
 ,  ,  ,  ,  ,   .
 0 0 0 0 0 0 0 0 0 0 0 0 1 −1 0 0 1 0 −1 0 1 0 0 −1 

10. Use coordinate vectors with respect to the standard basis of R3 [x] to find a basis for the subspace
span(−1 + x + x3 , 1 + x + 2x2 + 3x3 , 2x + 2x2 + 4x3 , 3 + 4x + 7x2 + 11x3 ). 2

Solution: The coordinates of −1 + x + x3 , 1 + x + 2x2 + 3x3 , 2x + 2x2 + 4x3 and 3 + 4x + 7x2 + 11x3 are
[−1, 1, 0, 1]t , [1, 1, 2, 3]t , [0, 2, 2, 4]t and [3, 4, 7, 11]t , respectively. We have
   
−1 1 0 3 −1 1 0 1
 
 
 1 1 2 4  0 2 2 7
A=  ≡ , R2 → R2 + R1 , R4 → R4 + R1
   
 0 2 2 7  0 2 2 7

 
1 3 4 11 0 4 4 14
 
−1 1 0 1
 
 0 2 2 4
≡ , R3 → R3 − R2 , R4 → R4 − 2R2 .
 
 0 0 0 0
 
0 0 0 0

Thus a basis for col(A) is {[−1, 1, 0, 1]t , [1, 1, 2, 3]t }. The corresponding basis for the given span is {−1 + x +
x3 , 1 + x + 2x2 + 3x3 }.

11. Consider the subspace W = {[x, y, z, w]t ∈ R4 : x+y +z +w = 0}. Give an example of a linear transformation
T : M2 (R) → W such that rank(T ) = 3. No justification is required. 2
       
1 0 0 1 0 0 0 0
Solution: Take A =  , B =  , C =  , D =   and u = [1, −1, 0, 0]t , v = [1, 0, −1, 0]t ,
0 0 0 0 1 0 0 1
w= [1, 0, 0, −1]t . Note that {A, B, C, D} is a basis for M2 (R) and {u, v, w} is a basis for W .

Define T : M2 (R) → W such that T (A) = u, T (B) = v, T (C) = w and T (D) = 0. Then we have
   
a b a b
T   = [a + b + c, −a, −b, −c]t for all   ∈ M2 (R).
c d c d
12. Let T : V → W be a linear transformation from a finite dimensional vector space V to a vector space W .
Show that rank(T ) + nullity(T ) = dim(V ). 4

Solution: Let dim(V ) = n and nullity(T ) = k. Let {v1 , . . . , vk } be a basis for ker(T ). Let us extend this
basis to a basis {v1 , . . . , vk , vk+1 , . . . , vn } for V .

Notice that range(T ) = span(T (v1 ), . . . , T (vn )) = span(T (vk+1 ), . . . , T (vn )), as v1 , . . . , vk ∈ ker(T ).

Again for scalars bk+1 , . . . , bn , we have

bk+1 T (vk+1 ) + . . . + bn T (vn ) = 0

⇒T (bk+1 vk+1 + . . . + bn vn ) = 0

⇒bk+1 vk+1 + . . . + bn vn ∈ ker(T )

⇒bk+1 vk+1 + . . . + bn vn = b1 v1 + . . . + bk vk for some scalars b1 , . . . , bk

⇒(−b1 )v1 + . . . + (−bk )vk + bk+1 vk+1 + . . . + bn vn = 0

⇒ − b1 = 0, . . . , −bk = 0, bk+1 = 0, . . . , bn = 0.

Thus {T (vk+1 ), . . . , T (vn )} is linearly independent. Hence {T (vk+1 ), . . . , T (vn )} is a basis for range(T ) and
so rank(T ) + nullity(T ) = k + (n − k) = n = dim(V ).

d
13. Let T : R3 [x] → R3 [x] be defined by T (p(x)) = p(x) + dx (p(x)) for all p(x) ∈ R3 [x]. Show that T is an
isomorphism. 3

Solution: Let p(x), q(x) ∈ R3 [x] and α ∈ R. Then we have

d d d
T (αp(x) + q(x)) = αp(x) + q(x) + (αp(x) + q(x)) =α[p(x) + (p(x))] + [q(x) + (q(x))]
dx dx dx
=αT (p(x)) + T (q(x)).

Thus T is linear. Again, let p(x) = a + bx + cx2 + dx3 ∈ ker(T ). Then we have

d
T (p(x)) = 0 ⇒ p(x) + (p(x)) = 0 ⇒(a + bx + cx2 + dx3 ) + (b + 2cx + 3dx2 ) = 0
dx
⇒(a + b) + (b + 2c)x + (c + 3d)x2 + dx3 = 0

⇒a + b = 0, b + 2c = 0, c + 3d = 0, d = 0

⇒a = b = c = d = 0

⇒p(x) = 0.

Thus ker(T ) = {0} and therefore T is one-one. Since T is a one-one linear transformation and the dimension
of the domain and co-domain of T are equal, we find that T is onto as well. Hence T is an isomorphism.