The algorithm for computing determinants of square matrices will be given inductively on the size of the matrix. That is, we will find determinants of large matrices by computing the determinants of several smaller “sub-matrices”. In the smallest case, , the determinant is “equal” to the matrix, since there is only one coefficient. We also know the determinant of a matrix (Definition 4.1.1). Before giving the full definition, let us first state the formula for the determinant of a matrix.
Let . Then,
It is a good exercise to check that the following holds, which expresses the determinant in terms of three determinants:
This rearranged expression is called the expansion of about the first row of . An analogous formula will be used to define determinants, and higher. Let us point out two things about this expression:
The signs alternate, () and
each element is multiplied by the determinant of the matrix obtained by crossing out the row and column containing that element.
For example, the coefficient of multiplies the determinant
which is obtained by excluding the first row and second column of .
To define determinants for larger matrices, we will make use of the following notation. If , then is the matrix obtained by deleting the -th row and -th column.
Example 4.2.3.
As an example of this notation, let . Then we have
One could also check that the following expression holds:
This is called the expansion of about the first column, analogous to the situation above. For example, the third matrix is obtained from by deleting the row and column containing .
Now we are ready to inductively define the determinant and cofactor for any size matrix. Since we already have a definition of a determinant of a size 2 matrix (), we will use that to define the determinant of a size 3 matrix, and then use that to define the determinant of size 4, etc.
Let , and let . Assume that the determinant of any matrix is defined.
The determinant of is
This is the expansion of about the first row of . Equivalently, we can expand about any row or any column. That is, for any given , we have
This expansion of the determinant in terms of its cofactors is called a cofactor expansion.
We will also call (without the sign ) the minor of the coefficient .
One can check that the computation of for a matrix of size or matches that obtained using Definitions 4.1.1 and 4.2.1.
Example 4.2.7.
Let , let’s compute the determinant of , by using the cofactor expansion of the first row. First we compute the cofactors of the coefficients of the first row, and as follows:
The cofactor expansion tells us that determinant of is
The sign showing up in the cofactor may be remembered using the “chess-board” pattern:
In particular, note that the sign of the cofactor of a diagonal coefficient is always positive. Hence, such a cofactor is always equal to its minor.
Example 4.2.9.
It is a good exercise to check that in the case, it doesn’t matter which row or column we choose to expand, the resulting expression is always the same as Definition 4.2.1. For example, given the following matrix, expand the second column:
Recall that refers to the cofactor, . So the above expression becomes
Example 4.2.10.
Now let us consider a matrix. We will shortly come back to this same example in order to see how the computation of determinants can be simplified further.
Since can be computed by expanding about any row or column of , let us take the “easiest one”. As the third row has only two non-zero terms, let us expand about it. So, we get
So we have reduced the computation to two determinants, call them and . Expanding both of them about their first columns, we get
So the determinant of the matrix is equal to 6.