lecture7, linear transformation

36
Linear Transformations 1.Introduction to Linear Transformations 2.The Kernel and Range of a Linear Transformation 3.Matrices for Linear Transformations

Upload: hesham-mustafa

Post on 17-Aug-2015

254 views

Category:

Documents


1 download

DESCRIPTION

Lecture 7

TRANSCRIPT

Linear Transformations 1.Introduction to Linear Transformations 2.The Kernel and Range of a Linear Transformation 3.Matrices for Linear Transformations Rank of a linear transformation T:VW : rank( ) the dimension of the range ofdim(range( )) T T T = = Nullity of a linear transformation T:VW: nullity( ) the dimension of the kernel ofdim(ker( )) T T T = = Note: If:is a linear transformation given by( ) , then dim(range( )) dim( ( )) rank( ) rank( )nulldim(ker ity( ) nullity ( )) dim( ( ) ( ) )n mT R R T AT CSAT NS T AT AA== == == =x x 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 ()is called the nullity of A ( ) { | 0} NSA A = = x xker(T) = NS(A), so dim(ker(T)) = dim(NS(A)) range(T) = CS(A), so dim(range(T)) = dim(CS(A)) Theorem 5: Sum of rank and nullity (i.e.dim(range of) dim(kernel ofrank( ))ndim(domain oullityf ))) (TTT TT n+ =+ =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 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 ofthe domain of T are absorbed by the zero vector, which is exactly the dim(kernel of T) Pf: r A A n m T = ) rank( assume and , matrixanbyd represente be Let (1) rank( ) dim(range of) dim(column space of) rank( ) T T A A r = = = =n r n r T T = + = + ) ( ) ( nullity ) ( rank(2) nullity( ) dim(kernel of) dim(null space of) T T A n r = = = Here we only consider that T is represented by an mn matrix A. In the next section, we will prove that any linear transformation from an n-dimensional space to an m-dimensional space can be represented by mn matrixaccording to Thm. 4.17 where rank(A) + nullity(A) = n Ex 8: Finding the rank and nullity of a linear transformation ((((

=0 0 01 1 02 0 1

by define: nnsformatio linear tra the of nullityand rankthe Find3 3AR R TSol: 1 2 3 ) ( rank ) of domaindim( ) ( nullity2 ) ( rank ) ( rank= = == =T T TA T The rank is determined by the number of leading 1s, and the nullity by the number of free variables (columns without leading 1s) Ex 9: Finding the rank and nullity of a linear transformation 5 7Let:be a linear transformation(a) Find the dimension of the kernel of if the dimension of the range of is 2(b) Find the rank of if the nullity of is 4(c) Find the rank ofifkeT R RTTT TTr( ) { } T =0Sol: (a)dim(domain of) 5 dim(kernel of) dim(range of) 5 2 3T nT n T= == = =(b) rank( ) nullity( ) 5 4 1 T n T = = =(c) rank( ) nullity( ) 5 0 5 T n T = = =A function:is called one-to-one if the preimage ofevery in the range consists of a single vector. This is equivalentto saying that is one-to-one iff for all and in, ( ) ( ) implies T V WT V T T=wu v u vthat= u v One-to-one: one-to-onenot one-to-one One to one Not onto Onto Not one to one One to one Onto (one to one correspondance) Theorem 6: One-to-one linear transformation Let:be a linear transformation. Then is one-to-one iff ker( ) { }T V WT T=0Pf: ( ) Suppose is one-to-one T Then( )can have only one solution:T = = v 0 v 0} { ) ker( i.e. 0 = T( ) Suppose ker( )={ } and( )= ( ) T T T : 0 u v0 v u v u = = ) ( ) ( ) ( T T Tker( ) T e = = u v u v 0 u v is one-to-one (because( ) ( ) implies that) T T T = = u v u vT is a linear transformation, see Property 3 in Thm. 1 Due to the fact that T(0) = 0 Ex 10: One-to-one and not one-to-one linear transformation (a) The linear transformation:given by( )is one-to-oneTmn nmT M M TA A =3 3(b) The zero transformation:is not one-to-one T R R because its kernel consists of only the mn zero matrix because its kernel is all of R3 inpreimage a has in elementeveryif onto be to said is : functionA V WW V T Onto: (T is onto W when W is equal to the range of T) Theorem 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 ) dim( ) of range dim( ) ( rank W T T = =The definition of the rank of a linear transformation The definition of onto linear transformations Theorem 8: One-to-one and onto linear transformations Let:be a linear transformation with vector space and both of dimension. Then is one-to-one if and only if it is ontoT V W V Wn TPf: ( ) If is one-to-one, then ker( ) { } and dim(ker( )) 0 T T T = = 0) dim( )) dim(ker( )) ( range dim(5 Thm.W n T n T = = =Consequently, is onto T} { ) ker( 0 ) of range dim( )) dim(ker(5 Thm.0 = = = = T n n T n TTherefore, is one-to-one Tn W T T = = : ) dim( ) of range dim( thenonto, is If ) (According to the definition of dimension that if a vector space V consists of the zero vector alone, the dimension of V is defined as zero Ex 11: The linear transformation:is given by( ) . Find the nullity and rank of and determine whether is one-to-one, onto, or neithern mT R R T AT T = x x1 2 0(a)0 1 10 0 1A ( (=( ( 1 2(b)0 10 0A ( (=( ( 1 2 0(c) 0 1 1A (=( 1 2 0(d)0 1 10 0 0A ( (=( ( Sol: T:RnRm dim(domain of T) (1) rank(T) (2)nullity(T)1-1onto (a) T:R3R3330YesYes (b) T:R2R3 220YesNo (c) T:R3R2 321NoYes (d) T:R3R3 321NoNo = dim(range of T) = # of leading 1s = (1) (2) = dim(ker(T)) If nullity(T) = dim(ker(T)) = 0 If rank(T) = dim(Rm) = m = dim(Rn) = n Isomorphism : other eachto isomorphic be to said areandthen, to from m isomorphis anexists there such that spaces vectorare and if Moreover, m. isomorphis ancalled isonto and one to one is that: nnsformatio linear tra A W V W VW VW V T Theorem 9: Isomorphic spaces and dimension Pf: n V W V dimensionhas where , to isomorphic is thatAssume ) (onto and one to one is that: L.T. a exists There W V T is one-to-one Tn n T T TT= = = = 0 )) dim(ker( ) of domaindim( ) of range dim(0 )) dim(ker(Two finite-dimensional vector space V and W are isomorphic if and only if they are of the same dimension dim(V) = n n W V dimensionhave bothand thatAssume ) (: is onto Tn W T = = ) dim( ) of range dim(n W V = = ) dim( ) dim( Thus{ }{ }1 21 2Let, ,,be a basis of and' , , ,be a basis of nnB VB W==v v vw w wn nc c cVv v v v + + + = 2 2 1 1as d represente be caninvectorarbitraryanThen 1 1 2 2and you can define a L.T.:as follows( )(by defining( ) )n n i iT V WT c c c T= = + + + = w v w w w v wSinceis a basis for V, {w1, w2,wn} is linearly independent, and the only solution for w=0 is c1=c2==cn=0 So with w=0, the corresponding v is 0, i.e., ker(T) = {0} By Theorem5, we can derive that dim(range of T) = dim(domain of T) dim(ker(T)) = n 0 = n = dim(W) Since this linear transformation is both one-to-one and onto, then V and W are isomorphic ' Bone - to - one isT onto isT 3. Matrices for Linear Transformations 1 2 3 1 2 3 1 2 3 2 3(1)( , , ) (2 , 3 2 , 3 4 ) Tx x x x x x x x x x x = + + + Three reasons for matrix representation of a linear transformation: 1232 1 1(2)( ) 1 3 20 3 4xT A xx (( ((= = (( (( x x It is simpler to write It is simpler to read It is more easily adapted for computer use Two representations of the linear transformation T:R3R3 : Theorem 10:Standard matrix for a linear transformation Let:be a linear trtansformation such thatn mT R R 11 12 121 22 21 21 2( ) , ( ) , , ( ) ,nnnm m mna a aa a aT T Ta a a ((( ((( (((= = = ((( ((( e e e1 2 nwhere { , , , } is a standard basis for. Then thematrix whose columns correspond to( ),niR m nn T e e ee| |11 12 121 22 21 21 2( )( )( ) ,nnnm m mna a aa a aA T T Ta a a ( ( (= = ( ( e e eTA R v Av T(v)nformatrixstandard the called is , ineveryforsuch thatis =Pf: 121 2 1 1 2 21 0 00 1 00 0 1n n nnvvv v v v v vv (((( (((( ((((= = + + + = + + + (((( (((( v e e e1 1 2 21 1 2 21 1 is a linear transformation ( ) ( ) ( ) ( ) ( ) ( )n nn nT T Tv v vTv Tv Tvv T = + + += + + += +v e e ee e ee2 2( ) ( )n nv T v T + + e e(((((

+ + ++ + ++ + +=(((((

(((((

=n mn m mn nn nn mn m mnnv a v a v av a v a v av a v a v avvva a aa a aa a aA 2 2 1 12 2 22 1 211 2 12 1 11212 12 22 211 12 11v| |1 2If( )( )( ) ,thennA T T T = e e e11 12 121 22 21 21 21 1 2 2( ) ( ) ( )nnnm m mnn na a aa a av v va a av T v T v T ((( ((( (((= + + + ((( ((( = + + + e e enR A T ineachfor) ( Therefore, v v v = Note Theorem 10 tells us that once we know the image of every vector in the standard basis (that is T(ei)), you can use the properties of linear transformations to determine T(v) for any v in V 6.21 Ex 1: Finding the standard matrix of a linear transformation 3 2Find the standard matrix for the L.T.:defined by T R R ) 2 , 2 ( ) , , ( y x y x z y x T + =Sol: 1( ) (1,0,0) (1,2)T T = = e2( ) (0,1,0) ( 2,1)T T = = e3( ) (0,0,1) (0,0)T T = = e111( ) ( 0 )20T T( ( (= =( ( ( e202( ) ( 1 )10T T( ( (= =( ( ( e300( ) ( 0 )01T T( ( (= =( ( ( eVector NotationMatrix Notation | |1 2 3( )( )( )1 2 02 1 0A T T T = (=( e e e Note: a more direct way to construct the standard matrixz y xz y xA0 1 20 2 1

0 1 20 2 1+ ++ ((

=((

+=(((

((

=(((

y xy xzyxzyxA220 1 20 2 1i.e.,( , , ) ( 2 , 2 ) Txyz x y x y = + Check: The first (second) row actually represents the linear transformation function to generate the first (second) component of the target vector Ex 2: Finding the standard matrix of a linear transformation 2 22The linear transformation:is given by projecting each point in onto the x - axis. Find the standard matrix for T R RR TSol: ) 0 , ( ) , ( x y x T =| | | |1 21 0( )( ) (1,0)(0,1)0 0A T T T T (= = =( e e Notes: (1) The standard matrix for the zero transformation from Rn into Rm is the mn zero matrix (2) The standard matrix for the identity transformation from Rn into Rnis the nn identity matrix In Composition of T1:RnRm with T2:RmRp : nR T T T e = v v v )), ( ( ) (1 22 1This composition is denoted by T T T = Theorem11: Composition of linear transformations : 1 21 2Let:and:be linear transformations with standard matrices and ,thenn m m pT R R T R RA A 2 1(1) The composition: ,defined by( ) ( ( )), is still a linear transformationn pT R R T T T = v v2 1(2) The standard matrix for is given by the matrix product

A TA A A =Pf: (1) (is a linear transformation)Let and be vectors in and let be any scalar. ThennTR c u v2 1(2) (is the standard matrix for) A A T) ( ) ( )) ( ( )) ( ()) ( ) ( ( )) ( ( ) (1 2 1 21 1 2 1 2v u v uv u v u v uT T T T T TT T T T T T+ = + =+ = + = +) ( )) ( ( )) ( ( )) ( ( ) (1 2 1 2 1 2v v v v v cT T cT cT T c T T c T = = = =v v v v v ) ( ) ( )) ( ( ) (1 2 1 2 1 2 1 2A A A A A T T T T = = = = Note: 1 2 2 1T T T T = Ex 3: The standard matrix of a composition 3 31 2Let and be linear transformations from into s.t. T T R R) , 0 , 2 ( ) , , (1z x y x z y x T + + =) , z , ( ) , , (2y y x z y x T =2 11 2Find the standard matrices for the compositions and'T T TT T T==Sol: ) formatrixstandard ( 1 0 10 0 00 1 21 1T A((((

=) formatrixstandard ( 0 1 01 0 00 1 12 2T A((((

=1 2formatrixstandard The T T T =2 1' formatrixstandard The T T T =(((

=(((

(((

= =0 0 01 0 10 1 21 0 10 0 00 1 20 1 01 0 00 1 11 2A A A((((

=((((

((((

= =0 0 10 0 01 2 20 1 01 0 00 1 11 0 10 0 00 1 2'2 1A A A Inverse linear transformation : 1 2If:and:are L.T. s.t. for every in n n n n nT R R T R R R v)) ( (and)) ( (2 1 1 2v v v v = = T T T Tinvertible be to said is and of inverse the called is Then 1 1 2T T T Note: If the transformation Tis invertible, then the inverse is unique and denoted by T1 Theorem 12: Existence of an inverse transformation Let:be a linear transformation with standard matrix,Then the following condition are equivalentn nT R R A Note: If T is invertible with standard matrix A, then the standard matrix for T1 is A1 (1) T is invertible (2) T is an isomorphism (3) A is invertible For (2) (1), you can imagine that since T is one-to-one and onto, for every w in the codomain of T, there is only one preimage v, which implies that T-1(w) =v can be a L.T. and well-defined, so we can infer that T is invertible On the contrary, if there are many preimages for each w, it is impossible to find a L.T to represent T-1 (because for a L.T, there is always one input and one output), so T cannot be invertible Ex 4: Finding the inverse of a linear transformation 3 3The linear transformation:is defined by T R R ) 4 2 , 3 3 , 3 2 ( ) , , (3 2 1 3 2 1 3 2 1 3 2 1x x x x x x x x x x x x T + + + + + + =Sol: 1 4 21 3 31 3 2formatrixstandard The((((

= AT3 2 13 2 13 2 14 23 33 2x x xx x xx x x+ + + + + + | |(((

=1 0 0 1 4 20 1 0 1 3 30 0 1 1 3 23I AShow that T is invertible, and find its inverse G.-J. E. 11 0 0 1 1 00 1 0 1 0 10 0 1 6 2 3I A ( ( ( = ( ( 1 1is formatrixstandard the and invertible is Therefore A T T(((

=3 2 61 0 10 1 11A(((

+ + =(((

(((

= = 3 2 13 12 13211 13 2 6 3 2 61 0 10 1 1) (x x xx xx xxxxA T v v) 3 2 6 , , ( ) , , (s, other word In 3 2 1 3 1 2 1 3 2 11x x x x x x x x x x T + + = Check T-1(T(2, 3, 4)) = T-1(17, 19, 20) = (2, 3, 4) The matrix of T relative to the bases B and B: 1 2: (a linear transformation){ , , , }(a nonstandard basis for)The coordinate matrix of any relative to is denoted by [ ]nBT V WB VB= v v vv vA matrix A can represent T if the result of A multiplied by a coordinate matrix of v relative to B is a coordinate matrix of v relative to B, where B is a basis for W. That is, where A is called the matrix of T relative to the bases B and B| |'( ) [ ] ,BBT A = v v121 1 2 2if can be represeted as, then [ ]n n Bnccc c cc| | ( | ( | (+ + + = | ( | ( | \ .v v v v v Transformation matrix for nonstandard bases (the generalization of Theorem 10, in which standard bases are considered) : | | | | | |11 12 121 22 21 2' ' '1 2( ) , ( ) , , ( )nnnB B Bm m mna a aa a aT T Ta a a ((( ((( (((= = = ((( ((( v v v1 2Let and be finite - dimensional vector spaces with bases and', respectively, where{ , , , }nV W B BB = v v vIf:is a linear transformation s.t. TV W | |') ( to correspond columns se matrix who then theBiv T n n m| |'is such that( ) [ ]for every in BBT A V = v v v| |11 12 121 22 21 21 2[ ( )][ ( )][ ( )]nnB B n Bm m mna a aa a aA T T Ta a a' ' ' ( ( (= = ( ( v v vThe above result state that the coordinate of T(v) relative to the basis B equals the multiplication of A defined above and the coordinate of v relative to the basis B. Comparing to the result in Thm. 10 (T(v) = Av), it can infer that the linear transformation and the basis change can be achieved in one step through multiplying the matrix A defined above. Ex 5: Finding a matrix relative to nonstandard bases 2 2Let:be a linear transformation defined by T R R ) 2 , ( ) , (2 1 2 1 2 1x x x x x x T + =Find the matrix of relative to the basis{(1,2),( 1,1)} and' {(1,0),(0,1)}T BB= =Sol: ) 1 , 0 ( 3 ) 0 , 1 ( 0 ) 3 , 0 ( ) 1 , 1 () 1 , 0 ( 0 ) 0 , 1 ( 3 ) 0 , 3 ( ) 2 , 1 ( = = + = =TT| | | |((

= ((

=30) 1 , 1 (,03) 2 , 1 (' ' B BT T' and to relative formatrixthe B B T| | | | | |((

= =3 00 3) 2 , 1 ( ) 2 , 1 (' ' B BT T A Ex 6: 2 2For the L.T.:given in Example 5, use the matrix to find( ), where(2,1)T R R AT= v vSol: ) 1 , 1 ( 1 ) 2 , 1 ( 1 ) 1 , 2 ( = = v| |((

= 11Bv| | | |((

=((

((

= = 33113 00 3) (' B BA T v v) 3 , 3 ( ) 1 , 0 ( 3 ) 0 , 1 ( 3 ) ( = + = v T )} 1 , 0 ( ), 0 , 1 {( ' = B)} 1 , 1 ( ), 2 , 1 {( = B) 3 , 3 ( ) 1 2(2) , 1 2 ( ) 1 , 2 ( = + = T Check: