Linear Transformation

Unit-1, Lecture-4,5

Lecture-4

1 Linear Transformation

Let X and Y be two non empty sets, then a mapping f : X −→ Y is a rule

which associates every element of X into a unique element of Y . Mapping

and transformation are synonyms of function. In general, we use the term

transformation if the function is defined between two vector spaces. The

domain of f is denoted by Dom(F ) and the range of f is denoted by Ran(f ).

Definition 1.1. Let U and V be two vector spaces over a field F . Then a

map T : U → V is called linear transformation if

T (ax + by) = aT (x) + bT (y), ∀x, y ∈ U &, a, b ∈ F .

Let dim(U ) = n and dim(V ) = m. Let B = {u1 , u2 , ..., un ) be a basis

of U , then for any u ∈ U ,∃ a1 , a2 , ..., an such that u = a1 u1 + a2 u2 +

... + an un . We have T (u) = T (a1 u1 + a2 u2 + ... + an un ) = a1 T (u1 ) +

a2 T (u2 ) + ... + an T (un ). Thus every element of range of T (Ran(T )) can be

expressed as a linear combination of {T (u1 ), T (u2 ), ...., T (un )}. Note that

the set {T (u1 ), T (u2 ), ...., T (un )} may or may not be a basis of Ran(T ).
Remark 1.1. Since T (0v) = 0T (v) = 00 ⇒ T (0) = 00 ⇒ zero vector in U

