Determinant of (Square) Matrices

\[ A^{n\times n} = \begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \cdots & a_{ij} & \cdots & \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{pmatrix} \longrightarrow \det A \]

a real number

\( 1 \times 1 \qquad \det(a) = a \)

\[ \begin{gathered} 2 \times 2 \qquad \det \begin{pmatrix} a & b \\ c & d \end{pmatrix} = ad - bc \\[0.5em] 3 \times 3 \qquad \det \begin{pmatrix} a & b & c \\ d & e & f \\ g & h & i \end{pmatrix} = aei + bfg + cdh - ceg - afh - bdi \end{gathered} \]
3 by 3 array of letters a to i repeated side by side with crossing diagonal arrows
Figure 1
A Rule of Sarrus diagram. The three rows of the 3 by 3 matrix are written out and then the first two columns are repeated to the right, giving the arrangement: first row a, b, c, a, b, c; second row d, e, f, d, e, f; third row g, h, i, g, h, i. Red arrows run diagonally down to the right across the array, marking the three positive products aei, bfg, and cdh. Blue arrows run diagonally down to the left, marking the three negative products ceg, afh, and bdi. All arrows terminate with arrowheads below the bottom row of letters.

The above methods do not work for higher dim. matrices.

Method 1 (Co-factor expansion)

— Compute det A recursively

\[ A^{n\times n} = \begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \cdots & \cdots & \cdots & \cdots \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{pmatrix} \]

Choose any row e.g. ith row

\[ \begin{gathered} \begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ & \vdots & & \\ a_{i1} & a_{i2} & \cdots & a_{in} \\ & \vdots & & \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{pmatrix} \qquad \begin{pmatrix} + & - & + & - & \cdots \\ - & + & - & + & \cdots \\ + & - & + & - & \cdots \\ \cdots & - & - & - & - \end{pmatrix} \\[0.5em] \det A = \sum_{j=1}^{n} (-1)^{i+j} a_{ij} \det M_{ij} \\[0.5em] = (-1)^{i+1} a_{i1} \det M_{i1} + (-1)^{i+2} a_{i2} \det M_{i2} + \cdots \\[0.5em] \cdots + (-1)^{i+n} a_{in} \det M_{in} \end{gathered} \]

\( M_{ij} = ij\text{-th cofactor of } A \)

\[ \begin{gathered} = \text{delete the } i^{th} \text{ row and } j^{th} \text{ col. from } A. \\[0.5em] A = \begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1j} & \cdots & a_{1n} \\ & & & & & \\ a_{i1} & a_{i2} & \cdots & a_{ij} & \cdots & a_{in} \\ & & & & & \\ a_{n1} & a_{n2} & \cdots & a_{nj} & \cdots & a_{nn} \end{pmatrix} \longrightarrow M_{ij} \end{gathered} \]

Note:A is \( n \times n \) while \( M_{ij} \) is \( (n-1) \times (n-1) \)

Choose any column, e.g. \( j^{th} \) column

\[ \begin{gathered} \begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1j} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2j} & \cdots & a_{2n} \\ & & \vdots & & & \\ a_{n1} & a_{n2} & \cdots & a_{nj} & \cdots & a_{nn} \end{pmatrix} \qquad \begin{pmatrix} + & - & + & - & \cdots \\ - & + & - & + & \cdots \\ + & - & + & - & \cdots \\ \cdots & - & - & - & - \end{pmatrix} \\[0.5em] \det A = \sum_{i=1}^{n} (-1)^{i+j} a_{ij} \det M_{ij} \\[0.5em] = (-1)^{1+j} a_{1j} \det M_{1j} + (-1)^{2+j} a_{2j} \det M_{2j} + \cdots \\[0.5em] + (-1)^{n+j} a_{nj} \det M_{nj} \end{gathered} \]

Theorem

Expanding along any row or any column will give you the same value.

