You are on page 1of 28

LINEAR TRANSFORMATION

UNIT 4: LINEAR TRANSFORMATION


INTRODUCTION

In unit three we developed the theory of vector spaces in considerable detail and the concepts
under vector space are essential for this unit. It is now natural to consider those functions defined
on vector spaces. These special functions are called linear transformations. Typically, we shall
be considering a mapping T: V →W, where V and W are vector spaces over the same field of
scalars. Our interest of study also extends to mappings which have nice properties in relation to
the operations (addition and multiplication by scalars) defined on the vector spaces and all the
field unless specifies are the fields of real numbers.
You are recommended to do all the activities and exercise in detail.
Objectives: At the end of this sub unit, you will be able to:
 Define the definition of linear mapping.
 Determine whether a given mapping is linear or not.
Definition
A function T from a vector space V to a vector space W is a linear transformation if it satisfies
the following conditions for all vectors u and v in V and for all scalars c in a field
1. T (u + v) = T (u ) + T (v)
2. T (cu) = cT (u )
Note: The operations of addition and scalar multiplication and then the operation of T on the left
side of the equations are the same as operation under T and then addition and scalar

Example 4. 1 .Show that T : R →  defined by () =  ( identitiy function ) is a linear


multiplication.

transformation.

(  + ) =  + = () + ( )
Solution: Let x and y be in R and let c be in R.

( ) =  = () = ()
i.
ii.

Example .  : Show that


Therefore T is linear transformation.

T: R → {0} defined by T(x) = 0 ( Zero function ) is a linear transformation

i. (  + ) = 0 = 0 + 0 = () + ( )
Solution: Let x and y be in R and let c be in R.

ii. ( ) = 0 = (0) = ()


Therefore T is linear transformation.
Example 4.3. Show that T ( x, y ) = ( x + y, 3x) is a linear transfomation from R 2 to R 2 .
Solution: To show that addition preserved, we have as follow:

(  + ) = T (( x, y ) + ( z , w) ) = T ( x + z , y + w) = (( x + z ) + ( y + w), 3( x + z ) )
Let u = (x,y) and v = (z,w) be elements of V .Then

= ( x + z + y + w, 3 x + 3 z ) = (  + , 3) + (  + , 3)

BIT MATHEMATICS PROGRAM


118
LINEAR ALGEBRA

= ( , ) + (, )= ( ) + ()


Therefore, T preserves addition.

( ) = T (c( x, y ) ) = T (cx, cy) = (cx + cy, 3cx) = c( x + y, 3x) = cT ( x, y ) = cT (u )


To show that scalar multiplication is preserved, for any scalar c we have

Thus, T peserves scalar multiplication. Since T preserves both addition and scalar multiplication,
T is a linear transformation.
Example 4.4. Let T be the function from M n×m (R) to M n×m (R) defined by T ( A) = A t . Show
that T is a Linear transformation.
Solution: From the properties of the transpose matrices and addition and scalar
multiplication.Let A and B be n × m matries and let c be a scalar. Then
T ( A + B) = ( A + B) t = A t + B t = T ( A) + T ( B) , T preserves addition.
Also, T (cA) = (cA) t = c( A t ) = cT ( A) , so T preserves scalar multiplication.
Example 4.5 . Let T be a function from V toW , where V consists of all differentiable functions
and W consists of all derivative of this function.That is, T ( f ) = f ' . Show that T is a linear
transformation.
Solution: T ( f + g ) = ( f + g )' = f '+ g ' = T ( f ) + T ( g ), so T preserves addition.
T (cf ) = (cf )' = c( f ' ) = cT ( f ), So T peserves scalar multiplication.

Example.4.6. Determermine wether the map T from      defined by


Therefore, T is a linear transformation.

(, ) = (  + + 1, − )
Solution: Let u = ( x,y ) ,  = (, ) be in   ! "# $# % " & ' ℎ# )'#"!.
( + ) = *(, ) + (, )+ = ( + , + )
= ( +  + +  + 1, +  −  − )
= ( + + 1, − ) + (  + ,  − )
() + () = (, ) + ( , )
------- (1)

= (  + + 1, − ) + (  +  + 1,  − )
= (  + +  +  + 2, +  –  − ) --------- (2)

( + ) ≠ () + ()


From (1) and ( 2) we can conclude that

Example 4.7. The function T :  →  / is defined as follows ,


Therefore T is not a linear transformation

3 0 3
() = 0 2 1 1 2 4 , where v = *3,  + '  
−1 −2


Then, find a. ( 2, −1)


b. Show that T is a linear transformation

BIT MATHEMATICS PROGRAM


119
LINEAR TRANSFORMATION

3 0 6
2
Solution: a . ( 2, −1) = 0 2 1 1 2 4 = 031
−1
−1 −2 0
6
( 2, −1) = 031
0
b. Let  = ( 3 ,  ) and  = ( 3 ,  ) $# '   and let c be a scalar in the
field , then
i.(  + ) = (( 3 ,  ) + ( 3 ,  ) =  ( 3 + 3 ,  +  )
3 0 3 + 3 3 0 3 3 0 3
=0 2 1 1 2 +  4 = 0 2 1 1 2 4 + 0 2 1 1 2 4
−1 −2 −1 −2 −1 −2
   

= ( 3 ,  ) +  (3 ,  ) = ( ) + ()
3 0 3 3 0 3
ii. ( ) = ( (( 3 ,  )) = ( 3 ,  ) = 0 2 1 1 2  4 = 0 2 1 1 2 4
−1 −2 −1 −2
 

= c ()

Let : 7 → 8 be a linear mapping from the vector space V into the vector space W over the
4.1. PROPERTIES OF LINEAR TRANSFORMATION

1.  (0) = 0', where 0 is the zero element in V and 0' is the zero element in W.
same field K. Then

2.  (−) = − () for each v ∈ V.


3.  ( 3 + $ ) =  (3 ) + $ (3 ) for each v1, v2 ∈ V and a, b ∈ K
4.  ( 3 3 +   + … + : : ) = 3  (3 ) +   ( ) + . . . + :  (: ),
for each 3 ,  , . . : ∈ 7 and 3 ,  , . , : ∈ K.
5. Let L : V → W and T : V → W be linear maps, where V and W are vector spaces over a
field F, and let a ∈ F . We define
a) Addition of linear maps L and T as
L + T : V → W by ( L + T )( x) = L( x) + T ( x) for all x ∈ V , and
b) Scalar multiplication of a linear map as aL : V → W by (aL )( x) = aL( x) for all x ∈ V .
Of course, these are just the usual definitions of addition and scalar multiplication of functions.
We are fortunate; however, to have the result that both sums and scalar

Remark: Let ;: 7 → 8 and : 7 → 8 are linear maps and k is a scalar.Then


multiples of linear transformations are also linear.

1. ; + : 7 → 8 is linear i.e. Sum of linear maps is linear


<;: 7 → 8 is linear i.e scalar multiple of a linear map is linear
Example 4. 8. Let T be a linear transformation from R to R such that T(3) = −4 , then
Bind i T( 7) ii. T( −5)
Solution ∶ Let T(x) = cx for a certain conatant c, then
( 3) = 3 and ( 3) = −4 , we have 3 = −4
⇒ = −/
M

BIT MATHEMATICS PROGRAM


120
LINEAR ALGEBRA

(7) = 7 = 7 2− / 4 = −
M N
/