goes to zero vector in V under the linear transformation T . ( here 00 is the

zero vector in V .

Let A = [aij ]mn be a m × n real/complex matrix. Clearly rows of A

represents elements in Rn and the columns of A represents elements in Rm .

For any column vector X ∈ Rn , AX ∈ Rm . Thus a matrix of order m × n

maps the elements of Rn into the elements of Rm , i.e., A : Rn −→ Rm for

any A = [aij ]mn . It can be easily shown that the A is a linear transformation.

Example 1.2. Let U = C[0, 1] = {f : [0, 1] −→ R : f is continuous} and

R1
V = R. Define T : C[0, 1] → R by T (f ) = 0 f dx. Then T is a linear

transformation.

Solution- Let a, b ∈ R & f, g ∈ C[0, 1], then

R1
T (af + bg) = 0 (af + bg)dx
R1 R1
= 0 af dx + 0 bg dx
R1 R1
= a 0 f dx + b 0 g dx

= aT (f ) + bT (g).

Thus T is a linear transformation.

Following are some more examples of linear transformations which can

be easily solved.

1. Let U = V = F [x] (Set of polynomials defined over the field F ). Then

d
T : F [x] → F [x] defined by T (f ) = f (x) is a linear transformation.
dx

2
  
 1 0 
2. The identity matrix I =   defined by R2 as I : R2 −→ R2
0 1
such hat I(X) = I × X for any X ∈ R2 is a linear transformation.

3. Double stretching along x-direction. Define T : R2 −→ R2 by

  
 2 0  x 
T (x, y) =     = (2x, y). T is a linear transformation.
0 1 y

4. Double stretching along y-direction: T : R2 −→ R2 by

  
 1 0  x 
T (x, y) =     = (x, 2y). T is a linear transformation.
0 2 y

5. Reflection with respect to y-axis. T : R2 −→ R2 by

  
 −1 0   x 
T (x, y) =     = (−x, y). T is a linear transformation.
0 1 y

6. Double stretching along y-direction and reflection with respect to y-

axis. T : R2 −→ R2 by
  
 −1 0  x 
T (x, y) =     = (−x, 2y). T is a linear transformation.
0 2 y

7. Rotation by an angle theta. T : R2 −→ R2 by

  
 cos θ −sin θ  x 
T (x, y) =     = (xcos θ − ysin θ, xsin θ +
sin θ cos θ y
ycos θ). T is a linear transformation.

8. Shear. T : R2 −→ R2 by

3
   
 1 1  x 
T (x, y) =     = (x + y, y). T is a linear transformation
0 1 y

9. Shear and rotation. T : R2 −→ R2 by

  
 1 −1   x 
T (x, y) =     = (x−y, y). T is a linear transformation
0 1 y

1.1 Null Space and Range space

Definition 1.3. Let T : U → V be linear transformation. Then kernel of T

is defined by Ker(T ) = {x ∈ U : T (x) = 0} and the range of T is defined by

Ran(T ) = {y ∈ V : ∃ x ∈ U such that T (x) = y}.

Ker(T ) and Ran(T ) are subspaces of U and V which are called null

space and range space respectively. Dimension of null space is called Nul-

lity of T and dimension of range space is called Rank of T .

Theorem 1.1. (Rank-Nullity Theorem : Sylvesties law of Nullity)-

Let T : U −→ V be a linear transformation from a vector space U to a

vector space V over the same field F . If Rank(T ) = r and dim(U ) = n then

N ullity(T ) = n − r, i.e., Rank(T ) + N ullilty(T ) = dim(U ).

Definition 1.4. Sum and Product of Linear Transformation-

1. Let U and V be two vector spaces over the field F . Let T1 , T2 be two linear

transformations s.t. T1 : U −→ V and T2 : U −→ V , then the sum of linear

transformations S = T1 + T2 : U −→ V defined by S(u) = T1 (u) + T2 (u) for

any u ∈ U is also a linear transformation.

4
2. Let U , V and W are three vector spaces over the field F . Let T1 : U −→ V ,

T2 : V −→ W s.t. T1 (U ) ⊆ V , then the product of T1 and T2 , T2 T1 defined

by T2 T1 : U −→ W s.t. T2 T1 (u) = T2 (T1 (u)), ∀ u ∈ U is also a linear

transformation.

Note that if T1 , T2 : V −→ V , then T2 T1 and T1 T2 both are defined but

T2 T1 6= T1 T2 in general.

Example 1.5. Let T bea linear transformation T X = AX from R2 to R3 ,

 1 2 
 
where A =  −1 1  and X = (x, y)T . Find the Ker(T ), Ran(T ) and
 
 
3 2
their dimensions.

Solution- Since we know that X ∈ Ker(T ) if T X = 0.

2
∈ R such
So we find X  that T X =AX  = 0 ∈ R3 .

 1 2   0 
 
  x   
TX = 0 ⇒   −1 1    =  0 
  
  y  
3 2 0
   
 x + 2y   0 
   
⇒  −x + y  =  0 
  
   
3x + 2y 0
⇒ x + 2y = 0, −x + y = 0, 3x + 2y = 0 ⇒ x = y = 0.

Thus Ker(T ) = {(0, 0, 0)T } and N ullity(T ) = dim(Ker(T )) = 0.

5
      
 x + 2y   1   2 
     
Now, AX = 
 −x + y
 = x  −1  + y  1 .
    
     
3x + 2y 3 2
   
 1   2 
   
⇒ Ran(T ) = {Y = AX : x 
 −1  + y  1  , x, y ∈ R}
  
   
3 2
Since the vectors (1, −1, 3)T and (2, 1, 2)T are LI ⇒ dim(Ran(T )) = 2.

In fact a basis of Ran(T ) is given by {(1, −1, 3)T , (2, 1, 2)T }.

6
 Lecture-5

2 Matrix representation of linear transforma-

tion

We know that every matrix A of order m × n is a linear transformation from

Rn into Rm . In this section we will show that we may associate a matrix A

for a linear transformation T defined between two finite dimensional vector

space V to W , in particular T : Rn −→ Rm .

Let T : V −→ W be a linear transformation, where dim(V ) = n,

dim(W ) = m, and X = {v1 , v2 , . . . , vn } and Y = {w1 , w2 , . . . , wm } be

bases of V and W respectively. Then each T (vj ) can be expressed as a linear

combination of {w1 , w2 , ..., wm }, j = 1, 2, ..., n. Let,

T (v1 ) = α11 w1 + . . . + αm1 wm

.. .. .. ..
. . . .

T (vj ) = α1j w1 . . . + αmj wm

.. .. .. ..
. . . .

T (vn ) = α1n w1 + . . . + αmn wm .

We can write,

T (vj ) = α1j w1 + . . . + αmj wm

= [w1 , w2 , ..., wm ][α1j , α2j , ..., αmj ]T , j = 1, 2, 3....n

Hence, we can write

7
  
 α11 α12 . . . α1n 
 . .. .. .. 
T [v1 , v2 , . . . vn ] = [w1 , w2 , . . . wm ]  . .
 . . . . 
 
αm1 αm2 . . . αmn
Or, T X = Y A.

The matrix A = [aij ]m×n is called matrix representation of T with respect

to the basis X and Y , which is given by

 
 α11 α12 . . . α1n 
 . .. .. .. 
A= .
 . . . .
. 
 
αm1 αm2 . . . αmn
Thus, to find the matrix representation of any linear transformation T :

V −→ W , we express T (vj ), j = 1, 2, ..., n as a linear combination of the basis

vectors {w1 , w2 , ..., wm } of W . The coefficients of this linear representation

form the jth column of the corresponding matrix representation A of T .

Remark 2.1. Matrix representation of any linear transformation not only

depends on the definition of T but also on the bases of the vector spaces.

Remark 2.2. Note that the basis vectors of V and W are column vectors.

For the sake of simplicity sometime we express them as row vectors in the

examples.

Example 2.1. Let the linear transformation T : R2 → R3 is defined by

T (x, y) = (x + y, x, x − y).

(i) Find the matrix representation of T with respect to the standard basis

of R2 and R3 .

8
 (ii) Find matrix representation of T with respect to the basis X = {(1, 1), (1, −1)}

of R2 and Y = {(0, 1, 1), (1, 0, 1)(1, 1, 0)}.

Solution

(i) Here X = {(1, 0), (0, 1)} and Y = {(1, 0, 0), (0, 1, 0), (0, 0, 1)}

By the definition of LT, we have

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

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

Thus the matrix representation

  of T with respect to the standard basis is
 1 1 
 
M atrix(T ) = A =  1 0 .

 
1 −1
(ii) Here, X = {(1, 1), (1, −1)} and Y = {(0, 1, 1), (1, 0, 1)(1, 1, 0)}

By the definition of LT, we have

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

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

Thus the matrix representation

 of T with respect to the given bases is
1
 − 2 −1 
 
M atrix(T ) = A =  1
 2 0 .
 
3
2
1

Example 2.2. Find the matrix representation of the linear transformation

T : R2 → R2 defined by T (x, y) = (x + 2y, 3x + 4y) with respect to the

standard basis of R2 .

Solution.

9
 By the definition of LT, we have

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

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

Thus the matrix representation

  of T with respect to the standard basis is
 1 2 
M atrix(T ) = A =  
3 4

We have studied the method to find matrix representation of a linear

transformation T , we can also find the linear transformation T corresponding

to the given matrix representation. Let us do the following example.

Example 2.3. Let T : R2 −→ R3 , and the basis of R2 and R3 are X =

{(1, 2)T , (3, 4)T } and Y = {(−1, 1, 1)T , (1, −1, 1)T , (1, 1, −1)T } respectively.

Find the linear transformation T if the matrix representation of T is given

by  
 1 2 
 
A=  2 3 .

 
3 4
Solution-

We have

T [v1 , v2 ] =[w1 , w2 , w3 ]A    
 −1 1 1   1 2   4 5 
     
=
 1 −1 1


 2 3 = 2 3 
   
     
1 1 −1 3 4 0 1
Clearly T (v1 ) = (4, 2, 0)T and T (v2 ) = (5, 3, 1)T .

10
 Now,
 any
 vector
 x x2 )T