\[ \begin{gathered} 1\times 1 \qquad \det(a) = a \\[0.5em] 2\times 2 \qquad \det\begin{pmatrix} a & b \\ c & d \end{pmatrix} \qquad \begin{pmatrix} + & - \\ - & + \end{pmatrix} \\[0.5em] = +a \det(d) - b \det(c) \\[0.5em] = ad - b \\[0.5em] 3\times 3 \qquad \det\begin{pmatrix} a & b & c \\ d & e & f \\ g & h & i \end{pmatrix} \\[0.5em] = a \det\begin{pmatrix} e & f \\ h & i \end{pmatrix} - b \det\begin{pmatrix} d & f \\ g & i \end{pmatrix} + c \det\begin{pmatrix} d & e \\ g & h \end{pmatrix} \\[0.5em] = a(ei - fh) - b(di - fg) + c(dh - eg) \\[0.5em] = aei - afh - bdi + bfg + cdh - ceg \end{gathered} \]

eg

\[ \begin{gathered} A = \begin{pmatrix} 2 & 0 & 1 \\ 6 & 1 & 7 \\ 4 & 5 & 9 \end{pmatrix} \qquad \begin{pmatrix} + & - & + \\ - & + & - \\ + & - & + \end{pmatrix} \\[0.5em] = 2 \det\begin{pmatrix} 1 & 7 \\ 5 & 9 \end{pmatrix} - 0 \det\begin{pmatrix} 6 & 7 \\ 4 & 9 \end{pmatrix} + 1 \det\begin{pmatrix} 6 & 1 \\ 4 & 5 \end{pmatrix} \\[0.5em] = 2(9-35) - 0(\cdots) + 30 - 4 \\[0.5em] = 2(-26) + 26 = -26 \\[0.5em] A = \begin{pmatrix} 2 & 0 & 1 \\ 6 & 1 & 7 \\ 4 & 5 & 9 \end{pmatrix} \qquad \begin{pmatrix} + & - & + \\ - & + & - \\ + & - & + \end{pmatrix} \\[0.5em] \det A = -6 \det\begin{pmatrix} 0 & 1 \\ 5 & 9 \end{pmatrix} + 1 \det\begin{pmatrix} 2 & 1 \\ 4 & 9 \end{pmatrix} - 7 \det\begin{pmatrix} 2 & 0 \\ 4 & 5 \end{pmatrix} \\[0.5em] = -6(-5) + (18-4) - 7(10) \\[0.5em] = 30 + 14 - 70 = -26 \\[0.5em] A = \begin{pmatrix} 2 & 0 & 1 \\ 6 & 1 & 7 \\ 4 & 5 & 9 \end{pmatrix} \qquad \begin{pmatrix} + & - & + \\ - & + & - \\ + & - & + \end{pmatrix} \\[0.5em] \det A = 1 \det\begin{pmatrix} 6 & 1 \\ 4 & 5 \end{pmatrix} - 7 \det\begin{pmatrix} 2 & 0 \\ 4 & 5 \end{pmatrix} + 9 \det\begin{pmatrix} 2 & 0 \\ 6 & 1 \end{pmatrix} \\[0.5em] = 30 - 4 - 7(10) + 9(2) = 26 - 70 + 18 = -26 \end{gathered} \]

eg

