Chapter Two

Linear Transformation On -spaces

2.1: Linear Transformation On -spaces definitions and examples

2.2: Matrix of Linear Transformation On -spaces.

2.3: The effect of change of bases

2.4: The kernel and image of a Linear Transformation On -spaces.

2.5: Rank of Matrices

2.6: Solution of system of linear equations

1
2.1: Linear Transformation On -spaces definitions and examples

‫التحويالت الخطية على الفضاءات‬

Definition 2.1.1:

Let V and W be -spaces. A mapping T:V W is said to be linear transformation

if;

(1)T(u + v) = T(u) + T(v);

(2)T( u)= T(u);

For all u, v V and for all . [or T( u + v) = T(u) + T(v), For all u, v

V and for all ].

If T:V V then we say that T is a linear on V.

Example 2.1.2:

Let T: ( ) ( ) defined by:

T( , , )= ( + , )

Is T a linear transformation.

Solution:

Let u=( , , ), v=( , , ) ( ) and then

u + v=( , , )+( , , )=( + , + , + )

(1)T(u + v)=T( + , + , + )

=( + + + , + )

=( + + + , + )

=( + , )+( + , )

=T(u) + T(v)

2
(2) u= ( , , )=( , , ) then

T( u)=T( , , )=( + , )

= ( + , )= T(u)

Hence T is a linear transformation.

Example 2.1.3:

Let T: ( ) ( ) defined by:

T( , , )= ( + 1, )

Is T a linear transformation.

Solution:

Method 1:

Let u=(1, 0, 0), v=(2, 0, 0) ( ) then u + v=(3, 0, 0) since

T(u + v)=T(3, 0, 0)=(4, 0)

T(u)=T(1, 0, 0)=(2, 0)

T(v)=T(2, 0, 0)=(3, 0)

T(u + v)=T(3, 0, 0)=(4, 0) T(u) + T(v)=(5, 0)

Hence T is not a linear transformation.

Method 2:

Let u=(1, 0, 0) ( ) and =2 then u=(2, 0, 0) since

T( u)= T(2, 0, 0)=(3, 0)

T(u)=2(2, 0)=(4, 0)

T( u)= T(2, 0, 0)=(3, 0) (4, 0)= T(u)

Hence T is not a linear transformation.

Example 2.1.4:
3
Let M and N be fixed m m and n n matrices respectively. Define

T: ) by: T(A)=MAN, for all A ( )

Is T a linear transformation?

Solution:

Let A, B and

(1)T(A + B)=M(A + B)N= (MAN) + (MBN)=T(A) + T(B)

(2)T( A)=M( A)N= (MAN)= T(A)

Hence T is a linear transformation.

Example 2.1.5:

Let V be a -spaces then I:V V defined by: I(u)=u for all u V is a linear

Transformation called the identity linear transformation.

Solution:

I(u + v)= u + v =I(u) + I(v);

I( u)= αu=αI(u).

Example 2.1.6:

Let V and W be a -spaces then :V W defined by: (u)=0 for all u V is a

linear transformation called the zero linear transformation.

Solution:

(u + v)= 0=0 + 0 = (u) + (v);

( u)=0= α,0=α (u).

Remark 2.1.7:

If T:V W is linear transformation where V and W are a -spaces then

4
(1)T(O)=O

(2)T( + +…+ )= T( ) + T( ) +… + T( )

Where u= + +…+ V.

Lemma 2.1.8:

Let V and W be -spaces where (V: )=n. If B={ , ,…, } is a basis for V

And S={ , ,…, } is any set in W then there exists a unique linear

transformation T: V W defined by : T( )= for j=1,2,…,n.

2.2: Matrix of Linear Transformation On -spaces.

‫مصفوفة التحويل الخطي على فضاء المتجهات‬

Let V and W be -spaces.

Definition 2.2.1:

Let V be -spaces with (V: )=n and (W: )=m. Let ={ , ,…, } be a

basis for V and ={ , ,…, } be a basis for W. Let T: V W be a linear

transformation. Now for each j=1,2,…n, T( ) W and thus

T( )=

Where are uniquely determined. Let A=( ) ( ) then A is called

the matrix of T relative to the bases and and is denoted by A= .

Example 2.2.2:

Let T: ( ) ( ) be a linear transformation defined by:

T( , , )=( + , 2 + ). Find

(1)Find A= where ={ =(1, 0, 0), =(0, 1, 0), =(0, 0, 1)} and

5
 ={ =(1, 0), =(0, 1)}

