Chapter 4 General Vector Spaces Face Recognition ( á¹¢å ± å½å¬)
Chapter 4 General Vector Spaces Face Recognition ( á¹¢å ± å½å¬)
Chapter 4 General Vector Spaces Face Recognition ( á¹¢å ± å½å¬)
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
4.7 Kernel (), Range (), and theRank/Nullity () TheoremLA 04_77 Definition: Let U and V be vector spaces. Let u and v bevectors in U and let c be a scalar. A transformation T: U V is said to be linear if T(u + v) = T(u) + T(v), T(cu) = c T(u) Example 2: Let P n be the vector space of real polynomialfunctions of degree n. Prove TP 2 P 1 is linearT(ax 2 + bx + c) = (a + b) x + c— Proof: Let ax 2 + bx + c, px 2 + qx + r P 2 .— (1) <strong>Vector</strong> addition: T((ax 2 + bx + c) + (px 2 + qx + r)) =(a + p + b + q) x + (c + r) = (a + b) x+c + (p + q) x + r= T (ax 2 + bx + c) + T (px 2 + qx + r)—(2) Scalar multiplication: Assume k is any scalar.T ( k ( a x 2 + b x + c ) ) = ( k a + k b ) x + k c= k ( (a + b) x + c ) = k T ( a x 2 + b x + c )LA 04_79Definition: Let T: U V be a linear transformation.•The kernel () of T = { u U | T u = 0 V }. Denotedker(T). ()•The range () of T : { T u : u U }.Denoted range(T).Example 3 D D = d D P ndxDxDn(4x3nxn3x122x1) f g P nc D ( f g ) Df D ( cf ) cD ( f• Others: Integration (), Mean value () of a randomvariable ()Ef[f)12Dg gdx fdx gdx , cfdx c g ] E [ f ] E [ g ], E [ cf ] cEx26x[fdxf2]Theorem 4.26 : Let T: U V be a linear transformation.(a) The kernel of T is a subspace of U.(b) The range of T is a subspace of V.Proof:(a) If u 1 , u 2 ker(T), that is T u 1 = T u 2 = 0, then(1) T ( u 1 + u 2 ) = T u 1 + T u 2 = 0 + 0 = 0,(2) T ( c u 1 ) = c T u 1 = c 0 = 0(b) If v 1 , v 2 Range (T), that is, there exist u 1 , u 2 such thatT u 1 = v 1 , T u 2 = v 2 . Then(1) v 1 + v 2 = T u 1 + T u 2 = T (u 1 + u 2 )(2) c v 1 = c T u 1 = T ( c u 1 )LA 04_78LA 04_80