The Determinant
The determinant is a scalar-valued function on square matrices that encodes whether the matrix is invertible, how it scales volumes, and the sign of the orientation change.
Definition
The determinant is defined recursively:
Base case (): .
Recursive step: For , expanding along the first row:
where is the matrix obtained by deleting row 1 and column .
Equivalently,
where is the symmetric group on and is the sign of the permutation.
Small cases
.
This is the area of the parallelogram spanned by the column vectors and , with sign indicating orientation.
This is the signed volume of the parallelepiped spanned by the three column vectors.
for all . (The identity preserves volume and orientation.)
. The determinant of a diagonal matrix is the product of the diagonal entries.
For upper or lower triangular matrices, the determinant equals the product of the diagonal entries:
If has a row (or column) of all zeros, then . (In the permutation formula, every term contains a factor from the zero row.)
Properties
For and :
- Multiplicativity: .
- Transpose: .
- Scalar multiple: .
- Inverse: If is invertible, .
- Row operations:
- Row swap: changes sign.
- Scale row by : multiplies by .
- Add multiple of one row to another: unchanged.
, .
, . , .
, not . This is a common mistake: scaling an matrix by multiplies the determinant by , not .
In general, .
: .
If , then . The determinant is a similarity invariant and hence an invariant of the linear operator, independent of the choice of basis.
:
, : .
: .
(product of pivots, no row swaps so sign is positive).
Geometric interpretation
For with columns :
- = the -dimensional volume of the parallelepiped spanned by .
- = the orientation: preserves orientation, reverses it.
- iff the vectors are linearly dependent (the parallelepiped is degenerate, with zero volume).
Columns and : . The parallelogram has area .
. Rotations preserve both area and orientation.
. Reflection preserves area but reverses orientation.
The determinant provides the scalar test for invertibility (Theorem 4.2) and leads to Cramer's Rule for solving systems. The cofactor expansion gives a practical recursive computation method.