Demonstration 1.
Edit and re-run the next cell, using several different columns of the identity matrix. Compare the solution vectors with the columns of the inverse of A
above.
📚 The CoCalc Library - books, templates and other resources
Important: to view this notebook properly you will need to execute the cell above, which assumes you have an Internet connection. It should already be selected, or place your cursor anywhere above to select. Then press the "Run" button in the menu bar above (the right-pointing arrowhead), or press Shift-Enter on your keyboard.
ParseError: KaTeX parse error: \newcommand{\lt} attempting to redefine \lt; use \renewcommand
An invertible matrix.
Building the inverse, now column by column, by solving systems of equations with the vector of constants equal to columns of an identity matrix.
Edit and re-run the next cell, using several different columns of the identity matrix. Compare the solution vectors with the columns of the inverse of A
above.
Consolidating the above as the following illustrates Theorem CINM and its proof.
Now, a non-invertible matrix.
Edit and re-run the next cell, using several different columns of the identity matrix, in attempts to construct columns of the inverse. Just one of these failures is enough to be certain that A
does not have an inverse, following the logic of Example MWIAA.
It is the case that no column of the identity matrix leads to a consistent system (for this matrix). We can see all six systems with a computation reminiscent of Theorem CINM.
You might struggle to find any vector of constants that will combine with C
to be a consistent systems. (Though there are some. And I can think of seven that are real easy to find if you think about it a bit.)
Do you see the fundamental difference between the matrices A
and B
?
This work is Copyright 2016–2019 by Robert A. Beezer. It is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.