MTE-02

ASSIGNMENT BOOKLET
Bachelor’s Degree Programme
(B.Sc./B.A./B.Com.)

LINEAR ALGEBRA
(1st January, 2019 to 31st December, 2019)

• It is compulsory to submit the Assignment before filling in the

Term-End Examination form.

• It is mandatory to register for a course before appearing in the

Term-End Examination of the course. Otherwise, your result will
not be declared.

For B.Sc. Students Only

• You can take electives(56 or 64 credits) from a minimum of TWO
and a maximum of FOUR science disciplines, viz. Physics,
Chemistry, Life Sciences and Mathematics.

• You can opt for elective courses worth a MINIMUM OF 8 CREDITS

and a MAXIMUM OF 48 CREDITS from any of these four disciplines.

• At least 25% of the total credits that you register for in the
elective courses from elective courses from Life Sciences,
Chemistry and Physics discipline must be from the laboratory
courses. For example, if you opt for a total of 24 credits of
electives in these 3 disciplines, at least 6 credits should be from
lab courses.

School of Sciences
Indira Gandhi National Open University
Maidan Garhi, New Delhi-110068
( 2019)
Dear Student,
Please read the section on assignments in the Programme Guide for elective Courses that we
sent you after your enrolment. A weightage of 30%, as you are aware, has been earmarked for
continuous evaluation, which would consist of one tutor-marked assignment for this course.
The assignment is in this booklet.

Instructions for Formatting Your Assignments

Before attempting the assignment please read the following instructions carefully.

1) On top of the first page of your answer sheet, please write the details exactly in the
following format:

ROLL NO. :. . . . . . . . . . . . . . . . . . . . . . . . . .
NAME :. . . . . . . . . . . . . . . . . . . . . . . . . .
ADDRESS :. . . . . . . . . . . . . . . . . . . . . . . . . .
..........................
..........................
COURSE CODE : . . . . . . . . . . . . . . . . . . . . . . . . . ..........................
COURSE TITLE : . . . . . . . . . . . . . . . . . . . . . . . .
STUDY CENTRE : . . . . . . . . . . . . . . . . . . . . . . . . DATE. . . . . . . . . . . . . . . . . . . . . . . . . .
PLEASE FOLLOW THE ABOVE FORMAT STRICTLY TO FACILITATE
EVALUATION AND TO AVOID DELAY.

2) Use only foolscap size writing paper (but not of very thin variety) for writing your answers.

3) Leave a 4 cm margin on the left, top and bottom of your answer sheet.

4) Your answers should be precise.

5) While solving problems, clearly indicate which part of which question is being solved.

6) This assignment is to be submitted to the Study Centre as per the schedule made by the
study centre. Answer sheets received after the due date shall not be accepted.

7) This assignment is valid only up to 31st December, 2019. If you fail in this assignment or
fail to submit it by 31st December, 2019, then you need to get the assignment for the year
2020 and submit it as per the instructions given in the Programme Guide.

8) You cannot fill the Exam form for this course till you have submitted this assignment.
So solve it and submit it to your study centre at the earliest.

9) We strongly suggest that you retain a copy of your answer sheets.

We wish you good luck.

2
 Assignment
Course Code: MTE-02
Assignment Code: MTE-02/TMA/2019
Maximum Marks: 100

1) a) Which of the following are binary operations on C? Justify your answer.

i) The operation 5 defined by x 5 y = |xy| .
ii) The operation 4 defined by x 4 y = xy where the bar denotes complex
conjugation.
Also, for those operations which are binary operations, check whether they are
associative and commutative. (5)
b) Find the vector equation of the plane determined by the points (1, 1, −1), (1, 1, 1)
and (0, 1, 1). Also find the point of intersection of the line
r = (1 + 3t)i + (2 − t)j + (1 + t)k and the plane . (3)
i+j+k
√ , i−j
√ , i−2j+k
√
c) Check whether the vectors 3 2 6
are orthonormal. (2)

2) a) Check whether the set of vectors v1 = (1, 1, 0, 1), v2 = (1, 0, 2, 1),

v3 = (−1, 1, −3, −2) ∈ R4 are linearly indpendent. If they are dependent, find α1 ,
α2 and α3 ∈ R, not all zero, such that α1 v1 + α2 v2 + α3 v3 = 0. (5)
b) Which of the following are subspaces of R3 ? Justify your answer.

