Lecture # 16 PDF

Book: Introductory Linear Algebra (9thEdition)
by B. Kolman, David R Hill

• Chapter: 6
• Sections: 6.1
Book: Advanced Engineering Mathematics

(10th Edition) by Ervin Kreyszig
• Chapter: 7
• Sections: 7.9
Linear Transformation
• Let V and W be vector spaces. The function
𝑻: 𝑽 → 𝑾 is called a linear transformation of 𝑉 into
𝑊 if the following two properties are true for all 𝐮 and
𝐯 in 𝑉 and for any real scalar 𝑐.
1. 𝑇 𝐮 + 𝐯 = 𝑇 𝐮 + 𝑇 𝐯 .
2. 𝑇 𝑐𝐮 = 𝑐𝑇(𝐮)
• Equivalently we may write it as:
T ( u   v )   T (u)   T ( v ),  u, v  V and   ,   R.
• A linear transformation is said to be operation

preserving (the operations of addition and scalar
multiplication).
Matrix transformation is a linear transformation
Let 𝐴 be an 𝑚𝑛 matrix. A matrix transformation is a function
T : Rn 
 Rm defined by:
T ( v)  Av
We can easily show that every matrix transformation is a linear
transformation
Note: R n vector R m vector
 a11 a12  a1n   v1   a11v1  a12v2    a1n vn 
 a21 a22  a2 n  v2   a21v1  a22v2    a2 n vn 
Av       
    
    
am1 am 2  amn  vn  am1v1  am 2v2    amnvn 
T ( v)  Av
T : Rn 
 Rm
Example: (A linear transformation defined by a matrix)
3 0
   v1 
The function T : R2  R3 is defined as T ( v )  Av  2 1  
  v2 
  1  2 
(a) Find T ( v) , where v  (2,1)
(b) Show that T is a linear transformation form R 2 into R 3
Solution: R 2 vector R 3 vector
(a) v  (2,1)
3 0 6 
  2  
T ( v )  Av  2 1   3
   1  
  1  2  0 
T (2,1)  (6,3,0)
(b) T (u  v)  A(u  v)  Au  Av  T (u)  T (v) (vector addition)
T (cu)  A(cu)  c( Au)  cT (u) (scalar multiplication)

• Chapter: 6
• Sections: 6.2
The Kernel of a Linear Transformation
Let T : V  W be a linear transformation. Then the set of all
vectors v in V that satisfy T ( v)  0 is called the kernel of T and is
denoted by ker 𝑇 .
ker(T )  {v | T (v)  0, v V }
Example: (Finding the kernel of a linear transformation)

T ( A)  AT (T : M 32  M 23 )
Solution:
 0 0  
 
ker(T )  0 0 
 0 0  
 
Let T : R 3  R 3 be a Linear transformation defined by:
T ( x, y, z )  ( x, y, 0) [Projection onto the xy - plane.]
ker(T )  ?
Solution:
ker(T )  {( x, y, z ) | ( x, y, 0)  (0, 0, 0)}
ker(T ) consists of ( x, y, z ) that are solutions of the system:
x0
y0
z is a free variable, and x  y  0. Thus,
ker(T )  {(0, 0, z ) | z is a real number}
or we can write it as:
ker(T )  span{(0, 0,1)}.
Basis for kernel of 𝑇
Example: (The kernel of the zero and identity transformations)
(a) 𝑇(𝒗) = 𝟎 (the zero transformation) T :V  W
ker(T )  V
(b) 𝑇(𝒗) = 𝒗 (the identity transformation) T : V  V
ker(T )  {0}
 x1 
 1  1  2  
T (x)  Ax    x2 (T : R 3  R 2 )
  1 2 3 x 
 3
ker(T )  ?
Solution:
ker(T )  {( x1 , x2 , x3 ) | T ( x1 , x2 , x3 )  (0,0), x  ( x1, x2 , x3 )  R3}
T ( x1 , x2 , x3 )  (0,0)
 x1 
 1  1  2    0 
 1 2  x2   
3    0 
 x3 
 1 1 2 G. J .E 1 0 1
 1 2 3    
   0 1 1 
 x1 
1 0 1   0 
   x2    
0 1 1    0 
 x3 
 x1  x3  0 
   
 x2  x3  0 
 x1  x3  0, x2  x3  0
 x1  x3 , x2   x3 , x3  x3 .
Let x3  t , then x  (t , t , t )  t (1, 1,1).

 ker(T )  {t (1, 1,1) | t is a real number}.
Theorem: (The kernel is a subspace of V)
The kernel of a linear transformation T :V  W is a subspace of
the domain V.
Proof: T (0)  0
ker(T ) is a nonemptysubsetof V
Let u and v be vectors in the kernel of T . then
T (u  v)  T (u)  T (v)  0  0  0  u  v  ker(T )
T (cu)  cT (u)  c0  0  cu  ker(T )

