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} \]Figure 1
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.
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' \]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
Remark 1
\[ \det(\text{upper/lower triangular matrix}) = \text{product of the diagonal entries} \]Figure 2
Figure 3
Remark 2
\[ \det(\text{upper/lower triangular block matrix}) = \text{product of dets of diagonal blocks.} \]Figure 4
Figure 5
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} \]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} \]✓✓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} \]
✓✓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} \]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.
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 \).
✓✓Use the row interchange, scalar, and additive properties to prove that any \( 3 \times 3 \) matrix with linearly dependent rows has a zero determinant.
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 \).
✓✓Use the column interchange, scalar, and additive properties to prove that any \( 3 \times 3 \) matrix with linearly dependent columns has a zero determinant.