\[ \begin{gathered} A = \begin{pmatrix} 3 & 1 & 0 & 0 \\ 1 & 7 & 0 & 5 \\ 1 & 1 & -1 & 1 \\ 0 & 1 & 2 & 1 \end{pmatrix} \\[0.5em] \det A = 3 \det\begin{pmatrix} 7 & 0 & 5 \\ 1 & -1 & 1 \\ 1 & 2 & 1 \end{pmatrix} - 1 \det\begin{pmatrix} 1 & 0 & 5 \\ 1 & -1 & 1 \\ 0 & 2 & 1 \end{pmatrix} \\[0.5em] = 3\left[ 7 \det\begin{pmatrix} -1 & 1 \\ 2 & 1 \end{pmatrix} + 5 \det\begin{pmatrix} 1 & -1 \\ 1 & 2 \end{pmatrix} \right] \\[0.5em] - 1\left[ \det\begin{pmatrix} -1 & 1 \\ 2 & 1 \end{pmatrix} + 5 \det\begin{pmatrix} 1 & -1 \\ 0 & 2 \end{pmatrix} \right] \\[0.5em] = 3[7(-1-2) + 5(2+1)] \\[0.5em] - 1[-1-2 + 5(2)] \\[0.5em] = 3(-21+15) - [-3+10] \\[0.5em] = -18 - 7 = -25 \end{gathered} \]

eg

\[ \begin{gathered} A = \begin{pmatrix} 3 & 1 & 0 & 0 \\ 1 & 7 & 0 & 5 \\ 1 & 1 & -1 & 1 \\ 0 & 1 & 2 & 1 \end{pmatrix} \\[0.5em] \det A = (-1) \det\begin{pmatrix} 3 & 1 & 0 \\ 1 & 7 & 5 \\ 0 & 1 & 1 \end{pmatrix} \\[0.5em] - 2 \det\begin{pmatrix} 3 & 1 & 0 \\ 1 & 7 & 5 \\ 1 & 1 & 1 \end{pmatrix} \\[0.5em] = - [3(7-5) - (1)] \\[0.5em] - 2[3(7-5) - (1-5)] \\[0.5em] = -[6-1] - 2[6+4] \\[0.5em] = -5 - 20 \\[0.5em] = -25 \end{gathered} \]

Method 2 (Elementary Row/Col Ops)

