Kernel and Range Definition of one-to-one transformation: A linear transformation V, v1 v2 L :V W is said to be one-to-one if for all v1 , v2 in implies that Lv1 Lv2 (or Lv1 Lv2 implies v1 v2 ). Example: x x y L . Is L one-to-one? y x y [solution:] Let x x v1 1 , v2 2 . Then, y1 y2 x y1 x 2 y 2 Lv1 Lv 2 1 x y x1 y1 x2 y 2 x y 1 2 1 2 x1 y1 x2 y 2 2 x1 2 x2 x1 x2 y1 y 2 . x x v1 1 2 v 2 y1 y2 . Therefore, L is one-to-one. Definition of kernel: Let L :V W be a linear transformation. The kernel of L, 1 kerL , is v the subset of V consisting of all vectors Lv 0 . such that Example: Let u1 1 2 3 u1 Lu L u 2 Au 4 5 6 u 2 . u 7 8 9 u 3 3 What is kerL ? [solution:] kerL is the set consisting of all vectors u1 u u 2 u 3 such that Lu Au 0 . That is, kerL is the solution space of Au 0 . Important result: Let L :V W be a linear transformation. Then, subspace of V. [proof:] For any v1, v2 kerL , Lv Lv 0 . Then, 1 2 2 kerL is a 1. Lv1 v2 Lv1 Lv2 0 0 0 v1 v2 kerL . 2. Lkv1 kLv1 k 0 0, k R kv1 kerL . By 1, 2, kerL is a subspace of V. Important result: A linear transformation L :V W is one-to-one if and only if ker L 0 [proof:] : Since L is one-to-one, L0 0 implies there is only one vector 0 such that L0 0 . : kerL 0. Suppose Lu Lv . Then, Lu v Lu Lv 0 . Since ker L 0, that implies u v 0 u v . Therefore, L is one-to-one. Important result: n n Let L : R R be a linear transformation defined by Lx Ax , where A is a equivalent: n n ker L 0. Ax 0 matrix. Then, the following conditions are has only the trivial solution. 3 Ax b Lx Ax has a unique solution for every b. is one-to-one. Definition of range: Let L :V W be a linear transformation. The range of L, rangeL , is the subset of W consisting of all vectors that are images of vectors in V (i.e., w rangeL , there exists for any If rangeL W v in V such that Lv w ). , L is said to be onto. Important result: Let L :V W be a linear transformation. Then, rangeL is a subspace of V. [proof:] Since L0 0 , 0 rangeL . empty set. For any such that 1. Thus, rangeL is not a w1, w2 rangeL , there exist v1 , v2 in V Lv1 w1 , Lv2 w2 . Then, Lv1 v2 Lv1 Lv2 w1 w2 . Then, w1 w2 rangeL since v1 v2 V . 2. Lkv1 kLv1 kw1, k R . Then, kv1 V By 1, 2, rangeL is a subspace of V. 4 kw1 rangeL since Example: Let L : R3 R3 , 1 0 1 x1 Lx Ax 1 1 2 x 2 . 2 1 3 x3 (a) Is L onto? (b) What is range L? [solution:] a w b R 3 , there exists x c (a) Suppose L is onto. Then for any vector such that 1 0 1 x1 1 0 1 a Ax 1 1 2 x2 x1 1 x2 1 x3 2 b w . 2 1 3 x3 2 1 3 c That is 1 0 1 1 , 1 , 2 2 1 3 span R 3 1 0 1 1 , 1 , 2 2 1 3 is a basis for R 3 . But 1 det A 1 2 0 1 1 5 1 2 0 . 3 Thus, 1 0 1 1 , 1 , 2 2 1 3 is not a basis and it is a contradiction. Therefore, L is not on-to. (b) rangeL the vectors Ax for any x R 3 x1 x1 A x 2 col1 A col 2 A col 3 A x 2 x3 x3 x1col1 A x 2 col 2 A x3 col 3 A, x1 , x 2 , x3 R spancol1 A, col 2 A, col 3 A the column space of A Note: As the linear transformation defined by L : R n R m , L x Am n x, then and rangeL the column space of A kerL the null space of A . Important result: Let L :V W be a linear transformation of an n-dimensional vector space V into a vector space W, then, dim rangeL dim kerL n dim V , 6 where dim is the dimension of some vector space. Note: As the linear transformation defined by L : R n R m , L x Am n x, the above important result is rank A nullity A dim column space of A dim null space of A dim rangeL dim ker L dim R n n 7