MATHEMATICS II

MATH F112

Department of Mathematics
BITS Pilani K K Birla Goa Campus

Dr. Manoj Kumar Pandey

 Linear Transformations

Dr. Manoj Kumar Pandey

A function T that maps a vector space V into a vector space W:

T : V →
mapping
W, V , W : vector spaces
V: the domain of T W: the codomain of T
Image of v under T :
If v is a vector in V and w is a vector in W such that
T ( v) = w,
then w is called the image of v under T

The range of T :
The set of all images of vectors in V

6.3
The graphical representations of the domain, codomain, and range

6.4
Linear Transformations (LT)
Let V , W be vector spaces, a function
L :V → W
is called a linear transformation from V into W if the
following two properties are true

(1) L(u + v) = L(u) + L(v), ∀u, v ∈V

( 2) L (cu) = cL(u), ∀c ∈ R
In some special case if V=W then the LT is called a linear operator
on V.
L :V → V

6.5
Remark:

A linear transformation is said to be operation preserving

T (u + v ) = T (u) + T ( v ) T (cu) = cT (u)

Addition Addition Scalar Scalar

in V in W multiplication multiplication
in V in W

6.6
 Examples
Let
L: R → R
2 2

be defined as

( a ) L ( x, y ) = ( x − y , x + 2 y )
(b) L( x, y ) = ( x,− y )

Show that L is a LT.

4.7
Verifying a linear transformation L from R2 into R2

u = (u1 , u2 ), v = (v1 , v2 ) : vector in R 2 , c : any real number

(1) Vector addition :

u + v = (u1 , u2 ) + (v1 , v2 ) = (u1 + v1 , u2 + v2 )
L(u + v ) = L(u1 + v1 , u 2 + v2 )
= ((u1 + v1 ) − (u2 + v2 ), (u1 + v1 ) + 2(u2 + v2 ))
= ((u1 − u 2 ) + (v1 − v2 ), (u1 + 2u 2 ) + (v1 + 2v2 ))
= (u1 − u2 , u1 + 2u2 ) + (v1 − v2 , v1 + 2v2 )
= L(u) + L( v )

6.8
( 2) Scalar multiplication
cu = c(u1 , u2 ) = (cu1 , cu2 )
L(cu) = L(cu1 , cu2 ) = (cu1 − cu2 , cu1 + 2cu2 )
= c(u1 − u2 , u1 + 2u2 )
= cL(u)
Therefore, L is a linear transformation

6.9
Two uses of the term “linear”.

(1) f ( x) = x + 1 is called a linear function because its graph

is a line

(2) f ( x) = x + 1 is not a linear transformation from a vector

space R into R because it preserves neither vector
addition nor scalar multiplication

6.10
Zero transformation:
L :V → W L( v ) = 0, ∀v ∈ V
Identity transformation:
L :V → V L( v) = v, ∀v ∈ V

Projection transformation:

L : R3 → R3 L( x, y, z ) = ( x, y,0)

Reflection transformation:

L : R2 → R2 L ( x, y ) = ( x, − y )

6.11
Properties of linear transformations

L : V → W , u, v ∈ V

(1) L(0v ) = 0 w (L(cv) = cL(v) for c=0)

(2) L(− v ) = − L( v ) (L(cv) = cL(v) for c=-1)

(3) L(u − v ) = L(u) − L( v ) (L(u+(-v))=L(u)+L(-v) and property (2))

(4) If v = c1v1 + c2 v2 + L + cn vn ,
then L( v) = L(c1v1 + c2 v2 + L + cn vn )
= c1 L(v1 ) + c2 L(v2 ) + L + cn L(vn )
(Iteratively using L(u+v)=L(u)+L(v) and L(cv) = cL(v))

6.12
Problems

Which of the following are LT’s

(a) L : R → R , L( x, y, z ) = (0, 0)
3 2

(b) L : R 3 → R 3 , L( x, y, z ) = (1, 2,−1)

(c) L : R 3 → R 2 , L( x, y, z ) = ( x 2 + y, y − z )
(d ) L : P2 → P1 , L(ax 2 + bx + c) = 2ax + b + c
(e) L : P2 → P1 , L(ax + bx + c) = (a + 2) x + b − c
2

4.13
The transpose function is a linear transformation from Mm×n
into Mn ×m
T ( A) = AT (T : M m×n → M n×m )
Show that T is a linear transformation
Sol:
A, B ∈ M m×n
T ( A + B) = ( A + B)T = AT + BT = T ( A) + T ( B)
T (cA) = (cA)T = cAT = cT ( A)

Therefore, T (the transpose function) is a linear transformation

from Mm×n into Mn×m

6.14
Theorem

Let L : V → W be a LT of an n - dim. vector space V into a

