## SectionDMDeterminant of a Matrix

Before we define the determinant of a matrix, we take a slight detour to introduce elementary matrices. These will bring us back to the beginning of the course and our old friend, row operations.

### SubsectionEMElementary Matrices

Elementary matrices are very simple, as you might have suspected from their name. Their purpose is to effect row operations (Definition RO) on a matrix through matrix multiplication (Definition MM). Their definitions look much more complicated than they really are, so be sure to skip over them on your first reading and head right for the explanation that follows and the first example.

#### DefinitionELEM.Elementary Matrices.

1. For $$i\neq j\text{,}$$ $$\elemswap{i}{j}$$ is the square matrix of size $$n$$ with

\begin{equation*} \matrixentry{\elemswap{i}{j}}{k\ell}= \begin{cases} 0 & k\neq i, k\neq j, \ell\neq k\\ 1 & k\neq i, k\neq j, \ell=k\\ 0 & k=i, \ell\neq j\\ 1 & k=i, \ell=j\\ 0 & k=j, \ell\neq i\\ 1 & k=j, \ell=i \end{cases}\text{.} \end{equation*}

2. For $$\alpha\neq 0\text{,}$$ $$\elemmult{\alpha}{i}$$ is the square matrix of size $$n$$ with

\begin{equation*} \matrixentry{\elemmult{\alpha}{i}}{k\ell}= \begin{cases} 0 & \ell\neq k\\ 1 & k\neq i, \ell=k\\ \alpha & k=i, \ell=i \end{cases}\text{.} \end{equation*}

3. For $$i\neq j\text{,}$$ $$\elemadd{\alpha}{i}{j}$$ is the square matrix of size $$n$$ with

\begin{equation*} \matrixentry{\elemadd{\alpha}{i}{j}}{k\ell}= \begin{cases} 0 & k\neq j, \ell\neq k\\ 1 & k\neq j, \ell=k\\ 0 & k=j, \ell\neq i, \ell\neq j\\ 1 & k=j, \ell=j\\ \alpha & k=j, \ell=i\\ \end{cases}\text{.} \end{equation*}

Again, these matrices are not as complicated as their definitions suggest, since they are just small perturbations of the $$n\times n$$ identity matrix (Definition IM). $$\elemswap{i}{j}$$ is the identity matrix with rows $$i$$ and $$j$$ trading places, $$\elemmult{\alpha}{i}$$ is the identity matrix where the diagonal entry in row $$i$$ and column $$i$$ has been replaced by $$\alpha\text{,}$$ and $$\elemadd{\alpha}{i}{j}$$ is the identity matrix where the entry in row $$j$$ and column $$i$$ has been replaced by $$\alpha\text{.}$$ (Yes, those subscripts look backwards in the description of $$\elemadd{\alpha}{i}{j}$$). Notice that our notation makes no reference to the size of the elementary matrix, since this will always be apparent from the context, or unimportant.

The raison d'etre for elementary matrices is to “do” row operations on matrices with matrix multiplication. So here is an example where we will both see some elementary matrices and see how they accomplish row operations when used with matrix multiplication.

We will perform a sequence of row operations (Definition RO) on the $$3\times 4$$ matrix $$A\text{,}$$ while also multiplying the matrix on the left by the appropriate $$3\times 3$$ elementary matrix.

\begin{equation*} A= \begin{bmatrix} 2 & 1 & 3 & 1\\ 1 & 3 & 2 & 4\\ 5 & 0 & 3 & 1 \end{bmatrix} \end{equation*}
\begin{align*} \rowopswap{1}{3}:\ & \begin{bmatrix} 5 & 0 & 3 & 1\\ 1 & 3 & 2 & 4\\ 2 & 1 & 3 & 1 \end{bmatrix} & \elemswap{1}{3}:\ & \begin{bmatrix} 0 & 0 & 1\\ 0 & 1 & 0\\ 1 & 0 & 0 \end{bmatrix} \begin{bmatrix} 2 & 1 & 3 & 1\\ 1 & 3 & 2 & 4\\ 5 & 0 & 3 & 1 \end{bmatrix} = \begin{bmatrix} 5 & 0 & 3 & 1\\ 1 & 3 & 2 & 4\\ 2 & 1 & 3 & 1 \end{bmatrix}\\ \rowopmult{2}{2}:\ & \begin{bmatrix} 5 & 0 & 3 & 1\\ 2 & 6 & 4 & 8\\ 2 & 1 & 3 & 1 \end{bmatrix} & \elemmult{2}{2}:\ & \begin{bmatrix} 1 & 0 & 0\\ 0 & 2 & 0\\ 0 & 0 & 1 \end{bmatrix} \begin{bmatrix} 5 & 0 & 3 & 1\\ 1 & 3 & 2 & 4\\ 2 & 1 & 3 & 1 \end{bmatrix} = \begin{bmatrix} 5 & 0 & 3 & 1\\ 2 & 6 & 4 & 8\\ 2 & 1 & 3 & 1 \end{bmatrix}\\ \rowopadd{2}{3}{1}:\ & \begin{bmatrix} 9 & 2 & 9 & 3\\ 2 & 6 & 4 & 8\\ 2 & 1 & 3 & 1 \end{bmatrix} & \elemadd{2}{3}{1}:\ & \begin{bmatrix} 1 & 0 & 2\\ 0 & 1 & 0\\ 0 & 0 & 1 \end{bmatrix} \begin{bmatrix} 5 & 0 & 3 & 1\\ 2 & 6 & 4 & 8\\ 2 & 1 & 3 & 1 \end{bmatrix} = \begin{bmatrix} 9 & 2 & 9 & 3\\ 2 & 6 & 4 & 8\\ 2 & 1 & 3 & 1 \end{bmatrix} \end{align*}

The next three theorems establish that each elementary matrix effects a row operation via matrix multiplication.

In each of the three conclusions, performing the row operation on $$A$$ will create the matrix $$B$$ where only one or two rows will have changed. So we will establish the equality of the matrix entries row by row, first for the unchanged rows, then for the changed rows, showing in each case that the result of the matrix product is the same as the result of the row operation. Here we go.

Row $$k$$ of the product $$\elemswap{i}{j}A\text{,}$$ where $$k\neq i\text{,}$$ $$k\neq j\text{,}$$ is unchanged from $$A\text{,}$$

\begin{align*} \matrixentry{\elemswap{i}{j}A}{k\ell} &=\sum_{p=1}^{n}\matrixentry{\elemswap{i}{j}}{kp}\matrixentry{A}{p\ell}&& \knowl{./knowl/theorem-EMP.html}{\text{Theorem EMP}}\\ &=\matrixentry{\elemswap{i}{j}}{kk}\matrixentry{A}{k\ell}+ \sum_{\substack{p=1\\p\neq k}}^{n}\matrixentry{\elemswap{i}{j}}{kp}\matrixentry{A}{p\ell}&& \knowl{./knowl/property-CACN.html}{\text{Property CACN}}\\ &=1\matrixentry{A}{k\ell}+ \sum_{\substack{p=1\\p\neq k}}^{n}0\matrixentry{A}{p\ell}&& \knowl{./knowl/definition-ELEM.html}{\text{Definition ELEM}}\\ &=\matrixentry{A}{k\ell}\text{.} \end{align*}

