Cofactor Expansion: Computing Determinants Through Recursive Minor Decomposition

Cofactor expansion, also known as Laplace expansion, is a systematic method for computing the determinant of a square matrix by reducing it to smaller subproblems. The determinant is one of the most important scalar values in linear algebra, encoding information about matrix invertibility, volume scaling, and orientation preservation. Cofactor expansion provides a recursive framework that works for matrices of any size.

The method works by expanding along any row or column of the matrix. For a matrix A, the determinant computed by expanding along row i is: det(A) = Σ(j=1 to n) a_ij × C_ij, where C_ij = (-1)^(i+j) × M_ij is the cofactor and M_ij is the minor (determinant of the submatrix obtained by deleting row i and column j). The checkerboard pattern of signs (-1)^(i+j) alternates starting with + in the upper-left corner.

Strategic Row Selection

A key optimization in cofactor expansion is choosing the row or column with the most zeros. Each zero entry eliminates an entire minor calculation. For a 3×3 matrix with a zero in position (2,1), expanding along row 2 requires only two 2×2 determinants instead of three. In numerical computing, this strategy significantly reduces computational cost, especially for sparse matrices.

The 2×2 Foundation

The simplest case of cofactor expansion is the 2×2 determinant: det([[a,b],[c,d]]) = ad - bc. This is obtained by expanding along the first row: a×(+1)×d + b×(-1)×c = ad - bc. This fundamental result serves as the base case for all recursive cofactor expansions.

Computational Complexity

Cofactor expansion has a time complexity of O(n!) for an n×n matrix, making it impractical for large matrices. For a 10×10 matrix, the expansion requires computing over 3.6 million 2×2 determinants. In practice, Gaussian elimination (O(n³)) is used for large matrices, while cofactor expansion remains essential for theoretical work, symbolic computation, and small matrices where exact results are needed.

• Linearity: The determinant is linear in each row, allowing expansion of multi-term rows into simpler determinants.
• Row Operations: Adding a multiple of one row to another does not change the determinant, simplifying cofactor expansion.
• Permutation Interpretation: Cofactor expansion is equivalent to summing over all permutations with appropriate signs.