vector space W. Also let
S = {v1, v2 , L vn }
be a basis for V . If u ∈ V , then L(u) is completely determined
by the set
{L(v1 ), L(v2 ), L ,L(vn )}.

4.15
Example

Let L : P1 → P2 be a LT for which

L(x + 1 ) = x 2 − 1 and L ( x − 1) = x 2 + x
then find the LT and what is L ( 7 x + 3 )

4.16
The Kernel and Range of a Linear Transformation
Kernel of a linear transformation L
Let L : V → W be a linear transformation. Then the set of
all vectors v in V that satisfy L( v ) = 0 is called the kernel
of L and is denoted by ker(L)
ker( L) = {v | L( v ) = 0, v ∈ V }

Range of a linear transformation L

Let L : V → W be a linear tra nsformatio n. Then the set of all
vectors w in W that are images of any vector s in V is called the
range of L and is denoted by range ( L )

range( L) = {L( v ) | ∀v ∈ V }
6.17
L

6.18
Important Results

Let L : V → W be a linear transformation then

(1) The kernel of L is a subspace of V.

(2) The range of L is a subspace of W.

6.19
 One-One LT

A LT L : V → W is said to be one to one if for all v1 , v2 in V

v1 ≠ v2 implies that L(v1 ) ≠ L (v2 ). An equivalent statement is that L
is one to one if for all v1 , v2 in V , L(v1 ) = L (v2 ) implies that v1 = v2 .

L : V → W is said to be onto if range( L ) = W .

4.20
Theorem:

A LT L : V → W is one to one if and only if ker(L) = {0v }

4.21
Example

Let L : R 3 → R 3 be defined by
L(x , y , z) = ( x − y , x + 2 y , z )
( a ) Show that L is a LT.
( b ) Find a basis for ker( L ).
( c ) Find a basis for range( L ).
( d ) Is L one one.
( e ) Is L onto.

4.22
Problem

Let L : R 3
→ R 3 be defined by
 x  1 0 1   x 
L  y  =  1 1 2   y 
 z   2 1 3   z 
( a ) Show that L is a LT.
( b ) Find a basis for ker( L ).
( c ) Find a basis for range( L ).
( d ) Is L one one.
( e ) Is L onto.

4.23
 Matrices for Linear Transformations
Two representations of the linear transformation T :R3→R3 :

(1) T ( x1 , x2 , x3 ) = (2 x1 + x2 − x3 , − x1 + 3 x2 − 2 x3 ,3 x2 + 4 x3 )

 2 1 −1  x1 
(2) T (x) = Ax =  −1 3 −2   x2 
 0 3 4   x3 
Three reasons for matrix representation of a linear transformation:

It is simpler to write

It is simpler to read

It is more easily adapted for computer use

6.24
Matrix of a LT

Let L :V→W : be a LT, let us consider the

ordered bases
S = {v 1 , v 2 , L v n } be a basis for V ,
T = {w 1 , w 2 , L w m } be a basis for W ,
L ( v 1 ) = a 11 w 1 + a 21 w 2 + L + a m 1 w m
L ( v 2 ) = a 12 w 1 + a 22 w 2 + L + a m 2 w m
M M M
L ( v n ) = a 1 n w 1 + a 2 n w 2 + L + a mn w m

4.25
 Matrix of a LT

The coordinate vectors of

L ( v1 ), L ( v 2 ), L L ( v n ) w.r.t basis T are :

 a11   a12   a1n 

a  a  a 
[ L(v1 )]T =  21 
, [ L(v2 )]T =  22 
, L, [ L(vn )]T =  2n 

 M   M   M 
     
am1   am 2  amn 

4.26
Matrix of a LT

Then the matrix of L w.r.t bases S and T is

 a 11 a 12 L a1n 
a a 22 L 
a2n 
L ST =  21

 M M L M 
 
 a m1 am2 L am2 

4.27
 Example

Let L : R 3 → R 2 be defined by
L(x , y , z) = ( x + y , y − z )
find the matrix of L w.r.t
S = {(1,0,1), (0,1,1), (1,1,1) } and T = {( 1, 2 ), ( − 1,1)}.

Use the matrix of L to compute the image of (2,3,1).

4.28
Let A be the matrix of L w.r.to bases S and T :
L
X L(X )

[ X ]S [ L ( X )] T = A [ X ] S
A

4.29
Quiz-1 5-marks

Let L : P1 → P2 be defined by
L(p ( x ) ) = xp ( x )
find the matrix of L w.r.t
S = {x + 1 ,x- 1}and T = {1, x , x }.
2

4.30
 Rank of a linear transformation T:V→W :
rank(T ) = the dimension of the range of T = dim(range(T ))

Nullity of a linear transformation T:V→W:

nullity(T ) = the dimension of the kernel of T = dim(ker(T ))

Note:
If T : R n → R m is a linear transformation given by T (x) = Ax, then
rank(T ) = dim(range(T )) = dim(CS ( A)) = rank( A)
nullity(T ) = dim(ker(T )) = dim( NS ( A)) = nullity( A)

6.31
Dimension Theorem (Rank Nullity Theorem)

Let T: V →W be a linear transformation from an n-dimensional

vector space V (i.e. the dim(domain of T) is n) into a vector
space W. Then

rank(T ) + n ullity (T ) = n
(i.e. dim(range of T ) + dim(kernel of T ) = dim(domain o f T ))

6.32
Note

If we change the order of the vectors in the

bases S and T, then the matrix of L may change.

Change of basis lead to a different matrix of L.

4.33
 Theorem

Let T : V → V be a linear operator, where V is an n-

dimensional vector space. Let
B = {v1, v2 ,Lvn } and B′ = {w1, w2 ,L wn } be a bases for V ,
and let P be the transition matrix from B' to B. If A
−1
is the matrix of T w.r.to B then AP is the matrix
P
of T w.r.to the basis B'.

P = [[w1]B [w2 ]B [w3]B L [wn ]B ]

4.34
Transition Matrices
T :V → V ( a linear transformation)
B = {v1 , v 2 ,L , v n } ( a basis of V )
B ' = {w1 , w 2 ,L , w n } (a basis of V )

A = [T ( v1 ) ]B [T ( v 2 ) ]B L [T ( v n ) ]B  ( matrix of T relative to B )

A ' = [T ( w1 ) ]B ' [T (w 2 ) ]B ' L [T (w n ) ]B '  (matrix of T relative to B ')

∴ [T ( v ) ]B = A [ v ]B , and [T ( v ) ]B ' = A′ [ v ]B '

P = [ w1 ]B [ w 2 ]B L [ w n ]B  ( transition matrix from B ' to B )

P −1 = [ v1 ]B ' [ v 2 ]B ' L [ v n ]B '  ( transition matrix from B to B ')

∴ [ v ]B = P [ v ]B ' , and [ v ]B ' = P −1 [ v ]B

6.35
Example

Let L : R 2
→ R 2 be defined by
L(x , y) = ( x + y , x − 2 y )
find the matrix of L w.r.t
S = {(1,0), (0,1) } and use it to find the
matrix of L w.r.t T = {( 1, − 1 ), ( 2 , 1)}.

4.36
Isomorphism
A linear transformation T : V → W that is one to one and onto is called
an isomorphism, and the vector spaces V and W are are said to
be isomorphic to each other

Theorem:

Every real n-dimensional vector space is isomorphic to Rn

6.37
Isomorphic vector spaces
The following vector spaces are isomorphic to each other

(a) R 4 = 4 - space

(b) M 4×1 = space of all 4 × 1 matrices

(c) M 2×2 = space of all 2 × 2 matrices

(d) P3 ( x ) = space of all polynomials of degree 3 or less

6.38
composition of T1:Rn→Rm with T2:Rm→Rp :
T ( v ) = T2 (T1 ( v )), v ∈ R n

This composition is denoted by T = T2 o T1

6.39
Inverse linear transformation:

If T1 : R n → R n and T2 : R n → R n are L.T. s.t. for every v in R n

T2 (T1 ( v )) = v and T1 (T2 ( v )) = v

Then T2 is called the inverse of T1 and T1 is said to be invertible

6.40
Finding the inverse of a linear transformation

The linear transformation T : R 3 → R 3 is defined by

T ( x1 , x2 , x3 ) = (2 x1 + 3 x2 + x3 , 3 x1 + 3 x2 + x3 , 2 x1 + 4 x2 + x3 )

Show that T is invertible, and find its inverse

Sol:
The standard matrix for T ( with respect to standard basis)
2 3 1
A = 3 3 1  2 3 1 1 0 0
[ A I 3 ] =  3 3 1 0 1 0
2 4 1  
 2 4 1 0 0 1 

6.41
  1 0 0 −1 1 0 

G.-J. E.
→  0 1 0 −1 0 1  =  I A−1 
 0 0 1 6 −2 −3

Therefore T is invertible and the standard matrix for T −1 is A−1

− 1 1 0
A−1 = − 1 0 1
 
 6 − 2 − 3
− 1 1 0   x1   − x1 + x2 
T −1 ( v ) = A−1 v = − 1 0 1   x2  =  − x1 + x3 
    
 6 − 2 − 3 x
 3   1 6 x − 2 x 2 − 3 x3
In other words,
T −1 ( x1 , x2 , x3 ) = (− x1 + x2 , − x1 + x3 , 6 x1 − 2 x2 − 3 x3 )

6.42