Matrix Inverses
Inverse
Let
The inverse of
To see what a matrix inverse represents, see Inverse Linear Transformations.
Do not write
Given
Then
Inverse Existence
Let
Show
Since
(see zero vector)
so
Show
Since
so
Finally, since
A matrix must be full rank, otherwise it squishes some vectors into a lower dimension. You cannot "unsquish" these vectors, since the linear transformation would no longer be a function (each input would have multiple outputs).
Inverse Uniqueness
We prove the uniqueness of an inverse
Assume
Hence, if
Matrix Inversion Algorithm
Consider
Thus
We have three systems of equations with the same coefficient matrix, so we construct an augmented matrix
(Since
We must consider 2 cases:
- If the RREF of
is , then where is the result of Gauss-Jordan elimination on .
From this, we see that Hence So - Else
, and is not invertible, since if were invertible, it would have by the "inverse existence" theorem
For
- If the RREF of
is for some : - Else:
is not invertible
If an inverse is found, you can check to ensure that
Given
Find
Notice how we started with the identity matrix as the coefficient matrix. and ended with the identity matrix as the constant matrix.
We conclude that
Given
Find
We see that the RREF of
Properties of Matrix Inverses
Let
(see transpose) (think about it)
Let
- Left cancellation:
- Right cancellation:
Invertible Matrix Theorem
Let
is invertible- The RREF of
is - For all
, the system is consistent, and has a unique solution is invertible (see transpose) (see null space)- The columns of
form a linearly independent set - The columns of
span (see column space)- The rows of
form a linearly independent set - The rows of
span (see row space)