Row $$i$$ of the product $$\elemswap{i}{j}A$$ is row $$j$$ of $$A\text{,}$$

\begin{align*} \matrixentry{\elemswap{i}{j}A}{i\ell} &=\sum_{p=1}^{n}\matrixentry{\elemswap{i}{j}}{ip}\matrixentry{A}{p\ell}&& \knowl{./knowl/theorem-EMP.html}{\text{Theorem EMP}}\\ &=\matrixentry{\elemswap{i}{j}}{ij}\matrixentry{A}{j\ell}+ \sum_{\substack{p=1\\p\neq j}}^{n}\matrixentry{\elemswap{i}{j}}{ip}\matrixentry{A}{p\ell}&& \knowl{./knowl/property-CACN.html}{\text{Property CACN}}\\ &=1\matrixentry{A}{j\ell}+ \sum_{\substack{p=1\\p\neq j}}^{n}0\matrixentry{A}{p\ell}&& \knowl{./knowl/definition-ELEM.html}{\text{Definition ELEM}}\\ &=\matrixentry{A}{j\ell}\text{.} \end{align*}

Row $$j$$ of the product $$\elemswap{i}{j}A$$ is row $$i$$ of $$A\text{,}$$

\begin{align*} \matrixentry{\elemswap{i}{j}A}{j\ell} &=\sum_{p=1}^{n}\matrixentry{\elemswap{i}{j}}{jp}\matrixentry{A}{p\ell}&& \knowl{./knowl/theorem-EMP.html}{\text{Theorem EMP}}\\ &=\matrixentry{\elemswap{i}{j}}{ji}\matrixentry{A}{i\ell}+ \sum_{\substack{p=1\\p\neq i}}^{n}\matrixentry{\elemswap{i}{j}}{jp}\matrixentry{A}{p\ell}&& \knowl{./knowl/property-CACN.html}{\text{Property CACN}}\\ &=1\matrixentry{A}{i\ell}+\sum_{\substack{p=1\\p\neq i}}^{n}0\matrixentry{A}{p\ell}&& \knowl{./knowl/definition-ELEM.html}{\text{Definition ELEM}}\\ &=\matrixentry{A}{i\ell}\text{.} \end{align*}

So the matrix product $$\elemswap{i}{j}A$$ is the same as the row operation that swaps rows $$i$$ and $$j\text{.}$$

Row $$k$$ of the product $$\elemmult{\alpha}{i}A\text{,}$$ where $$k\neq i\text{,}$$ is unchanged from $$A\text{,}$$

\begin{align*} \matrixentry{\elemmult{\alpha}{i}A}{k\ell} &=\sum_{p=1}^{n}\matrixentry{\elemmult{\alpha}{i}}{kp}\matrixentry{A}{p\ell}&& \knowl{./knowl/theorem-EMP.html}{\text{Theorem EMP}}\\ &=\matrixentry{\elemmult{\alpha}{i}}{kk}\matrixentry{A}{k\ell}+ \sum_{\substack{p=1\\p\neq k}}^{n}\matrixentry{\elemmult{\alpha}{i}}{kp}\matrixentry{A}{p\ell}&& \knowl{./knowl/property-CACN.html}{\text{Property CACN}}\\ &=1\matrixentry{A}{k\ell}+\sum_{\substack{p=1\\p\neq k}}^{n}0\matrixentry{A}{p\ell}&& \knowl{./knowl/definition-ELEM.html}{\text{Definition ELEM}}\\ &=\matrixentry{A}{k\ell}\text{.} \end{align*}

Row $$i$$ of the product $$\elemmult{\alpha}{i}A$$ is $$\alpha$$ times row $$i$$ of $$A\text{,}$$

\begin{align*} \matrixentry{\elemmult{\alpha}{i}A}{i\ell} &=\sum_{p=1}^{n}\matrixentry{\elemmult{\alpha}{i}}{ip}\matrixentry{A}{p\ell}&& \knowl{./knowl/theorem-EMP.html}{\text{Theorem EMP}}\\ &=\matrixentry{\elemmult{\alpha}{i}}{ii}\matrixentry{A}{i\ell}+ \sum_{\substack{p=1\\p\neq i}}^{n}\matrixentry{\elemmult{\alpha}{i}}{ip}\matrixentry{A}{p\ell}&& \knowl{./knowl/property-CACN.html}{\text{Property CACN}}\\ &=\alpha\matrixentry{A}{i\ell}+\sum_{\substack{p=1\\p\neq i}}^{n}0\matrixentry{A}{p\ell}&& \knowl{./knowl/definition-ELEM.html}{\text{Definition ELEM}}\\ &=\alpha\matrixentry{A}{i\ell}\text{.} \end{align*}

So the matrix product $$\elemmult{\alpha}{i}A$$ is the same as the row operation that swaps multiplies row $$i$$ by $$\alpha\text{.}$$

Row $$k$$ of the product $$\elemadd{\alpha}{i}{j}A\text{,}$$ where $$k\neq j\text{,}$$ is unchanged from $$A\text{,}$$

Row $$j$$ of the product $$\elemadd{\alpha}{i}{j}A\text{,}$$ is $$\alpha$$ times row $$i$$ of $$A$$ and then added to row $$j$$ of $$A\text{,}$$

So the matrix product $$\elemadd{\alpha}{i}{j}A$$ is the same as the row operation that multiplies row $$i$$ by $$\alpha$$ and adds the result to row $$j\text{.}$$

Later in this section we will need two facts about elementary matrices.

We show that we can row-reduce each elementary matrix to the identity matrix. Given an elementary matrix of the form $$\elemswap{i}{j}\text{,}$$ perform the row operation that swaps row $$j$$ with row $$i\text{.}$$ Given an elementary matrix of the form $$\elemmult{\alpha}{i}\text{,}$$ with $$\alpha\neq 0\text{,}$$ perform the row operation that multiplies row $$i$$ by $$1/\alpha\text{.}$$ Given an elementary matrix of the form $$\elemadd{\alpha}{i}{j}\text{,}$$ with $$\alpha\neq 0\text{,}$$ perform the row operation that multiplies row $$i$$ by $$-\alpha$$ and adds it to row $$j\text{.}$$ In each case, the result of the single row operation is the identity matrix. So each elementary matrix is row-equivalent to the identity matrix, and by Theorem NMRRI is nonsingular.

Notice that we have now made use of the nonzero restriction on $$\alpha$$ in the definition of $$\elemmult{\alpha}{i}\text{.}$$ One more key property of elementary matrices.

