MA 102: Engineering Mathematics II Odd Sem ’19–’20

Solution to the Tutorial Sheet 4: September 13, 2019

Lecturer: D. Ghosh Scribes: Sandeep

1. (a) T1 is not linear transformation because T1 (0, 0) = (0, 1) 6= (0, 0).

(b) T2 is not linear transformation because T2 (0, 0) = (1, 0) 6= (0, 0).

(c) Note that {(1, −1, 1), (1, 1, 1), (1, 0, 0)} is a basis of R3 . Let T (1, 0, 0) = (a, b), a and b being any real
number. Then, note that
x3 −x2 x2 +x3
T (x1 , x2 , x3 ) = T (c1 (1, −1, 1) + c2 (1, 1, 1) + c3 (1, 0, 0)), where c1 = 2 , c2 = 2 , c3 = x1 − x3
= c1 T (1, −1, 1) + c2 T (1, 1, 1) + c3 T (1, 0, 0)
= c1 (1, 0) + c2 (0, 1) + c3 (a, b)
= (c1 + a c3 , c2 + b c3 )
= ( x3 −x
2
2
+ a (x1 − x3 ), x3 +x
2
2
+ b (x1 − x3 )).

2x+y y−x x+2y−3z

2. Show that T is one-one and onto. T −1 (x, y, z) =


3 , 3 , 3 .

3. You can show that T is one-one and onto.

Aliter. As T (α) = α + β
T (β) = γ + β
T (γ) = γ,  
1 1 0
the matrix of the linear transformation with respect to the given basis is A = 0 1 1 . As det(A) = 1 6= 0,
0 0 1
the linear transformation T is invertible. So T is bijective.

4. (a) T : R3 → R4 is defined by T (x, y, z) = (−x + y − z, x − y + z, x + y − z, x + y + z).

Consider α, β ∈ R, and x = (x1 , x2 , x3 ) and y = (y1 , y2 , y3 ) ∈ R3 .
Note that T (αx + βy) = T (α(x1 , x2 , x3 ) + β(y1 , y2 , y3 ))
= T (αx1 + βy1 , αx2 + βy2 , αx3 + βy3 )
= (−αx1 − βy1 + αx2 + βy2 − αx3 − βy3 , αx1 + βy1 − αx2 − βy2 + αx3 + βy3 , αx1 + βy1 − αx2 −
βy2 − αx3 − βy3 , αx1 + βy1 + αx2 + βy2 + αx3 + βy3 )
= α(−x1 + x2 − x3 , x1 − x2 + x3 , x1 + x2 − x3 , x1 + x2 + x3 ) + β(−y1 + y2 − y3 , y1 − y2 + y3 , y1 +
y2 − y3 , y1 + y2 + y3 )
= αT (x1 , x2 , x3 ) + βT (y1 , y2 , y3 ) = αT (x) + βT (y).
Hence, T is linear transformation.

The null space of T is given by

NT = {(x, y, z) ∈ R3 | T (x, y, z) = (0, 0, 0)}

= {(x, y, z) ∈ R3 | x − y + z = 0, x + y − z = 0, x + y + z = 0}
= {(0, 0, 0)}.

4-1
4-2 Lecture 4: September 13, 2019

The range space of T is given by

RT = {T (x, y, z) | (x, y, z) ∈ R3 }
= {(x − y + z, x + y − z, x + y + z) | x, y, z ∈ R3 }

(b) The null space of T is the set of all skew-symmetric matrices. The range space is the set of all symmetric
matrices.
5. Given T (a + bx + cx2 ) = b + 2cx. Thus
NT = {a + bx + cx2 | b + 2cx = 0, a, b, c ∈ R}
= {a + bx + cx2 | b = c = 0, a, b, c ∈ R}
= {a + 0x + 0x2 | a ∈ R} = L{1}
and
RT = {b + 2cx | b, c ∈ R} = L{1, x}.
Hence, nullity(T ) = dim(NT ) = 1, rank(T ) = dim(RT ) = 2, and hence rank(T )+nullity(T ) = 3 =dim(P2 (R)).
Note that T (1) = f 0 (1) = 0 = 0 + 0x + 0x2
T (x) = f 0 (x) = 1 + 0x + 0x2
T (x2 ) = 0 + 2x + 0x2 .  
0 1 0
Thus the matrix representation of T is 0 0 2 .
0 0 0
6. (a) We are given W1 = {(a1 , a2 , a3 , a4 , a5 ) ∈ R5 |a1 − a3 − a4 = 0}.
A basis for W1 is set of linearly independent vectors which spans W1 .
We have a1 − a3 − a4 = 0 =⇒ a4 = a1 − a3
and hence (a1 , a2 , a3 , a4 , a5 ) = (a1 , a2 , a3 , a1 − a3 , a5 )
= a1 (1, 0, 1, 0, 0) + a2 (0, 1, 0, 0, 0) + a3 (0, 0, 1, −1, 0) + a5 (0, 0, 0, 0, 1)
So, W1 = L{(1, 0, 1, 0, 0), (0, 1, 0, 0, 0), (0, 0, 1, −1, 0), (0, 0, 0, 0, 1)}.
As {(1, 0, 1, 0, 0), (0, 1, 0, 0, 0), (0, 0, 1, −1, 0), (0, 0, 0, 0, 1)} is L.I. in W1 , a basis for W1 is
{(1, 0, 1, 0, 0), (0, 1, 0, 0, 0), (0, 0, 1, −1, 0), (0, 0, 0, 0, 1)}.