( −5) = −5 2− 4 =
M O
/ /
Example 4.9: Let T be a linear transformation from    , such that
T(1,1) = 3 , T(1,0) = 4, then Bind T( 2,1)
Solution: Let u = (x, y) be in   , and a , b be scalars , then
( , ) =  + $
( 1,1) = . 1 + $. 1 = + $ = 3 -------( 1)
(1,0) = =4 -----------------------(2 )

( 2,1) = 42 + 1(−1) = 8 − 1 = 7


Therefore from (1) and (2) , we b = -1

Example 4.10. Let L: R → R2 be a linear map. Suppose that L (1, 1) = (1, 4) and
2

L(2, -1) = (-2, 3). Find L (3, -1)


Solution: i) To compute L (3, -1), we first write (3, -1) as a linear combination of
(1, 1) and (2, -1).
Then let (3, -1) = a (1, 1) + b (2, -1), for scalars a and b
⇒ (3, -1) = (a + 2b, a - b)
a + 2b = 3
⇒  and solve for a and b
a − b = −1
⇒ ( − ) + (2$ − (−$)) = 3 − (−1)
⇒ 3$ = 4

⇒ $ =
4
3
from − $ = -1 and b = . We get
4
3

= −1 + $ = −1 +
4 −3+ 4 1
= =
3 3 3

Thus, = , $ =
1 4

