Multiplicativity and Invertibility
The relationship between determinants, matrix multiplication, and invertibility forms the cornerstone of determinant theory. These properties make the determinant an invaluable computational and theoretical tool.
TheoremMultiplicativity of Determinants
For any n×n matrices A and B:
det(AB)=det(A)⋅det(B)
This property extends to products of any number of matrices: det(A1A2⋯Ak)=det(A1)det(A2)⋯det(Ak).
Multiplicativity implies that the determinant is a group homomorphism from GLn(F) (invertible matrices) to F∗ (nonzero scalars). This algebraic perspective unifies many determinant properties.
TheoremDeterminant and Invertibility
An n×n matrix A is invertible if and only if det(A)=0.
Moreover, if A is invertible:
det(A−1)=det(A)1=[det(A)]−1
Proof: If A is invertible, then AA−1=I. Taking determinants:
det(A)det(A−1)=det(I)=1
Thus det(A)=0 and det(A−1)=1/det(A).
Conversely, if det(A)=0, the inverse formula A−1=det(A)1adj(A) shows A is invertible.
TheoremProperties Under Matrix Operations
Let A be an n×n matrix.
- Transpose: det(AT)=det(A)
- Scalar multiple: det(cA)=cndet(A) for scalar c
- Powers: det(Ak)=[det(A)]k for positive integer k
- Similar matrices: If B=P−1AP, then det(B)=det(A)
- Block diagonal: If A=[B00C], then det(A)=det(B)det(C)
TheoremDeterminant of Elementary Matrices
Each elementary row operation corresponds to multiplication by an elementary matrix:
- Row swap: det(E)=−1
- Row scaling by c: det(E)=c
- Row addition: det(E)=1
Since any invertible matrix is a product of elementary matrices, det(A)=det(E1⋯Ek)=det(E1)⋯det(Ek).
Remark
The multiplicativity property det(AB)=det(A)det(B) is remarkable: matrix multiplication is complicated, yet the determinant converts it to simple scalar multiplication. This reduction of complexity is what makes determinants powerful in applications from eigenvalue theory to differential equations.