i) S = {(x, y, z) ∈ R3  x + y = z}

S = (x, y, z) ∈ R3  2x = 3yz

ii) (5)
3) Let
P(e) = {p(x) ∈ R[x]|p(x) = p(−x)}
P(o) = {p(x) ∈ R[x]|p(x) = −p(−x)}

a) Check that P(e) and P(o) are subspace of R[x]. (4)

b) Show that
(  )

P(e) = ∑ ai xi ∈ R[x] ai = 0 if i is odd.

i 
(  )

P(o) = ∑ ai xi ∈ R[x] ai = 0 if i is even.

i 

Deduce that P(o) ∩ P(e) = {0}. (5)

c) Check p(x) + p(−x) ∈ P(e) for every p(x) ∈ R(x). Check that the map
ψ : R[x] → P(e) given by ψ(p(x)) = p(x)+p(−x)
2 is a linear map. Further, check that
2
ψ = ψ. Determine the kernel of ψ. (6)
4) a) Let T : R3 → R3 be defined by
T (x1 , x2 , x3 ) = (x1 + x3 , x3 , x2 − x3 ) .
Is T invertible? If yes, find a rule for T −1 like the one which defines T . If T is not
invertible, check whether T satisfies Cayley-Hamiltion theorem. (4)

3
 b) Find the inverse of the matrix
 
2 1 0
0 1 1
1 1 0

using row reduction. (3)

5) a) Check whether the following system of equations has a solution. (6)

4x + 2y + 8z + 6w = 4
2x + 2y + 2z + 2w = 0
x + 3z + 2w = 3

b) Define T : R3 → R3 by

T (x, y, x) = (−x, x − y, 3x + 2y + z).

Check whether T satisfies the polynomial (x − 1)(x + 1)2 . Find the minimal
polynomial of T . (4)

6) a) Let T : P2 → P2 be defined by

T (a + bx + cx2 ) = b + 2cx + (a − b)x2 .

Check that T is a linear transformation. Find the matrix of the transformation with
respect to the ordered bases B1 = {x2 , x2 + x, x2 + x + 1} and B2 = {1, x, x2 }. Find
the kernel of T . (4)
b) Consider the basis e1 = (1, 1, −1), e2 = (−1, 1, 1) and e3 = (1, −1, 1) of R3 over R.
Find the dual basis of {e1 , e2 , e3 }. (3)

7) a) Check whether the matrices A and B are diagonalisable. Diagonalise those matrices
which are diagonalisable. (11)
   
1 0 0 −2 −4 −1
i) A = 1 2 −3
  ii) B =  3 5 1.
1 1 −2 1 1 2
b) Find inverse of the matrix B in part a) of the question by using Cayley-Hamiltion
theorem. (2)
c) Find the inverse of the matrix A in part a) of the question by finding its adjoint. (3)

8) a) Let P3 be the inner product space of polynomials of degree at most 3 over R with
respect to the inner product
Z 1
h f , gi = f (x)g(x) dx.
0

Apply the Gram-Schmidt orthogonalisation process to find an orthonormal basis for

the subspace of P3 generated by the vectors (8)

1 − 2x, 2x + 6x2 , −3x2 + 4x3 .



4
 b) Consider the linear operator T : C3 → C3 , defined by

T (z1 , z2 , z3 ) = (z1 + iz2 , iz1 − 2z2 + iz3 , −iz2 + z3 ) .

i) Compute T ∗ and check whether T is self-adjoint.

ii) Check whether T is unitary. (6)
c) Let (x1 , x2 , x3 ) and (y1 , y2 , y3 ) represent the coordinates with respect to the bases
B1 = {(1, 0, 0), (0, 1, 0), (0, 0, 1)}, B2 = {(1, 0, 0), (0, 1, 2), (0, 2, 1)}. If
Q(X) = x12 − 2x1 x2 + 4x2 x3 + x22 + x32 , find the representation of Q in terms of
(y1 , y2 , y3 ). (3)

9) Find the orthogonal canonical reduction of the quadratic form −x2 + y2 + z2 − 4xy − 4xz.
Also, find its principal axes. (8)