(1)Find B= where ={ =(1, 0, 1), =(1, 1, 1), =(1, 0, 0)} and

={ =(0, 1), =(1, 0)}

Solution:

(1)T( )=T(1, 0, 0)=(1,2)=(1, 0) + 2(0, 1)=1 +2

T( )=T(0, 1, 0)=(1, 0)=(1, 0) + 0(0, 1)=1 +0

T( )=T(0, 0, 1)=( 1, 1)= (1, 0) + 1(0, 1)= 1 +1

Hence

A= =

(2)T( )=T(1, 0, 1)=(2,1)=(0, 1) + 2(1, 0)=1 +2

T( )=T(1, 1, 1)=(1, 3)=3(0, 1) + 1(1, 0)=3 +1

T( )=T(1, 0, 0)=(1, 2)= 2(0, 1) + 1(1, 0)= 2 +1

Hence

B= = .

2.3: The effect of change of bases

‫تأثير تغير األساسات‬

Let V and W be -spaces.

Definition 2.3.1:

Let V be -spaces with (V: )=n and (W: )=m. Let ={ , ,…, } be a

basis for V and ={ , ,…, } be a basis for W. Let T: V W be a linear

6
transformation. Let A=( )= ( ) be the matrix of T relative to

the bases and and is denoted by A= .

Now let ={ , , …, } be another basis for V and ={ , , …, } be

another basis for W and let B=( )= ( ) be the matrix of T

relative to the bases and .

By Lemma 2.1.8, there exists a linear transformation P:V V, let C=( )=

( ) be the matrix of P relative to the bases and .

Similarly, there exists a linear transformation Q:W W, let D=( )=

( ) be the matrix of P relative to the bases and .

V W

P C D Q

V W

T .

B=DA

We now look at this in the particular case when T:V V, in this case and

7
coincide this means that D=C. Hence

B=CA

Example 2.3.2:

Let ={u, v, w} be a basis for a -space V with (V: )=3 and T:V V be

A linear transformation where A= = . Find B== where

={u + v, u 2v + w, v –w}.

Solution:

u + v= u + v +0w

u 2v + w= u + ( 2)v + w

v –w=0u + v +( –1)w

Here

C= and =

B= =CA =

= =

How to find :

1. = = =[2 1] –[ 1]=1 +1=2 0

8
2. =

= =1, = =1, = =1 ;

= =1, = = 1, = = 1;

= =1, = = 1, = = 3;

3.CofC=

4.AdjC= =

5. = . AdjC=

2.4: The kernel and image of a Linear Transformation On -spaces.

‫نواة وصور التحويل الخطي على فضاء المتجهات‬

Definition 2.4.1:

Let V and W be -spaces and T:V W be a linear transformation we define:

kerT={u V; T(u)=O}as a subset of V and imT={w= T(u): u V} as a subset of

W called the kernel and image of T respectively.

Lemma 2.4.2:

If V and W are -spaces and T:V W is a linear transformation then

9
(1)kerT is a subspace of V.

(2)imT is a subspace of W.

Proof (1):

(1)kerT since O kerT [T(O)=O];

(2) Let u, v kerT [T(u)=O and T(v)=O] since

T(u + v)=T(u) + T(v)=O +O=O, so (u +v) kerT;

(3) Let u kerT [T(u)=O ] and , since

T( u)= T(u)= .O=O, so u kerT.

Hence kerT is a subspace of V.

Proof (2):

(1)imT since O=T(O) imT;

(2)Let , imT then there exists , V such that =T( ) and =T( ).

Since ( + )= T( ) + T( )= T( + ) and ( + ) V, ( + ) imT;

(3) Let imT then there exists V such that =T( ) and , since

= T( )=T( ) where V.

Hence imT is a subspace of W.

Definition 2.4.3:

Let V and W be -spaces and T:V W be a linear transformation then the

nullity of T is the dimension of kerT that is nullity T=(kerT: ) also the rank

of T is the dimension of image of T that is rankT=(imT: ).

Theorem 2.4.5:

Let V and W be -spaces and T:V W be a linear transformation then

10
nullity T + rank T= (V: ).

Example 2.4.6:

Let T: ( ) ( ) be a linear transformation defined by:

T( , , )= ( +2 ,2 + , 2 +2 )

Find a basis for imT and kerT.

Solution:

First we find a basis for imT

T( , , )= ( +2 ,2 + , 2 +2 )

= (1, 2, 1) + (2, 0, 2) + ( 1, 1, 2)