Now, ; (3, −1) = ; ( (1, 1) + $ (2, −1) = ;(1, 1) + $;(2, −1)(; is linear)
3 3

=
1 4
(1,4) + (−2,3)
3 3

=  , + ,  =  − , +  = 
 1 4   − 8 12   1 8 4 12   − 7 16 
, 
3 3  3 3  3 3 3 3   3 3

Therefore, ;(3, −1) = 


 − 7 16 
, .
 3 3

BIT MATHEMATICS PROGRAM


121
LINEAR TRANSFORMATION

In general: L (x, y) = (  + $ ,  + ! ), for each (x, y) ∈ R2


L(1,1) =(1. + 1. $, 1. + 1. !) = ( + $, + !) = (1,4)
;(2, −1) = (2. + (−1)$, 2. + (−1)!) = (2 − $, 2 − !) = (−2,3)
+$ =1 S
+R
2 − $ = −2
3 = −1 ⇒ = − ! $ =
3 M
/ /
+! =4S
and + R ⇒c=/ , ! = 4−/=/
T U T
2 − ! = 3
Therefore (, ) = ( + , + ) or matrix form
VW MX TW UW
/ / / /

+
VW MX
  + $
 2 4 = Y Z =  [ TW
/
UW \
/
 + ! +
/ /
Example 4.11. Let T be a linear transformation from p 2 to p3 defined by
T (1) = x 3 + 5 , T ( x) = x 2 , T ( x 2 ) = 2 + 3 x + 6 x 2 . Then find T (−3 + 5 x + 9 x 2 )
Solution: T (−3 + 5 x + 9 x 2 ) = − 3T (1) + 5T ( x) + 9T ( x 2 ) = − 3( x 3 + 5) + 5( x 2 ) + 9(2 + 3x + 6 x 2 )
= − 3x 3 − 15 + 5 x 2 + 18 + 27 x + 54 x 2

= −3x  + 59x  + 27x + 3


Exercise 4.1
1. Determine whether the given function T is a linear transformation or not.
a. T: R2 → R2 defined by T (x, y) = (2x + y, y)
b. T: R2 → R defined by T(x, y) = xy
c. T: R → R2 defined by T (x) = (ex, x)
d. T : R2 → R defined by T ( x, y) = x + y
e. T: R4 → R2 defined by T (w, x, y, z) = ( 2w-x , y + 3z)
f. T : M 2× 2 (R) → R defined by T (A) = A
a b 
g. T : M 2× 2 (R) → P2 defined by T   = c + bx + ax 2
c d 
a b 
h. T : M 2× 2 (R) → R3 , T   = (ab, c, d )
c d 
i. Let A be an m × n matrix. Let T be the function from M n×k to M m×k defined by
T ( B) = AB . Show that T is a linrar transformation.
2. Let T: R2 → R2 be a linear map. Suppose that T (3, 1) = (1, 2) and T (-1, 0) = (1, 1).

3.  →  be a linear tranformation such that T( 1, 0, 0) =( 2, -1, 4), T ( 0, 1, 0) = (1, 5, - 2)


Find a. T ( 1,-2) b. T( 1,0)
/ /

4. Let T be a linear transformation from e  e such that T(1) = x, T(x) = 1+x,


T (0, 0, 1) = ( 0, 3,1 ), then compute T ( 2, 3, -2).

T(  ) = 1 +  +   , the find ( 2 − 6 +   )

BIT MATHEMATICS PROGRAM


122
LINEAR ALGEBRA

5. Let T be a linear transformation from f ' f


1 0 1 −1 0 1 0 2
such that
2 4= 2 4, 2 4= 2 4
0 0 0 2 0 0 1 1
0 0 1 2 0 0 3 −1
2 4 = 2 4, 2 4= 2 4
1 0 0 1 0 1 1 0
1 3
Find  2 4
−1 4

4.2 THE KERNEL AND IMAGE OF LINEAR MAPPINGS


Objectives : At the end of this sub unit you will able to:
 Explain the definition of kernel
 Define the range or image the linear transformation..
 Find the kernel and the range(image) of the linear transformation.
 Find the the basis and dimension of kernel of a linear transformation.
 Find the basis and the dimension of the image of the linear transformation.
Definition : Let V and W be vector spaces and let T be a linear map from V to
W.Then 1. The Kernel of T is the set of all vectors in V mapped to zero by T.
i.e, KerT = {x ∈ V : T ( x) = 0}
2. The range of T is the set of all images T ( x) :
Range T = {T ( x) : x ∈ V }.
Example 4.12 Let T: R3 → R3 be the projection map such that T(x, y, z) = (x, y, 0).
Then find Kernel and image of T.
Solution: T is a linear map. ( Please try to show it)
i. Ker (T) = {(x, y, z) ∈ R3 : T(x, y, z) = (0, 0, 0)} = {(x, y, z) ∈ R3 :(x, y, 0) = (0, 0, 0)}
= {(x, y, z) ∈ R3 : x = y = 0 } = {(0, 0, z) : z ∈ R}
ii. Range (T) = {T(x, y, z) :(x, y, z) ∈ R3}= {(0, y, z) : y, z ∈ R}, which is the YZ-plane in R3
Example 4.13 Let T be the transformation from R 3 to R defined by
T ( x, y ) = y − 2 x , Find the kernel and the range of( image) T.
Ker( T ) = {(x, y) ∈   : T(x, y) = 0} = {(x, y) ∈ R2 : y- 2x = 0}
= {(x, y) ∈ R2 : y = 2x } = {(x,2x) : x ∈ R}
ii. Range (T) = {T(x, y) : (x, y) ∈ R2} = {y-2x : y, x ∈ R}, which is R
$ 0 $
Example 4.14. T: fW () → fW,  2 4=2 4
! 0

$ $ 0 0 $ 0 $ 0 0
Find the kernel and the range of( image) T
Solution: ker(T) = { 2 4:  2 4=2 4} = R2 4: 2 4=2 4g
! ! 0 0 ! 0 0 0
$ 0
= R2 4 : $ = 0, = 0g = R2 4 : , ! ∈ g
! 0 !
And Image of T all 2x2 matrice with the diagonal elements are zero.
Example 4.15 Let T be the transformation from R 2 to R R 2 defined by

BIT MATHEMATICS PROGRAM


123
LINEAR TRANSFORMATION

T ( x, y) = (3x, 2 y ). Find the kernel and the range of( image) T


Solution: i#& () = {( , ): ( , ) = (0,0)}
= {(, ): ( 3, 2 ) = ( 0,0)} = { ( , ): 3 = 0, 2 = 0}
= {(, ):  = 0, = 0} = {(0,0)} = {0}
Im(T) = {(, ): (, ) ∈   }
= {(3, 2 ): (, ) ∈   }
= {(3, 2 ): 3 = , 2 =  , ,  ∈ } = {(, ): ,  ' }
= 
Example 4.16 Let T be the transformation from R 3 to R R 3 defined by
T ( x, y, z ) = (3x − y − 2 z, y − z, x + 4 y − 5 z ).
Find the kernel and the range of( image) T.
Solution: A vector ( x, y , z ) is the kernel of T if and only if T ( x, y, z ) = (0,0,0), that is,
(3x − y − 2 z, y − z, x + 4 y − 5 z ) = (0,0,0) . This statement is equivalent to the system of
equations. 3 x − y − 2 z = 0
y− z=0
x + 4 y − 5z = 0
 3 − 1 − 2  1 0 − 1
   
The matrix of this system is  0 1 − 1  .The reduced row echelon form is  0 1 − 1 .
1 4 − 5 0 0 0 
   
This is equivalent to the system x − z = 0
y − z = 0.
Thus the solution is x = z and y = z, hence ker T = {( z , z , z ) : z ∈ IR}
A vector (a, b, c) is in the range of T if there exists a vector (x, y, z) such that
(a, b, c) = T ( x, y, z ) = (3x − y − 2 z, y − z , x + 4 y − 5 z ). That is, (a, b, c) is in the rangeT if there is
a solution to the system 3x − y − 2 z = a
y−z =b
x + 4 y − 5z = c .
3 −1 − 2 a
 
The matrix of the system is  0 1 − 1 b .
1 4 − 5 c 

1 0 − 1 − 4b + c 
 
The reduced row echelon form is  0 1 − 1 b .
0 0 0 a + 13b − 3c 

Thus there is a solution to T ( x, y, z ) = (a, b, c) if and only if a + 13b − 3c = 0 , that is, if and only
if a = −13b + 3c. Thus Range T = {(− 13b + 3c, b, c )} .

BIT MATHEMATICS PROGRAM


124
LINEAR ALGEBRA

Theorem : Let T : V→W be a linear transformation. Then


(a) Ker T is a subspace of V ,
(b) Im T is a subspace of W.
Proof.
(a) Let s1; s2 be in the field F and v1, v2 be in Ker T. We must show that s1v1 + s2v2 be Ker
T, i.e., that T(s1v1 + s2v2) = 0. Since T is a linear transformation and T(v1) = 0 = T(v2), we

hence T(s1v1 + s2v2) ∈ Ker T. Therefore Ker T is a subspace of V .


have T(s1v1 + s2v2) = s1T(v1) + s2T(v2)= s10 + s20 = 0;

b. Now suppose that t1; t2 ∈ F and w1; w2 ∈ Im T. We must show that t1w1 + t2w2 ∈ Im T,
i.e., that t1w1+t2w2 = T(v) for some v2 ∈V .
Since w1;w2 ∈ Im T, there are vectors v1; v2 ∈ V for which T(v1) = w1; T(v2) = w2:

$
Hence Im(T) is a subspace of W
Example4.17. T: e → fW () deBined by  ( + $ +   ) = 2 4
2 +$

0 0
Find the ker(T) and image or range of T
Solution: Ker(T) = R + $ +   : ( + $ +   ) = 2 4g
0 0
$ 0 0 {
= R + $ +   : 2 4=2 4g= + $ +   ∶ = 0 , $ = 0}
2 +$ 0 0
= { }

$
Hence ker(T) is any constant polynomials.
Im(T) = {2 4 : = 2 , ! = + $, ! , $, , ! ∈ }
!
Definition. Let V and W be vector spaces over a field K and
let T: V →W be a linear transformation.
a. The basis for ker( T) is the set all linearly independent sets in V that spans ker(T)
b. The dimension of Ker (T) is called the nullity of T, denoted by nullity (T).
c. The basis of the image is the set linealy indendent sets ( vectors) in W that generates
The image of T or the range of T.

Example4.18 Let :  / →  / defined $ ( , , ) = (  − ,  − , 0). Then find


d. The dimension of Im(T) is called the rank of T denoted by rank(T).

a. The basis of the kernel of T.


b. The dimension of the kernel or nullity(T)
c. The basis of the image of T.

Solution: a. Ker(T) = { (, , ): (, , ) = ( 0,0,0)}


d. Rank of T.

= { (x, y, z): ( x − y, z − x, 0) = (0,0,0)}


= {(, , ):  − = 0,  −  = 0} = { , , ):  = ,  = }
= { (, , )  ∈ }= { ( 1,1,1),  ∈ }
Hence the basis of ker(T) is { 1,1,1}

BIT MATHEMATICS PROGRAM


125
LINEAR TRANSFORMATION

b. Since basis ker(T) has one element , the dimension of ker(T) is 1.

c. Image of T = { (,  ,0):  =  − ,  =  − , )& , , ,  ∈ }


Nullity (T) = 1

= { (, , 0):  ,  ∈ } = { ( m, 0,0) + ( 0, n, 0): m, n ∈ R}


= { ( 1,0,0)m + (0,1,0)n : m,n ∈ }
Hence the basis of the image of T is { ( 1,0,0), (0,1,0)}
d.Dimension of the image is 2.
So that the rank(T) is 2 .
Theorem (Dimension theorem)
Let V and W be finite dimensional vector spaces, and let T be a linear
transformation from V toW .Then rank T + nullity T = dimV .
$ 0 $
Example 4.19 Let T:fW ( ) → fW ( ),  m2 4n = 2 4, then find
! 0
a. Basis of ker (T) , b . Nullity(T) c. the basis of the image d.The rank(T)
$ $ 0 0
Solution: a. Ker(T) = o2 4 :  m2 4n = 2 4p
! ! 0 0
$ 0 $ 0 0
= R2 4: 2 4=2 4g
! 0 0 0
$
={2 4 : $ = , = 0}
!
0
=R2 4 , , ! ∈ g
0 !
1 0 0 0
= {2 4 +2 4 !}
0 0 0 1
1 0 0 0
Therfore the basis of ker(T) = R2 4,2 4g
0 0 0 1

0 1 0 0
a. Nullity(T) = 2
b. The basis of the image of T is R2 4,2 4g
0 0 1 0
c. Rank(T) = dim(image(T)) = 2

Recall that DimfW () = 4, Dim(fW () = ""' () + & <()
From the above theorem we can check that

0 2$
4 = 2+2
Example 4.20 Let : e → fW () , deBined as  ( + $ +   ) = 2 4, then find
$

0 0
a. the basis of ker(T) b. Nullity(T) c. basis of the range d. rank(T)
Solution: i#&() = R + $ +   :  ( + $ +   ) = 2 4g
0 0
0 2$ 0 0
= R + $ +   : 2 4=2 4g = { + $ +   : $ = 0, = 0}
$ 0 0
= { }
So that the basis of the ker(T) = {   }
b. Nullity( T) is 1.

BIT MATHEMATICS PROGRAM


126
LINEAR ALGEBRA

0 2$ 0 2 0 0
c. Since the range of T = {2 4 ∶ $, ∈ } = { 2 4$ + 2 4 }
$ 0 1 1 0
0 2 0 0
The basis the image is R2 4,2 4g
0 1 1 0
d. Rank(T) = 2= Dim(e ) – Nullity(T)

Example 4.21. T: R3 → R3 given by T(x, y, z) = (0, y, z), where V = R 3 = W.


Find the nullity(T) and rank(T)
Solution: Ker T = {(x, 0, 0) : x ∈ R} is the x-axis in R3
Basis ker(T) = {(1,0,0)}
Nullity(T) = dim Ker (T) = 1
And lmT = {(0, m, n) : m, n ∈ R}, i.e the YZ-plane in R3
Dim( lm(T) ) = 2 and hence rank (T) = 2
From the above thereom
Dim V = dim R3 = 3 and dim V = 3 = 1 + 2 = dim Ker (T) + dim Im T
= nullity (T) + rank (T).
Exercise 4.2
1. For each of the following linear transformation T, find
a. Ker T, b. a basis for Ker T c. Nullity(T) d. Im T and e. basis for Im T
f. rank(T)
a. T: M 2× 2 (R) → M 2× 2 (R), T(A) = At
b. T: R2 → R2 , T( x ,y) = ( 2x - y, 0 )
c. T: P2 →P3, T( c + bx + ax2) = ( a + b) x + cx3
2. Let F: R3 → R2 be given by F(x, y,z) = (x, y).

3. Let T  U →  T be a linear transformation.


Find the dimensions of the kernel and rank of F.

a. Find the dimension of ker(T) if its rank of T is 2

c. Find the rank(T) if ker(T) ={0}


b. Find the rank(T) if nullity( T) is 4

4. Let :   →  / , (, ) = (  − 2 , 0, −), find


a. ker(T) b. Basis of ker(T) c. Nullity(T) d. rank(T)

4.3. ONE - TO – ONE (INJECTIVE) AND ONTO( SURJECTIVE)


LINEAR TRANSFORMATIONS

Objective: At the end of this sub topic you are able to:
 Determine wether a given linear map is one –to –one ( injective ) or not.
 Determine wether a given linear map is onto ( surjective ) or not
 Show that 1-1 ness of a given linear transformation.

BIT MATHEMATICS PROGRAM


127
LINEAR TRANSFORMATION

 Show that onto ness of a given linear transformation.

Definition: Let  ∶ 7 → 8 $# a linear transformation.


 Find the inverse of a linear transformation.

1. T is said to be one – to- one or injective iff () = () ⇒  =  for all v, w in V

() = . ( i.e the range or image is equal to W)


2. T is said to be surjective ( onto) if and only if for every w in W , there is v in V such that

3. T is said to be bi-jective if and only if T is both injective and surjective.

Let T:   →   defined by (, ) = ( −, − ) , determine wether T is injective,


Example 4.22.

Surjective, bijective.

let  = ( , ) !  = ( , ) '   and ( ) = ()


Solution: To show that wether T 1-1 or not

⇒ ( , ) = (, )
⇒ ( −, − ) = ( −, −)
⇒ ( , ) = (, )
⇒=

To show wether is surjective, let w = (m, n) be any element in W =   .


Hence T is injective.

Then there is  = ( −, −) '   % ℎ ℎ  ( −, −) = (, )


That is the range of T is   .
Hence T is surjective.
Therefore T is bi-jective linear map.
Theorem: Let V and W be vector spaces.Let T: V → W is a linear map. Then
1. T is injective (one- to – one) if and only if ker (T) = { 0}
2. If W finite dimensional , T is surjective (onto) if and only if rank of T is equal to the
dimension of W.

Let :  / →   , defined as  ( , , ) = (  − , )
Example 4.23. Determine wether the linear map is injective, surjective or bijective.

Solution : ker ( T) = {( , , ): (, , ) = (0,0)} = {( , , ): (  − , ) = ( 0,0)}


= { (x, y,z) : x-y = 0 , y = 0} = { ( x,y,z) : x = 0 , y = 0} = { ( 0,0,z) : z ∈ }
Hence T is not injectitve.
Image of T = { ( x- y, y)} = { ( x, 0) + ( -y , y) } = { (1,0)x + ( -1,1 ) y}

So the rank(T) = 2 = q'(  )


Therefore the basis of the range = { ( 1,0),( -1, 1)}

Hence T is onto linear map.

Let :   →   , defined as  ( , ) = ( , 2 + )
Example 4.24 Determine wether the linear map is injective, surjective or bijective.

Solution : ker ( T) = {( , ): (, ) = (0,0)}


= {( , ): ( , 2 + ) = ( 0,0)}
= {(x, y): x = 0, 2x + y = 0 , y } = {( x, y) : x = 0 , y = 0}

BIT MATHEMATICS PROGRAM


128
LINEAR ALGEBRA

= {( 0 ,0) } = {0}

Image of T = {(x, 2x+y): x,y ∈   }


Hence T is injectitve.

= { ( x, 2x) + ( y , y) } = { (1,2)x + ( 1,1 ) y}

So the rank(T) = 2 = q'(  )


Therefore the basis of the range = { ( 1,2),( 1, 1)}

Hence T is onto linear map.

Example 4.25 Let : e → e/ deBined by  ( + $ +   ) =  / + ( + $)


Therefore T is a bijective linear transformation.

Solution: Ker (T) = { + $ +   :  ( + $ +   ) = 0}


Determine wether T is an injective, surjective or bijective.

= { + $ +   :  / + ( + $) = 0}
= { + $ +   : = 0, + $ = 0} = {   − : ∈ }
= {(  − ) : ∈ } ≠ {0}

Range of T ={( r(): r() ∈ r }


Hence T is not injective.

={  / + ( + $): , $, ∈ } = span{ / , }
Rank(T) is 2 and dim(r ) '% 3
Hence T is not surjective.
Definition:
1. Let U, V and W be sets. Let T: U → V and G: V → W are mappings. Then the mapping G ο
T: U → W, given by (G ο T) (u) = G (T (u)) for all u in U is called the composite mapping from
U in to W.
2. Let T: V → W is a mapping. We say that T has an inverse if there exists a mapping .G : W →
V Such that GoT = IV and ToG = Iw.Where IV is the identity map of V and Iw is the identity
map of W.
-1
3. If T has an inverse, we also say that T is invertible and write T to mean the
inverse of T.
Theorem : Let V and W are vector spaces. A linear map T: V → W is injective if
and only if its kernel is {0}, where 0 is the zero element in V.
Example 4.26 Let T: R2 → R2 be a linear map given by T(x, y) = ( y, x+y).
Find the inverse of F,If it exists.
Solution: Here we have V = R2 = W that is dim V = dim W
And Ker F = {(x, y) :T(x, y) = (0, 0)}
= {(x, y) :( y, x+y) = (0, 0)} = {(x, y) : y = 0 and x +y = 0}
= {(x, y) : y = 0 and x = -y} = {(0, 0)}
⇒ Ker T = {(0, 0)}, where (0, 0) in the identity in R2.
Hence, by the above theorem T is invertible.

BIT MATHEMATICS PROGRAM


129
LINEAR TRANSFORMATION

To find the inverse of T, suppose


T-1(x, y) = (a, b) where (x, y) ∈ W = R2 and (a, b) ∈ V = R2
⇒ T(T-1(x, y)) = T(a, b)
⇒ T(a, b) = (x, y)
⇒( $, + $) = ( , )
Now you need to find a and b in terms of x and y.
⇒ b = x and a + b = y
⇒ a = y- b ⇒ = −
Hence, T (x, y) = ( − , ) is the inverse of T(x, y) = (y, x + y)
-1

EXERCISE 4.3.
1. Determine wether the following linear transformations are injective,surjectiveor
bi-jective
a. T: R3 → R2, T ( x ,y, z) = ( x-y , 4y-2z)
b. T: R2 → R4 , T ( a, b) = ( a , 0, b, 0)
c. T: P2 → R2 , T (p) = ( p(1), p(0))
d. : e/ → , (! +  + $  +  / ) = !
2. Let T: R3 → R2 and G: R2 → R2 be defined by T(x, y, z) = (3x, y - z) and
G(x, y) = (y, x). Find (GoT) (1, 1, 2)

:   →   , (, ) = (2 + , 3 − 5 ) is invertible and if so, find its inverse.


3 .Determine whether the given linear transformation

4.4 STANDARD MATRIX OF A LINEAR TRANSFORMATION, M(T)


Objectives: At the end of this sub topic you will be able to:
 Evaluate the standard matrix of a linear transformation with respect to the standard
bassis.
 Find the standard matrix of a linear transformation with respect to any basis.
Definition:
Let T be a transformation from R n to R m , and {e1 , e2 ,..., en } be the standard basis
for R n . The matrix of T, denoted M(T),is the n × m matrix whose columns are
the images of the elements of the standard basis:
M (T ) = [T (e1 ), T (e2 ),............,T (en )]. And the relation

  + $
T(v) = Mv is called the matrix representation.
Example 4.27. Let   →   defined  2 4 = Y Z , find the standard matrice of T.
 + !
Solution: The standard basis of   '% = { ( 1,0), ( 0,1)}
1
 2 4= 2 4
0
0 $
2 4 = 2 4
1 !
$
Hence the standard matrix of  , f() = 2 4
!

BIT MATHEMATICS PROGRAM


130
LINEAR ALGEBRA

Example 4.28. Let T be the linear transformation from R 3 to R 4 defined by


 x+ y 
 x 
   − 2 x + z 
T  y = .
 0 
 z   
 2y 
Then find the standard matrix of T.
1  1  0 
1   0    0   
−2 0 1
Solution: T 0 =  , T 1  =  , T 0 =  .
0  0  0 
0   0   1  
0   2 0 
 1 1 0
− 2 0 1
Therefore, M (T ) =  .
 0 0 0
 
 0 2 0


 1 1 0
− 2 0 1  x 
And its representation is  m n =   y 
  0 0 0  
  z 
 0 2 0

T :  / →   defined by ( , , ) = (  − 2 , 2 + )
Example 4.29. Find the standard matrix for the linear transformation T:

1
1 − 20 1
Solution:  001= 2 4=2 4
21 + 0 2
0

0
0−2 −2
 01 1 = 2 4=2 4
0+1 1
0

0
0 − 20 0
 00 1 = 2 4=2 4
20 + 0 0
1
1 −2 0
Hence the standard matrix M(T) = 2 4
2 1 0
Example 4.30 Find the standard matrix of the linear transformation

BIT MATHEMATICS PROGRAM


131
LINEAR TRANSFORMATION

 x
T that rotates a vector   counterclockwise in R 2 through an angle θ .
 y
Solution: From the rotation we obtain
 x  (cos θ ) x − (sin θ ) y 
T  =   . Evaluating T on the standard basis, we get
 y  (sin θ ) x + (cos θ ) y 
1 cos θ  0 − sin θ  cos θ − sin θ 
T  =   , T  =  . Therefore, M (T ) =  .
0  sin θ  1  cos θ   sin θ cos θ 

Let : 7 → 8 be a linear transformation and Let s = {3 , ,…, : } be the basis of V and
Definition: (Standard matrix for other basis)

s , = { 3 ,  , … , t } be the basis of W. (Assume V and W are finite dimensional )


Now (3 ),  ( ), … , (: ) are vectors in W and each is the linear combination of
with respect to the basis of W = s , .
Son the let ( 33,, 3, … , 3t ) is the co ordinates of (3 ) 'ℎ &#%r#   s ,

11 … 12 … 1
In the same way, getting the all the coordinates, the matrix A of mxn defined as

A = []wx = 0 ; ; ; 1 is calld the standard matrix of T or the


w

1 2 
matrix representation of  with respect to β and β’,

5 − 2
Example 4.31. Let T: R/ → R , defined as  z 0 1{ = Y Z , with respect to the
3 + 
basis s = { (1,0,0), ( 0,0,1), 1, −1,1)} and s , = {(1,0), (1, −1)} )&   .
(

1
Find the standard matrix of T.
5 5
Solution:  001 = 2 4, and the co ordinates of 2 4
0 0
0
(5, 0) = |( 1,0) + s( 1, −1)
| + s = 5S
}
−s = 0
α = 5 and β = 0
1
5
Hence the coordinates of of  001 '% 2 4
0
0
0
0
 001 = 2 4 and ( 0,1 ) = |( 1,0) + s( 1, −1)
1
1
| + s = 0S
}
−s = 1
α = 1 and β = −1

BIT MATHEMATICS PROGRAM


132
LINEAR ALGEBRA

0
1
The coordinates of of  001 '% 2 4
−1
1
1
7
 0−11 = 2 4 and the coordinates
−2
1
(7, − 2) = |( 1,0) + s( 1, −1)
| + s = 7S
}
−s = −2
α = 5 and β = 2
1
5
The coordinates of  0−11 is 2 4
2
1
5 1 5
Hence M(T) = []wx = ((1) (2) (3)) = 2 4
w
0 −1 2
Theorem: Let 3 :  : →  t and  :  t →   $# linear transformations with standard
matrices ‚ ! ƒ . The composition :  : →   , !#)'#! $ () =  *3 ()+ is a linear
transformation . Moreover , thev standard matrix C for T is given by the matrix product