= (x1 ,  ∈ R2 can be expressed as

 x1   1   3
 = α +β  ⇒ α = 12 (−4x1 + 3x2 ), β = 12 (2x1 − x2 )


x2 2 4
Hence, we have

T x =T (αv
1 + βv2 ) =
αT (v1 ) + βT (v2 )

 4   5 
   
= α 2
 
 + β
 3 

   
0 1
 
 4α + 5β 
 
= 2α + 3β 

 
β
 
 −6x1 + 7x2 
 
= 21 
 −2x1 + 3x2
 (putting the value of α and β)

 
2x1 − x2

Note that, for the given matrix A, the corresponding linear transformation

T is given by T X = AX with respect to the standard basis. In the above

example, the linear transformation T is given by T (x, y)T = AX = (x +

2y, 2x + 3y, 3x + 4y)T (or T (x, y) = (x + 2y, 2x + 3y, 3x + 4y)) with respect

to the standard basis.

Example
 2.4.Find the linear transformation T corresponding to the matrix
 1 2 
A=  with respect to the standard basis.
3 4
Solution- Linear transformation T is defined by T (x, y)T = A(x, y)T , i.e.,

11
     
 1 2   x   x + 2y 
T (x, y)T =    =  
3 4 y 3x + 4y
Thus, T (x, y) = (x + 2y, 3x + 4y).

Example 2.5. Find the matrix, rank and nullity of linear transformation T :

R3 −→ R2 defined by T (x, y, z) = (x + y, −x + z) with respect to the standard

basis.

Solution. Matrix representation of T with respect to the standard basis is

given by-
 
 1 1 0 
M atrix (T ) =  
−1 0 1

Ker(T ) = {(x, y, z)| T (x, y, z) = (0, 0)}

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

= {a(1, −1, 1)T | a ∈ F }.

Nullity= dim Ker(T ) = 1.

Range(T) ={T (v)|v ∈ V } 

  x  
 1 1 0    x+y 
 
= {T v =    y =
 }
−1 0 1   −x + z
z
     
 1   1   0 
= {x   + y   + z   : x, y, z ∈ F }.
−1 0 1

12
      
 1   1   0 
Since   =   −  .
−1 0 1
This implies dim[Range(T )] = Rank(T ) = 2.

By Rank-Nullity Theorem also we can determine the Rank(T ),

Rank(T ) + N ullilty(T ) = dim(R3 ) = 3.

Thus, Rank(T ) = 3 − 1 = 2

Example 2.6. Linear transformation T : P4 −→ P3 be defined by T (f (x)) =

d
(f (x)). Find the matrix representation, Kernel and Nullity of T .
dx

Solution- Consider the standard basis of P4 as X = {1, x, x2 , x3 , x4 } and the

standard basis of P3 as Y = {1, x, x2 , x3 }.

Now,

T (1) = 0 = 0 + 0x + 0x2 + 0x3

T (x) = 1 = 1 + 0x + 0x2 + 0x3

T (x2 ) = 2x = 0 + 2x + 0x2 + 0x3

T (x3 ) = 3x2 = 0 + 0x + 3x2 + 0x3

T (x4 ) = 4x3 = 0 + 0x + 0x2 + 4x3

Thus, the matrix representation of T is given by

13
  
 0 0 0 0 
 

 1 0 0 0 

 
M atrix (T ) = 
 
 0 2 0 0 

 

 0 0 3 0 

 
0 0 0 4

Since T (constant polynomial) = 0. This implies null space Ker(T ) = F

(Field) and N ullity = dim(F ) = 1.

Exercises

1. Let linear transformation T : R2 −→ R3 be defined by T (x, y) = (x −

y, x + y, x + 3y). Find matrix of T with respect to standard basis.

2. Let linear transformation T : P1 −→ P2 be defined by T (a + bx) =

R
(a + bx) dx. Find matrix of T with respect to standard basis, where

P1 = {a + bx|a, b ∈ R} and P2 = {a + bx + cx2 | a, b, c ∈ R}.

3. Determine matrix of the linear transformation T : R3 −→ R2 defined

by T (x, y, z) = (y + z, y − z) with respect to (i) standard basis (ii) basis

of R3 = {(0, 1, 1), (1, 0, 1), (1, 1, 0)} and basis of R2 = {(1, 1), (1, −1)}.

4. Find rank and nullity of linear transformation T : R2 −→ R3 defined

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

14
5. Find matrix, rank and nullity of linear transformation T : R3 −→ R3

defined by T (x, y, z) = (x + y, z, x − y).

6. Let T : R2 −→ P2 is defined by T (x, y) = x + yt + (x + y)t2 . Find the

matrix representation of T with respect to the standard bases.

15