Thus, ker(T ) is a subspace of V .
Note:
The kernel of T is sometimes called the nullspace of T.
The Range of a Linear Transformation
Let T :V  W be a Linear Transformation.
Then the set of all vectors w in W that are images of vectors
in V is called the range of T and is denoted by range(T ).
range(T )  {w | T ( v)  w, v  V , w  W }
Thus w is in range(T ) if there exists some vector v in V

such that T  v   w.
Example: (Finding the range of a linear transformation)
T ( x, y, z )  ( x, y, 0) [Projection onto the xy - plane.]
range(T )  ?
Solution:
range(T )  {w | T ( v)  w, v  V , w  W }
Thus,
range(T )  {( x, y, 0) | x, y are real numbers}
 {x(1, 0, 0)  y (0,1, 0) | x, y are real numbers}
or we can write it as:
range(T )  span{(1, 0, 0), (0,1, 0)}.
Basis for range of 𝑇

Theorem : (The range of T is a subspace of W)
The rangeof a linear transformation T : V  W is a subspace of W.
Proof:
T (0)  0
range(T ) is a nonemptysubsetof W
Let T (u) and T ( v) be vector in the range of T i.e.,
T (u)  w1 and T (u)  w 2 .
T (u  v)  T (u)  T ( v)  w1  w 2  range(T )
(u  V , v  V  u  v  V )
T (cu)  cT (u)  cw1  range(T )
(u  V  c u  V )
Therefore,range(T ) is W subspace.
Notes:
T : V  W is a L.T.
(1)Ker(T ) is subspaceof V
(2)range(T ) is subspaceof W
Example: (Finding the kernel and range of a linear transformation)
T ( x, y )  ( x, x  y, x  2 y ).
ker(T )  ? range(T )  ?
Solution:
ker(T )  {( x, y ) | ( x, x  y, x  2 y )  (0, 0, 0)}
ker(T ) consists of ( x, y ) that are solutions of the system:
x0
x y 0
x  2y  0
Thus,
ker(T )  {(0, 0)}.
Basis for kernel of 𝑇

Example: (Finding the kernel and range of a linear transformation)
T ( x, y )  ( x, x  y, x  2 y ).
ker(T )  ? range(T )  ?
Solution:
range(T )  {T ( v)  w | v  V , w  W }
Thus,
range(T )  {( x, x  y, x  2 y ) | x, y are real numbers}
 {x(1,1,1)  y (0,1, 2) | x, y  R}.
 span{(1,1,1), (0,1, 2)}.
Basis for range of 𝑇

Rank of a linear transformation 𝑇: 𝑉 → 𝑊
rank(T )  the dimension of the rangeof T
Nullity of a linear transformation 𝑇: 𝑉 → 𝑊
nullity(T )  the dimension of the kernelof 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)
One-to-one transformation (Injective)
A linear transformation T : V  W is called one-to-one if the
preimage of every w in the range consists of a single vector.
T is one - to - one iff for all u and v inV,
T (u)  T ( v) implies that u  v.
An equivalent statement is that T is one-to-one if:
u  v implies that T (u)  T ( v).
one-to-one not one-to-one

Onto transformation: (Surjective)
A linear transformation T : V  W is said to be onto if
every element in W has a preimage in V .
(T is onto when W is equal to the range of T, i.e., 𝑟𝑎𝑛𝑔𝑒(𝑇) = 𝑊)
Non-singular transformation: (Bijective or Isomorphism)

A linear transformation that is both one - to - one and onto
is known as a non - singular transformation.
(Non-singular transformations have an inverse.)
Practice Questions
Chapter: 6
Exercise: 6.1
Q # 6, Q # 9, Q # 12
Exercise: 6.2
Q # 1 to Q # 11

Lecture # 16 PDF

Uploaded by

Document Informationclick to expand document information

Copyright:

Available Formats

Lecture # 16 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lecture # 16 PDF

Uploaded by

Copyright:

Available Formats

Book: Introductory Linear Algebra (9thEdition)

by B. Kolman, David R Hill

Book: Advanced Engineering Mathematics

• A linear transformation is said to be operation

(b) T (u  v)  A(u  v)  Au  Av  T (u)  T (v) (vector addition)

T (cu)  A(cu)  c( Au)  cT (u) (scalar multiplication)

Example: (Finding the kernel of a linear transformation)

(b) 𝑇(𝒗) = 𝒗 (the identity transformation) T : V  V

Let x3  t , then x  (t , t , t )  t (1, 1,1).

T (cu)  cT (u)  c0  0  cu  ker(T )

Thus w is in range(T ) if there exists some vector v in V

Basis for range of 𝑇

Basis for kernel of 𝑇

Basis for range of 𝑇

rank(T )  the dimension of the rangeof T

Nullity of a linear transformation 𝑇: 𝑉 → 𝑊

nullity(T )  the dimension of the kernelof T

one-to-one not one-to-one

Non-singular transformation: (Bijective or Isomorphism)

You might also like