Example 4.32. „et T3 and  be linear transformations from  /   / such that


C = BA.

3 ( , , ) = ( 2 + , 0,  + ) !  ( , , ) = (  − , , )
Find the standard matrice for the compositions  =  o3 !  x = 3 
Soltion: The standard matices of 3 !  &#:
2 1 0 1 −1 0
‚ = 00 0 0 1 ! ƒ = 00 0 11
1 0 1 0 1 0

The standard matrix of  =  3 '%


Then by the above theorem

1 −1 0 2 1 0 2 1 0
ƒ‚ = 00 0 11 00 0 01 = 01 0 11 and
0 1 0 1 0 1 0 0 0
The standard matrix of  , = 3 
2 1 0 1 −1 0 2 −2 1
AB = 00 0 01 00 0 11 = 00 0 01
1 0 1 0 1 0 1 0 0

EXERCISE 4.4
− 2
1. Let T be the linear transformation from R 4 to R 2 defined by T (e1 ) =   ,
1 

BIT MATHEMATICS PROGRAM


133
LINEAR TRANSFORMATION

2
− 4
0 2 3
T ( e 2 ) =   , T ( e3 ) =   , T (e4 ) =   .Then compute T  .
 2 0  3 1 
 
− 4
2.Find the standard matix for T and find the image of v under T
a. T ( x, y , z ) = (12 x − 9 y + 4 z , 6 x + 5 y − z ), v = (1,−2,1)
b T ( x, y ) = ( x + y , x − y , 2 x,2 y ) , v = (3,−3)
3. Let T be a liear transformation from R 3 to R 3 defined
 x  2x 