10) Which of the following statements are true and which are false? Justify your answer with
a short proof or a counterexample. (10)

i) R2 has infinitely many non-zero, proper vector subspaces.

ii) If T : V → W is a one-one linear transformation between two finite dimensional
vector spaces V and W then T is invertible.
iii) If Ak = 0 for a square matrix A, then all the eigenvalues of A are zero.
iv) Every unitary operator is invertible.
v) Every system of homogeneous linear equations has a non-zero solution.

Block 1 29; Block 2 30; Block 3 16; Block 4 25; Block 5 0 Block 6 0 Total 100

5
 Marking Scheme
MTE-02
2019
The solution presented in the marking scheme may be one of the possible solutions. Marks
may be given for any other correct solution.

1. a) i) The first operation is a binary operation because |xy| ∈ R ⊂ C (1)

The second operation is a binary operation because for any x, y ∈ S, xy ∈ C
and xy ∈ C. (1)
We have

(x 5 y) 5 z = (|xy|) 5 z
= ||xy|z| = ||xy|||z|
= |xy||z| = |x||y||z|
= |x||yz| = x 5 (|yz|)

∴ 5 is associative. (1)
Also, |x 5 y| = |xy| = |yx| since multiplication is commutative in C.
∴ x 5 y = y 5 x and 5 is commutative. ( 21 )
We have

x 4 (y 4 z) = x 4 (yz) = xyz = xyz

(x 4 y) 4 z = xy 4 z = xyz = xyz 6= x 4 (y 4 z)

for example when x = i, y = 1, z = 1. In this case xyz = −i and xyz = i. So, 4

is not associative. (1)
We have x 4 y = xy = yx = y 4 z. So, 4 is commutative. ( 21 )
b) Taking a = (1, 1, −1), b = (1, 1, 1) and c = (0, 1, 1), the equation of the plane is

r = a + α(b − a) + µ(c − a)
= i + j − k + α(2k) + µ(−i + 2j)
= (1 − µ)i + (1 + µ)j + (−1 + 2α)k (1)

If the line r = (1 + 3t)i + (2 − t)j + (1 + t)k intersects the above plane, we have
1 − µ = 1 + 3t, 1 + µ = 2 − t, −1 + 2α = 1 + t. or 3t + µ = 0, µ + t = 1,
2α − t = −2. ( 12 )
Solving, we get t = − 12 , µ = 23 , α = 34 . ∴ the line and the plane intersect. (1)
Substituting the value of t in the equation of the line, we get
       
3 1 1
r = 1− i+ 2− − j+ 1+ − k
2 2 2
1 5 1
= − i + j + k.
2 2 2
So, the point of intersection is − 12 , 52 , 12 . ( 12 )

6
 c) We have
r
i + j + k
√ = 1+1+1 =1
3 3 3 3
r
i − j 1 1
2 = 2+2 =1

r
i − 2j + k
√ = 1+4+1 =1 (1)
6 6 6 6
So, all the vectors have norm 1. We have
  
i+j+k i−j 1
√ √ = √ =0
3 2 6
  
i+j+k i − 2j + k 1 2 1
√ √ = √ −√ +√ =0
3 6 18 18 18
  
i−j i − 2j + k 1 2 1
√ √ = √ − √ = − √ 6= 0 ( 21 )
2 6 6 6 6
So, the vectors are not orthogonal and hence not orthonormal. ( 21 )

2. The vectors are linearly dependent iff there are α1 , α2 and α3 , not all zero, such that
α1 v1 + α2 v2 + α3 v3 = 0, i.e

(α1 + α2 − α3 , α1 + α3 , α1 + 2α2 − 3α3 , α2 − 2α3 )

3. a) Checking that T is a linear operator. (1)

Checking that T 4 = I:

T 2 (x1 , x2 , x3 , x4 ) = T (−x2 , x1 , −x4 , x3 ) = (−x1 , −x2 , −x4 , −x3 ) ( 12 )

T 3 (x1 , x2 , x3 , x4 ) = T (−x1 , −x2 , −x4 , −x3 ) = (x2 , −x1 , x4 , −x3 ) ( 12 )
T 4 (x1 , x2 , x3 , x4 ) = T (x2 , −x1 , x4 , −x3 ) = (x1 , x2 , x3 , x4 ) ( 12 )