Since $$A$$ is nonsingular, it is row-equivalent to the identity matrix by Theorem NMRRI, so there is a sequence of $$t$$ row operations that converts $$I$$ to $$A\text{.}$$ For each of these row operations, form the associated elementary matrix from Theorem EMDRO and denote these matrices by $$E_1,\,E_2,\,E_3,\,\dots,\,E_t\text{.}$$ Applying the first row operation to $$I$$ yields the matrix $$E_1I\text{.}$$ The second row operation yields $$E_2(E_1I)\text{,}$$ and the third row operation creates $$E_3E_2E_1I\text{.}$$ The result of the full sequence of $$t$$ row operations will yield $$A\text{,}$$ so

\begin{equation*} A= E_t\dots E_3E_2E_1I= E_t\dots E_3E_2E_1\text{.} \end{equation*}

Other than the cosmetic matter of re-indexing these elementary matrices in the opposite order, this is the desired result.

#### SageEM.Elementary Matrices.

Each of the three types of elementary matrices can be constructed easily, with syntax similar to methods for performing row operations on matrices. Here we have three $$4\times 4$$ elementary matrices, in order: $$\elemswap{1}{3}\text{,}$$ $$\elemmult{7}{2}\text{,}$$ $$\elemadd{9}{2}{4}\text{.}$$ Notice the change in numbering on the rows, and the order of the parameters.

A = elementary_matrix(QQ, 4, row1=0, row2=2); A

A = elementary_matrix(QQ, 4, row1=1, scale=7); A

A = elementary_matrix(QQ, 4, row1=3, row2=1, scale=9); A


Notice that row1is always the row that is being changed. The keywords can be removed, but the scalekeyword must be used to create the second type of elementary matrix, to avoid confusion with the first type.

We can illustrate some of the results of this section with two examples. First, we convert a matrix into a second matrix which is row-equivalent, and then accomplish the same thing with matrix multiplication and a product of elementary matrices.

A = matrix(QQ, [[6, -2, 3, -2],
[3,  3, 1,  8],
[4,  0, 5,  4]])
B = copy(A)
B.swap_rows(0,2)
E1 = elementary_matrix(QQ, 3, row1=0, row2=2)
B.rescale_row(1, 5)
E2 = elementary_matrix(QQ, 3, row1=1, scale=5)
E3 = elementary_matrix(QQ, 3, row1=1, row2=0, scale=-3)
B

E3*E2*E1*A

B == E3*E2*E1*A

R = E3*E2*E1
R.is_singular()

R


The matrix R, the product of three elementary matrices, can be construed as the collective effect of the three row operations employed. With more row operations, Rmight look even less like an identity matrix. As the product of nonsingular matrices (Theorem EMN), Ris nonsingular (Theorem NPNT).

The matrix Babove is not in reduced row-echelon form (it was just row-equivalent to A). What if we were to begin with a matrix and track all of the row operations required to bring the matrix to reduced row-echelon form? As above, we could form the associated elementary matrices and form their product, creating a single matrix Rthat captures all of the row operations.

It turns out we have already done this. Extended echelon form is the subject of Theorem PEEF, whose second conclusion says that $$B=JA\text{,}$$ where $$A$$ is the original matrix, and $$B$$ is the row-equivalent matrix in reduced row-echelon form. Then $$J$$ is a square nonsingular matrix that is the product of the sequence of elementary matrices associated with the sequence of row operations converting $$A$$ into $$B\text{.}$$ There may be many, many different sequences of row operations that convert $$A$$ to $$B\text{,}$$ but the requirement that extended echelon form be in reduced row-echelon form guarantees that $$J$$ is unique.

### SubsectionDDDefinition of the Determinant

We will now turn to the definition of a determinant and do some sample computations. The definition of the determinant function is recursive, that is, the determinant of a large matrix is defined in terms of the determinant of smaller matrices. To this end, we will make a few definitions.

#### DefinitionSM.SubMatrix.

Suppose that $$A$$ is an $$m\times n$$ matrix. Then the submatrix $$\submatrix{A}{i}{j}$$ is the $$(m-1)\times (n-1)$$ matrix obtained from $$A$$ by removing row $$i$$ and column $$j\text{.}$$

For the matrix

\begin{equation*} A= \begin{bmatrix} 1 & -2 & 3 & 9\\ 4 & -2 & 0 & 1\\ 3 & 5 & 2 & 1 \end{bmatrix} \end{equation*}

we have the submatrices

\begin{align*} \submatrix{A}{2}{3} = \begin{bmatrix} 1 & -2 & 9\\ 3 & 5 & 1 \end{bmatrix}&& \submatrix{A}{3}{1} = \begin{bmatrix} -2 & 3 & 9\\ -2 & 0 & 1 \end{bmatrix}\text{.} \end{align*}

#### DefinitionDM.Determinant of a Matrix.

Suppose $$A$$ is a square matrix. Then its determinant, $$\detname{A}=\detbars{A}\text{,}$$ is an element of $$\complexes$$ defined recursively by:

1. If $$A$$ is a $$1\times 1$$ matrix, then $$\detname{A}=\matrixentry{A}{11}\text{.}$$

2. If $$A$$ is a matrix of size $$n$$ with $$n\geq 2\text{,}$$ then

\begin{align*} \detname{A}&= \matrixentry{A}{11}\detname{\submatrix{A}{1}{1}} -\matrixentry{A}{12}\detname{\submatrix{A}{1}{2}} +\matrixentry{A}{13}\detname{\submatrix{A}{1}{3}}-\\ &\quad \matrixentry{A}{14}\detname{\submatrix{A}{1}{4}} +\cdots +(-1)^{n+1}\matrixentry{A}{1n}\detname{\submatrix{A}{1}{n}}\text{.} \end{align*}

So to compute the determinant of a $$5\times 5$$ matrix we must build 5 submatrices, each of size $$4\text{.}$$ To compute the determinants of each the $$4\times 4$$ matrices we need to create 4 submatrices each, these now of size $$3$$ and so on. To compute the determinant of a $$10\times 10$$ matrix would require computing the determinant of $$10!=10\times 9\times 8\times 7\times 6\times 5\times 4\times 3\times 2=3,628,800$$ $$1\times 1$$ matrices. Fortunately there are better ways. However this does suggest an excellent computer programming exercise to write a recursive procedure to compute a determinant.

Let us compute the determinant of a reasonably sized matrix by hand.

Suppose that we have the $$3\times 3$$ matrix

\begin{equation*} A= \begin{bmatrix} 3 & 2 & -1\\ 4 & 1 & 6\\ -3 & -1 & 2 \end{bmatrix}\text{.} \end{equation*}

Then

