Recall that the inverse of a square matrix , is another square matrix such that , where is the identity matrix. Here is a field, such as . One can prove that if an inverse matrix exists then it is unique, so we are allowed to call it the inverse (see also Exercise 1.22), and we usually denote it by . If has an inverse, then we say it is invertible.
Let be a field. If , then is invertible if and only if .
We will not recall the definition of the determinant here. For that, see the MATH105 course notes.
When , the above theorem should be familiar. But consider what it says when . It says that the inverse matrix always has coefficients in the rational numbers, if your original matrix had only coefficients in the rational numbers. If you consider the steps involved during the algorithm for inverting matrices, this should come as no surprise.
Find the inverse of the matrix .
Solution: We make the augmented matrix , and find its reduced row echelon form, using e.r.o.’s (details not shown).
Then the matrix on the far right is the inverse of . Since it is easy to make a mistake, it is always worth checking:
Notice that had all coefficients in , and therefore must also have all coefficients in (and it does).
For the field of integers modulo 5, from Exercise 1.2, find the inverse of the matrix . Note your answer must be a matrix whose entries are in the field . Check your answer is correct by multiplying .
[End of Exercise]
Recall from MATH105 that for a matrix , the entries are collectively called the diagonal of the matrix. Also, is called a diagonal matrix if whenever . The matrix is called upper triangular (respectively lower triangular) if the only non-zero entries occur on or above (resp. below) the diagonal. We will use the same terminology for matrices with coefficients in any field.
Consider the following matrices in :
If , which of these matrices are diagonal? Upper triangular? Lower triangular?
If (see Exercise 1.2), how do your answers above change?
[End of Exercise]