T T 3 = T 3 T = I. So, T is invertible. ( 12 )
b) Let v ∈ V , v 6= 0. Then [v] is a one dimensional subspace of V and T [v] ⊂ [v], so,
T v = λ v for some λ ∈ F. (1)
Enough to show that, if v1 , v2 ∈ V and T v1 = λ1 v1 and T v2 = λ2 v2 , λ1 = λ2 . (1)
Suppose v1 , v2 ∈ V , T v1 = λ1 v1 and T v2 = λ2 v2 and v2 = µv1 . Let, T v1 = λ1 v1 .
Then, T v2 = T (µv2 ) = µT v1 = λ1 µv1 = λ1 v2 . So, λ1 = λ2 . (1)
Suppose, v1 and v2 are linearly independent. We have v3 = v1 + v2 6= 0. Suppose
T v3 = λ3 v3 . Then, T (v1 + v2 ) = T (v1 ) + T (v2 ) = λ1 v1 + λ2 v2 = λ3 v1 + λ3 v2 . (2)
We have λ3 = λ1 = λ1 by linear independence of v1 and v2 . (1)
Proving the converse. (1)

4. a) We can write the equation in the form AX = B, where

 
    x
4 2 8 6 5 y
A = 2 2 2 2 , B = 7 , and X =  z

1 0 3 2 5
w

7
 The equations have a solution only if ρ(A) = ρ[A B]. So, we need to find the ranks
of A and the augmented matrix [A B]. ( 21 )
 
4 2 8 6
A = 2 2 2 2
1 0 3 2
Carrying out row operations
  R1 → 41 R1 , R2 → R2 − 2R1 , R3 → R3 − R1 , we get
1 1/2 2 3/2
0 1 −2 −1  (1 12 )
0 −1/2 1 1/2  
1 1/2 2 3/2
Carrying out row operation R3 → R3 + (1/2)R2 , we get 0 1 −2 −1 . ( 12 )
0 0 0 0
Therefore, the rank of A is 2. ( 12 )
We have
 
4 2 8 6 4
[A B] = 2 2 2 2 0 .
1 0 3 2 3
Carrying out row operations R1 → 41 R1 , R2 → R2 − 2R1 , R3 → R3 − R1 , we get

1 1/2 2 3/2 1
0 1 −2 −1 −2. (1 12 )
0 −1/2 1 1/2 2
Carrying
  R3 → R3 + (1/2)R2 , we get
out row operations
1 1/2 2 3/2 1
0 1 −2 −1 −2. ( 12 )
0 0 0 0 1
So, ρ([A B]) = 3 6= ρ(A). ∴ no solution exists. ( 21 )
b) Checking that T is a linear transformation. (1)

T x2 = 1 − x ( 12 )

T x + x2 = 2 − x ( 12 )

T 1 + x + x2 = 2 ( 12 )

∴ the matrix is
 
1 2 2
( 12 )
−1 −1 0
Kernel is a − ax + x2 | a ∈ R

(1)
5. a) The characteristicpolynomial is 3 2 2
 x + x − x − 1 = (x + 1) (x − 1). (1 21 )
2 −2 0
We have A − I = 4 −4 0 . Carrying out row operations R1 → 12 R1 ,

4 −2 −2  
1 −1 0
R2 → R2 − 4R1 , and R3 → R3 − 4R1 we get 0 0 0 .
0 2 −2

8
  
x
So, the eigenvectors y for the eigenvalue 1 satisfy the equation x − y = 0,
z    
x 1
y − z = 0. So, the solution is x = x 1, where x ∈ R. (1 12 )
 x 1  
4 −2 0 x
We have A + I = 4 −2 0 , So,the eigenvectors y satisfy the equation 2x = y.
  
4 −2 0     z
x 1 0
So, the eigenvectors are 2x = x 2 + z 0.
     (2)
z 0 1
Since there are
 three linearly
 independent eigenvectors,
 Ais diaonalisable. ( 12 )
1 1 0 1 0 0
  −1
Taking P = 1 2 0 , we have P AP = 0 −1 0 .  ( 12 )
1 0 1 0 0 −1
b) The characteristicpolynomialis x3 − 4x2 + 5x − 2 = (x 2
 − 1) (x − 2).
 (1 12 )
