1

Math 115B, Winter 2007: Homework 1

Exercise 1.1. (FIS, 6.3 Exercise 7) The linear operator T : R2 R2 dened by T (x, y) = (2x + 3y, 4x + 6y) has the property that ker (T ) = ker (T ). Proof. The formula for T is T (x, y) = = (x, y)|T (1, 0) (1, 0) + (x, y)|T (0, 1) (0, 1) (x, y)|(2, 4) (1, 0) + (x, y)|(3, 6) (0, 1) = (2x + 4y, 3x + 6y)

From this, we can compute ker (T ) = {(x, y) R2 : 2x = 3y} ker (T ) = {(x, y) R2 : x = 2y}. Evidently, ker (T ) = ker (T ).

Exercise 1.2. (FIS, 6.3 Exercise 8) Let V be a nite dimensional inner product space, and T a linear operator on V . If T is invertible, then T is invertible and (T )1 = (T 1 ) . Proof. Since T is an isomorphism, each element of V is of the form T (v) for some v V . Then for any w V , we have v|1V (w) = = v|w = T 1 (T (v))|w T (v)|(T 1 ) (w) = y|(T (T 1 ) (w) .

By uniqueness of the adjoint, we must have T (T 1 ) ) = (1V ) = 1V . Hence (T 1 ) is the (right, and clearly left) inverse of T , i.e. (T 1 ) = (T )1 . Dr. Petersen oers the following elegant proof in his book. Basic properties of adjoints guarantee that 1V = (1V ) = (T T 1 ) = (T 1 ) T , therefore (T 1 ) is the inverse map to T . Lemma 1.3. (a) If V is an inner product space over R, then for all x, y V , 4 x|y = ||x + y||2 ||x y||2 . (b) If V is an inner product space over C, then for all x, y V ,
4

4 x|y =
k=1

ik ||x + ik y||2 .

Proof. (a) In a real inner product space, x|y = y|x = y|x , so we have ||x + y||2 ||x y||2 = = x + y|x + y x y|x y ( x|x + 2 x|y + y|y )

( x|x 2 x|y + y|y ) = 4 x|y (b) In a complex inner product space, we have ||x + y||2 = i||x + iy||2 = i ||x y||2 = i||x + y||2 = i therefore x + y|x + y = x|x + x|y + y|x + y|y x + iy|x + iy = i x|x + x|y y|x + i y|y x y|x y = x|x + x|y + y|x + y|y x iy|x iy = i x|x + x|y y|x i y|y
4

ik ||x + ik y||2 = 4 x|y .

k=1

Exercise 1.4. (FIS, 6.3 Exercise 10) If T is a linear operator on a nite dimensional inner product space V , then ||T (x)|| = ||x|| for all x V if and only if T is an isometry. Proof. If T is an isometry, then ||T (x)|| = T (x)|T (x) = x|x = ||x||. Conversely, suppose that ||T (x)|| = ||x|| for all x V . In particular, for any x, y V , ||T (x) T (y)|| = ||T (x y)|| = ||x y||. If V is a real inner product space, then Lemma 1.3(a) guarantees that T (x)|T (y) = = 1 (||T (x) + T (y)||2 ||T (x) T (y)||2 ) 4 1 (||x + y||2 ||x y||2 ) = x|y . 4

If V is a complex inner product space, then Lemma 1.3(b) guarantees that T (x)|T (y) = 1 4 1 4
4

ik ||T (x) + ik T (y)||2

k=1 4

ik ||x + ik y||2 = x|y .

k=1

In both the real and complex cases, it follows that T is an isometry. Exercise 1.5. (FIS, 6.3 Exercise 13) If T is a linear operator on a nite dimensional inner product space V over F, then (a) ker (T T ) = ker (T ). In particular, rank(T T ) = rank(T ). (b) rank(T ) = rank(T ). In particular, rank(T T ) = rank(T ). (c) for any A Mn (F), rank(A A) = rank(AA ) = rank(A). 2

Proof. (a) If x ker (T ), then T (T (x)) = T (0) = 0, so x ker (T T ). If x ker (T T ), then by the Fredholm Alternative, T (x) ker (T ) = im(T ) . In other words, T (x)|T (y) = 0 for all y V . In particular, T (x)|T (x) = ||T (x)||2 = 0 which is possible if and only if T (x) = 0. This shows that x ker (T ). So ker (T ) = ker (T T ), which implies that nullity(T ) = nullity(T T ). It follows from the dimension theorem that rank(T ) = rank(T T ). (b) The dimension theorem guarantees that dim(V ) dim(im(L )) = dim(im(L )). By the Fredholm Alternative, we have rank(L) = dim(im(L)) = dim(V ) dim(ker(L)) = dim(V ) dim(im(L )) = dim(im(L )) = rank(L ). By part (a), ker (T T ) = ker ((T ) T ) = ker (T ). By the dimension theorem, rank(T T ) = rank(T ) = rank(T ). (c) Let LA : Fn Fn denote the linear transformation associated to A. Then by parts (a) and (b) rank(A A) = rank(LA LA ) = rank(LA ) = rank(A) = rank(LA LA ) = rank(AA ).

Exercise 1.6. (FIS, 6.3 Exercise 14) Let V be an inner product space over F, and let y, z V . Dene a linear operator T : V V by T (x) = x|y z for all x V . Then T exists and is dened by T (x) = x|z y. Proof. First, we convince the reader that T is in fact a linear operator. Let x, x V and a F, and compute T (ax + x ) = ax + x |y z = a x|y z + x |y z = aT (x) + T (x ). Assume that T exists. Then for any x, x V , x|T (x ) = = = T (x)|x = x|y z|x x|y

x|y z|x = z|x

x| z|x y = x| x |z y .

By the uniqueness of the adjoint, we must have T (x ) = x |z y. It now suces to prove that T dened as such is a linear map. Indeed, if x, x V and a F, then T (ax + x ) = ax + x |z y = a x|z y + x |z y = aT (x) + T (x ).