253Solutions4

# Linear Algebra with Applications (3rd Edition)

This preview shows pages 1–4. Sign up to view the full content.

ma253 ,Fa l l 2007 — Problem Set 4 Solutions 1. Problems from the textbook: a. Section 2 . 3 1 The inverse is ± 8 - 3 - 52 ² . *2 The matrix is not invertible. *4 The inverse is 3 2 - 1 1 2 1 2 0 - 1 2 - 3 2 1 1 2 . *12 Hard to do by hand; doing it with the calculator is fne. You should have gotten 5 - 20 - 27 0 - 10 0 - 26 1 2 030 1 . 29 Row-reducing the matrix gives 2 - k 01 k - 1 00k 2 - 3k + 2 , so that the matrix is invertible iF and only iF k 2 - 3k + 2 6 = 0 , i.e., iF k 6 = 1 and k 6 = 2 . *30 Row-reducing the matrix gives - c 01 b 00 0 , so this is not invertible For any values oF b and c . 31 You have to consider separately the case when a 6 = 0 and the case when a = 0 , because otherwise you can’t row-reduce. IF a 6 = 0 , the rreF Form oF the matrix is - c a b a , He may look like an idiot and talk like an idiot but don’t let that Fool you. He really is an idiot. – Groucho Marx

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
so that the matrix is not invertible in this case. On the other hand, when a = 0 , after one row-reduction step we get - b - c0 00 c b , so the rref can’t have a pivot in the second column, and again we see that the matrix is not invertible. So the matrix in question is never invertible. *34 The matrix A is invertible if and only if none of a , b , c is zero, and then the inverse is 1 a 0 1 b 0 1 c . The general case is the same: an n × n diagonal matrix is invertible if and only if none of the diagonal entries a 11 , a 22 ,..., a nn is zero, and then the inverse will be a diagonal matrix whose entries are the reciprocals 1/a ii . *43 We basically did this in class: the transformation that sends ~ x to A ( B ~ x ) is the one that corresponds to the matrix AB . So the problem is asking us to Fnd ( AB ) - 1 (under the assumption that both A and B are invertible). We know that ( AB ) - 1 = B - 1 A - 1 , and that is the answer to the problem, i.e., ~ x = B - 1 ( A - 1 ~ y ) . b. Section 2 . 4 31 The problem has inFnitely many solutions, as we can see by row-reducing the appropriate matrix. The solutions are: 2 + t - 1 + s - 1 - 2t 1 - s ts , where t and s can be arbitrary. *32 The equation B ~ x = ~ 0 unpacks into a homogeneous linear system with three unknowns and two equations. We showed, early in the game, that such systems always have inFnitely many solutions, soinpa r t icu la rtheremus tbeanon -zero solution ~ x 0 . Now, if AB = I 3 ,wewou ldhave ~ x 0 = I 3 ~ x 0 = AB ~ x 0 = A ( B ~ x 0 )= A ~ 0 = ~ 0, which contradicts the fact that ~ x 0 is not zero. Hence, it is impossible for AB to be equal to I 3 . When a true genius appears in the world, you may know him by this sign, that the dunces are all in confederacy against him. – Jonathan Swift
33 Since an invertible matrix must yield a one-to-one transformation, it can’t send any non-zero vectors to zero. Now repeat the same proof as in 32.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This homework help was uploaded on 01/23/2008 for the course MATH 253 taught by Professor Ghitza during the Spring '07 term at Colby.

### Page1 / 9

253Solutions4 - ma253, Fall 2007 - Problem Set 4 Solutions...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online