Determinants and cofactor expansion
The determinant is a single number computed from a square matrix. It tells whether the matrix is invertible and how the matrix scales areas and volumes.
The 2 x 2 determinant
For \(A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}\), \(\det A = ad - bc\). For \(\begin{bmatrix} 3 & 1 \\ 4 & 2 \end{bmatrix}\), it is \(6 - 4 = 2\). A is invertible exactly when \(\det A \ne 0\). Notation varies: \(\det A\), \(|A|\), or vertical bars around the entries.
Minors and cofactors
For an n x n matrix, the minor \(M_{ij}\) is the determinant of the matrix left after deleting row i and column j. The cofactor is \(C_{ij} = (-1)^{i+j}M_{ij}\), so signs follow a checkerboard pattern starting with + in the top-left corner: + - + along the first row, - + - along the second, and so on.
Cofactor expansion
The determinant can be computed by expanding along any row or column: \(\det A = a_{i1}C_{i1} + a_{i2}C_{i2} + \dots + a_{in}C_{in}\) for any fixed row i, and similarly down any column. Pierre-Simon Laplace described this expansion in 1772. Choosing a row or column with many zeros saves work, since zero entries contribute nothing.
The 3 x 3 case
Expanding along the first row: \(\det A = a_{11}(a_{22}a_{33} - a_{23}a_{32}) - a_{12}(a_{21}a_{33} - a_{23}a_{31}) + a_{13}(a_{21}a_{32} - a_{22}a_{31})\). The Rule of Sarrus, adding the three 'downward' diagonal products and subtracting the three 'upward' ones, gives the same result but works only for 3 x 3 matrices.
Triangular matrices
The determinant of a triangular matrix, upper or lower, is the product of its diagonal entries, because cofactor expansion down the first column repeatedly leaves only one non-zero term. So the determinant of the identity is 1, and a triangular matrix with any zero on its diagonal is singular.
Cost of cofactor expansion
Full cofactor expansion of an n x n determinant involves about n! terms, which grows explosively: for n = 25, n! is about 1.6 x 10^25, impossible even for supercomputers. In practice determinants are computed by row reduction to triangular form, which takes on the order of n^3 operations, as the next lesson explains.
History
Determinants predate matrices: Seki Takakazu in Japan (1683) and Gottfried Leibniz in Europe (1693) studied them independently to solve systems of equations. The term 'determinant' in its modern sense was popularised by Augustin-Louis Cauchy in the early nineteenth century, and Arthur Cayley's matrix algebra of the 1850s placed them in today's framework.
Worked example
Compute the determinant of \(\begin{bmatrix} 2 & 0 & 1 \\ 3 & 1 & 0 \\ 1 & 4 & 5 \end{bmatrix}\) by expanding along the first row: \(2(1 \cdot 5 - 0 \cdot 4) - 0(\dots) + 1(3 \cdot 4 - 1 \cdot 1) = 2(5) + 1(11) = 21\). The middle term vanishes because its entry is 0. Since 21 is non-zero, the matrix is invertible.
Key takeaways
For 2 x 2 matrices, det = ad - bc, and non-zero means invertible. Minors delete a row and column; cofactors add checkerboard signs (-1)^(i+j). Cofactor (Laplace, 1772) expansion works along any row or column; choose ones with zeros. 3 x 3 determinants can use the first-row formula or the Rule of Sarrus. Triangular determinants are diagonal products. Full expansion needs about n! terms, so row reduction, about n^3 work, is used in practice. Seki and Leibniz studied determinants in the 1680s and 1690s, long before matrix algebra.
Flashcard
ad - bc
Check your understanding
What is the determinant of the upper triangular matrix with diagonal entries 2, -3, and 4?
