0% found this document useful (0 votes)
51 views44 pages

Linear Transformation

Uploaded by

sheldor1201
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views44 pages

Linear Transformation

Uploaded by

sheldor1201
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 44

Module - 3

Linear Transformation
Introduction to Linear Transformations
Transformation:
Function T that maps a vector space V into a vector space W:

T : V mapping
W , V ,W : vector space

V: the domain of T
W: the codomain of T
Linear Transformation (L.T.):

LetV , W are two vector spaces


T : V  W: V to W linear transformation

(1) T (u  v)  T (u)  T ( v), u, v V

(2) T (cu)  cT (u), c  R


Notes:

(1) 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

(2) A linear transformation T : V  V from a vector space into


itself is called a linear operator.
Ex 1:
Verifying a linear transformation T from R2 into R2
T (v1 , v2 )  (v1  v2 , v1  2v2 )

Proof:

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 )

T (u  v )  T (u1  v1 , u2  v2 )
 ((u1  v1 )  (u2  v2 ), (u1  v1 )  2(u2  v2 ))
 ((u1  u2 )  (v1  v2 ), (u1  2u2 )  (v1  2v2 ))
 (u1  u2 , u1  2u2 )  (v1  v2 , v1  2v2 )
 T (u)  T ( v )
2). Scalar Multiplication

cu = c(𝑢1 , 𝑢2 ) = (𝑐𝑢1, , 𝑐𝑢2 )


T (cu)  T (cu 1 , cu 2 )  (cu 1  cu 2 , cu 1  2cu 2 )
 c(u1  u 2 , u1  2u 2 )
 cT (u)

Therefore, T is a linear transformation.


==================================
Ex 2: Check whether the functions are linear transformations are not

(a) f ( x)  sin x
sin( x1  x2 )  sin( x1 )  sin( x2 )  f ( x)  sin x is not
sin( 2  3 )  sin( 2 )  sin( 3 ) linear transformatio n
(b) f ( x)  x 2
 f ( x)  x 2 is not linear
( x1  x2 ) 2  x12  x22
transformatio n
(1  2) 2  12  2 2

(c ) f ( x )  x  1
f ( x1  x2 )  x1  x2  1
f ( x1 )  f ( x2 )  ( x1  1)  ( x2  1)  x1  x2  2
f ( x1  x2 )  f ( x1 )  f ( x2 )  f ( x)  x  1 is not
================================== linear transformatio n
Image of v under T:

If v is in V and w is in W such that

T ( v)  w
Then w is called the image of v under T .

T
Range of T:
The set of all images of vectors in V.
R(T) = {w ∈ 𝑊 : T(v) = w for some v ∈ V}

Note: R(T) ⊆ W (Co-Domain)

Preimage of w:

The set of all v in V such that T(v) = w.


Ex 3: (A function from R2 into R2 )

T : R2  R2 v  (v1 , v2 )  R 2
T (v1 , v2 )  (v1  v2 , v1  2v2 )
(a) Find the image of v = (-1,2). (b) Find the preimage of w=(-1,11)
Sol:
(a) v  (1, 2)
 T ( v)  T (1, 2)  (1  2,  1  2(2))  (3, 3)
(b) T ( v)  w  (1, 11)
T (v1 , v2 )  (v1  v2 , v1  2v2 )  (1, 11)
 v1  v2  1
v1  2v2  11
 v1  3, v2  4 Thus {(3, 4)} is the preimage of w=(-1, 11).
Kernel or Null Space of a linear transformation 𝝓 or T:

Let  :V  W be a linear transformation

Then the set of all vectors v in V that satisfy  ( v)  0 is


called the kernel of T and is denoted by ker (ϕ).
ker( )  null space ( )  {v | ( v)  0, v  V }
Ex 4 : (The kernel of the zero and identity transformations)

(a) T(v)=0 (the zero transformation T : V  W )


ker(T )  V

(b) T(v)=v (the identity transformation T : V  V )


ker(T )  {0}
=============================================
Rank of a linear transformation T : V→W :

rank(T )  the dimension of the range of T

Nullity of a linear transformation T:V→W :

nullity(T )  the dimension of the kernel of T

Note:
Let T : R n  R m be the L.T. given by T (x)  Ax, then
rank(T )  rank( A)
nullity(T )  nullity( A)
=================================================
Remark(a):
Let V(F) be a finite dimensional vector space and
S={𝛼1 , 𝛼2 , 𝛼3 … . 𝛼𝑚 } be a linearly independent subset of V. Then
either S itself a basis of V (or) S can be extended to form a basis of
V.

===========================================

State and Prove the Rank – Nullity Theorem.


