Linear Transformation
Linear Transformation
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.):
Proof:
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
(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:
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}
Preimage of w:
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:
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.
===========================================
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:
Note:
If the transformation T is invertible, then the inverse is
unique and denoted by T–1 .
Remark: (Existence of an inverse transformation)
(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)
1 I
A1
0 0 1 6 2 3
1 1 0
A1 1 0 1
6 2 3
1 1 0 x1 x1 x2
T 1 ( v) A1 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' )
T ( v)B AvB
T ( v)B ' A' vB '
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
==========================================================