* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Math 310, Lesieutre Problem set #7 October 14, 2015 Problems for
Orthogonal matrix wikipedia , lookup
Cross product wikipedia , lookup
Determinant wikipedia , lookup
Non-negative matrix factorization wikipedia , lookup
Gaussian elimination wikipedia , lookup
Perron–Frobenius theorem wikipedia , lookup
Jordan normal form wikipedia , lookup
Exterior algebra wikipedia , lookup
Eigenvalues and eigenvectors wikipedia , lookup
Matrix multiplication wikipedia , lookup
Singular-value decomposition wikipedia , lookup
Laplace–Runge–Lenz vector wikipedia , lookup
Cayley–Hamilton theorem wikipedia , lookup
System of linear equations wikipedia , lookup
Euclidean vector wikipedia , lookup
Vector space wikipedia , lookup
Covariance and contravariance of vectors wikipedia , lookup
Math 310, Lesieutre Problem set #7 October 14, 2015 Problems for M 10/5: 3.3.1 Use Cramer’s rule to solve 5x1 + 7x2 = 3, 2x1 + 4x2 = 1. We have 5 7 A= , 2 4 3 b= . 1 Note det A = 6. According to Cramer’s rule, 3 7 1 4 5 det A1 (b) = = . x1 = det A 6 6 5 3 2 1 1 det A2 (b) = =− . x2 = det A 6 6 3.3.7 Determine the values of s for which the system has a unique solution, and describe the solution: 6sx1 + 4x2 = 5 9x1 + 2sx2 = −2. This is another one for Cramer’s rule. Use 6s 4 A= , 9 2s 5 b= . −2 This time det A = 12s2 − 36. 5 4 −2 2s det A1 (b) 10s + 8 = = . x1 = 2 det A 12s − 36 12s2 − 36 6s 5 9 −2 det A2 (b) 12s + 45 x2 = = =− . 2 det A 12s − 36 12s2 − 36 √ There’s a unique solution as long as 12s2 − 36 is not 0, which is to say that s 6= ± 3. The solution then is what it says above. 3.3.11 Find the adjugate of the given matrix and use it to find the inverse: 0 −2 −1 0 0 A= 5 −1 1 1 (We didn’t define the adjugate in class, though we got close: take a look at page 181.) The minors we need are 0 0 1 1 = 0 −2 −1 = −1 1 1 −2 −1 =0 0 0 5 0 −1 1 = 5 0 −1 −1 1 = −1 0 −1 5 0 = 5 To get the adjugate, with stick these guys in − signs, then take the transpose. 0 adj(A) = −5 5 5 0 −1 1 = 5 0 −2 −1 1 = −2 0 −2 5 0 = 10 a grid with the usual alternating + and 1 0 −1 −5 2 10 To find the inverse, we need to know det A. Expanding by cofactors in the second row, that’s −2 −1 = (−5)(−1) = 5. −5 1 1 So 1 0 0 5 = −1 − 15 −1 . 2 1 2 5 A−1 3.3.20 Find the area of the parallelogram with vertices (0, 0), (2, −4), (4, −5), and (2, −1) Remember that determinant gives the area of a parallelogram (taking absolute value, anyway). The area we’re after is 2 2 = 6. area = −4 −1 3.3.29 Find a formula for the area of the triangle whose vertices are 0, v1 = (a, b), and v2 = (c, d) in R2 . The triangle is half of the parallelogram with legs those vectors, so 1 a b ad − bc area = = . 2 c d 2 Problems for W 10/7: 4.1.1 Let V be the first quadrant in the xy-plane, that is the set of all vectors (x, y) with x ≥ 0 and y ≥ 0. In set notation, this is: x V = : x ≥ 0, y ≥ 0 . y (a) If u and v are in V , is u + v in V ? Yes, it is: if you add two vectors where both of the entries are positive, the sum has both entries positive. (b) Find a specific vector u in V and a specific scalar c such that cu is not in V . (This is enough to show that V is not a vector space.) Take 1 v= . 1 and c = −1. Then −1 cv = , −1 which isn’t in V . But this means that V isn’t a subspace. 4.1.3 Let H be the set of points inside and on the unit circle in the xy-plane: x 2 2 H= :x +y ≤1 . y Find a specific example – two vectors or a vector and a scalar – to show that H is not a subspace of R2 . Take 1/2 v= . 1/2 Then v is in V because (1/2)2 + (1/2)2 = 1/2. Set c = 2. Then 1 cv = , 1 which isn’t in V because 12 + 12 = 2 > 1. This means that V isn’t a subspace. 4.1.5 Let P2 be the vector space of polynomials of degree at most 2. Is the set of polynomials of the form at2 a subset of P2 (where a is a scalar?) It is a subspace. We have (at2 ) + (bt2 ) = (a + b)t2 , which is also of the required form. So the set is closed under addition. Also, c(at2 ) = (ac)t2 , as needed. 4.1.7 Let P2 be the vector space of polynomials of degree at most 3. Is the set of all polynomials with integers as coefficients a subspace? Nope this one isn’t a subspace. Take the vector v = t3 , which has integer coefficients. Take c = 1/2. Then cv = t3 /2, which doesn’t have integers as coefficients. Problems for F 10/9: 5b + 2c 4.1.11 Let W be the set of all vectors of the form b . Find vectors u and v such that c W = span(u, v). Why does this show that W is a subspace of Rn ? This is the span of 5 u = 1 , 0 since 2 v = 0 , 1 5 2 5b + 2c bu + cv = b 1 + c 0 = b . 0 1 c It shows that W is a subspace because the span of any set of vectors is always a subspace. 4.2.4 Find an explicit description of the nullspace of the following matrix by listing a set of vectors that span the nullspace: 1 −6 4 0 A= 0 0 2 0 We want to find the general solution in parametric vector form, and then take the vectors that show up here. These span the set (in fact, they’re a basis for the nullspace in the lingo from this week). We need to get to rref: 1 −6 4 0 1 −6 0 0 1 −6 0 0 → → . 0 0 2 0 0 0 2 0 0 0 1 0 The variables x2 and x4 are free, and x1 = 6x2 and x3 = 0. The parametric vector form is 0 x1 6 0 x2 1 = s + t . 0 x3 0 1 x4 0 A basis for the nullspace is 6 1 u= 0 , 0 0 0 v= 0 . 1 4.2.7 Explain why the following set either is or is not a vector space: a b : a + b + c = 2 c 2 This is not a vector space. For example, v = 0 is in the space, since 2 + 0 + 0 = 2. 0 14 But if we multiply by the scalar 7, we get 7v = 0 , which isn’t, since 14 + 0 + 0 6= 2. 0 So the set in question is not closed under multiplication by scalars (in fact it isn’t closed under addition, either.) 4.2.15 Find a matrix A such that the given set is the column space of A. 2s + 3t r + s − 2t : r, s, t are scalars . 4r + s 3r − s − t This is a lot like the one we just did. 0 2 3 1 1 −2 . A= 4 1 0 3 −1 −1 4.2.17 For what value of k is Nul(A) a subspace of Rk ? For what value of k is Col(A) a subspace of Rk ? 2 −6 −1 3 A= −4 12 . 3 −9 Remember that for a m × n matrix, the nullspace is a subspace of Rn (the number of columns), while the column space is a subspace of Rm (the number of rows). This matrix is 4×2, so the nullspace is a subspace of R2 , and the column space is a subspace of R4 . (Once you get to the bottom of things, this problem is really just asking you what the dimensions of the matrix are.)