−1 1 0 −1 1 0
We have B − I = −1 1 0 . R3 → R3 − 2R1 gives −1 1 0. So, the
  
  −2 1 1 0 −1 1
x
eigenvectors y for the eigenvalue 1 satisfy the equation x = y, y = z. So, the
 z  
x 1
solution is x = x 1, where x ∈ R.
   (1 12 )
x  1   
−2 1 0 x
We have B − 2I = −1 0 0. So, the eigenvectors y for the eigenvalue 2
−2 1 0 z    
x 0 0
satisfy the equation 2x = y, x = 0. So, the solution is 2x = 0 = z 0, where
z z 1
z ∈ R. (1 21 )
Since there are only two linearly independent eigenvectors, B is not diagonalisable.
( 21 )
c) The minimal polynomial for A is either (x + 1)(x − 1) = x2 − 1 or (x + 1)2 (x − 1)
because the characteristic polnomyial and the minimal polynomial have the same
roots. ( 21 )
We have A2 = I, So, A2 − I = 0 and x2 − 1 = 0 is the minimal polynomial. (1 21 )
2 1
The minimal polynomial
  (x − 1)(x
of Bhas to be either  − 2) or (x − 1) (x − 2). ( 2 )
−1 1 0 −2 1 0
We have B − I = −1 1 0 , B − 2I = −1 0 0.
  
−2 1 1  −2 1 0
1 −1 0
∴ (B − I)(B − 2I) = 1 −1 0 6= 0. So, the minimal polynomial has to be

1 −1 0

9
 (x − 1)2 (x − 2). (1 12 )
Determinant of B is2.  ( 21 )
4 −2 0
The adjoint of B is 2 0 0.
 (2)
3 −2 1 
4 −2 0
So, the inverse is 12 2 0 0. ( 12 )
3 −2 1
By Cayley-Hamiltion theorem, B(B2 − 4B + 5I) = 2I. So, A−1 = 12 A2 − 4A + 5I

( 21 )    
−1 2 0 4 −2 0
Computing B2 = −2 3 0 and B2 − 4B + 5I = 2 0 0,
 −5
 2 4 3 −2 1
4 −2 0
−1 1
A = 2 2 0 0. (1 12 )
3 −2 1

6. a) Let v1 = (−1, 1, 0, 1), v2 = (1, 0, −1, 0), and v3 = (1, 0, 2, −1). We have v01 = v1 . ( 12 )
We have
hv2 , v01 i 0
 
0 (−1) 2 1 1
v2 = v2 − 0 0 v1 = (1, 0, −1, 0) − (−1, 1, 0, 1) = , − , −1, (1)
hv1 , v1 i 3 3 3 3
We have
hv3 , v01 i 0 hv3 , v02 i 0
v03 = v3 − v − v
hv01 , v01 i 1 hv02 , v02 i 2
−2 −5/3
= (1, 0, 2, −1) − (−1, 1, 0, 1) − (2/3, 1/3, −1, 1/3)
3 5/3
= (1, 0, 2, −1) − (2/3, −2/3, 0, −2/3) − (−2/3, −1/3, 1, −1/3)
= (1 − 2/3 + 2/3, 0 + 2/3 + 1/3, 2, 2 − 0 − 1, −1 + 2/3 + 1/3) = (1, 1, 1, 0)
(1 12 )
Normalising to get

v03
r 
v01 v02

1 3 2 1 1 1
w1 = 0 = √ (−1, 1, 0, 1), w2 = 0 = , , −1, , w3 = 0 = √ (1, 1, 1, 0).
kv1 k 3 kv2 k 5 3 3 3 kv3 k 3
(1)

b) i) Let u = (u1 , u2 , u3 , u4 ) and w = (w1 , w2 , w3 , w4 ) ∈ C4 . We have

hT (u), wi = h(−iu2 , iu1 , −iu4 , u3 ) , (w1 , w2 , w3 , w4 )i ( 12 )

= −iu2 w1 + iu1 w2 − iu4 w3 + u3 w4 ( 12 )
= u1 (−iw2 ) + u2 (iw1 ) + u3 w4 + u4 (iw3 ) (1)
= h(u1 , u2 , u3 , u4 ) , (−iw2 , iw1 , w4 , w3 )i ( 21 )