\begin{align*} \detname{A}=\detbars{A} &=\begin{vmatrix} 3 & 2 & -1\\ 4 & 1 & 6\\ -3 & -1 & 2 \end{vmatrix}\\ &= 3 \begin{vmatrix} 1 & 6\\ -1 & 2 \end{vmatrix} -2 \begin{vmatrix} 4 & 6\\ -3 & 2 \end{vmatrix} +(-1) \begin{vmatrix} 4 & 1\\ -3 & -1 \end{vmatrix}\\ &= 3\left( 1\begin{vmatrix} 2\\ \end{vmatrix} -6\begin{vmatrix} -1 \end{vmatrix}\right) -2\left( 4\begin{vmatrix} 2 \end{vmatrix} -6\begin{vmatrix} -3 \end{vmatrix}\right) -\left( 4\begin{vmatrix} -1 \end{vmatrix} -1\begin{vmatrix} -3 \end{vmatrix}\right)\\ &= 3\left(1(2)-6(-1)\right) -2\left(4(2)-6(-3)\right) -\left(4(-1)-1(-3)\right)\\ &=24-52+1\\ &=-27\text{.} \end{align*}

In practice it is a bit silly to decompose a $$2\times 2$$ matrix down into a couple of $$1\times 1$$ matrices and then compute the exceedingly easy determinant of these puny matrices. So here is a simple theorem.

Applying Definition DM,

\begin{equation*} \begin{vmatrix} a&b\\c&d \end{vmatrix}= a\begin{vmatrix}d\end{vmatrix}-b\begin{vmatrix}c\end{vmatrix}=ad-bc\text{.} \end{equation*}

Do you recall seeing the expression $$ad-bc$$ before? (Hint: Theorem TTMI.)

### SubsectionCDComputing Determinants

There are a variety of ways to compute the determinant. We will establish first that we can choose to mimic our definition of the determinant, but by using matrix entries and submatrices based on a row other than the first one.

First, the statement of the theorem coincides with Definition DM when $$i=1\text{,}$$ so throughout, we need only consider $$i\gt 1\text{.}$$

Given the recursive definition of the determinant, it should be no surprise that we will use induction for this proof (Proof Technique I). When $$n=1\text{,}$$ there is nothing to prove since there is but one row. When $$n=2\text{,}$$ we just examine expansion about the second row,

\begin{align*} (-1)^{2+1}\matrixentry{A}{21}&\detname{\submatrix{A}{2}{1}}+ (-1)^{2+2}\matrixentry{A}{22}\detname{\submatrix{A}{2}{2}}\\ &=-\matrixentry{A}{21}\matrixentry{A}{12}+\matrixentry{A}{22}\matrixentry{A}{11}&& \knowl{./knowl/definition-DM.html}{\text{Definition DM}}\\ &=\matrixentry{A}{11}\matrixentry{A}{22}-\matrixentry{A}{12}\matrixentry{A}{21}\\ &= \detname{A}&& \knowl{./knowl/theorem-DMST.html}{\text{Theorem DMST}}\text{.} \end{align*}

So the theorem is true for matrices of size $$n=1$$ and $$n=2\text{.}$$ Now assume the result is true for all matrices of size $$n-1$$ as we derive an expression for expansion about row $$i$$ for a matrix of size $$n\text{.}$$ We will abuse our notation for a submatrix slightly, so $$\submatrix{A}{i_1,i_2}{j_1,j_2}$$ will denote the matrix formed by removing rows $$i_1$$ and $$i_2\text{,}$$ along with removing columns $$j_1$$ and $$j_2\text{.}$$ Also, as we take a determinant of a submatrix, we will need to “jump up” the index of summation partway through as we “skip over” a missing column. To do this smoothly we will set

\begin{equation*} \epsilon_{\ell j}= \begin{cases} 0 & \ell\lt j\\ 1 & \ell\gt j \end{cases}\text{.} \end{equation*}

Now,

\begin{align*} &\detname{A}\\ &\quad= \sum_{j=1}^{n}(-1)^{1+j}\matrixentry{A}{1j}\detname{\submatrix{A}{1}{j}}&& \knowl{./knowl/definition-DM.html}{\text{Definition DM}}\\ &\quad= \sum_{j=1}^{n}(-1)^{1+j}\matrixentry{A}{1j} \sum_{\substack{1\leq\ell\leq n\\\ell\neq j}} (-1)^{i-1+\ell-\epsilon_{\ell j}}\matrixentry{A}{i\ell}\detname{\submatrix{A}{1,i}{j,\ell}}&& \text{Induction Hypothesis}\\ &\quad= \sum_{j=1}^{n}\sum_{\substack{1\leq\ell\leq n\\\ell\neq j}} (-1)^{j+i+\ell-\epsilon_{\ell j}} \matrixentry{A}{1j}\matrixentry{A}{i\ell}\detname{\submatrix{A}{1,i}{j,\ell}}&& \knowl{./knowl/property-DCN.html}{\text{Property DCN}}\\ &\quad= \sum_{\ell=1}^{n}\sum_{\substack{1\leq j\leq n\\j\neq\ell}} (-1)^{j+i+\ell-\epsilon_{\ell j}} \matrixentry{A}{1j}\matrixentry{A}{i\ell}\detname{\submatrix{A}{1,i}{j,\ell}}&& \knowl{./knowl/property-CACN.html}{\text{Property CACN}}\\ &\quad= \sum_{\ell=1}^{n}(-1)^{i+\ell}\matrixentry{A}{i\ell} \sum_{\substack{1\leq j\leq n\\j\neq\ell}} (-1)^{j-\epsilon_{\ell j}} \matrixentry{A}{1j}\detname{\submatrix{A}{1,i}{j,\ell}}&& \knowl{./knowl/property-DCN.html}{\text{Property DCN}}\\ &\quad= \sum_{\ell=1}^{n}(-1)^{i+\ell}\matrixentry{A}{i\ell} \sum_{\substack{1\leq j\leq n\\j\neq\ell}} (-1)^{\epsilon_{\ell j}+j} \matrixentry{A}{1j}\detname{\submatrix{A}{i,1}{\ell,j}}&& 2\epsilon_{\ell j}\text{ is even}\\ &\quad= \sum_{\ell=1}^{n}(-1)^{i+\ell}\matrixentry{A}{i\ell}\detname{\submatrix{A}{i}{\ell}}&& \knowl{./knowl/definition-DM.html}{\text{Definition DM}}\text{.} \end{align*}

We can also obtain a formula that computes a determinant by expansion about a column, but this will be simpler if we first prove a result about the interplay of determinants and transposes. Notice how the following proof makes use of the ability to compute a determinant by expanding about any row.

With our definition of the determinant (Definition DM) and theorems like Theorem DER, using induction (Proof Technique I) is a natural approach to proving properties of determinants. And so it is here. Let $$n$$ be the size of the matrix $$A\text{,}$$ and we will use induction on $$n\text{.}$$

For $$n=1\text{,}$$ the transpose of a matrix is identical to the original matrix, so vacuously, the determinants are equal.

Now assume the result is true for matrices of size $$n-1\text{.}$$ Then,