As there are four elements in the basis of W1 , dimension of W1 = 4.

(b) dim(W2 ) = 1.
4 4
7. The LT  T : R → R be a linear transformation defined by T (x) = Ax, where
 is defined by
1 1 1 2
1 1 3 2
A= 2 5 2 6 .


6 4 8 5
The null space of T is given by N (T ) = N (A) = {x ∈ R4 | Ax = 0}.
So, the null space is a set of all the solutions for the system Ax = 0. For the solution of the system we consider
the augumented matrix [A|0] and reduce the matrix by elementary row operations.
We have 
1 1 1 2 0
1 1 3 2 0
[A|0] = 2 5 2 6 0


6 4 8 5 0
Lecture 4: September 13, 2019 4-3

row operations:
 R2 ← R2 − R1 ,R3 ← R3 − 2R1 , R4 ← R4 − 6R1
1 1 1 2 0
0 0 2 0 0
[A|0] = 0 3 0 2 0


0 −2 2 −7 0
 R2 and R3
interchange 
1 1 1 2 0
0 3 0 2 0
[A|0] = 0 0 2 0 0


0 −2 2 −7 0
R2 ← 31 R 2 then R1 ←4R1 −R2 R4 , ← R4 + R2
1 0 1 3 0
0 1 0 2
3 0
[A|0] = 0 0 2

0 0
0 0 2 −17 3 0
1
R4 ← R 4 − R3 , R3 ← 2 R3  then R1 ← R1 − R3
4
1 0 1 3 0
0 1 0 2
3 0
[A|0] =  
0 0 1 0 0
0 0 0 −17 3 0
−3
R4 ← 17R4 then R1 ← R1 − 43 R3 and R2 ← R2 − 32 R4
1 0 0 0 0
0 1 0 0 0
[A|0] =  
0 0 1 0 0
0 0 0 1 0
By back substitution method, we get from Ax = 0 that x1 = x2 = x3 = x4 = 0
So, the null space of T is {(0, 0, 0, 0)}.

 
0 0 2 2 0
1 3 2 4 1
8. We are given B =  2 6 2 6 2 .


3 9 1 10 6
Step 1:
 Interchange R  R2
1 and
1 3 2 4 1
0 0 2 2 0
B= 2 6 2 6 2


3 9 1 10 6
 3 ← R3 − 2R1 
Step 2:R
1 3 2 4 1
0 0 2 2 0
B=  
0 0 −2 −2 0
0 0 −5 −2 3
5
 R3 ← R3 + R2, R4 ← R4 + 2 R2
Step 3:
1 3 2 4 1
0 0 2 2 0
B= 0 0 0 0 0


0 0 0 3 3
Step 4: R1 ← R1 − R2 , interchange R3 and R4 and R3 ← 13 R3
4-4 Lecture 4: September 13, 2019

 
1 3 0 2 1
0 0 2 2 0
B= 0 0 0 1 1


0 0 0 0 0
1
 R1 ← R1 − 2R3 , R2 ← 2 R2
Step 5:
1 3 0 0 −1
0 0 1 1 0 
B= 0 0 0 1 1 


0 0 0 0 0
Step 6: R2 ← R1 − R3
 
1 3 0 0 −1
0 0 1 0 −1
B=
0

0 0 1 1
0 0 0 0 0

 form of B is given by
So therow reduced echelon
1 3 0 0 −1
0 0 1 0 −1
B= 0 0 0 1 1 .


0 0 0 0 0