∴ T ∗ (w1 , w2 , w3 , w4 ) = (−iw2 , iw1 , w4 , w3 ) ( 12 )

Here T 6= T ∗ So, T is not Hermitian. (1)

10
 ii) We have
(T T ∗ ) (u1 , u2 , u3 , u4 ) = T (−iu2 , iu1 , u4 , u3 ) ( 12 )
= ((−i)(iu1 ), i(−iu2 ), (−i)(iu3 ), u4 )
= (u1 , u2 , u3 , u4 ) (1)

T T ∗ = I, so T is unitary. ( 12 )
 
−1 1 −1
7. a) Then matrix of the quadratic form is A =  1 1 1 . ( 12 )
−1 1 1
3 2
The characteristic polynomial is x − x − 4x + 4 = (x + 2)(x − 2)(x − 1). (1)
2 + 2y2 + z2 . 1
∴ the orthogonal canonical
 form is
 −2x ( 2)
−3 1 −1
We have A − 2I = 1 −1 1 .

−1 1 −1  
−3 1 −1
Carrying out R3 → R3 + R2 , and R2 = R2 + ( 13 )R1 , we get  0 −2/3 2/3. We
0 0 0 
0
get y = z and −3x + y − z = 0 or x = 0. Eigenvector corresponding to 2 is 1. (1 12 )

  1
−2 1 −1
We have A − I =  1 0 1 . Carrying out row operations R3 → R3 + R1 and
−1 1  0 
−2 1 −1
R2 → R2 + ( 21 )R1 , we get  0 1/2 1/2. We get the equations y = −z and
0  1 1
1
−2x + y − z = 0 or x = y. So,  1 . (1 12 )
 −1

1 1 −1
We have A + 2I =  1 3 1 . Carrying out row operations R2 → R2 + (−1)R1
−1 1 3 
1 1 −1
and R3 → R3 + R1 , we get 0 2 2 . We get the equations x + y − z = 0 and
0  2 2
2
y = −z. So, we get x = 2z. So, −1 is an eigenvector for −2.
 (1 21 )
1
Normalising, we get the principal axes
   1   2 
0 √ √
3 6
 √1   √1  − √1 
 2  ,  3  and  6
( 12 )
1
√
2 − √13 √1
6
 
1 −3
8. The matrix of the quadratic form is ( 12 )
−3 1

11
 The characteristic polynomial is x2 − 2x − 8 = (x − 4)(x + 2) (1)
1
The co-ordinate tranform reduces it to 4x2 − 2y2 . 2
x2 y2
So, the transformed equation is 4x2 − 2y2 = 4, which is the same as 1 − 22 = 1, which is a
hyperbola. (1)

9. NOTE: NO MARKS SHOULD BE GIVEN IF THERE IS NO VALID

JUSTIFICATION.
i) True. Every line through the origin is a proper, non-zero subspace and there are
infinitely many of them.
ii) False For e.g. T : R2 → R3 defined by T ((1, 0)) = (1, 0, 0), T ((0, 1)) = (0, 1, 0), then
T is one-one because

T ((x, y)) = T (x(1, 0) + y(0, 1)) = xT ((1, 0)) + yT ((0, 1))

= x(1, 0, 0) + y(0, 1, 0) = (x, y, 0)

T ((x, y)) = 0 implies (x, y, 0) = (0, 0, 0) or (x, y) = 0. But, T is not onto because the
third coordinate of T ((x, y)) is always 0, so (0, 0, 1) is not in the image of T . So, T −1
doesn’t exist.
iii) True. The minimal polynomial divides xk , so it is of the form xm for some m with
0 < m ≤ k. So all the eigenvalues are 0.
iv) True. If U is a unitary operator, UU ∗ = I. So, det(U) det(U ∗ ) = det(I) = 1,
det(U) 6= 0. So, U is non-singular.
v) False. Writing the equations

2x + 3y = 0
3x + y = 0

in the form of matrix equation

    
2 3 x 0
=
3 1 y 0
 
2 3
we see that is invertible so
3 1
      
x −1/7 3/7 0 0
s= =
y 3/7 −2/7 0 0
 
0
So, is the only solution.
0

12