I A. Here it is computed in a partially factored form in preparation for part b. Scale. 87100 A, 7486 B, 5673 C. Median 79.

79. 2 2 2 = (2 )((1 )2 + 2) 0 1 2 Problem 1. [10] Let A be an n n matrix whose determi0 2 1 nant is 0. Prove that the homogeneous system Ax = 0 has = ( + 2)(2 2 + 3) a nontrivial solution. (You may use any properties of determinants and homogeneous systems that you know, except b. Find the eigenvalues for A. this statement itself of course.) Since one factor of the characteristic polynomial is + 2, There are many possible proofs. Heres a short one. one eigenvalue is 2. The other two eigenvalues are the The homogeneous system has a nontrivial solution i A is roots of the irreducible quadratic polynomial 2 2 + 3. singular, but A is singular i |A| = 0. Its roots are 2 4 12 = 1 3 = 1 i 3. Problem 2. [18; 6 points each part] Consider the set V of 2 all vectors in R4 of the form (a, b, c, d) such that c. Choose one of the eigenvalues that you found in part b 0 a 1 0 0 4 and determine all the eigenvectors for it. 0 1 0 3 b 0 = Here are the eigenvectors for = 2. We need to nd 0 2 0 6 c 0 vectors x such that Ax = 2x, equivalently, (A + 2I)x = 0. 0 d 0 0 0 4 Since A + 2I is the matrix a. What is the dimension of V ? Explain how you know that 0 2 2 is the dimension. 0 3 2 , This is the null space of the matrix. If (a, b, c, d) is in that 0 2 3 space, then from the fourth line, 4d = 0, so d = 0. The third line is a multiple of the second, so it can be disregarded. The The solutions are of the form x = (x, 0, 0) where x is any second says b + d = 0, that is b = d = 0, and the rst line real number, i.e., the eigenvectors are on the x-axis in R3 . says a + 4d = 0, so a = 4d = 0. Thus, the general solution is of the form Problem 4. [10] Consider the set S = (a, b, c, d) = (0, 0, c, 0) {(3, 0, 0, 0, 1), (3, 3, 0, 3, 2), (0, 2, 0, 1, 2), (0, 1, 0, 2, 1)} of vectors in R5 . Let W = span (S) be the subspace of R5 where c is an arbitrary real number. spanned by S. Find a basis for W . Thus, the dimension is 1. There are essentially two methods you can use. One is to b. Exhibit a basis for V . (No need to explain how you found write the vectors in rows in a matrix and row reduce it. The it.) nonzero rows give a basis for this row space. Heres that One basis consists of the two vectors you get when matrix and its reduced echelon form you assign one of c and d the value 1 and the other 0. 3 0 0 0 1 1 0 0 0 1 3 {(0, 0, 1, 0), (4, 1, 0, 1)}. 3 3 0 3 2 0 1 0 0 1 0 2 0 1 0 0 0 1 2 0 c. Give an example of a 2-dimensional subspace W of V . 0 1 0 2 1 0 0 0 0 0 There are none since a 1-dimensional vector space cant have a 2-dimensional subspace. So a basis is {(1, 0, 0, 0, 1 ), (0, 1, 0, 0, 1), (0, 0, 0, 1, 0)}. Math 130 Final Exam Answers. Dec 2009.
3

Problem 3.

[18; 6 points each part] Consider the matrix 2 A= 0 0 2 1 2 2 2 1

a. Find the characteristic polynomial of A. Its the determinant of A I or, if you prefer, the determinant of 1

The other method is to write the vectors as columns in a matrix, row reduce that, and the pivot columns of the reduced matrix indicate which of the original vectors are independent. 3 3 0 0 1 1 0 0 0 3 2 1 0 3 1 2 0 0 0 0 0 0 1 1 0 3 1 2 0 0 0 0 1 2 2 1 0 0 0 0

Since the rst three columns are pivot columns, that L(x) = x where A is a matrix that represents the the rst three of the original vectors give a basis: linear transformation L. Since B represents the same linear {(3, 0, 0, 0, 1), (3, 3, 0, 3, 2), (0, 2, 0, 1, 2)}. transformation, and eigenvalues are determined by the linear transformation, therefore A and B have the same eigenvalues. Problem 5. [10] Let V be a nite dimensional vectors A dierent explanation uses the fact that A and B are conspace with W a subspace of V . Explain why dim V must be jugate matrices, that is, that there is an invertible matrix P greater than or equal to dim W . such that P AP 1 = B. The eigenvalues are the roots of the Heres one short proof. characteristic polynomials, and the characteristic polynomiThe dimension of the subspace W is the largest number als are the same. Heres why: of independent vectors in it. But since those vectors are also in V , therefore the largest number in independent vectors in det(B I) = det(P 1 AP I) V is at least that many. = det(P 1 AP P 1 IP ) Problem 6. [24; 3 points each part] True or false. Just write the word true or the word false. If its not clear to you which it is, explain; otherwise no explanation is necessary. a. The xed points x of a matrix transformation T (x) = Ax are eigenvectors with eigenvalue 1. True. b. Two matrices A and B are said to be similar if by means of row operations one can be reduced to the other. False; simlar means conjugate matrices. c. If S is the basis of Rn , then the columns of the transition matrix PES are the basis vectors in S. True. d. The following set S is a basis for R6 . S = {(2, 2, 0, 8, 5, 2), (4, 3, 2, 0, 4, 1), (3, 2, 1, 4, 3, 2), (1, 3, 2, 1, 0, 0), (0, 4, 2, 3, 2, 1)} False. You need 6 vectors in any basis of R6 . e. The set of all vectors of the form (a, 2a + b + 1, 2b) is a subspace of R3 . False. 0 is not included, among other things. f. The maximum column rank of a 35 matrix is 3. True. The column rank equals the row rank, and the row rank is at most 3. g. The eigenvalues of a square matrix must be distinct (no two are equal). False. They can be repeated. h. It is possible for vector space to have two bases where one has 3 elements and the other has 5 elements. False. All bases have the same number of elements. Problem 7. [10] Suppose that the linear transformation L : Rn Rn has the standard matrix representation A so that in standard coordinates L(x) = Ax, and suppose that S is a basis of Rn where in S-coordinates the transformation L is represented by the matrix B so that [L(x)]S = B [x]S . Explain why if is an eigenvalue of A, then is also an eigenvalue of B. In other words, explain why two similar matrices A and B have the same eigenvalues. Here are a couple of explanations. An eigenvalue of the matrix is a constant such that there is some vector x such 2 = = = det(P 1 (A I)P ) det(P 1 ) det(A I) det(P ) det(A I)