by T  y  = 2 y + z , and let F be a linear transformation from R 3 to R 4 defined
 z   x − z 
 5z 
 x x − y
by F  y  =
  . Then find FoT.
 y 
 z 
 
 y + z
4. Let T be the operator on R3 defined by T ( x, y, z ) = (5 x, x + 6 y, x + 2 y − z ) .
a. Show that T is invertible. b. Find a formula for T-1.
5. Find the standard matrices for  =  o3 !  , = 3 o
3 :   →   , 3 ( , ) = (  − 2 , 2 + 3 )
 :   →   ,  (, ) = ( 2,  − )
6.Find () using a.using the standard matrix
b. using the standard matrix relative to s ! s ,
T: R → R/ , T(x, y) = ( x + y, x, y), v = ( 5,4)
β = {(1, −1), (0,1)} , βx = {(1,1,0), (0,1,1), (1,0,1)}

UNIT SUMMARY
 The map T: V → W, where V and W are vector spaces over the same field K is linear if i.
( + ) = () + ()
''.  ( ) =  () )& ,  ∈ 7 ! ∈i
Also, Ker (T) = {v ∈ V: T(v) = 0′, where 0′ is the identity in W} and T(0) = 0′.
 The sum of linear maps is linear.
 A scalar multiple of a linear map is linear.
 In the linear map L: V → W, Ker (T) is a subspace of V and Im(T) is a subspace of W.
 Composition of linear maps is linear.
 Inverse of a linear map is linear.
 A linear map T: V → W is injecitve if and only if Ker (T) = {0},