=======================================================
Problem:
Determine the range and null space of the linear transformation and
verify the rank nullity theorem
T: ℝ3 → ℝ4 by T(x, y, z) = (x-y+z, y-z, x, 2x-5y+5z)
Solution:
Given that T:ℝ3 → ℝ4 by T(x, y, z)=(x-y+z, y-z, x, 2x-5y+5z)
Clearly Dim (ℝ3 ) =3
Let 𝛼 ∈ ℝ3 ⇒ 𝛼 = (x, y, z) ∈ ℝ3
Suppose 𝛼 ∈ N (T)
T (𝛼) = 0
T(x, y, z) = 0
(x-y+z, y-z, x, 2x-5y+5z ) = (0, 0, 0, 0)
x - y + z =0
y - z = 0,
x = 0,
2x - 5y + 5z = 0
∴ x = 0, y = z =k(say)
N (T) = {(x, y, z) = (0, y, y) = (0, k, k) = k (0, 1, 1)∈ ℝ3 , k is
arbitrary}
∴ every element of N(T) can be spanned by a singleton set
{(0, 1, 1)}
∴ Basis of N (T) = {(0, 1, 1)}
∴ Dim(N (T)) = Nullity (T) = 1
To find the rank of T
Standard basis of ℝ3 is S = {(1, 0, 0), (0, 1, 0), (0, 0, 1)}
Now T (1, 0, 0) = ( 1 - 0 + 0 , 0 – 0 , 1, 2 - 0 + 0) = (1, 0,1, 2)
T (0, 1, 0) = ( 0 – 1 + 0, 1-0, 0 , 0-5+0) = (-1, 1,0,-5)
T (0, 0, 1) = (0 – 0 + 1, 0 - 1, 0 , 0-0+5) = (1, -1,0,5)

1 0 1 2
Let A = −1 1 0 −5
1 −1 0 5

1 0 1 2
~ 0 1 1 −3 R 2 → R 2 + R1 ,R 3 → R 3 − R1
0 −1 −1 3
1 0 1 2
~ 0 1 1 −3 R 3 → R 3 + R 2
0 0 0 0
Therefore rank of A is = 2 (number of non-zero row)
And basis of R (T) = {(1, 0, 1, 2), (0, 1, 1,-3)}
Rank (T) = 2
Therefore we know that the rank nullity theorem is, Dim (T) =
Rank (T) + Nullity (T)
Here Nullity (T) = 1, Rank (T) = 2 and Dim (ℝ3 ) = 3
Dim (T) = 3, Rank (T) + Nullity (T) = 3
Hence Dim (T) = Rank (T) + Nullity (T)
Therefore the given linear transformation is satisfied the Rank
nullity theorem.
===========================================
Invertibility:
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

Note:
If the transformation T is invertible, then the inverse is
unique and denoted by T–1 .
Remark: (Existence of an inverse transformation)

Let T : R n  R n be a L.T. with standard matrix A,


Then the following condition are equivalent .

(1) T is invertible.
(2) T is an isomorphism.
(3) A is invertible.
Note:
If T is invertible with standard matrix A, then the standard
matrix for T–1 is A–1 .
Ex 4: (Finding the inverse of a linear transformation)

The L.T. T: R 3  R 3 is defined by


T ( x1 , x2 , x3 )  (2 x1  3x2  x3 , 3x1  3x2  x3 , 2 x1  4 x2  x3 )

Show that T is invertible, and find its inverse.


Soln:
The standard matrix for T
2 3 1  2 x1  3x2  x3
A  3 3 1  3x1  3x2  x3
2 4 1  2 x1  4 x2  x3
 2 3 1 1 0 0
 A I 3    3 3 1 0 1 0
 
 2 4 1 0 0 1 
.
1 0 0  1 1 0
G 0 1 0  1 0
. J .E


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 3   1
x 6 x  2 x 2  3 x3
In other words,
T 1 ( x1 , x2 , x3 )  ( x1  x2 ,  x1  x3 , 6 x1  2 x2  3x3 )
=========================================================
Transition Matrices:
T :V  V ( a L.T.)
B  {v1 , v2 ,, vn } ( a basis of V )
B'  {w1 , w2 ,, wn } (a basis of V )
A  T (v1 )B , T (v2 )B ,, T (vn )B  ( matrix of T relative to B)
A'  T ( w1 )B ' , T ( w2 )B ' ,, T ( wn )B '  (matrix of T relative to B' )
P  w1 B , w2 B ,, wn B  ( transitio n matrix from B' to B )

P 1  v1 B ' , v2 B ' ,, vn B '  ( transitio n matrix from B to B' )

 v B  Pv B ' , v B '  P 1 v B

T ( v)B  AvB
T ( v)B '  A' vB '
The way to get from v B ' to T ( v)B ' :
P 1 AP[ v]B '  [T ( v)]B '  A'  P 1 AP
Ex : Finding a matrix for a linear transformation
Find the matrix A' for T: R 2  R 2
T ( x1 , x2 )  (2x1  2x2 ,  x1  3x2 )
reletive to the basis B'  {(1, 0), (1, 1)}
Sol:
(1). A'  T (1, 0)B ' T (1, 1)B ' 
3
T (1, 0)  (2,  1)  3(1, 0)  1(1, 1)  T (1, 0)B '   
 1
  2
T (1, 1)  (0, 2)  2(1, 0)  2(1, 1)  T (1, 1)B '   
2
 3  2
 A'  T (1, 0)B ' T (1, 1)B '   
 1 2 
(2).
standard matrix for T ( matrix of T relative to B  {(1, 0), (0, 1)})
 2  2
A  T (1, 0) T (0, 1)  
 1 3 
transition matrix from B' to B
1 1
P  (1, 0)B (1, 1)B    
0 1
transition matrix from B to B'
1 1  1
P  
 0 1 
matrix of T relative B'
1 1  1  2  2 1 1  3  2
A'  P AP         
0 1   1 3  0 1   1 2 
==========================================================

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy