Unit 4 - Linear Transformation

Q1. Define linear transformation with an example.

Answer. Let V and W be vector spaces (over F ). A function T : V → W is said to be a linear
transformation from V to W if, for all x, y ∈ V and c ∈ F , we have
(a) T(x + y) = T(x) + T(y) and
(b) T(cx) = c T(x).
Eg.1 For any angle θ, define Tθ : R2 → R2 by the rule: Tθ (a1 , a2 ) is the vector obtained by rotating
(a1 , a2 ) counterclockwise by θ if (a1 , a2 ) 6= (0, 0), and Tθ (0, 0) = (0, 0). Then Tθ : R2 → R2 is a
linear transformation that is called the rotation by θ.
Eg.2 Define T : R2 → R2 by T (a1 , a2 ) = (a1 , −a2 ). T is called the reflection about the x-axis.
Eg.3 Define T : R2 → R2 by T (a1 , a2 ) = (a1 , 0). T is called the projection on the x-axis.

Q2. Define the Range of a Linear Transformation.

Answer. Let V and W be vector spaces, and let T : V → W be linear. The range (or image)
R(T) of T is defined as the subset of W consisting of all images (under T ) of vectors in V ; that is,
R(T) = {T(x) : x ∈ V}.
Q3. Define the Null Space of a Linear Transformation.
Answer. Let V and W be vector spaces, and let T : V → W be linear. The null space (or kernel)
N (T ) of T is defined as the set of all vectors x in V such that T(x) = 0; that is, N(T) = {x ∈ V :
T(x) = 0}.
Q4. Is T : R3 (R) → R3 (R) defined by T (x, y, z) = (x, 0, 0) is a linear transformation?
Solution. Given, T : R3 (R) → R3 (R) defined by T (x, y, z) = (x, 0, 0).
a) T (x + y) = (x + y, 0, 0) = (x, 0, 0) + (y, 0, 0) = T (x) + T (y)
b) T (cx) = (cx, 0, 0) = c(x, 0, 0) = cT (x)
Since the conditions of linear transformation are satisfied, T is a linear transformation.
Q5. Test the map T : R → R defined by T (x) = x + 3 ∀x ∈ R is a linear transformation.
Solution. Given, T : R → R defined by T (x) = x + 3 ∀x ∈ R. We need to check whether the
conditions for linear transformations are satisfied.
a) T (x + y) = x + y + 3 and T (x) + T (y) = x + 3 + y + 3 = x + y + 6. Hence, T (x + y) 6= T (x) + T (y)
b) T (cx) = cx + 3 and cT (x) = c(x + 3) = cx + 3x. Hence, T (cx) 6= cT (x).
Since neither of the conditions of linear transformation are satisfied, T is not a linear transformation.
Q6. State dimension theorem.
Dimension Theorem. Let V and W be vector spaces, and let T : V → W be linear. If V is
finite-dimensional, then
nullity(T ) + rank(T ) = dim(V )

1
Note 1. In Fn , let e1 = (1, 0, 0, . . . , 0), e2 = (0, 1, 0, . . . , 0), . . . , en = (0, 0, . . . , 0, 1); {e1 , e2 , . . . , en }
is
 readily seen to be a basis for Fn and is called the standard basis for Fn . In Pn (F ) the set
1, x, x , . . . , xn is a basis. We call this basis the standard basis for Pn (F ).
2

Definition 1. Let β = {u1 , u2 , . . . , un } be an ordered basis for aP

finite dimensional vector space V.
n
For x ∈ V, let a1 , a2 , . . . , an be the unique scalars such that x = i=1 ai ui .
We define the coordinate vector of x relative to β, denoted [x]β , by
 
a1
 a2 
[x]β =  . 
 
 . .
an
 2 2
Eg. Let V =P2 (R),
 and let β = 1, x, x be the standard ordered basis for V. If f (x) = 4+6x−7x ,
