By Jaime R.

Sandoval Professor Crass Linear Algebra 347 1) Suppose V has nite dimension T:VV is linear and satises: T2 = T (note: T = T T). a) Show that T is a projection in the sense that for some subspace U V, T|U = I|U and T(V) = U. T projects V onto U. Solution: A linear transformation T:VV is said to be orthogonal if T(v)T(w)= vw for v,w V. Orthogonal transformation preserves angles and length. Let us work this out this orthogonal transformation using a following steps. A linear transformation T: 3 3 is if it maps bases onto bases. A basis {V1 , V2 ,...,Vn } for n is said to be ortho-normal if Vi Vj = ij where ij = 1 when i=j and 0 when i=j. The usual basis for 2 is { e1 , e2 } = { (1,0), (0,1)}. Now, B[e1 ] = 1, 0 0 , 1 [ 1, 0]T = [1,0]T B[e2 ] = 1, 0 0 , 1 [0,1]T = [0, -1]T . Let us check that { (1,0), (0,-1)} forms an basis for 2 . Let (x1 , x2 ) be an arbitrary point in 2 . Then,(x1 , x2 ) = c1 (1,0) +c2 (0,-1), x1 = c1 , x2 = -c2 . Thus, (x1 , x2 ) = x1 (1,0)-x2 (0,-1), and {(1,0), (0,-1)} forms a basis for 2 . Since (1,0) dot ((0,-1) = 1(0)+(0)(-1) = 0 the two basis vectors are . Since (1,0) = 02 + (1)2 = 1 and (1,0) = 12 + 02 = 1. The vectors (1,0), (0,-1) form a basis for 2 . Thus, the given linear trasnformation is # b) Determine the possible eigenvalues for T. Solution T= 1 , 0 0 , 1 = [x,y]T = [0,0]T (*). System (*) can have non-trivial solutions if det(T-I) = 0 or (1-)(-1-) = 0. Therefore, the eigenvalues are = 1 and = -1, , with respect to some basis, a diagonal matrix D= 1, 0 0 , 1 which represents the quadratic form. To show this, rst nd two eigenvectors associated with the eigenvalues. If =1, (*) becomes the matrix 0, 0 0 , 1 1

[x,y]T = [0,0]T . By computing the matrix, we nd that an eigenvector with = 1 is [x,y] = [0, 0] and [0,0] with = -1 These are linear dependent. and . c) Show that T has a basis of eigenvectors . Solution: Using (*) T: [x1 ,x2 ] 1, 0 0 , 1 x1 x2 = [x1 ,-x2 ]T . of T relative to . d) Describe the form of the matrix T Solution: A point with coordinates [x1 , x2 ] is sent to a point whose rst coordinate is the same, but whose second coordinate is the negative of the original coordinate. e) Work out the map P: 3 3 is projection onto the plane y=z? 2) 9.2: 3 Show that if a 22 complex matrix X commutes with every 22 complex matrix, then X= I for some complex , where I is the 22 identity matrix. Solution: If T is a linear operator for which the characteristic polynomial factors completely over the scalar eld, then there is an ordered basis for V in which T is represented by a matrix which is in Jordan form. The characteristic polynomial for the given operator is (x-c1 )(x-c2 ) if c1 and c2 are distinct complex numbers. If c1 =c2 then it is (x-c)2 for some c in C. In either, we see that the polynomial factors into linear products. I fthe two eigenvalues are distinct, then the eigenvectors associated with these eigenvalues form a basis for C2 . With respect to this basis, T is a diagonalizable and is represented by c1 , 0 0, c2 If the characteristic equation is (x-c)2 , then we must look to the minimal polynomial to helpus in our search for the simplest matrix representation of T. Let m(x) may be (x-c), in which case T= cI = c, 0 0, c or it may be (x-c)2 . In the previous case, the kernel of (T-cI)2 is a T invariant space, and T can be represented as the sum of all nilpotent matrix and a diagonal matrix. This is the same as saying that T is an ordered basis by the matrix c, 0 1, c 2

. Therefore, for all 22 complex matrix is similar to a matrix of c1 , 0 0, c2 or c, 0 1, c , with c1 = c2 in c1 , 0 0, c2 . That is, if the single eigenvalue c1 = c2 has associatiated with two linearly independent eigenvectors # 9.3: 3 The vector apace M22 ( ) has basis B = { E11 , E12 , E21 , E22 } given in (9.1.2). Let (A) be the transpose of the matrix A. Show that : B B is a linear map with matrix representation 1, 0, 0, 0 0, 0, 1, 0 0, 1, 0, 0 0, 0, 0, 1 . Solution: If is a linear transformation mapping there is an nn matrix B such that (x ) = x x n . In fact, the jth column vector of B is given by bj = (Ej ) j=1,2,3,4 dene in this case and let B = { E11 , E12 , E21 , E22 } x = x1 E1 +x2 E2 +x3 E3 +x4 E4 is an arbitrary element of n (x) = x1 (E1 )+x2 (E2 )+x3 (E3 )+x4 (E4 ) = x1 b1 +x2 b2 +x3 b3 +x4 b4 = (b1 , b2 , b3 , b4 )(xi )T i=1,2,3,4. Therefore, Bx #. 9.4: 3 Let A= a, b c, d . (i) Suppose that ad-bc =0. Find A1 . Solution: 1 Let D =ad-bc =0. (*) D d, b c, a a, b c, d

adbc D ,0 bc 0, adD

= I. a, b c, d multiply this times (*) to obtain I Therefore, (*) = A1 . (ii)Suppose that ad-bc = 0. Find all column vectors x such that a, b c, d [x1 ,x2 ]T = [0,0]T 10.1: 6 Let V be the real vector space of dierentiable functions f: , and let :VV be dened by (f) = df/dx. Show that every real number is an eigenvalue of . Given a real number , what is E ? Solution: If f(x) = ex for any real number , then (f) = df/dx = ex = f(x). Therefore, for all real numbers there is an eigenvalue of . is an eigenvalue of where a nonzero function V, that is (f) = df/dx = f. When we let = 0 we obtain a basis for E which is the C1 , when x =0 the basis E = (x) =ex . 10.4: 1. Show that the matrix A =

1, 2 3, 4

satises its own characteristic equation. Use this to compute A4 . Solution: determinant 1 , 2 3, 4 = (-1-)(4-)+6 2 -3+2 (*) (*) is the characteristic equation associated with A. It is a polynomial in , the characteristic value. Replacing by the matrix A, 2 by 2I, and see if (*) is valid then 1, 2 3, 4 -3 1, 2 3, 4
2

+2 1, 0 0, 1 = 5, 6 9, 10 3 , 6 9, 12 2, 0 0, 2 = 0, 0 0, 0 That is, the matrix A is a zero of (*). It satises its own characteristic equation.