The determinant can be written as a signed sum over permutations, or computed recursively by cofactor expansion. These formulas are mostly historical rather than practical for computation, but they reveal how determinant terms are organized by signs, row and column choices, pivots and minor matrices.
Permutation and cofactor formulas are two ways to organize the same signed products.
This chapter is mainly conceptual: it connects the compact determinant formulas with the actual signed products and recursive submatrices they contain.
The number of permutation terms grows as n!, and cofactor expansion repeatedly creates smaller determinants. This growth is much faster than row-reduction-based computation, so the formulas are mainly useful for understanding determinant structure, not for efficient numerical calculation.
The PDF is a single document. The page links below are best-effort: most browsers support them, but some viewers may ignore the page hint.
In the permutation formula, swapping rows reverses the sign of every term, scaling a row scales every term and row replacement produces canceling pairs. In cofactor expansion, the same determinant rules are reflected through the alternating cofactor signs and through the determinant of the remaining minor.