\begin{align*} \detname{\transpose{A}} &=\frac{1}{n}\sum_{i=1}^{n}\detname{\transpose{A}}\\ &= \frac{1}{n}\sum_{i=1}^{n}\sum_{j=1}^{n}(-1)^{i+j} \matrixentry{\transpose{A}}{ij}\detname{\submatrix{\transpose{A}}{i}{j}}&& \knowl{./knowl/theorem-DER.html}{\text{Theorem DER}}\\ &= \frac{1}{n}\sum_{i=1}^{n}\sum_{j=1}^{n}(-1)^{i+j} \matrixentry{A}{ji}\detname{\submatrix{\transpose{A}}{i}{j}}&& \knowl{./knowl/definition-TM.html}{\text{Definition TM}}\\ &= \frac{1}{n}\sum_{i=1}^{n}\sum_{j=1}^{n}(-1)^{i+j} \matrixentry{A}{ji}\detname{\transpose{\left(\submatrix{A}{j}{i}\right)}}&& \knowl{./knowl/definition-TM.html}{\text{Definition TM}}\\ &= \frac{1}{n}\sum_{i=1}^{n}\sum_{j=1}^{n}(-1)^{i+j} \matrixentry{A}{ji}\detname{\submatrix{A}{j}{i}}&& \text{Induction Hypothesis}\\ &= \frac{1}{n}\sum_{j=1}^{n}\sum_{i=1}^{n}(-1)^{j+i} \matrixentry{A}{ji}\detname{\submatrix{A}{j}{i}}&& \knowl{./knowl/property-CACN.html}{\text{Property CACN}}\\ &= \frac{1}{n}\sum_{j=1}^{n}\detname{A}&& \knowl{./knowl/theorem-DER.html}{\text{Theorem DER}}\\ &=\detname{A}\text{.} \end{align*}

Now we can easily get the result that a determinant can be computed by expansion about any column as well.

We have

\begin{align*} \detname{A}&= \detname{\transpose{A}}&& \knowl{./knowl/theorem-DT.html}{\text{Theorem DT}}\\ &= \sum_{i=1}^{n}(-1)^{j+i}\matrixentry{\transpose{A}}{ji}\detname{\submatrix{\transpose{A}}{j}{i}}&& \knowl{./knowl/theorem-DER.html}{\text{Theorem DER}}\\ &= \sum_{i=1}^{n}(-1)^{j+i}\matrixentry{\transpose{A}}{ji}\detname{\transpose{\left(\submatrix{A}{i}{j}\right)}}&& \knowl{./knowl/definition-TM.html}{\text{Definition TM}}\\ &= \sum_{i=1}^{n}(-1)^{j+i}\matrixentry{\transpose{A}}{ji}\detname{\submatrix{A}{i}{j}}&& \knowl{./knowl/theorem-DT.html}{\text{Theorem DT}}\\ &= \sum_{i=1}^{n}(-1)^{i+j}\matrixentry{A}{ij}\detname{\submatrix{A}{i}{j}}&& \knowl{./knowl/definition-TM.html}{\text{Definition TM}}\text{.} \end{align*}

That the determinant of an $$n\times n$$ matrix can be computed in $$2n$$ different (albeit similar) ways is nothing short of remarkable. For the doubters among us, we will do an example, computing a $$4\times 4$$ matrix in two different ways.

Let

\begin{equation*} A=\begin{bmatrix} -2 & 3 & 0 & 1\\ 9 & -2 & 0 & 1\\ 1 & 3 & -2 & -1\\ 4 & 1 & 2 & 6 \end{bmatrix}\text{.} \end{equation*}

Then expanding about the fourth row (Theorem DER with $$i=4$$) yields,

\begin{align*} \detbars{A} &= (4)(-1)^{4+1} \begin{vmatrix} 3 & 0 & 1\\ -2 & 0 & 1\\ 3 & -2 & -1 \end{vmatrix} +(1)(-1)^{4+2} \begin{vmatrix} -2 & 0 & 1\\ 9 & 0 & 1\\ 1 & -2 & -1 \end{vmatrix}\\ &\quad\quad+(2)(-1)^{4+3} \begin{vmatrix} -2 & 3 & 1\\ 9 & -2 & 1\\ 1 & 3 & -1 \end{vmatrix} +(6)(-1)^{4+4} \begin{vmatrix} -2 & 3 & 0 \\ 9 & -2 & 0 \\ 1 & 3 & -2 \end{vmatrix}\\ &= (-4)(10)+(1)(-22)+(-2)(61)+6(46)=92\text{.} \end{align*}

Expanding about column 3 (Theorem DEC with $$j=3$$) gives

\begin{align*} \detbars{A} &= (0)(-1)^{1+3} \begin{vmatrix} 9 & -2 & 1\\ 1 & 3 & -1\\ 4 & 1 & 6 \end{vmatrix} + (0)(-1)^{2+3} \begin{vmatrix} -2 & 3 & 1\\ 1 & 3 & -1\\ 4 & 1 & 6 \end{vmatrix} +\\ &\quad\quad(-2)(-1)^{3+3} \begin{vmatrix} -2 & 3 & 1\\ 9 & -2 & 1\\ 4 & 1 & 6 \end{vmatrix} + (2)(-1)^{4+3} \begin{vmatrix} -2 & 3 & 1\\ 9 & -2 & 1\\ 1 & 3 & -1 \end{vmatrix}\\ &=0+0+(-2)(-107)+(-2)(61)=92\text{.} \end{align*}

Notice how much easier the second computation was. By choosing to expand about the third column, we have two entries that are zero, so two $$3\times 3$$ determinants need not be computed at all!

When a matrix has all zeros above (or below) the diagonal, exploiting the zeros by expanding about the proper row or column makes computing a determinant insanely easy.

Suppose that

\begin{equation*} T=\begin{bmatrix} 2 & 3 & -1 & 3 & 3\\ 0 & -1 & 5 & 2 & -1\\ 0 & 0 & 3 & 9 & 2\\ 0 & 0 & 0 & -1 & 3\\ 0 & 0 & 0 & 0 & 5 \end{bmatrix}\text{.} \end{equation*}

We will compute the determinant of this $$5\times 5$$ matrix by consistently expanding about the first column for each submatrix that arises and does not have a zero entry multiplying it.

\begin{align*} \detname{T}&= \begin{vmatrix} 2 & 3 & -1 & 3 & 3\\ 0 & -1 & 5 & 2 & -1\\ 0 & 0 & 3 & 9 & 2\\ 0 & 0 & 0 & -1 & 3\\ 0 & 0 & 0 & 0 & 5 \end{vmatrix}\\ &=2(-1)^{1+1} \begin{vmatrix} -1 & 5 & 2 & -1\\ 0 & 3 & 9 & 2\\ 0 & 0 & -1 & 3\\ 0 & 0 & 0 & 5 \end{vmatrix}\\ &=2(-1)(-1)^{1+1} \begin{vmatrix} 3 & 9 & 2\\ 0 & -1 & 3\\ 0 & 0 & 5 \end{vmatrix}\\ &=2(-1)(3)(-1)^{1+1} \begin{vmatrix} -1 & 3\\ 0 & 5 \end{vmatrix}\\ &=2(-1)(3)(-1)(-1)^{1+1} \begin{vmatrix} 5 \end{vmatrix}\\ &=2(-1)(3)(-1)(5)=30 \end{align*}

When you consult other texts in your study of determinants, you may run into the terms minor and cofactor, especially in a discussion centered on expansion about rows and columns. We have chosen not to make these definitions formally since we have been able to get along without them. However, informally, a minor is a determinant of a submatrix, specifically $$\detname{\submatrix{A}{i}{j}}$$ and is usually referenced as the minor of the matrix entry $$\matrixentry{A}{ij}\text{.}$$ A cofactor is a signed minor, specifically the cofactor of the matrix entry $$\matrixentry{A}{ij}$$ is $$(-1)^{i+j}\detname{\submatrix{A}{i}{j}}\text{.}$$

#### SageDM.Determinant of a Matrix.

Computing the determinant in Sage is straightforward.

A = matrix(QQ,[[ 4,  3, -2, -9, -11, -14, -4,  11,  -4,   4],
[ 0,  1,  0, -1,  -1,  -3, -2,   3,   6,  15],
[ 0,  1,  1,  1,   3,   0, -3,  -5,  -9,  -3],
[-3,  3,  3,  6,  12,   3, -9, -12,  -9,  15],
[-2,  0,  2,  3,   5,   3, -3,  -5,  -3,   7],
[ 3,  3, -1, -7,  -8, -12, -5,   8,  -4,   9],
[ 0, -1,  1,  2,   2,   5,  3,  -6,  -8, -12],
[-1, -2, -1,  1,  -2,   5,  6,   3,   6,  -8],
[ 2,  1, -3, -6,  -8,  -7,  0,  12,  11,   8],
[-3, -2,  2,  5,   5,   9,  2,  -7,  -4,  -3]])
A.determinant()


Random matrices, even with small entries, can have very large determinants.

B = matrix(QQ,  15, [
[-5, -5, -5,  4,  1,  1, -3,  0,  4,  4, -2, -4,  2,  3, -1],
[ 1,  1, -4,  3,  3,  4,  1, -1, -5,  4, -3,  0, -1,  0,  0],
[ 3,  4, -2,  3, -1, -5, -1, -4, -5,  0, -1,  2, -4, -1, -1],
[ 2, -4,  4, -3, -3, -3, -1, -3, -3, -1,  2,  4, -1, -1, -3],
[ 1,  4, -3, -1, -2, -2,  1, -1,  3, -5, -4, -2, -2, -2, -5],
[-1, -2,  4,  0,  4,  1,  1,  4, -5,  3,  1, -1,  4,  2, -2],
[ 4,  3,  2,  4,  4, -5,  2, -5, -5,  2, -5, -4, -4,  0,  3],
[ 1, -2,  0, -2, -2,  0,  2,  3,  1,  2, -4,  0, -5, -2,  2],
[-4, -4,  2,  1, -1,  4, -2,  1, -2,  2, -1, -1,  3,  4, -1],
[-4,  0,  2,  3, -4, -5,  3, -5,  4, -4, -2,  3,  3, -3,  0],
[ 1,  2,  3, -4,  2,  0, -4, -1,  1, -3,  1,  4, -2,  4, -1],
[-3,  3,  0,  2,  1, -2, -4,  0, -1, -1, -1,  2,  3,  1, -4],
[ 4,  3, -3, -4,  3,  1, -3,  2,  1, -5, -5, -3,  2,  1,  4],
[-3, -5, -1, -5, -2,  0, -3,  1,  2, -1,  0, -4,  3, -2,  3],
[-1,  1, -3, -1,  3, -3,  2, -3, -5, -1, -1,  3, -1,  2,  3]
])
B.determinant()


Sage is incredibly fast at computing determinants with rational entries. Try the following two compute cells on whatever computer you might be using right now. The one unfamilar command clears the value of the determinant that Sage caches, so we get accurate timing information across multiple evaluations.

C = random_matrix(QQ, 100, 100)
timeit("C.determinant(); C._cache={}")      # random

C.determinant()                             # random


#### 1.

Construct the elementary matrix that will effect the row operation $$\rowopadd{-6}{2}{3}$$ on a $$4\times 7$$ matrix.

#### 2.

Compute the determinant of the matrix

\begin{equation*} \begin{bmatrix} 2&3&-1\\ 3&8&2\\ 4&-1&-3 \end{bmatrix}\text{.} \end{equation*}

#### 3.

Compute the determinant of the matrix

\begin{equation*} \begin{bmatrix} 3 & 9 & -2 & 4 & 2 \\ 0 & 1 & 4 & -2 & 7 \\ 0 & 0 & -2 & 5 & 2 \\ 0 & 0 & 0 & -1 & 6 \\ 0 & 0 & 0 & 0 & 4 \end{bmatrix}\text{.} \end{equation*}

### ExercisesDMExercises

#### C21.

Doing the computations by hand, find the determinant of the matrix below.

\begin{equation*} \begin{bmatrix} 1 & 3\\ 6 & 2 \end{bmatrix} \end{equation*}
Solution.

Using the formula in Theorem DMST we have

\begin{align*} \begin{vmatrix}1 & 3 \\ 6 & 2 \end{vmatrix} &= 1 \cdot 2 - 6 \cdot 3 = 2 - 18 = -16\text{.} \end{align*}

#### C22.

Doing the computations by hand, find the determinant of the matrix below.

\begin{equation*} \begin{bmatrix} 1 & 3\\ 2 & 6 \end{bmatrix} \end{equation*}
Solution.

Using the formula in Theorem DMST we have

\begin{align*} \begin{vmatrix}1 & 3 \\ 2 & 6 \end{vmatrix} &= 1 \cdot 6 - 2 \cdot 3 = 6 - 6 = 0\text{.} \end{align*}

#### C23.

Doing the computations by hand, find the determinant of the matrix below.

\begin{equation*} \begin{bmatrix} 1 & 3 & 2 \\ 4 & 1 & 3 \\ 1 & 0 & 1 \end{bmatrix} \end{equation*}
Solution.

We can compute the determinant by expanding about any row or column; the most efficient ones to choose are either the second column or the third row. In any case, the determinant will be $$-4\text{.}$$

#### C24.

Doing the computations by hand, find the determinant of the matrix below.

\begin{equation*} \begin{bmatrix} -2 & 3 & -2 \\ -4 & -2 & 1 \\ 2 & 4 & 2 \end{bmatrix} \end{equation*}
Solution.

We will expand about the first row since there are no zeros to exploit,

\begin{align*} \begin{vmatrix} -2 & 3 & -2 \\ -4 & -2 & 1 \\ 2 & 4 & 2 \end{vmatrix} &= (-2)\begin{vmatrix} -2 & 1 \\ 4 & 2 \end{vmatrix} + (-1)(3)\begin{vmatrix} -4 & 1 \\ 2 & 2 \end{vmatrix} + (-2)\begin{vmatrix} -4 & -2 \\ 2 & 4 \end{vmatrix}\\ &=(-2)((-2)(2)-1(4)) + (-3)((-4)(2)-1(2)) + (-2)((-4)(4)-(-2)(2))\\ &=(-2)(-8)+(-3)(-10) + (-2)(-12)=70\text{.} \end{align*}

