* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Exam 1 solutions
Capelli's identity wikipedia , lookup
Fundamental theorem of algebra wikipedia , lookup
Tensor operator wikipedia , lookup
Quadratic form wikipedia , lookup
Bra–ket notation wikipedia , lookup
Cartesian tensor wikipedia , lookup
Basis (linear algebra) wikipedia , lookup
Determinant wikipedia , lookup
Matrix (mathematics) wikipedia , lookup
Eigenvalues and eigenvectors wikipedia , lookup
Jordan normal form wikipedia , lookup
Linear algebra wikipedia , lookup
Four-vector wikipedia , lookup
Non-negative matrix factorization wikipedia , lookup
Singular-value decomposition wikipedia , lookup
Orthogonal matrix wikipedia , lookup
Perron–Frobenius theorem wikipedia , lookup
System of linear equations wikipedia , lookup
Cayley–Hamilton theorem wikipedia , lookup
Math 217, Linear Algebra, Fall 2002 Exam 1, October 4, 2002 Name: Solutions 1.(5pts) Let A be a 6 × 5 matrix. What must a and b be in order to define T : Ra → Rb by T (x) = Ax? If we are trying to compute Ax then x must be a length 5 vector. The result of Ax is a length 6 vector. So a = 5 and b = 6. 2.(5pts) Give an example of a 2 × 2 matrix A which has the following three properties: 1) A 6= 0, 2) A 6= I2 , and 3) AT = A. 1 0 a b Try on for size. In fact, any matrix will work as long as if b = 0 0 0 b c then both a and d are not both 1 or both zero. 4 5 6 7 4 5 6 7 3.(10pts) Note that the matrix A = 8 7 6 5 is similar to the matrix B = 0 −3 −6 −9. 6 7 8 9 6 7 8 9 −1 Write down an elementary matrix E such that EA = B. What is E ? You can find an elementary matrix E such that EA = B by performing the same row operation on the identity as you did on A. That is, replace Row(2) of the identity with Row(2) − 2Row(1). Doing this yields the matrix 1 0 0 0 −2 1 0 0 E= 0 0 1 0 . 0 0 0 1 The matrix E −1 is such that E −1 E = I4 . So we find E −1 by performing the same row operation on the identity as we would perform on E to obtain I4 . That is, Row(2)→Row(2)+2Row(1) transforms E to I4 , thus Row(2)→Row(2)+2Row(1) transforms I4 to 1 0 0 0 2 1 0 0 E −1 = 0 0 1 0 . 0 0 0 1 4.(5pts) Consider the matrix 1 2 3 · · · 20 2 3 4 · · · 21 A= .. .. . . . 19 20 21 · · · 39 Are the columns of A linearly independent? (Explain). We have a theorem which states that a set of p vectors in Rn for p > n is linearly dependent. Note that A has 20 columns and only 19 rows. That means that the 20 column vectors form a set of vectors R19 , and we conclude that they must be linearly dependent. 2 0 2 0 1 0 0 0 0 1 0 0 and U = 0 1 1 0. Find x 5.(10pts) Suppose that A = LU for L = 0 0 2 4 0 2 1 0 1 0 0 1 0 0 0 2 2 2 such that Ax = 2. (Explain). 4 2 2 Let b = 2. Now because A = LU , we can set U x = y, solve Ly = b for 4 y, and then solve U x = y for x. To do this, first row reduce the augmented matrix [L b]. 1 0 0 0 2 1 0 0 0 2 0 1 0 0 2 ↔ 0 1 0 0 2 [L b] = 0 2 1 0 2 0 0 1 0 −2 1 0 0 1 4 0 0 0 1 2 2 2 So y = −2. Now row reduce the augmented matrix [U y]. 2 2 0 2 0 2 1 0 1 0 1 1 0 0 0 4 0 1 1 0 2 ↔ 0 1 1 0 2 ↔ 0 1 0 0 5 . [U y] = 0 0 2 4 −2 0 0 1 2 −1 0 0 1 0 −3 0 0 0 2 2 0 0 0 1 1 0 0 0 1 1 4 5 So we conclude that x = −3. 1 x1 −5x1 + 9x2 −1 6.(10pts) Show that T is invertible and find a formula for T when T = . x2 4x1 − 7x2 (Explain). x1 −5x1 + 9x2 −5 9 x1 Note that T = = . Thus T is a linear x2 4x1 − 7x2 4 −7 x2 −5 9 transformation with standard matrix A = . We have a theorem which 4 −7 −1 −1 says that T will be invertible if A is invertible, in which case T (x) = A x. We a b also have a theorem which says that if A = then A is invertible if and only c d d −b if ad − bc 6= 0, in which case A = . In this particular problem, −c a −7 −9 7 9 1 −1 ad − bc = (−5)(−7) − (4)(9) = −1 is not zero so A = −1 = . −4 −5 4 5 7 9 x1 7x1 + 9x2 A formula for T −1 is thus T −1 (x) = = . 4 5 x2 4x1 + 5x2 −1 1 ad−bc 7.(5pts) Ever striving for the perfect breakfast, you decide to mix Cracklin’ Oat Bran, glue, and toothpaste in your cereal bowl. I remind you that Cracklin’ Oat Bran contained 110 calories, 3 g of protein, 21 g of carbohydrates, and 3 g of fat per 28 g serving. Elmer’s glue contained 110 calories, 2 g of protein, 25 g of carbohydrates, and 0 g of fat per 28 g serving. Finally, toothpaste contains 110 calories, 0 g of protein 23 g of carbohydrates and 1.5 g of fat per 28 gram serving. Set up a matrix equation which you could use to decide if some mixture of these three delectables could supply a serving with 110 calories, 2.25 g of protein, 23 g of carbohydrates, and 1 g of fat. Tell me what each indeterminate you use stands for. You do not need to solve this equation. A matrix equation you can use to decide if some mixture of these three ingredients could supply a serving with the desired properties is 110 110 110 110 x1 3 2 0 x2 = 2.25 , 21 25 23 23 x3 1 3 0 1.5 where x1 is the number of servings of Cracklin’ Oat Bran, x2 is the number of servings of glue, and x3 is the number of servings of toothpaste. 8.(10pts) Suppose that T : Rn → Rm is a linear transformation and {v1 , v2 , v3 } gives a linearly dependent set. Is the set {T (v1 ), T (v2 ), T (v3 )} a linearly dependent set? (Explain). Because the set {v1 , v2 , v3 } is linearly dependent, there exist a, b, c ∈ R not all zero such that av1 + bv2 + cv3 = 0. This means that T (av1 + bv2 + cv3 ) = T (0). Because T is a linear transformation, we know that T (av1 + bv2 + cv3 ) = aT (v1 ) + bT (v2 ) + cT (v3 ) and T (0) = 0 (we proved this second assertion in class). Thus aT (v1 ) + bT (v2 ) + cT (v3 ) = 0 for some a, b, c ∈ R not all zero, so T (v1 ), T (v2 ), and T (v3 ) are linearly dependent. 9.(10pts) Can a square matrix with two identical columns be invertible? (Explain). The Invertible Matrix Theorem tells us that if a square matrix is invertible, then its columns must be linearly independent. If two of the columns are the same, then the columns are clearly dependent. We conclude that the matrix cannot be invertible. E. C. (5pts) Suppose that A is a 4 × 4 matrix, v and u are the vectors 1 −2 2 1 v= 2 , u = 0 , 1 0 and the general solution to the equation Ax = 0 is x4 + x3 x4 − x3 x= x3 . x4 2 4 If Av = u, then is x = 4 a solution to Ax = u? (Explain). 2 We showed in class that any solution to the equation Ax = u can be written as x = p + h where p is any solution to Ax = u and h is a solution to Ax = 0. 2 4 So if x = 4 is a solution to Ax = u, we can write it as 2 2 x4 + x3 2 x4 + x3 1 4 x4 − x3 4 x4 − x3 2 = 4 x3 + v = 4 = x3 + 2 x4 2 2 x4 1 for some x3 and things, this means that there x4 . Rearranging are x3 and x4 1 x4 + x3 1 2 x4 − x3 2 such that 2 = x3 . If this were true, however, v = 2 would be a 1 x4 2 solution to Ax = 0. This cannot happen because we know that Av = u 6= 0. Another see this is that there cannot possible be x4 and x3 making way to 1 x4 + x3 2 x4 − x3 = 2 x3 (by the last two equations, x4 = 1 and x3 = 2, but then 1 x4 x4 + x3 = 3 6= 1).