4
then [f ]β =  6 .
−7
Definition 2. Using the notation above, we call the m × n matrix A defined by Aij = aij the matrix
representation of T in the ordered bases β and γ and write A = [T]γβ . If V = W and β = γ, then
we write A = [T]β .

Working Procedure to find matrix of LT.

Step 1. Write the standard ordered basis of V (say β = {u1 , u2 , u3 , . . . . . . , un } ) and the standard
ordered basis of W (say γ = {w1 , w, w3 , . . . . . . , wn )
 
a11
 a21 
 
Step 2. Find T (u1 ) = a11 w1 + a21 w2 + . . . + am1 wm =  a31 
 
 .. 
 . 
am1
 
a12
 a22 
 
Find T (u2 ) = a12 w1 + a22 w2 + . . . + am2 wm =  a32 
 
 .. 
 . 
am2
 
a13
 a23 
 
Find T (u3 ) = a13 w1 + a23 w2 + . . . + am3 wm =  a33 
 
 .. 
 . 
am3
..
.  
a1n
 a2n 
 
Find T (un ) = a1n w1 + a2n w2 + . . . . . . + amn wm =  a3n 
 
 .. 
 . 
amn
Step 3. The columns T (u1 ) , T (u2 ) , . . . , T (un ) gives
 the matrix of the linear transformation. Re-
a11 a12 · · · a1n
 a21 a22 · · · a2n 
 
quired matrix =  a31 a32 · · · a3n 
 
 .. .. .. .. 
 . . . . 
am1 am2 · · · amn

2
 Q7. Obtain the matrix representing the linear transformation T : R3 → R2 given by T (x, y, z) = (2x +
3y − z, x + z) with respect to the standard basis {e1 , e2 , e3 }.
Solution. Given the linear transformation T : R3 → R2 defined by T (x, y, z) = (2x + 3y − z, x + z).
The standard basis of R3 is {e1 , e2 , e3 }, where e1 = (1, 0, 0)0 , e2 = (0, 1, 0)0 , and e3 = (0, 0, 1)0 . We
need to compute T (e1 ), T (e2 ), and T (e3 ).
ˆ T (e1 ) = T (1, 0, 0) = (2(1) + 3(0) − 0, 1 + 0) = (2, 1)
ˆ T (e2 ) = T (0, 1, 0) = (2(0) + 3(1) − 0, 0 + 0) = (3, 0)
ˆ T (e3 ) = T (0, 0, 1) = (2(0) + 3(0) − 1, 0 + 1) = (−1, 1)

Each column of the matrix represents the image of the corresponding standard basis vector. Thus,
the matrix of T is:  
2 3 −1
M=
1 0 1
Therefore, the matrix representing the linear transformation T with respect to the standard basis
is:  
2 3 −1
M=
1 0 1

Q8. Let T : R2 → R2 be defined by T (x, y) = (4x − 2y, 2x + y). Find the matrix of T relative to the
standard basis.
Solution. Given the linear transformation T : R2 → R2 defined by T (x, y) = (4x − 2y, 2x + y). The
standard basis of R2 is {e1 , e2 }, where e1 = (1, 0) and e2 = (0, 1). We need to compute T (e1 ) and
T (e2 ).
ˆ T (e1 ) = T (1, 0) = (4(1) − 2(0), 2(1) + 0) = (4, 2)
ˆ T (e2 ) = T (0, 1) = (4(0) − 2(1), 2(0) + 1) = (−2, 1)

Each column of the matrix represents the image of the corresponding standard basis vector. Thus,
the matrix of T is:  
4 −2
M=
2 1

Q9. Let V and W be vector spaces, and let T : V → W be linear. Then prove that T is one-to-one if
and only if N (T ) = {0}
Proof. Suppose that T is one-to-one and x ∈ N(T). Then T(x) = 0 = T (0). Since T is one-to-one,
we have x = 0. Hence N (T ) = {0}.
Now assume that N(T) = {0}, and suppose that T(x) = T(y). Then 0 = T(x) − T(y) = T(x − y)
by linearity property. Therefore x − y ∈ N(T) = {0}. So x − y = 0, or x = y. This means that T is
one-to-one.
Q10. Let V and W be vector spaces and T : V → W be linear. Then prove that N(T) and R(T) are
subspaces of V and W respectively.
Proof. We use the symbols 0V and 0W to denote the zero vectors of V and W , respectively.
Since T (0V ) = 0W , we have that 0V ∈ N(T). Let x, y ∈ N(T) and c ∈ F . Then T(x + y) =
T(x) + T(y) = 0W + 0W = 0W , and T(cx) = cT(x) = c0W = 0W . Hence x + y ∈ N(T) and
cx ∈ N(T), so that N(T) is a subspace of V .
Because T (0V ) = 0W , we have that 0W ∈ R(T). Now let x, y ∈ R(T) and c ∈ F . Then there
exist v and w in V such that T(v) = x and T(w) = y. So T(v + w) = T(v) + T(w) = x + y, and
T(cv) = cT(v) = cx. Thus x + y ∈ R(T) and cx ∈ R(T ), so R(T ) is a subspace of W .
Note 2. Test for Diagonalization
Let T be a linear operator on an n-dimensional vector space V . Then T is diagonalizable if and only
if both of the following conditions hold.
C1. The characteristic polynomial of T splits.
C2. For each eigenvalue λ of T , the multiplicity of λ equals n − rank(T − λI).

3
  
3 1 0
Q11. Test the matrix A =  0 3 0  ∈ M3×3 (R) for diagonalizability.
0 0 4
Solution. The characteristic polynomial of A is det(A − tI) = −(t − 4)(t − 3)2 , which splits, and
so C1 of the test for diagonalization is satisfied. Also A has eigenvalues λ1 = 4 and λ2 = 3 with
multiplicities 1 and 2 , respectively. Since λ1 has multiplicity 1, C2 is satisfied for λ1 . Thus we need
only test C2 for λ2 . Because
 
0 1 0
A − λ2 I =  0 0 0 
0 0 1
has rank 2, we see that 3 − rank (A − λ2 I) = 1, which is not the multiplicity of λ2 . Thus C2 fails
for λ2 , and A is therefore not diagonalizable.
Q12. Define Eigenspace of linear operator T.
Eigenspace. Let T be a linear operator on a vector space V, and let λ be an eigenvalue of T. Define
Eλ = {x ∈ V : T(x) = λx} = N (T − λIV ). The set Eλ is called the eigenspace of T corresponding
to the eigenvalue λ. Analogously, we define the eigenspace of a square matrix A to be the eigenspace
of LA .
Q13. If T : R2 → R3 be defined by T (x, y) = (2x − y, 3x + 4y, x). Compute the matrix of T in the
standard basis of R2 and R3 . Find N(T) and R(T). Is T one-to-one and onto?
Solution. Given T : R2 → R3 be defined by T (x, y) = (2x − y, 3x + 4y, x). The standard basis for
R2 is {e1 , e2 }, where e1 = (1, 0) and e2 = (0, 1).
To find the matrix of T , we have to find T (e1 ) and T (e2 ):
ˆ T (e1 ) = T (1, 0) = (2, 3, 1)
ˆ T (e2 ) = T (0, 1) = (−1, 4, 0)
 
2 −1
Therefore, the matrix of T is M = 3 4.
1 0
To find N(T) and R(T):
We know that, N (T ) = {x : T (x) = 0}.

T (x, y) = 0 ⇒ (2x − y, 3x + 4y, x) = (0, 0, 0) ⇒ x = 0, y = 0

Therefore, N (T ) = {(0, 0)} and hence T is one-to-one.

Similarly, we know that R(T ) = {T (x) : x ∈ R2 }. The range of T , R(T ), is the span of the images
of the basis vectors e1 and e2 . Since, the range of T is the span of these vectors:

R(T ) = span{(2, 3, 1), (−1, 4, 0)}

The dimension of the range (rank of T ) is 2 because (2, 3, 1) and (−1, 4, 0) are linearly independent.
Thus, the range of T is a 2-dimensional subspace of R3 . We know that, a linear transformation is
onto if its range is the entire codomain. The codomain of T is R3 , which is 3-dimensional, but the
range of T is only 2-dimensional. Therefore, T is not onto.
Q14. Let T : R2 → P2 (R) be a linear transformation such that T (1, 1) = 2 − 3x + x2 , T (2, 3) = 1 − x2 .
Determine T and find T (−1, 2), T (−5, 2). Also find the rank and nullity of T .
Solution. Given, T : R2 → P2 (R) be a linear transformation such that T (1, 1) = 2 − 3x + x2 ,
T (2, 3) = 1 − x2 .
Representing the polynomial as vectors, we can rewrite the transformation as follows,
 
2
T (1, 1) = 2 − 3x + x2 → −3
1

4
 and  
1
T (2, 3) = 1 − x2 →  0 
−1
Also,
T (1, 1) = T (e1 + e2 ) = T (e1 ) + T (e2 )
and
T (2, 3) = T (2e1 + 3e2 ) = 2T (e1 ) + 3T (e2 ),
where e1 and e2 are standard basis of R2 .
Using the above representations, we have the following equations,
 
2
T (e1 ) + T (e2 ) = −3 (1)
1
 
1
2T (e1 ) + 3T (e2 ) =  0  (2)
−1
   
5 −3
Solving the above equations, we get T (e1 ) = −9 and T (e2 ) =  6 .
4 −3
Therefore for any (x, y) ∈ R2 ,
 
5x − 3y
T (x, y) = T (xe1 ) + T (ye2 ) = x T (e1 ) + y T (e2 ) = −9x + 6y  .
4x − 3y

Thus, 
−11
T (−1, 2) =  21  ⇒ T (−1, 2) = −11 + 21x − 10x2
−10
and  
−31
T (−5, 2) =  57  ⇒ T (−5, 2) = −31 + 57x − 26x2 .
−26

Rank of T is the dimension of its range. Since T (1, 1) = 2 − 3x + x2 and T (2, 3) = 1 − x2 are two
linearly independent polynomials, the range of T is 2-dimensional. Therefore, the rank of T is 2.
Nullity of T is the dimension of the null space, which is the set of vectors (x, y) ∈ R2 such that
T (x, y) = 0. Since T maps from R2 to a 2-dimensional range, and the rank is 2, the nullity must be
2 − 2 = 0. This means the null space contains only the zero vector, and the nullity is 0.
Q15. Let T : R2 → R3 be defined by T (x, y) = (x − y, x, 2x + y). Let B = {e1 , e2 } , e1 = (1, 0), e2 = (0, 1)
be the basis for R2 and B 0 = {(1, 1, 0), (0, 1, 1), (2, 2, 3)} be a basis for R3 . Find the matrix of T in
these bases.
Solution. Given T : R2 → R3 be defined by T (x, y) = (x − y, x, 2x + y). The basis for R2 is
B = {e1 , e2 }, where e1 = (1, 0) and e2 = (0, 1).
To find the matrix of T , we have to find T (e1 ) and T (e2 ):
ˆ T (e1 ) = T (1, 0) = (1, 1, 2)
ˆ T (e2 ) = T (0, 1) = (−1, 0, 1)

5
 Now we have to find the matrix of the transformation under the basis B 0 = {(1, 1, 0), (0, 1, 1), (2, 2, 3)}
for R3 . We have to find scalars such that
       
1 1 0 2
1 = a 1 + b 1 + c 2
2 0 1 3
       
−1 1 0 2
 0  = p 1 + q 1 + r 2
1 0 1 3

i.e.,

a + 2c = 1; a + b + 2c = 1; b + 3c = 2 (3)
p + 2r = −1; p + q + 2r = 0; q + 3r = 1 (4)

Solving the equations we get a = − 31 , b = 0, c = 23 and p = −1, q = 1, r = 0

 1 
− 3 −1
Therefore, the matrix of T is M =  0 1.
2
3 0

Q16. Let T : R2 → R3 defined by T (a, b) = (a − b, b − a, −a) ∀ a, b ∈ R is a linear transformation. Find

the matrix of T under the standard basis and hence find rank(T).
Solution. Given T : R2 → R3 defined by T (a, b) = (a − b, b − a, −a)∀ a, b ∈ R is a linear
transformation. The basis for R2 is B = {e1 , e2 }, where e1 = (1, 0) and e2 = (0, 1).
To find the matrix of T , we have to find T (e1 ) and T (e2 ):
ˆ T (e1 ) = T (1, 0) = (1, −1, −1)
ˆ T (e2 ) = T (0, 1) = (−1, 1, 0)
 
1 −1
Therefore, the matrix of T is M = −1 1 .
−1 0
To find the rank of T, we reduce the matrix M to its row echelon form. Therefore,
 
1 −1
M = −1 1 
−1 0
 
1 −1
∼ 0 0  R2 → R2 + R1 & R3 → R3 + R1
0 −1
 
1 0
∼ 0 0  R1 → R1 − R3
0 −1

Since there are 2 non-zero rows in the row echelon form, the rank of the matrix M is 2. Thus, the
rank of the linear transformation T is rank(T) = 2.
Q17. Let T : R3 → R2 defined by T (a1 , a2 , a3 ) = (a1 − a2 , 2a3 ). Find the basis for N (T ) and compute
the nullity of T.
Solution. The given transformation is T : R3 → R2 defined by T (a1 , a2 , a3 ) = (a1 − a2 , 2a3 )
The null space of T , denoted N (T ), consists of all vectors (a1 , a2 , a3 ) ∈ R3 such that T (a1 , a2 , a3 ) =
(0, 0).
This gives the system of equations:
a1 − a2 = 0
2a3 = 0
From the second equation, 2a3 = 0, we have a3 = 0.

6
 From the first equation, a1 − a2 = 0, we have a1 = a2 .
Thus, the general solution for (a1 , a2 , a3 ) ∈ N (T ) is:

(a1 , a2 , a3 ) = (a2 , a2 , 0) = a2 (1, 1, 0)

Therefore, the null space of T consists of all scalar multiples of (1, 1, 0), so a basis for N (T ) is
{(1, 1, 0)}.
The nullity of a linear transformation is the dimension of its null space. Since the basis for N (T )
has one vector, the nullity of T nullity(T ) = 1

Q18. Suppose T : R2 → R2 is linear, T (1, 0) = (1, 4), T (1, 1) = (2, 5). What is T (2, 3)? Is T one-to-one?
Solution. Given, T : R2 → R2 is linear, T (1, 0) = (1, 4), T (1, 1) = (2, 5).
Since T is linear, we can write any vector (x, y) ∈ R2 as a linear combination of the basis vectors
(1, 0) and (0, 1):
(x, y) = x(1, 0) + y(0, 1)

Thus, the linearity of T allows us to express T (x, y) as:

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

We can compute T (0, 1) from the information given. Since,

T (1, 1) = T (1, 0) + T (0, 1)

and using T (1, 1) = (2, 5) and T (1, 0) = (1, 4), we get

T (0, 1) = (2, 5) − (1, 4) = (1, 1)

Therefore,
T (x, y) = xT (1, 0) + yT (0, 1)
T (x, y) = x(1, 4) + y(1, 1) = (x + y, 4x + y)
Now, using the formula T (x, y) = (x + y, 4x + y), we can calculate T (2, 3):

T (2, 3) = (5, 11)

To determine if T is one-to-one, we solve T (x, y) = (0, 0):

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

This gives the system of equations:

x+y =0
4x + y = 0
From the first equation, y = −x. Substituting this into the second equation:

4x + (−x) = 0 ⇒ 3x = 0 ⇒ x = 0

Substituting x = 0 into y = −x, we get y = 0. Thus, the only solution is (x, y) = (0, 0), so T is
one-to-one.
Rx
Q19. Let T : P2 (R) → P3 (R) be defined by T (f (x)) = 2f 0 (x) + 0 3f (t)dt. Find bases for N (T ) and R(T)
and hence verify dimension theorem. Is T one-to-one? Is T onto? Justify your answer.
Solution. Given the linear operator T : P2 (R) → P3 (R) defined by
Z x
0
T (f (x)) = 2f (x) + 3 f (t)dt
0

The standard basis for P2 (R) is 1, x, x2 .

7
 

∴ R(T ) = span T (1), T (x), T x2 But
Z x
T (1) = 2 · 0 + 3 1dt = 3[t]x0 = 3x
0
Z x  2 x
t 3
T (x) = 2 · 1 + 3 tdt = 2 + 3 = 2 + x2
0 2 0 2
Z x  3 x
t
T (x2 ) = 2 · 2x + 3 t2 dt = 4x + 3 = 4x + x3
0 3 0
 
3 2 3
R(T ) = L 3x, 2 + x , 4x + x
2

We test for linearly independence.

α1 3x + α2 2 + 23 x2 + α3 4x + x3 = 0



Suppose,
⇒ 2α2 + (3α1 + 4α3 ) x + 23 α2 x2 + α3 x3 = 0

Equating like coefficients, we get

α2 = 0, α3 = 0, 3α1 + 4α3 = 0 ⇒ α1 = 0
3
Hence 3x, 2 + x2 , 4x + x3 are linearly independent.
2
But dim P3 (R) = 4 and dim R(T ) = 3 ⇒ rank T = 3.
∴ T is not onto.
We know that,

N (T ) = {f (x) ∈ P2 (R) : T (f (x)) = 0}

Z x
0
T (f (x)) = 0 ⇒ 2f (x) + 3 f (t)dt = 0 (*)
0

Differentiating w.r. to x, we get

2f 00 (x) + 3f (x) = 0
d
(2D2 + 3)f (x) = 0, where D =
r dx
3
2m2 + 3 = 0 ⇒ m = ±i
2
r r
3 3
f (x) = A cos x + B sin x∈
/ P2 (R)
2 2
So, this is not a solution.
Clearly, only f (x) = 0 satisfies the equation (*).
T (f (x)) = 0 ⇒ f (x) = 0, the zero polynomial N (T ) = {0} and hence nullity (T ) = 0 and T is
one-to-one.
We know,
dim P2 (R) = 3
nullity (T ) + rank(T ) = 0 + 3 = 3 = dim P2 (R)
Hence dimension theorem is verified.
But rank of P3 (R) is 4 and rank(T ) = 3.
∴ T is not onto.
Q20. Let T : P2 (R) → P2 (R) be defined as T [f (x)] = f (x) + (x + 1)f 0 (x). Find the eigen values and
corresponding eigen vectors of T with respect to standard basis of P2 (R).
Solution. Given, T : P2 (R) → P2 (R) be defined as T [f (x)] = f (x) + (x + 1)f 0 (x). The standard
basis for P2 (R) is {1, x, x2 }. Therefore,

8
 When f (x) = 1 T [1] = 1 + (x + 1) · 0 = 1 · 1 + 0 · x + 0 · x2
When f (x) = x T [x] = x + (x + 1) · 1 = 1 + 2x = 1 · 1 + 2 · x
When f (x) = x2 T [x2 ] = x2 + (x + 1) · 2x = x2 + 2x2 + 2x = 0 · 1 + 2 · x + 3 · x2
The matrix of T is  T  
1 0 0 1 1 0
M = 1 2 0 = 0 2 2
0 2 3 0 0 3

Since the matrix is an upper triangular matrix, the eigen values are the main diagonal elements.
Therefore, the eigen values are λ = 1, 2, 3.
The eigen vectors are obtained from the equation (M − λI)X = 0 for each λ.
 
1
When λ = 1, we get X1 = 0.
0
 
1
When λ = 2, we get X2 = 1.
0
 
1
When λ = 3, we get X3 = 2.
1
 
1 2 1
Q21. Find the linear transformation T : V3 (R) → V3 (R) determined by the matrix  0 1 1  with
−1 3 4
the standard basis {e1 , e2 , e3 }. Hence find T (−2, 2, 3).
 
1 2 1
Solution. The matrix of T is  0 1 1 .
−1 3 4
 
1 0 −1
∴ the coefficient matrix is  2 1 3 .
1 1 4
The standard basis is e1 = (1, 0, 0), e2 = (0, 1, 0), e3 = (0, 0, 1).

T (e1 ) = (1, 0, −1), T (e2 ) = (2, 1, 3), and T (e3 ) = (1, 1, 4)

Let (x, y, z) ∈ R3 be any element. Then,

(x, y, z) = xe1 + ye2 + ze3

T (x, y, z) = xT (e1 ) + yT (e2 ) + zT (e3 )
= x(1, 0, −1) + y(2, 1, 3) + z(1, 1, 4)
= (x + 2y + z, y + z, −x + 3y + 4z)
T (−2, 2, 3) = (−2 + 2 · 2 + 3, 2 + 3, −(−2) + 3 · 2 + 4 · 3)
= (5, 5, 20)

Q22. Let T : R2 → R3 is a linear transformation such that T (1, 1) = (1, 0, 2), T (2, 3) = (1, −1, 4). Then
find
i. T
ii. T(2, 5)
iii. T(8, 11)
iv. Rank(T)
v. Is T one-one or onto?

9
 Solution. The transformation T : R2 → R3 is determined if T is defined on the standard basis
{(1, 0), (0, 1)} of R2 . We find T (1, 0) and T (0, 1).
Let (x, y) ∈ R2 .

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

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

Now, (1, 1) = (1, 0) + (0, 1)

∴ T (1, 1) = T (1, 0) + T (0, 1)
⇒ (1, 0, 2) = T (1, 0) + T (0, 1) (1)
But (2, 3) = (2, 0) + (0, 3) = 2(1, 0) + 3(0, 1)
∴ T (2, 3) = 2T (1, 0) + 3T (0, 1)
⇒ (1, −1, 4) = 2T (1, 0) + 3T (0, 1) (2)

(1) × 2 ⇒ 2T (1, 0) + 2T (0, 1) = (2, 0, 4)

(2) ⇒ 2T (1, 0) + 3T (0, 1) = (1, −1, 4)
Subtracting, −T (0, 1) = (1, 1, 0) ⇒ T (0, 1) = (−1, −1, 0)
Substituting in (1), we get

T (1, 0) + (−1, −1, 0) = (1, 0, 2)

⇒ T (1, 0) = (1, 0, 2) − (−1, −1, 0) = (2, 1, 2)
∴ T (x, y) = x(2, 1, 2) + y(−1, −1, 0)
= (2x, x, 2x) + (−y, −y, 0)
⇒ T (x, y) = (2x − y, x − y, 2x) (3)
∴ T (2, 5) = (2 · 2 − 5, 2 − 5, 2 · 2) = (−1, −3, 4)
and T (8, 11) = (2 · 8 − 11, 8 − 11, 2 · 8) = (5, −3, 16)

To find Rank T :
Now
N (T ) = {(x, y) : T (x, y) = 0}
T (x, y) = 0 ⇒ (2x − y, x − y, 2x) = (0, 0, 0)
2x − y = 0, x − y = 0, 2x = 0 ⇒ x=0
y=0
∴ N (T ) = {(0, 0)} = {0} ⇒ nullity (T ) = 0
∴ T is one to one.
By dimension theorem, rank(T ) = dim R2 − nullity(T ) = 2 − 0 = 2.
Since rank(T ) 6= dim R3 , T is not onto.

10