#### C25.

Doing the computations by hand, find the determinant of the matrix below.

\begin{equation*} \begin{bmatrix} 3 & -1 & 4\\ 2 & 5 & 1\\ 2 & 0 & 6 \end{bmatrix} \end{equation*}
Solution.

We can expand about any row or column, so the zero entry in the middle of the last row is attractive. Let us expand about column 2. By Theorem DER and Theorem DEC you will get the same result by expanding about a different row or column. We will use Theorem DMST twice.

\begin{align*} \begin{vmatrix} 3 & -1 & 4\\ 2 & 5 & 1\\ 2 & 0 & 6 \end{vmatrix} &= (-1)(-1)^{1+2} \begin{vmatrix} 2 & 1\\ 2 & 6 \end{vmatrix} + (5)(-1)^{2+2} \begin{vmatrix} 3 & 4\\ 2 & 6 \end{vmatrix} + (0)(-1)^{3+2} \begin{vmatrix} 3 & 4\\ 2 & 1 \end{vmatrix}\\ &=(1)(10)+(5)(10)+0=60 \end{align*}

#### C26.

Doing the computations by hand, find the determinant of the matrix $$A\text{.}$$

\begin{equation*} A= \begin{bmatrix} 2 & 0 & 3 & 2 \\ 5 & 1 & 2 & 4 \\ 3 & 0 & 1 & 2 \\ 5 & 3 & 2 & 1 \end{bmatrix} \end{equation*}
Solution.

With two zeros in column 2, we choose to expand about that column (Theorem DEC),

\begin{align*} \detname{A} &= \begin{vmatrix} 2 & 0 & 3 & 2 \\ 5 & 1 & 2 & 4 \\ 3 & 0 & 1 & 2 \\ 5 & 3 & 2 & 1 \end{vmatrix}\\ &= 0(-1) \begin{vmatrix} 5 & 2 & 4 \\ 3 & 1 & 2 \\ 5 & 2 & 1 \end{vmatrix} + 1(1) \begin{vmatrix} 2 & 3 & 2 \\ 3 & 1 & 2 \\ 5 & 2 & 1 \end{vmatrix} + 0(-1) \begin{vmatrix} 2 & 3 & 2 \\ 5 & 2 & 4 \\ 5 & 2 & 1 \end{vmatrix} + 3(1) \begin{vmatrix} 2 & 3 & 2 \\ 5 & 2 & 4 \\ 3 & 1 & 2 \end{vmatrix}\\ &= (1)\left(2(1(1)-2(2)) - 3(3(1)-5(2)) + 2(3(2)-5(1))\right) +\\ &\quad\quad(3)\left(2(2(2)-4(1)) - 3(5(2)-4(3)) + 2(5(1)-3(2))\right)\\ &= (-6+21+2) + (3)(0+6-2) = 29\text{.} \end{align*}

#### C27.

Doing the computations by hand, find the determinant of the matrix $$A\text{.}$$

\begin{equation*} A= \begin{bmatrix} 1 & 0 & 1 & 1\\ 2 & 2 & -1 & 1\\ 2 & 1 & 3 & 0\\ 1 & 1 & 0 & 1 \end{bmatrix} \end{equation*}
Solution.

Expanding on the first row, we have

\begin{align*} \begin{vmatrix} 1 & 0 & 1 & 1\\ 2 & 2 &-1 & 1\\2 & 1 & 3 & 0\\1 & 1 & 0 & 1\end{vmatrix} &= \begin{vmatrix} 2 & -1 & 1\\1 & 3 & 0\\1 & 0 & 1 \end{vmatrix} - 0 + \begin{vmatrix} 2 & 2 & 1\\ 2 & 1 & 0\\ 1 & 1 & 1\end{vmatrix} - \begin{vmatrix} 2 & 2 & -1\\ 2 & 1 & 3 \\ 1 & 1 & 0 \end{vmatrix}\\ &= 4 + (-1) - (-1) = 4\text{.} \end{align*}

#### C28.

Doing the computations by hand, find the determinant of the matrix $$A\text{.}$$

\begin{equation*} A= \begin{bmatrix} 1 & 0 & 1 & 1\\ 2 & -1 & -1 & 1\\ 2 & 5 & 3 & 0\\ 1 & -1 & 0 & 1 \end{bmatrix} \end{equation*}
Solution.

Expanding along the first row, we have

\begin{align*} \begin{vmatrix} 1 & 0 & 1 & 1 \\ 2 & -1 & -1 & 1\\ 2 & 5 & 3 & 0\\ 1 & -1 & 0 & 1 \end{vmatrix} &= \begin{vmatrix} -1 & -1 & 1\\5 & 3 & 0\\-1 & 0 & 1 \end{vmatrix} - 0 + \begin{vmatrix} 2 & -1 & 1\\ 2 & 5 & 0\\1 & -1 & 1 \end{vmatrix} - \begin{vmatrix}2 & -1 & -1\\2 & 5 & 3\\ 1 & -1 & 0 \end{vmatrix}\\ &= 5 - 0 + 5 - 10 = 0\text{.} \end{align*}

#### C29.

Doing the computations by hand, find the determinant of the matrix $$A\text{.}$$

\begin{equation*} A= \begin{bmatrix} 2 & 3 & 0 & 2 & 1\\ 0 & 1 & 1 & 1 & 2\\ 0 & 0 & 1 & 2 & 3\\ 0 & 1 & 2 & 1 & 0\\ 0 & 0 & 0 & 1 & 2 \end{bmatrix} \end{equation*}
Solution.

Expanding along the first column, we have

\begin{align*} \begin{vmatrix} 2 & 3 & 0 & 2 & 1\\ 0 & 1 & 1 & 1 & 2\\ 0 & 0 & 1 & 2 & 3\\ 0 & 1 & 2 & 1 &0\\ 0 & 0 & 0 & 1 & 2 \end{vmatrix} &= 2 \begin{vmatrix} 1 & 1 & 1 & 2\\ 0 & 1 & 2 & 3\\ 1 & 2 & 1 & 0\\ 0 & 0 & 1 & 2 \end{vmatrix} + 0 + 0 + 0 + 0\\ \end{align*}

Now, expanding along the first column again, we have

