Lecture 5 & 6

Chapter 6 (ELA)
Linear Transformations(Contd..)

6.1
Span of a Vector Space
Basis of Vector Space
Basis

Linearly
Spanning Bases Independent
Sets Sets

https://ltcconline.net/greenl/courses/203/Vectors/linIndSpan.htm
4.6 Rank of a Matrix and Systems of Linear Equations
(Starting at Page 195) [ELA Book]

 Here, three vector spaces are investigated

 Row space: the vector space spanned by the row vectors of a matrix A

 Column space: the vector space spanned by column vectors of a matrix A

 Nullspace: the vector space consisting of all solutions of the homogeneous

system of linear equations Ax = 0
 Consider matrix A with the size m×n

 row vectors: (with size 1×n) row vectors of A

 a11 a12  a1n   A1  (a11 a12 a1n )  A(1)
a  
a22  a2 n   A2   (a21 a22 a2n )  A(2)
A   21 
       
   
am1 am 2  amn   Am   (am1 am 2 amn )  A(m )
※ So, the row vectors are vectors in Rn
 column vectors: (with size m×1) column vectors of A
 a11 a12 a1n   a11   a12   a1n 
a a22 a2 n  a   a  a 
A  21
  A1 A 2 A n    21   22    2 n 
         
      
 am1 am 2 amn  am1  am 2  amn 
|| || ||
(1) (2) (n)
※ So, the column vectors are vectors in Rm A A A
 Let A be an m×n matrix:

 Row space of A is a subspace of Rn spanned by the row vectors

of A:
RS ( A)  { 1 A(1)   2 A( 2 )  ...   m A( m ) |  1 ,  2 ,...,  m  R}
(If A(1), A(2), …, A(m) are linearly independent, A(1), A(2), …, A(m) can form a basis for RS(A))

m
 Column space of A is a subspace of R spanned by the column
vectors of A:
CS ( A)  {1 A(1)   2 A(2)     n A( n ) 1 ,  2 ,   n  R}
(If A(1), A(2), …, A(n) are linearly independent, A(1), A(2), …, A(n) can form a basis for CS(A))

 Notes:
(1) The definitions of RS(A) and CS(A) satisfy automatically the
closure conditions of vector addition and scalar multiplication
(2) dim(RS(A)) (or dim(CS(A)) equals the number of linearly
independent row (or column) vectors of A
 Solve Example 3,4,5 in Pages 197-198 [ELA Book]

 In Ex 5, S = {(1, 2, 3), (0, 1, 2), (–2, 0, 1)} spans R3. Use these
vectors as row vectors to construct A
 1 2 3
A   0 1 2   RS ( A)  R 3
 2 0 1 
(Since (1, 2, 3), (0, 1, 2), (–2, 0, 1) are linearly independent, they can form a basis for RS(A))

 Since S1 = {(1, 2, 3), (0, 1, 2), (–2, 0, 1), (1, 0, 0)} also spans R3,
1 2 3
0 1 2 
A1    RS ( A1 )  R 3
 2 0 1
 
1 0 0
(Since (1, 2, 3), (0, 1, 2), (–2, 0, 1) (1, 0, 0) are not linearly independent, they cannot be a
basis for RS(A1))
 Theorem 6.4: The range of T is a subspace of W
The range of a linear transformation T : V  W is a subspace of W

 Corollary to Theorem 6.4:

Let T : R n  R m be the linear transformation given by T (x)  Ax.
The range of T is equal to the column space of A, i.e. range(T )  CS ( A)
 (1) According to the definition of the range of T(x) = Ax, we know that the
range of T consists of all vectors b satisfying Ax=b, which is equivalent to
find all vectors b such that the system Ax=b is consistent

(2) Ax=b can be rewritten as

 a11   a12   a1n 
a  a  a 
Ax  x1  21   x2  22    xn  2 n   b
     
     
 am1   am 2   amn 
Therefore, the system Ax=b is consistent iff we can find (x1, x2,…, xn)
such that b is a linear combination of the column vectors of A, i.e. b  CS ( A)
Thus, we can conclude that the range consists of all vectors b, which is a linear
combination of the column vectors of A or said b  CS ( A) . So, the column space
of the matrix A is the same as the range of T, i.e. range(T) = CS(A)
 Use our example to illustrate the corollary to Theorem 6.4:
※ For the orthogonal projection of any vector (x, y, z) onto the xy-
plane, i.e. T(x, y, z) = (x, y, 0)
※ According to the above analysis, we already knew that the range
of T is the xy-plane, i.e. range(T)={(x, y, 0)| x and y are real
numbers}
※ T can be defined by a matrix A as follows
1 0 0  1 0 0   x   x 
A  0 1 0  , such that 0 1 0   y    y 
    
0 0 0  0 0 0   z   0 
※ The column space of A is as follows, which is just the xy-plane

1  0 0   x1 
CS ( A)  x1 0   x2 1   x3 0    x2  , where x1 , x2  R
0  0  0   0 
 Notes:
(1) the standard basis for R3:
{i, j, k}, for i = (1, 0, 0), j = (0, 1, 0), k = (0, 0, 1)

(2) the standard basis for Rn :

{e1, e2, …, en}, for e1 = (1,0,…,0), e2 = (0,1,…,0),…, en = (0,0,…,1)
Ex: For R4, {(1,0,0,0), (0,1,0,0), (0,0,1,0), (0,0,0,1)}

※Express any vector in Rn as the linear combination of the vectors in the

standard basis: the coefficient for each vector in the standard basis is the
value of the corresponding component of the examined vector, e.g., (1, 3,
2) can be expressed as 1·(1, 0, 0) + 3·(0, 1, 0) + 2·(0, 0, 1)
 Ex 2 (page 162) : The nonstandard basis for R2
Show that S  {v1 ,v 2 }  {(1,1), (1, 1)} is a basis for R 2

 c1  c2  u1
(1) For any u  (u1 , u2 )  R , c1 v1  c2 v 2  u  
2

c1  c2  u2
Because the coefficient matrix of this system has a nonzero determinant, the
system has a unique solution for each u. Thus you can conclude that S spans R2

c1  c2  0
(2) For c1 v1  c2 v 2  0  
c1  c2  0
Because the coefficient matrix of this system has a nonzero determinant, you
know that the system has only the trivial solution. Thus you can conclude that S is
linearly independent

According to the above two arguments, we can conclude that S

is a (nonstandard) basis for R2
 Dimension:
The dimension of a vector space V is defined to be the
number of vectors in a basis for V
V: a vector space S: a basis for V

 dim(V) = #(S) (the number of vectors in a basis S)

 Finite dimensional:
A vector space V is finite dimensional if it has a basis
consisting of a finite number of elements

 Infinite dimensional:
If a vector space V is not finite dimensional, then it is called
infinite dimensional
 Ex 4: Finding a basis for the column space of a matrix
Find a basis for the column space of the matrix A
 1 3 1 3
 0 1 1 0

A   3 0 6  1
 
 3 4 2 1
 2 0  4  2
Sol. 1:
 Since CS(A)=RS(AT), to find a basis for the column space of
the matrix A is equivalent to find a basis for the row space of
the matrix AT
1 0 3 3 2  1 0 3 3 2  w1
3 1 0 4 0  0 1 9 5 6  w 2
AT   
G. E.
 B
1 1 6 2 4  0 0 1 1 1 w 3
   
3 0 1 1 2  0 0 0 0 0
 a basis for CS(A)
= a basis for RS(AT)
= {the nonzero row vectors of B}
= {w1, w2, w3}
 1   0   0 
   1   0 
 0      
  3,  9 ,  1   (a basis for the column space of A)
 3     
    5  1 
 2   6  1 
 Sol. 2: 1 3 1 3 1 3 1 3
0 1 1 0  0 1 1 0 
 
A   3 0 6 1 G. E.
 B  0 0 0 1
   
3 4 2 1  0 0 0 0
 2 0 4 2  0 0 0 0 
a1 a 2 a3 a 4 b1 b 2 b3 b 4

Leading 1’s  {b1, b2, b4} is a basis for CS(B) (not for CS(A))
{a1, a2, a4} is a basis for CS(A)

 Notes:
The bases for the column space derived from Sol. 1 and Sol. 2
are different. However, both these bases span the same CS(A),
which is a subspace of R5
 Ex 8 (page 202): Rank and nullity of a matrix
Let the column vectors of the matrix A be denoted by a1, a2,
a3, a4, and a5
 1 0 2 1 0
 0 1 3 1 3
A
 2 1 1 1 3
 
 0 3 9 0 12  45
a1 a2 a3 a4 a5
(a) Find the rank and nullity of A
(b) Find a subset of the column vectors of A that forms a basis for
the column space of A
Sol: Derive B to be the reduced row-echelon form of A.

 1 0 2 1 0 1 0 2 0 1
 0 1  3 1 3 0 1 3 0  4
A  B
 2  1 1  1 3 0 0 0 1  1
   
 0 3 9 0  12 0 0 0 0 0
a1 a2 a3 a4 a5 b1 b2 b3 b4 b5

(by Theorems 4.13 and 4.14, rank(A) = dim(RS(A)) =

(a) rank(A) = 3
dim(RS(B)) = the number of nonzero rows in B)

nuillity( A)  n  rank( A)  5  3  2 (by Thm. 4.17)

(b) Leading 1’s
 {b1 , b 2 , b 4} is a basis for CS ( B)
{a1 , a 2 , a 4 } is a basis for CS ( A)

 1  0  1
 0  1  1
a1   , a 2   , and a 4   ,
  2  1  1
 0  3  0
     
Back to Chapter 6 from ELA

 Ex 7 (page 313): 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
 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
 Null Space and Nullity

Great Resources to understand in detail:

First Watch : https://www.youtube.com/watch?v=EpcCNOe-oyE

Then : https://www.youtube.com/watch?v=abYAUqs_n6I
 Null Space

Nullity (A) = Dimension of Null space of A

Solve The examples here :

https://math.unm.edu/~loring/links/linear_s06/nullity.pdf
Summary: Row Space, Columns Space and Null Space

https://www.youtube.com/watch?v=J5u4fMEHojE
  Rank of a linear transformation T:V→W :
rank(T )  the dimension of the range of T  dim(range(T ))
According to the corollary to Thm. 6.4, 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 ))
According to the corollary to Thm. 6.3, 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
※ The dimension of the nullspace of A ( NS ( A)  {x | Ax  0}) is called the nullity
of A
 Theorem 6.5: 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 ))

※ You can image that the dim(domain of T)

should equals the dim(range of T)
originally
※ But some dimensions of the domain of T
is absorbed by the zero vector in W
※ So the dim(range of T) is smaller than
the dim(domain of T) by the number of
how many dimensions of the domain of
T are absorbed by the zero vector,
which is exactly the dim(kernel of T)
 Ex 8: Finding the rank and nullity of a linear transformation
Find the rank and nullity of the linear transformation T : R 3  R 3
define by
1 0  2
A  0 1 1 
0 0 0 
Sol:
rank(T )  rank( A)  2
nullity (T )  dim(domain of T )  rank(T )  3  2  1
※ The rank is determined by the number of leading 1’s, and the
nullity by the number of free variables (columns without leading
1’s)
 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}
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
 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

 Theorem 6.6: One-to-one linear transformation
Let T : V  W be a linear transformation. Then
T is one-to-one iff ker(T )  {0}
 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
 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 6.7: 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
 Theorem 6.8: 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
 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(Rn) = # of = (1) – (2) = = dim(ker(T)) dim(Rm) =
=n leading 1’s dim(ker(T)) =0 m

dim(domain rank(T)
T:Rn→Rm nullity(T) 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