BIT MATHEMATICS PROGRAM


134
LINEAR ALGEBRA

where 0 is the identity in V.


 A Linear mapping T: V → W is invertible if and only if it is bijective.
 For a linear map T : V → W and V-finite dimensional, we have
dim V = dim Ker T + dim ImT. Also, Ker T = {0}⇒ T is invertible and T is
surjective ⇒ T is invertible.
 Let T: Rn → Rm be a linear map. Then there exists an m x n matrix A such that T(v) = Av for
every column vectors v in Rn. A is called the matrix of T.
 If #ˆ is the i standard unit vector of Rn, i = 1, 2, … n and A is is the matrix of the linear map
th

T, then the i column of A is T(#ˆ ) for every i = 1, 2, …, n.


th

ANSWERS FOR UNIT FOUR


Exercise 4.1
1. a.T: R2 → R2 defined by T (x, y) = (2x + y, y)
Let u = ( x, y) , v = ( m,n) be in R2 and a be a scalar in a field, then
( + ) = *(, ) + ( , )+

= ( + , + )
= (2( + ) + + , + )
= (2 + , ) + ( 2 + , )

=  ( ) + ()
= T( x, y) + T( m, n)

And T( a u) = ( , ) = ( 2  + , ) = a( 2x+y, y)

( , ) = ()
Therefore T is a linear transformation.
b. T: R2 → R defined by T(x, y) = xy

Then (  + ) = * (, ) + (, )+ = (  + , + ) =  +  +  + 


Let u = ( x, y) and v = ( m,n)

( ) + () = ( , ) + ( , ) =  + 
( + ) ≠ ( ) + ()
Hence T is not linear transformation.
c. T: R → R2 defined by T (x) = (ex, x)
Let  , $# ' , then (  + ) = ( # W‰X ,  + )
= ( # W . # X ,  + ) ≠ (# W , ) + (# X , )
⇒  (  + ) ≠ () + ( )
T is not linear ransformation.
d. T : R2 → R defined by T ( x, y) = x + y
Let u = ( x, y) and v = ( m,n)

BIT MATHEMATICS PROGRAM


135
LINEAR TRANSFORMATION

Then (  + ) = * (, ) + (, )+ = (  + , + )


=++ +
=+ ++
= ( , ) + ( , ) = () + ()
And a be a scalar in the f ield,  ( ) = ( , ) =  + = (  + ) = ()
Hence T is a linear transformation.
e. T: R4 → R2 defined by T (w, x, y, z) = ( 2w-x , y + 3z)

Then (  + ) = * (, , , ) + (, , r, Š)+ = (  + , + ,  + r,  + Š)


Let u = ( x, y,z,w) and v = ( m,n,p q)

= (2 + 2 − − ,  + r + 3 + 3Š)
= (2 − ,  + 3) + (2 − , r + 3Š)
(, , , ) + (, , r, Š) = () + ()
And ( ) = ( , , , ) = ( 2  − ,  + 3 ) = (, , , ) = ()
Hence T is a linear transformation
f. T : M 2× 2 (R) → R defined by T (A) = A
Let A and B be any 2x2 matrices, (‚ + ƒ) = |‚ + ƒ| ≠ |‚| + |ƒ|
From properties of determinant.
T is not a linear transformation.
a b 
g. T : M 2× 2 (R) → P2 defined by T   = c + bx + ax
2

 
 c d 
$
Let A = 2 4, B = 2 r Š 4
!
$   + $+
(‚ + ƒ) =  m2 4 + 2 r Š 4n =  mY Zn
! +r !+Š
=( + r) + ($ + ) + ( + ) 
= + $ +   + r +  +  
= (‚) + (ƒ)
< <$
Let k be any scalar in a field k, (<‚) =  2 4 = < + <$ + <  
< <!
= < 2 c + bx + ax 2 4 = kT(A)
Therefore T is a linear transformation.
a b 
h. T : M 2× 2 (R) → R3 , T   = (ab, c, d )
 
c d 
$
Let A = 2 4, B =2 r Š 4
!
$   + $+
(‚ + ƒ) =  m2 4 + 2 r Š 4n =  mY Zn
! +r !+Š
= ( $ +  + $ + , + r, ! + Š)
(
And (‚) + (ƒ) = $, , !) + (, r, Š) = ( $ + . + r, ! + Š)

BIT MATHEMATICS PROGRAM


136
LINEAR ALGEBRA

(‚) + (ƒ) ≠ (‚ + ƒ)


Hence T is not a linear transformation.
i.Let A be an m × n matrix. Let T be the function from M n×k to M m×k defined by
T ( B) = AB . Show that T is a linrar transformation.
Let B and C be any 2x2 atrices, then (ƒ + ) = ‚(ƒ + ) = ‚ƒ + ‚ = (ƒ) + ()
For k be a scalar in the field, T(kB) = A(kB) = k(AB) = kT(B)
Hence T is a linear transformation.
2. Let T: R2 → R2 be a linear map. Suppose that T (3, 1) = (1, 2) and T (-1, 0) = (1, 1).
(1, −2) = −2(3,1) − 7(−1,0)
Hence . ( 1, −2) = −2(3,1) − 7(−1,0)
= (−2, −4) + (−7, −7) = (−9, −11)
$. ( 1,0) = 0( 3,1) − 1( −1,0)
( 1,0) = ( −1, −1)
3.. →  be a linear tranformation such that
/ /

T( 1, 0, 0) = ( 2, -1, 4), T ( 0, 1, 0) = (1, 5, -2), T (0, 0, 1) = ( 0, 3,1 ),


then compute T ( 2, 3, -2).

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


(2,3,-2) = 2(1,0,0)+3(0,1,0) -2( 0,0, 1)

4..Let T be a linear transformation from e  e such that T(1) = x, T(x) = 1+x,


T ( 2, 3, -2).= 2(2,-1,4) + 3(1,5,-2) + -2(0,3,1)

T(  ) = 1 +  +   , the find ( 2 − 6 +   )


( 2 − 6 +   ) = 2(1) − 6() + (  )= 2() − 6(1 + ) + 1 +  +  
= −5 − 3 +  
1 3 1 0 0 1 0 0 0 0
2 4 = 12 4 + 32 4-2 4 +4 2 4
−1 4 0 0 0 0 1 0 0 1
1 3 1 0 0 1 0 0 0 0
5.

2 4 = 1 2 4+3 2 4 − 1 2 4 + 4 2 4
−1 4 0 0 0 0 1 0 0 1
1 −1 0 2 1 2 3 −1
=2 4 + 32 4 − 12 4+ 4 2 4
0 2 1 1 0 1 0 1
12 −1
=2 4
3 8

Exercise 4.2
1.a. T: M 2× 2 (R) → M 2× 2 (R), T(A) = At
$ $ 0 0
a. ker(T) = R2 4:2 4=2 4g
! ! 0 0
$ 0 0
= R2 4: 2 4=2 4g
! $ ! 0 0
$ 0 0
= R2 4 : = $ = = ! = 0g = R2 4g
! 0 0
b. Since ker(T) has no basis.

BIT MATHEMATICS PROGRAM


137
LINEAR TRANSFORMATION


c. Nullity(T) = 0
d. Im(T) =R2 4g = fW ()
$ !
1 0 0 1 0 0 0 0
e. Basis for image of T is R2 4,2 4,2 4,2 4g( it has also
0 0 0 0 0 1 1 0
other basis)
f . Rank(T) = 4
1.b. T: R2 → R2 , T( x ,y) = ( 2x - y, 0 )
a. ker(T) = {(, ): (, ) = (0,0)} = {(, ): (2 − , 0) = (0,0)}
= {(, ): 2 − = 0} = {(, 2):  ∈ }
b. Basis of ker(T) = {(1,2)}

d. Im(T) = {(, 0):  ∈ }


c. Nullity(T) = 1

e. Basis for image of T = {(1,0)}


f. rank(T) = 1
c. T: P2 →P3, T( c + bx + ax2) = ( a + b) x + cx3
a. Ker(T) = { + $ +   : ( + $ +   ) = 0}
= { + $ +   : ( + $) +  / ) = 0} = { + $ +   : + $ = 0 , = 0}
= { + $ +   : = −$, = 0} = {   − } = { (  − )}
b. basis of Ker(T) = {  − }

d. Im(T) = { +  / }
c. Nullity(T) = 1

e. basis of the image = {,   }


f. rank() = 2
2. Let F: R3 → R2 be given by F(x, y,z) = (x, y).
Ker(F) = {(, , ): (, , ) = (0,0)}
= {(, , ): (, ) = (0,0)}
= {(0,0, ):  ∈ }
Basis of the kernel is {(0,0,1)}

And rank of F = Dim( / ) − Ž""' () = 3 − 1 = 2


Hence the dimensions of the kernel is 1.

3. Let T:  U →  T be a linear transformation.


a. Since Dim(ker(T) = Dim(V) – rank(T)

b. Rank(T) = Dim( ) − dim (ker()


=5-2=3
U

= 5- 4 = 1

⇒ dim (ker()) = ""' () = 0


c. Ker(T) = {0}

rank(T) = Dim( U ) − dim (ker()

4. Let :  →  , (, ) = (  − 2 , 0, −), find


=5–0=5
 /

BIT MATHEMATICS PROGRAM


138
LINEAR ALGEBRA

a. ker(T) = {(, ): (, ) = (0,0,0)


={(, ):  − 2 = 0, − = 0} = {(0,0)} = {0}
b. ker(T) has no basis.

d. rank(T) = dim(  ) − dim (ker()) = 2 - 0 = 2


c. Nullity(T) = 0

EXERCISE 4.3
1. a. ker () = {(, , ): (, , ) = ( 0,0)}
= { (x, y, z): (x − y, 4y − 2z) = ( 0, 0)}
= { ( , ‘, ’): x − y = 0, 4y − 2z = 0} = { (x, y,z) : x = y and 2y = z}
= { ( , , 2):  ∈  }

The image of T is (m, n) in   such that T(x,y,z) = ( m,n)


Hence T is not injective.

And the dim(  ) is 2.


So the basis of the dimension is 2. i.e rank is 2.

Hence T is surjective.
And hence T is bi-jective.
b. T: R2 → R4, T( a, b) = ( a , 0, b, 0)
ker() = { ( , $): ( , $) = ( 0,0,0,0) = {( a,b) : ( a,0,b,0) = ( 0,0,0,0)
= { ( a, b) : a = 0, b= 0}={ ( 0, 0) }
= {0}
Hence T is injective.

And the dimension of  M '% 4.


Basis of the image is { ( 1,0,0,0), ( 0,0,1)} so that the rank is 2.

c. Ker(T) = { + $ +   : ( + $ +   ) = ( 0,0)}
Hence T is not surjective.

= { + $ +   : (e(1), e(0) = (0,0)} = { +bx +   : ( + $ + , ) = ( 0,0)}


= { + $ +   : ( + $ + , ) = ( 0,0) } = { + $ +   : = −$ , = 0)}
= { −  +   } ≠ {0}
Hence T is not injective.

So the rank is 2 = dim(  )


The image of T is { ( m, n) : m = c+ b+a, n = c , for a,b,c in R}

d. ker( ) = { ! +  + $  +  / : (! +  + $  +  / ) = 0}
Hence T is surjective.

= {! +  + $  +  / : ! = 0} = {  + $  +  / }
Hence T is not injective.
The basis of the image is { 1}
So its rank is 1 = dim( R)
So T is surjective.
2. T: R3 → R2 and G: R2 → R2 be defined by T(x, y, z) = (3x, y - z) and

BIT MATHEMATICS PROGRAM


139
LINEAR TRANSFORMATION

(GoT) (1, 1, 2) = “*( 1,1,2)+ = “( 31,1 − 2) = “(3, −1) = ( −1, 3)


G(x, y) = (y, x).

3. Ker(T)= {(, ): ( , ) = (2 + , 3 − 5 ) = (0,0)}


= { ( , ): 2 + = 0 , 3 − 5 = 0}

2 + = 0 S 10 + 5 = 0S
Solving the homogenous system
} ⇒} ⟹ 13 = 0 ⟹  = 0 and y = 0
3 − 5 = 0 3 − 5 = 0
Hence ker(T) = {0}
Therefore T is invertible.
To find the inverse of T, suppose
T-1(x, y) = (a, b) where (x, y) ∈ W = R2 and (a, b) ∈ V = R2
⇒ T(T-1(x, y)) = T(a, b)
⇒ T(a, b) = (x, y)
⇒( 2 + $, 3 − 5$) = ( , )

2 +$ = S 10 + 5$ = 5 S
Now solve a and b interms of x and y.
} ⇒} ⟹ 13 = 5 + ⟹ = 3/
UW‰X
3 − 5$ = 3 − 5$ =
and b =  − 2 ⇒$=
/WVX
3/
Hence, T (x, y) = ( , ) i.e the for T( x,y ) in range there is ( , ) in the domain
UW‰X /WVX UW‰X /WVX
3/ 3/ 3/ 3/
-1

of T which is its inverse.


EXERCISE 4.4
− 2
1. Let T be the linear transformation from R 4 to R 2 defined by T (e1 ) =   ,
1 
2
− 4
0 2 3
T (e2 ) =   , T (e3 ) =  , T (e4 ) =   .Then compute T  .
 2 0  3 1 
 
− 4
We use the matrix of T to carry out the computation:
2 2
 − 4 − 2 0 2 3 − 4 − 14 

− 2 0 2 3 
M (T ) =   . Hence, a. T  1  =  1 2 0 3  1  =  − 18 
 1 2 0 3    
   
 − 4  − 4
2. Find the standard matix for T and find the image of v under T
a. T ( x, y , z ) = (12 x − 9 y + 4 z , 6 x + 5 y − z ), v = (1,−2,1)
b T ( x, y ) = ( x + y , x − y , 2 x,2 y ) , v = (3,−3)

BIT MATHEMATICS PROGRAM


140
LINEAR ALGEBRA

1 0  0 
12   − 9 4
a. T 0 =  , T 1 =   , T 0 =  
 
−1
0   0   1  
6 5

12 − 9 4
The standard matrix M (T ) is  ,
 6 5 1
 1   1 
  12 − 9 4   34 
T (v) = T  − 2  = is =   − 2  =  ,
 1   6 5 1  1   − 3 
   

1 1
   
1   1   0   − 1
b. T   =,   , T   =,  
0   2  1   0  •
0  2
   
1 1   0 
1 − 1  
3  6 
M (T ) is   T   =  M
2 0  − 3  6 
  and  − 6
0 2   
f
3. Let T be a liear transformation from R 3 to R 3 defined
 x  2x 
by T  y  = 2 y + z , and let F be a linear transformation from R 3 to R 4
 z   x − z 
 5z 
 x x − y
defined by F  y  =   . Then find FoT.
 y 
 z   
 y + z
 5( x − z ) 
x  x   2x  2 x − (2 y + z )
 
Solution: FoT  y  = F  T  y   = F 2 y + z  =  
   2y + z 
 z    z    x − z   
 2y + x 
4. Let T be the operator on R3 defined by T ( x, y, z ) = (5 x, x + 6 y, x + 2 y − z ) .
a. Show that T is invertible.
b. Find a formula for T-1.
Solution: a. kerT = {(x, y, z) : T(x, y, z) = (0, 0, 0) x, y, z in R}

BIT MATHEMATICS PROGRAM


141
LINEAR TRANSFORMATION

= {(x, y, z) : (5x, x +6y, x + 2y - z) = (0, 0, 0) x, y, z in R}.


From (5x, x +6y, x + 2y - z) = (0, 0, 0), we get the linear system
 5x = 0

 x + 6 y = 0 ⇒ x = 0, y = 0 z = 0
x + 2 y − z = 0

Thus ker(T ) = {0}
Hence T is injective and so T is invertible and so that T-1 exists in R3.
b. To find T-1, let T (x, y, z) = (m, n, p), then T-1 (m, n, p) = (x, y, z) .
Now let us find the values of x, y and z in terms of m, n andpt, and then substitute
in the above formula for T-1.
From T(x, y, z) = (2x, 4x – y, 2x + 3y –z) = (r, s, t) and solving the system
 5x = m

 x + 6y = n
x + 2 y − z = p

1 5n − m 25n − 2m − 15 p
Solving this We get x = m, y = ,z = .
5 6 15
 1 5n − m 25n − 2m − 15 p 
Therefore T −1 is given by T −1 (m, n, p ) =  m, , .
5 6 15 
5. Find the standard matrices for  =  o3 !  = 3 o,

3 :   →   , 3 ( , ) = (  − 2 , 2 + 3 )
 :   →   ,  (, ) = ( 2,  − )
The standard matrix of 3 !  &# :
1 −2
‚ = (3 (#1) 3 (#2)) = 2 4
2 3
2 0
ƒ = ( (#1)  (#2)) = 2 4
1 −1
Hence the standard matrix for  =  o3
2 0 1 −2 2 −4
BA = 2 42 4=2 4
1 −1 2 3 −1 −5
And the standard matrix  , = 3o is
1 −2 2 0 0 2
AB = 2 42 4=2 4
2 3 1 −1 7 −3
6.Find () using a. using the standard matrix
b. using the standard matrix relative to s ! s ,
T: R → R/ , T(x, y) = ( x + y, x, y), v = ( 5,4)
s = {(1, −1), (0,1)} , s x = {(1,1,0), (0,1,1), (1,0,1)}
a. ( #1) = (1,0) = (1,1,0)
(#2) = (0,1) = (1,0,1)

BIT MATHEMATICS PROGRAM


142
LINEAR ALGEBRA

1 1
The standard matrix of T with the standard basis is 01 01
0 1
 1 1  1 1 9
5 5
 2 4 = 01 01 2 4,  2 4 = 01 01 2 4 = 051
4 4
0 1 0 1 4
0
1
b.  2 4 = 0 1 1, and the coordinates of
−1
−1
( 0,1,-1) =|(1,1,0) + s(0,1,1) + —(1,0,1)
|+— = 0
˜ | + s = 1 S ⇒ | = − —, s = 1 + —
s + — = −1

|+— =0 S
R ⇒ — = −1, | = 1 ! s = 0
1 + — + — = −1
0 1
Hence the coordinates of 0 1 1 '% 0 0 1,
−1 −1
1 1
0
 2 4= 001 and the coordinates of 001 is with respect to s x
1
1 1
( 1,0,1) =|(1,1,0) + s(0,1,1) + —(1,0,1)
|+— =1
˜ | + s = 0S ⇒ | = 1 − —, | = s
s+— =1
| + | = 0 ⇒ | = 0, — = 1, s = 0
1 0
The coordinates of 001 '% 001
1 1
1 0
The matrix of relative the two basis is 0 0 01
−1 1
1 0 5
5 5
 2 4 = 0 0 01 2 4 = 0 0 1
4 4
−1 1 −1

BIT MATHEMATICS PROGRAM


143
LINEAR TRANSFORMATION

CHECK- LIST FOR UNIT 4


Put a tick mark () for those you are able to do it and put (X) for those unable to do it for each of
the following questions, if you put an (X) in the given box
For those point you put X you are are required to read on the respective sub topic until you put 
 Can you explain what a linear mapping means?
 Do you know the difference between mappings and linear mappings?
 Can you find the image of a given map?
 Can you identify mapping which are injecitve, surjective and bijective?
 Can you find the Kernel and image of a linear map?
 Can you find the rank and nullity of a linear Map?
 Can you find the standard matrix of a linear map?
 Can you find the marix of a linear map other than the standard basis?
 Can you discuss the conditions for the existence of inverses of linear maps?
 Can you find inverse of a linear map?

BIT MATHEMATICS PROGRAM


144
LINEAR ALGEBRA

BIT MATHEMATICS PROGRAM


145

You might also like