\begin{align*} &= 2\left( \begin{vmatrix} 1 & 2 & 3\\ 2 & 1 & 0\\ 0 & 1 & 2 \end{vmatrix} - 0 + \begin{vmatrix} 1 & 1 & 2\\ 1 & 2 & 3\\ 0 & 1 & 2 \end{vmatrix} - 0 \right)\\ &= 2\left( [1 \cdot 1 \cdot 2 + 2 \cdot 0 \cdot 0 + 3 \cdot 2 \cdot 1 - 0 \cdot 1 \cdot 3 - 1 \cdot 0 \cdot 1 - 2 \cdot 2 \cdot 2] + \right.\\ &\quad\left.[1 \cdot 2 \cdot 2 + 1 \cdot 3 \cdot 0 +2 \cdot 1 \cdot 1 -0 \cdot 2 \cdot 2 - 1 \cdot 3 \cdot 1 - 2 \cdot 1 \cdot 1]\right)\\ &= 2([2 +0 + 6 - 0 - 0 - 8] + [4 + 0 + 2 - 0 - 3 - 2])\\ &= 2\text{.} \end{align*}

#### C30.

Doing the computations by hand, find the determinant of the matrix $$A\text{.}$$

\begin{equation*} A= \begin{bmatrix} 2 & 1 & 1 & 0 & 1\\ 2 & 1 & 2 & -1 & 1\\ 0 & 0 & 1 & 2 & 0\\ 1 & 0 & 3 & 1 & 1\\ 2 & 1 & 1 & 2 & 1 \end{bmatrix} \end{equation*}
Solution.

In order to exploit the zeros, let us expand along row 3. We then have

\begin{align*} \begin{vmatrix} 2 & 1 & 1 & 0 & 1\\ 2 & 1 & 2 & -1 & 1\\ 0 & 0 & 1 & 2 & 0\\ 1 & 0 & 3 & 1 & 1\\ 2 & 1 & 1 & 2 & 1 \end{vmatrix} &= (-1)^6 \begin{vmatrix} 2 & 1 & 0 & 1 \\ 2 & 1 & -1 & 1\\ 1 & 0 & 1 & 1\\ 2 & 1 & 2 & 1 \end{vmatrix} + (-1)^7 \cdot 2\begin{vmatrix} 2 & 1 & 1 & 1\\ 2 & 1 & 2 & 1\\ 1 & 0 & 3 & 1\\ 2 & 1 & 1 & 1 \end{vmatrix}\\ \end{align*}

Notice that the second matrix here is singular since two rows are identical and thus it cannot row-reduce to an identity matrix. We now have

\begin{align*} &= \begin{vmatrix} 2 & 1 & 0 & 1 \\ 2 & 1 & -1 & 1\\ 1 & 0 & 1 & 1\\ 2 & 1 & 2 & 1 \end{vmatrix} + 0\\ \end{align*}

and now we expand on the first row of the first matrix:

\begin{align*} &= 2 \begin{vmatrix} 1 & -1 & 1\\ 0 & 1 & 1\\ 1 & 2 & 1 \end{vmatrix} - \begin{vmatrix} 2 & -1 & 1\\ 1 & 1 & 1\\ 2 & 2 & 1 \end{vmatrix} + 0 - \begin{vmatrix} 2 & 1 & -1 \\ 1 & 0 & 1\\ 2 & 1 & 2 \end{vmatrix}\\ &= 2(-3) - (-3) - (-3) = 0\text{.} \end{align*}

#### M10.

Find a value of $$k$$ so that the matrix

\begin{align*} A = \begin{bmatrix} 2 & 4 \\ 3 & k\end{bmatrix} \end{align*}

has $$\det(A) = 0\text{,}$$ or explain why it is not possible.

Solution.

There is only one value of $$k$$ that will make this matrix have a zero determinant.

\begin{align*} \detname{A} &= \begin{vmatrix} 2 & 4 \\ 3 & k \end{vmatrix} = 2k - 12 \end{align*}

so $$\detname{A} = 0$$ only when $$k = 6\text{.}$$

#### M11.

Find a value of $$k$$ so that the matrix

\begin{equation*} A = \begin{bmatrix} 1 & 2 & 1\\ 2 & 0 & 1 \\ 2 & 3 & k \end{bmatrix} \end{equation*}

has $$\det(A) = 0\text{,}$$ or explain why it is not possible.

Solution.

We find

\begin{align*} \detname{A} &= \begin{vmatrix} 1 & 2 & 1 \\ 2 & 0 & 1 \\ 2& 3 & k \end{vmatrix} = 7 - 4k\text{.} \end{align*}

Thus, $$\detname{A} = 0$$ only when $$k = \frac{7}{4}\text{.}$$

#### M15.

Given the matrix

\begin{equation*} B=\begin{bmatrix} 2 - x & 1 \\ 4 & 2 - x \end{bmatrix}\text{,} \end{equation*}

find all values of $$x$$ that are solutions of $$\det(B) = 0\text{.}$$

Solution.

Using the formula for the determinant of a $$2\times 2$$ matrix given in Theorem DMST, we have

\begin{align*} \det{(B)} &= \begin{vmatrix} 2 - x & 1\\ 4 & 2-x \end{vmatrix} = (2 - x)(2 - x) - 4 = x^2 - 4x = x(x-4) \end{align*}

and thus $$\det{(B)} = 0$$ only when $$x=0$$ or $$x=4\text{.}$$

#### M16.

Given the matrix

\begin{equation*} B =\begin{bmatrix} 4 - x & -4 & -4\\ 2 & -2 - x & -4\\ 3 & -3 & -4 -x \end{bmatrix}\text{,} \end{equation*}

find all values of $$x$$ that are solutions of $$\det(B) = 0\text{.}$$

Solution.

We find

\begin{align*} \detname{B} &= 8x -2x^2 - x^3 = -x(x^2 + 2x - 8) = -x(x-2)(x+4)\text{.} \end{align*}

And thus, $$\detname{B}=0$$ when $$x = 0\text{,}$$ $$x = 2\text{,}$$ or $$x = -4\text{.}$$

#### M30.

The two matrices below are row-equivalent. How would you confirm this? Since the matrices are row-equivalent, there is a sequence of row operations that converts $$X$$ into $$Y\text{,}$$ which would be a product of elementary matrices, $$M\text{,}$$ such that $$MX=Y\text{.}$$ Find $$M\text{.}$$ (This approach could be used to find the “9 scalars” of the very early Exercise RREF.M40.)

Hint: Compute the extended echelon form for both matrices, and then use the property from Theorem PEEF that reads $$B=JA\text{,}$$ where $$A$$ is the original matrix, $$B$$ is the echelon form of the matrix and $$J$$ is a nonsingular matrix obtained from extended echelon form. Combine the two square matrices in the right way to obtain $$M\text{.}$$

\begin{align*} X&=\begin{bmatrix} -1 & 3 & 1 & -2 & 8 \\ -1 & 3 & 2 & -1 & 4 \\ 2 & -4 & -3 & 2 & -7 \\ -2 & 5 & 3 & -2 & 8 \end{bmatrix} & Y&=\begin{bmatrix} -1 & 2 & 2 & 0 & 0 \\ -3 & 6 & 8 & -1 & 1 \\ 0 & 1 & -2 & -2 & 9 \\ -1 & 4 & -3 & -3 & 16 \end{bmatrix}\text{.} \end{align*}