Lecture 17 · Week 5· 15:57
The invertible matrix theorem
Elementary matrices, equivalent conditions for invertibility.
Video: coming soon
The lecture (15:57) is not published yet. It will play right here as soon as it is on YouTube.
Saved in this browser only. No account needed.
In this lecture
- Today: many questions, one answer
- Elementary matrices
- Row operations are multiplications
- Undoing an elementary matrix
- Why Gauss–Jordan inversion works
- An example
- The invertible matrix theorem
- Proof: the main loop
- Proof: the other statements
- Using the theorem
- Summary
Materials
Check yourself
Try it before you look
- Write down the elementary matrix of and its inverse, and check that with Theorem 3.6.3.
- Let over . Find elementary matrices with , and write both and as products of elementary matrices.
- Let be . True or false? (i) If has two different solutions, then the columns of do not span . (ii) If has a solution, then is invertible.
Work it out on paper first. Then open the hint if you are stuck, and the answer to check.
1Hint
Everything you need is in Section 3.6 of the course book. Open it at page 38 of the chapter PDF; any theorem the question names is stated there, with an example worked the same way.
2Answer
- , and is the matrix of the reverse operation (Theorem 3.6.6). By Theorem 3.6.3, is after : row becomes , so .
- gives rows , ; gives , ; gives . So , , , and by Theorem 3.6.8 (the formula agrees: ), while .
- (i) True. If with , then with , so statement (3) of Theorem 3.6.10 fails, and so does (8). (ii) False. has , but its second column is zero, so its columns are dependent and is not invertible. Statement (7) asks for a solution for every , not just one.
3How did it go?