The set ={ =(1, 2, 1) , =(2, 0, 2) , =( 1, 1, 2)} generates imT. Since

= 2 +2 = 2[4 1] +2[1 + 2]= 6 +6=0

Therefore is linearly dependent over .

Now we test S={(1, 2, 1) ,(2, 0, 2)}

Let , such that + =O

(1, 2, 1)+ (2, 0, 2)=(0, 0, 0)

( +2 ,2 , 2 ) =(0, 0, 0)

+ 2 =0

2 =0

2 =0

Thus =0, =0 so S is linearly independent over .

Hence S is a basis for imT and rankT=2.

11
Now bt Theorem 2. 4.5, we have nullity T + rank T=( ( ): )=3 or

nullity T=3 –rankT=3 2=1.

[if the example want to find rankT and nullity T this is the end of the solution]

To find a basis for kerT let ( , , ) kerT so T( , , )=O=(0, 0, 0)

( +2 ,2 + , 2 +2 )=(0, 0, 0)

+2 =0

2 +0 + =0

2 +2 =0

[ + and + ]

[ + ]

[ and + ]

= , = . Then

( , , )=( , , )= ( , , 1)

B={( , , 1)} is a basis for kerT.

2.5: Rank of Matrices

12
 ‫رتبة المصفوفات‬

Definition 2.5.1:

If A ( ) then the column rank of A is the maximum number of linearly

independent columns vectors in A.

Example 2.5.2:

Find the column rank of A where A=

Solution:

[ + and + ]

[ + and + , ]

[ + ] since

= +0

Thus { , } is linearly independent over .

13
Hence column rank A=2.

Definition 2.5.3:

If A ( ) then the row rank of A is the maximum number of linearly

independent rows vectors in A.

Example 2.5.4:

Find the r0w rank of A where A=

Solution:

Since { , } is linearly independent over .

Hence row rank A=2.

Notice column rank A= row rank A=2.

Theorem 2.5.5:

Row equivalent matrices have the same column rank

Theorem 2.5.6:

If ( ) then rank A= column rank A= row rank A.

2.6: Solution of system of linear equations

‫حل منظومة من المعادالت الخطية‬

(1)Homogeneous system:

The general form of homogeneous system of linear equations is :

14
 + + …+ =0

+ + …+ =0

……………..

+ + …+ =0

OR in matrix form

=0, or AX=0 where

A= and X=

Theorem 2.6.1:

The solution of the homogeneous system of linear equations AX=0 form

a subspace of ( ) of dimension equal to (n rank A). A nonzero solution

exists if and only if n rank A. If n = rank A then the zero solution is the only

solution,

Example 2.6.2:

Do the following homogeneous system of linear equations have a nonzero

Solution?.

+2 + =0

2 + + =0

+ +2 =0

Solution:

15
 =0

Here n=4 and A= , since rank A 3 n=4.

Hence the system has non zero solution by theorem 2.6.1.

Example 2.6.3:

Show that the following system has only the zero solution.

+2 =0

2 + =0

3 +2 + =0

Solution:

=0

Here n=3 and A=

[ + and + ]

[ and ]

[ + ] , rank A=3.

16
Since n=3=rank A, the system has only the zero solution by theorem 2.6.1.

(2) Non-homogeneous system:

The general form of nonhomogeneous system of linear equations is :

+ + …+ =

+ + …+ =

……………..

+ + …+ =

OR in matrix form

= , or AX=0 where

A= , X= and B=

Theorem 2.6.4:

The solution of the nonhomogeneous system of linear equations AX=B exists

If and only if rank (A B)= rank A where

(A B)= .

Example 2.6.5:

Solve, if the solution exists of the nonhomogeneous system of linear equations

+ 2 + +3 =1

17
2 +2 +2 +6 =2

3 +2 4 3 9 =3

Solution:

(A B)= [ + and

+ ]

[ and

+ , + ]

[ and + ]

Rank (A B)=3 and rank A=3. Since rank (A B)=3 = rank A so by Theorem 2.6.4

The system has solution.

=1

2 =0 =2

+3 =0 = 3

=1, =2, =1, = 3, =1.

18
Example 2.6.5:

Solve, if the solution exists of the nonhomogeneous system of linear equations

+ +2 + =5

2 +3 2 =2

4 +5 +3 =7

Solution:

(A B)= [ + and

+ ]

[ + ]

[ + ]

Rank (A B)=3 and rank A=2. Since rank (A B) rank A so by Theorem 2.6.4

The system does not has solution.

19