Linear Transformations

4.1
 Let T : R 3bea Rlinear
3
transformation defined by

 1 2 3   x1 
  
T ( x)  A.x  5 4 6 . x2 
 2 1 2  x 
  3
 1 2 3 1 1  1 2 3 0  2 1 2 3  0  3
              
 5 4 6 . 0    5   5 4 6 . 1    4   5 4 6 . 0    6 
 2 1 2  0  2  2 1 2 0  1  2 1 2 1  2
              

 1  0  0 1  2  3

            
T (a1 , a2 , a3 )  T  a1  0   a2  1   a3  0    a1  5   a2  4   a3  6 
  0  0 1  2 1  2
            

4.2

Ex 7: Finding a basis for the range of a linear
transformation
Let T : R 5  R 4 be defined by T ( x)  Ax, where x is R 5 and
 1 2 0 1 1
2 1 3 1 0
A 
 1 0 2 0 1 
 
0 0 0 2 8
Find a basis for the range of T
Sol:

Since range(T) = CS(A), finding a basis for the range of T is

equivalent to fining a basis for the column space of A

4.3
 1 2 0
1 1 1 0 2
0 1
2 1 3 1 0  G.-J. E.  0 1 1 0 2 
A  B
 1 0 2 0 1  0 0 0 1 4
   
0 0 0 2 8 0 0 0 0 0
c1 c2 c3 c4 c5 w1 w2 w3 w4 w5

 w1 , w2 , and w4 are indepdnent, so w1 , w2 , w4  can

form a basis for CS ( B)
 Row operations will not affect the dependency among columns
 c1 , c2 , and c4 are indepdnent, and thus c1 , c2 , c4  is
a basis for CS ( A)
That is, (1, 2,  1, 0), (2, 1, 0, 0), (1, 1, 0, 2) is a basis
for the range of T
4.4
 
Rank of a linear transformation T:V→W :
rank(T )  the dimension of the range of T  dim(range(T ))
Here, range(T) = CS(A), so dim(range(T)) = dim(CS(A))


Nullity of a linear transformation T:V→W :
nullity(T )  the dimension of the kernel of T  dim(ker(T ))
Here, ker(T) = NS(A), so dim(ker(T)) = dim(NS(A))


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)
※ The dimension of the row (or column) space of a matrix A is called the rank of
A NS ( A)  {x | Ax  0}
※ The dimension of the nullspace of A ( ) is called the nullity
4.5

Theorem: Sum of rank and nullity
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 )  nullity(T )  n
(i.e. dim(range of T )  dim(kernel of T )  dim(domain of T ))


Ex 8: Finding the rank and nullity of a linear transformation
Find the rank and nullity of the linear transformatio n T : R 3  R 3
define by
1 0  2 
A  0 1 1 
0 0 0 
4.6
Sol:
rank(T )  rank( A)  2
nullity(T )  dim(domain of T )  rank(T )  3  2  1

Ex 9: Finding the rank and nullity of a linear
transformation
Let T : R 5  R 7 be a linear transformation
(a) Find the dimension of the kernel of T if the dimension
of the range of T is 2
(b) Find the rank of T if the nullity of T is 4
(c) Find the rank of T if ker(T )  {0}

4.7
Sol:
(a) dim(domain of T )  n  5
dim(kernel of T )  n  dim(range of T )  5  2  3

(b) rank(T )  n  nullity(T )  5  4  1

(c) rank(T )  n  nullity(T )  5  0  5

4.8

One-to-one :
A function T : V  W is called one-to-one if the preimage of
every w in the range consists of a single vector. This is equivalent
to saying that T is one-to-one iff for all u and v in V , T (u)  T ( v)
implies that u  v

one-to-one not one-to-one

4.9

Theorem: One-to-one linear transformation
Let T : V  W be a linear transformation. Then
T is one-to-one iff ker(T )  {0}

Pf:
() Suppose T is one-to-one
Then T ( v)  0 can have only one solution : v  0
i.e. ker(T )  {0}
() Suppose ker(T )={0} and T (u)=T (v)
T (u  v )  T (u)  T ( v)  0
 u  v  ker(T )  u  v  0  u  v
 T is one-to-one (because T (u)  T ( v ) implies that u  v)
4.10

Ex 10: One-to-one and not one-to-one linear
transformation
(a) The linear transformation T : M mn  M nm given by T ( A)  AT
is one-to-one
because its kernel consists of only the m×n zero matrix

(b) The zero transformation T : R3  R3 is not one-to-one

because its kernel is all of R3

4.11

Onto:
A function T : V  W is said to be onto if every element
in W has a preimage in V
(T is onto W when W is equal to the range of T)

Theorem: Onto linear transformations

Let T: V → W be a linear transformation, where W is finite

dimensional. Then T is onto if and only if the rank of T is equal
to the dimension of W
rank(T )  dim(range of T )  dim(W )
The definition of The definition
the rank of a linear of onto linear
transformation transformations
4.12

Theorem : One-to-one and onto linear transformations
Let T : V  W be a linear transformation with vector space V and W
both of dimension n. Then T is one-to-one if and only if it is onto
Pf:
() If T is one-to-one, then ker(T )  {0} and dim(ker(T ))  0
dim(range(T ))  n  dim(ker(T ))  n  dim(W )
According to the definition of dimension
Consequently, T is onto that if a vector space V consists of the
zero vector alone, the dimension of V is
defined as zero

() If T is onto, then dim(range of T )  dim(W )  n

dim(ker(T ))  n  dim(range of T )  n  n  0  ker(T )  {0}
Therefore, T is one-to-one
4.13

Ex 11:
The linear transformation T : R n  R m is given by T (x)  Ax. Find the nullity
and rank of T and determine whether T is one-to-one, onto, or neither
1 2 0  1 2  1 2 0 
1 2 0 
(a) A  0 1 1  (b) A  0 1  (c) A    (d) A  0 1 1 
 0 0 1  0 0  0 1 1 0 0 0 
= dim(range
Sol: of T) If nullity(T) If rank(T) =
= dim(R ) =
n = # of = (1) – (2) = = dim(Rm) = m
n leading 1’s dim(ker(T)) dim(ker(T))
=0
dim(domain rank(T) nullity(T
T:Rn→Rm 1-1 onto
of T) (1) (2) )
(a) T:R3→R3 3 3 0 Yes Yes
(b) T:R2→R3 2 2 0 Yes No
(c) T:R3→R2 3 2 1 No Yes
(d) T:R3→R3 3 2 1 No No 6.14
4.14
Thank
You
4.15