\[ A \xrightarrow{\text{row op}} A' \]
  1. Interchange 2 rows

    \[ \begin{gathered} A = \begin{pmatrix} - r_i - \\ - r_j - \end{pmatrix} \longrightarrow A' = \begin{pmatrix} - r_j - \\ - r_i - \end{pmatrix} \\[0.5em] \det A' = - \det A \\[0.5em] \det \begin{pmatrix} - r_j - \\ - r_i - \end{pmatrix} = - \det \begin{pmatrix} - r_i - \\ - r_j - \end{pmatrix} \end{gathered} \]

Multiply one row by c

\[ \begin{gathered} A = \begin{pmatrix} - r_i - \end{pmatrix} \longrightarrow A' = \begin{pmatrix} - c\,r_i - \end{pmatrix} \\[0.5em] \det A' = c \det A \\[0.5em] \det \begin{pmatrix} - c\,r_i - \end{pmatrix} = c \det \begin{pmatrix} - r_i - \end{pmatrix} \end{gathered} \]

(3) Adding a multiple of one row to another

\[ \begin{gathered} A = \begin{pmatrix} - r_i - \\ - r_j - \end{pmatrix} \longrightarrow A' = \begin{pmatrix} - r_i - \\ - r_j + \alpha r_i - \end{pmatrix} \\[0.5em] \det A' = \det A \\[0.5em] \det \begin{pmatrix} - r_i - \\ - r_j + \alpha r_i - \end{pmatrix} = \det \begin{pmatrix} - r_i - \\ - r_j - \end{pmatrix} \end{gathered} \]

Note:

The same rules / properties apply to column operations

\[ \det\begin{pmatrix} 2 & 0 & 1 \\ 6 & 1 & 7 \\ 4 & 5 & 9 \end{pmatrix} = \det\begin{pmatrix} 2 & 0 & 1 \\ 0 & 1 & 4 \\ 0 & 5 & 7 \end{pmatrix} \] \[ = \det\left(\begin{array}{c|cc} 2 & 0 & 1 \\ 0 & 1 & 4 \\ 0 & 0 & -13 \end{array}\right) \] \[ \begin{gathered} = 2 \det\begin{pmatrix} 1 & 4 \\ 0 & -13 \end{pmatrix} \\[0.5em] = 2(-13) = -26 \\[0.5em] \det\begin{pmatrix} 2 & 0 & 1 \\ 6 & 1 & 7 \\ 4 & 5 & 9 \end{pmatrix} = - \det\begin{pmatrix} 1 & 0 & 2 \\ 7 & 1 & 6 \\ 9 & 5 & 4 \end{pmatrix} \end{gathered} \] \[ = - \det\begin{pmatrix} 1 & 0 & 2 \\ 0 & 1 & -8 \\ 0 & 5 & -14 \end{pmatrix} = - \det\left(\begin{array}{c|cc} 1 & 0 & 2 \\ 0 & 1 & -8 \\ 0 & 0 & 26 \end{array}\right) \] \[ \begin{gathered} = - (1)(26) \\[0.5em] = -26 \\[0.5em] \begin{vmatrix} 3 & 1 & 0 & 0 \\ 1 & 7 & 0 & 5 \\ 1 & 1 & -1 & 1 \\ 0 & 1 & 2 & 1 \end{vmatrix} = - \begin{vmatrix} 1 & 7 & 0 & 5 \\ 3 & 1 & 0 & 0 \\ 1 & 1 & -1 & 1 \\ 0 & 1 & 2 & 1 \end{vmatrix} \\[0.5em] = - \begin{vmatrix} 1 & 7 & 0 & 5 \\ 0 & -20 & 0 & -15 \\ 0 & -6 & -1 & -4 \\ 0 & 1 & 2 & 1 \end{vmatrix} = \begin{vmatrix} 1 & 7 & 0 & 5 \\ 0 & 1 & 2 & 1 \\ 0 & -6 & -1 & -4 \\ 0 & -20 & 0 & -15 \end{vmatrix} \end{gathered} \] \[ = \left|\begin{array}{c|ccc} 1 & 7 & 0 & 5 \\ 0 & 1 & 2 & 1 \\ 0 & 0 & 11 & 2 \\ 0 & 0 & 40 & 5 \end{array}\right| = 1 \begin{vmatrix} 1 & 2 & 1 \\ 0 & 11 & 2 \\ 0 & 40 & 5 \end{vmatrix} \] \[ = 1(55 - 80) = -25 \]

Remark 1

\[ \det(\text{upper/lower triangular matrix}) = \text{product of the diagonal entries} \]
Determinant of an upper triangular matrix with hatched region above the diagonal equals the product of diagonal entries.
Figure 2
A hand-drawn determinant of an upper triangular matrix. Inside tall vertical determinant bars, the diagonal entries \( a_{11} \), \( a_{22} \), a dotted diagonal, and \( a_{nn} \) run from top-left to bottom-right. The region above the diagonal is filled with diagonal hatch strokes indicating arbitrary nonzero entries, while the region below the diagonal is labeled with a circled zero and the text 0's. To the right of the determinant bars is an equals sign followed by the product \( a_{11} a_{22} \cdots a_{nn} \).
Determinant of a lower triangular matrix with hatched region below the diagonal equals the product of diagonal entries.
Figure 3
A hand-drawn determinant of a lower triangular matrix. Inside tall vertical determinant bars, the diagonal entries \( a_{11} \), \( a_{22} \), a dotted diagonal, and \( a_{nn} \) run from top-left to bottom-right. The region below the diagonal is filled with diagonal hatch strokes indicating arbitrary nonzero entries, while the region above the diagonal is labeled with a circled zero and the text 0's. To the right of the determinant bars is an equals sign followed by the product \( a_{11} a_{22} \cdots a_{nn} \).

Remark 2

\[ \det(\text{upper/lower triangular block matrix}) = \text{product of dets of diagonal blocks.} \]
Upper triangular block matrix with blocks A1, A2 to Ak on the diagonal, zeros below, equals product of their determinants.
Figure 4
A hand-drawn large parenthesized matrix representing an upper triangular block matrix. Boxed blocks labeled \( A_1 \), \( A_2 \), and continuing with a diagonal ellipsis to \( A_k \) are placed along the main diagonal from top-left to bottom-right. The region above the diagonal blocks is filled with diagonal hatching, indicating arbitrary entries. The lower-left region is labeled with a handwritten zero and the text 0's, indicating all zeros below the diagonal blocks. To the right of the matrix an equation reads equals \( (\det A_1)(\det A_2) \cdots (\det A_k) \), written on two lines with the trailing factor \( (\det A_k) \) on the second line.
Lower triangular block matrix with blocks A1, A2 to Ak on the diagonal, zeros above, equals product of their determinants.
Figure 5
A hand-drawn large parenthesized matrix representing a lower triangular block matrix. Boxed blocks labeled \( A_1 \), \( A_2 \), and continuing with a diagonal ellipsis to \( A_k \) are placed along the main diagonal from top-left to bottom-right. The upper-right region is labeled with a handwritten zero and the text 0's, indicating all zeros above the diagonal blocks. The region below the diagonal blocks is filled with diagonal hatching, indicating arbitrary entries. To the right of the matrix an equation reads equals \( (\det A_1)(\det A_2) \cdots (\det A_k) \), written on two lines with the trailing factor \( (\det A_k) \) on the second line.

eg

\[ \begin{gathered} \begin{vmatrix} 1 & 0 & 0 & 0 \\ * & 2 & 0 & 0 \\ * & * & 3 & 0 \\ * & * & * & 4 \end{vmatrix} = \begin{vmatrix} 1 & * & * & * \\ 0 & 2 & * & * \\ 0 & 0 & 3 & * \\ 0 & 0 & 0 & 4 \end{vmatrix} \\[0.5em] = (1)(2)(3)(4) = 24 \end{gathered} \]

eg

\[ \begin{gathered} \begin{vmatrix} 1 & 2 & * & * & * \\ 3 & 4 & * & * & * \\ 0 & 0 & 5 & * & * \\ 0 & 0 & 0 & 6 & 7 \\ 0 & 0 & 0 & 8 & 9 \end{vmatrix} = \begin{vmatrix} 1 & 2 & 0 & 0 & 0 \\ 3 & 4 & 0 & 0 & 0 \\ * & * & 5 & 0 & 0 \\ * & * & * & 6 & 7 \\ * & * & * & 8 & 9 \end{vmatrix} \\[0.5em] = \begin{vmatrix} 1 & 2 \\ 3 & 4 \end{vmatrix} (5) \begin{vmatrix} 6 & 7 \\ 8 & 9 \end{vmatrix} \\[0.5em] = (4-6)(5)(54-56) \\[0.5em] = (-2)(5)(-2) \\[0.5em] = 20 \end{gathered} \]

(Official) Definition of det

\[ A^{n\times n} \longrightarrow \det A \in \mathbb{R} \]

\( \det(\cdot) \) is a multi-linear, alternating function on square matrices such that \( \det I_n = 1 \)

(1) Multi-linear (linear on each row)

\[ \det\begin{pmatrix} - & r_1 & - \\ & \vdots & \\ - & \alpha u + \beta v & - \\ & \vdots & \\ - & r_n & - \end{pmatrix} = \alpha \det\begin{pmatrix} - & r_1 & - \\ & \vdots & \\ - & u & - \\ & \vdots & \\ - & r_n & - \end{pmatrix} + \beta \det\begin{pmatrix} - & r_1 & - \\ & \vdots & \\ - & v & - \\ & \vdots & \\ - & r_n & - \end{pmatrix} \]

(2) Alternating

\[ \det\begin{pmatrix} - & r_i & - \\ - & r_j & - \end{pmatrix} = - \det\begin{pmatrix} - & r_j & - \\ - & r_i & - \end{pmatrix} \]
  1. Use expansion along the third row to express each of the following determinants as a sum of determinants of \( 4 \times 4 \) matrices. Without expanding further, explain why \( 3\alpha = \beta \). What theorem from the text does this exercise demonstrate?

    \[ \alpha = \begin{vmatrix} 24 & -13 & 7 & 9 & 5 \\ 11 & 16 & -37 & 99 & 64 \\ 1 & 4 & 2 & 2 & -3 \\ 31 & -42 & 78 & 55 & -3 \\ 62 & 47 & 29 & -14 & -8 \end{vmatrix}, \qquad \beta = \begin{vmatrix} 24 & -13 & 7 & 9 & 5 \\ 11 & 16 & -37 & 99 & 64 \\ 3 & 12 & 6 & 6 & -9 \\ 31 & -42 & 78 & 55 & -3 \\ 62 & 47 & 29 & -14 & -8 \end{vmatrix} \]
  2. ✓✓Use expansion along the third row to express \( \beta \), \( \delta \), and \( \gamma \) as a sum of determinants of \( 4 \times 4 \) matrices, where \( \beta \) is as in Exercise 4.4 and \( \delta \) and \( \gamma \) are as follows. Without expanding further, explain why \( \beta = \delta + \gamma \). What theorem from the text does this exercise demonstrate?

    \[ \delta = \begin{vmatrix} 24 & -13 & 7 & 9 & 5 \\ 11 & 16 & -37 & 99 & 64 \\ 1 & 7 & 3 & 3 & -13 \\ 31 & -42 & 78 & 55 & -3 \\ 62 & 47 & 29 & -14 & -8 \end{vmatrix}, \qquad \gamma = \begin{vmatrix} 24 & -13 & 7 & 9 & 5 \\ 11 & 16 & -37 & 99 & 64 \\ 2 & 5 & 3 & 3 & 4 \\ 31 & -42 & 78 & 55 & -3 \\ 62 & 47 & 29 & -14 & -8 \end{vmatrix} \]
  1. ✓✓Suppose that

    \[ \begin{vmatrix} a & b & c \\ d & e & f \\ g & h & i \end{vmatrix} = 5 \]

    Compute the following determinants:

    \[ \textbf{(a)}\quad \begin{vmatrix} 2a & 2b & 2c \\ 3d - a & 3e - b & 3f - c \\ 4g + 3a & 4h + 3b & 4i + 3c \end{vmatrix} \qquad \textbf{(b)}\quad \begin{vmatrix} a + 2d & b + 2e & c + 2f \\ g & h & i \\ d & e & f \end{vmatrix} \]
  2. Use row reduction to prove that for all numbers \( x \), \( y \), and \( z \)

    \[ \begin{vmatrix} 1 & 1 & 1 \\ x & y & z \\ x^2 & y^2 & z^2 \end{vmatrix} = (y - x)(z - x)(z - y) \]

    reduction.

  1. Let

    \[ A = \begin{bmatrix} A_1 \\ A_2 \\ A_3 \end{bmatrix} \]

    represent a \( 3 \times 3 \) matrix and suppose that \( A_3 = 2A_1 + A_2 \). Use the row scalar and additive properties to prove that \( \det A = 0 \).

  2. ✓✓Use the row interchange, scalar, and additive properties to prove that any \( 3 \times 3 \) matrix with linearly dependent rows has a zero determinant.

  3. Let

    \[ A = [A_1, A_2, A_3] \]

    represent a \( 3 \times 3 \) matrix and suppose that \( A_3 = 2A_1 + A_2 \). Use the column scalar and additive properties to prove that \( \det A = 0 \).

  4. ✓✓Use the column interchange, scalar, and additive properties to prove that any \( 3 \times 3 \) matrix with linearly dependent columns has a zero determinant.