Arab Open University

Faculty of Computer Studies

Prof. Mohamed Sayed

MT132 - Linear Algebra

Linear Transformation, Null
Spaces and Ranges
 Linear Transformations
 Definition:
Let V and W be vector spaces. The mapping
T :V  W
is called linear transformation if for every X , Y in V
and c in R ,
 T ( X  Y )  T ( X )  T (Y )
 T (cX )  cT ( X )

𝑥
𝑥
The mapping 𝑇: 𝐑2 ⟶ 𝐑3 defined by 𝑇 𝑦 = 𝑦 is a linear transformation.
𝑥+𝑦
2 −1 1 2
2 −1 1 2
e.g. 𝑇 = 5 , 𝑇 = 3 , 𝑇 = 8 , 𝑇 10 = 10 5
5 3 8 5
7 2 9 7
Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra
 Linear Transformations
 Note:
 The mapping T : V  W is a linear tra nsformatio n if
T (cX  Y )  cT ( X )  T (Y )
for every X , Y  V and c  R.
 If T : V  W is a linear tra nsformatio n, then
 T (OV )  OW

 T (rX  sY )  rT ( X )  sT (Y )

o A linear transformation 𝑇: 𝐕 ⟶ 𝐖 is called a matrix transformation.

𝑥 1 0 𝑥
𝑥
e.g. 𝑇: 𝐑2 ⟶ 𝐑3 defined by 𝑇 𝑦 = 𝑦 = 0 1 𝑦.
𝑥+𝑦 1 1
Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra
 Linear Transformations
 Example 1:   x 
   x 
Show that the mapping T : R  R defined by T  y   
3 2

  
z  y z 
 
is a linear tra nsformatio n.

 x1   x2 
For every vectors  y1  and  y2  in R 3 , and c  R,
   
 z1   z2 

  x1   x2     x1  x2     x1     x2  
        x1  x2   x1   x2       y 
 T  y1  y2   T  y1  y2       y  z    y  z   T   y1    T 
          2
z  z   z  z   1 y y 2 z1 z 2  1 1  2 2 z    z2  
  1  2   1 2   1 
  x1    cx1     x1  
       cx1   1   
 T  c  y1 
x
  T   1  
cy    c y  z   cT   y1  
  
 z    cz    1cy cz1  1 1 z 
  1   1  1

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 Linear Transformations
 Example 2:
  x  x  y
  
Show that the mapping T : R  R defined by T  y   y  z 
3 3
   
  z    z 1
   
is not a linear tra nsformatio n.

  0   0  0 
     
It is clear that T  0   0  0 , T is not a linear tra nsformatio n.
     
 0  1 0
     

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 Linear Transformations
 Example 3:
Let T : R 2  R 2 be a linear tra nsformatio n such that

 1  1  0    2    3 
T        and T       . Find T    .
   
 0    2   1  3    2 

3 1 0
The vector can be written as a linear Combination of and as
−2 0 1
3 1 0
=3 − 2 . Now
−2 0 1
3 1 0 1 0 1 2
𝑇 =𝑇 3 −2 = 3𝑇 − 2𝑇 =3 −2
−2 0 1 0 1 2 3
−1
= .
0

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 Linear Transformations
 Example 4:
1 2
Let A    and define the mapping T : R 2
 R 2
by T ( X )  AX ,
3 0
 1  
for every X  R . Show that T is a linear tra nsformatio n. Find T    .
2

  4 

For every X , Y  R 2 and c  R,

 T ( X  Y )  A( X  Y )  AX  AY  T ( X )  T (Y ),
 T (cX )  A(cX )  c( AX )  cT ( X ).

 1  1 2 1 9

T            .
 4  3 0 4 3

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 Linear Transformations
 Example 5:
 x  
Determine whether t he mapping T : R  R by T      x 2  y 2
2

  y 
is a linear tra nsformatio n.

 x    cx    x  
T  c     T      c x  c y  c ( x  y )  cT    ,
2 2 2 2 2 2 2

  y   cy     y 
T is not linear tra nsformatio n.

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 Linear Transformations
 Example 6:
  x    y 
Define the linear tra nsformatio n T : R  R by T       ,
2 2

  y    x 
find a 2  2 matrix A such that T ( X )  AX for every X in R 2 .

  1   0 a b  1 a 
T              
a b    0    1  c d  0   c 
Let A    .
c d    0    1 a b  0   b 
T              
  1   0  c d  1 d 

 0  1
 a  0 ,b  1,c  1,d  0  A    .
 1 0 

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 The Null Space and Range
 Definition
Let V and W be vector spaces. For a linear tra nsformatio n T : V  W,
 The null space of T , N(T ), is defined by
N(T )  X  V : T ( X )  O W .
 The rang of T , R(T ), is defined by
R(T )  T ( X ) : X  V.

T T
V W V W

O
N(T )
R(T )

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 The Null Space and Range
 Example 1:  x  
    x  z 
Define the linear tra nsformatio n T : R  R by T   y    
3 2
 ,
 z    y  z
 
find the null space N(T ).

  x 
    0  x  z  0  x  z  0
T y          z  t , x  t , y  t , t  R
  0  y  z  0  y  z  0
z 
 
The null space of T is the solution of the above homogenuous

 t  
 
linear system.Thus, N(T )    t  t  R .
 
 t  
  
Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra
 The Null Space and Range
 Example 2:  x  
    x  z 
Define the linear tra nsformatio n T : R  R by T   y    
3 2
 ,
 z    y  z
 
find the rang of T , R(T ).

The rang of T is the following subspaceof R 2 :

  1   0   0 

             1 0  1 
R(T )  SpanT  0 , T  1 , T  0   Span ,  ,   
     
  0   0   1  0 1  1 
            
1 0   1 0    x  
 Span ,      x    y   : x, y  R      : x, y  R   R 2 .
0 1   0 1   y  

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 The Null Space and Range
 Example 3:
  x   x 
 
Let T : R 3  R 3 be linear tra nsformatio n defined by T   y     x  y .
   
  z   x  y  z
   
Find N(T ) and R(T ).

  x   0   x  0 
    
T  y   0  x  y   0  x  y  z  0  N(T )  O.
       
  z   0   x  y  z  0 
       

  1   0   0  1 0 0 

              
R(T )  SpanT  0 , T  1 , T  0   Span1, 1, 0   R 3.
        

 0            1 1 1 
       0    1         

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra

 Conclusion

Let T be linear transformation from Rn to Rm.

• The null space N(T) is a subspace of Rn.
• The range R(T) is a subspace of Rm.
• dim(N(T)) + dim(R(T)) = n.

Let A be an m × n matrix
• The rank of A is the number of leading 1s in the reduced row echelon
form of A.
• rank(A) + nullity(A) = n.
• An n × n matrix A is nonsingular if and only if rank(A) = n and
nullity(A) = 0.

Arab Open University – Faculty of Computer Studies MT132 - Linear Algebra