TheoremComplete

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×nn \times n matrices AA and BB: det(AB)=det(A)det(B)\det(AB) = \det(A) \cdot \det(B)

This property extends to products of any number of matrices: det(A1A2Ak)=det(A1)det(A2)det(Ak)\det(A_1A_2 \cdots A_k) = \det(A_1)\det(A_2) \cdots \det(A_k).

Multiplicativity implies that the determinant is a group homomorphism from GLn(F)GL_n(\mathbb{F}) (invertible matrices) to F\mathbb{F}^* (nonzero scalars). This algebraic perspective unifies many determinant properties.

TheoremDeterminant and Invertibility

An n×nn \times n matrix AA is invertible if and only if det(A)0\det(A) \neq 0.

Moreover, if AA is invertible: det(A1)=1det(A)=[det(A)]1\det(A^{-1}) = \frac{1}{\det(A)} = [\det(A)]^{-1}

Proof: If AA is invertible, then AA1=IAA^{-1} = I. Taking determinants: det(A)det(A1)=det(I)=1\det(A)\det(A^{-1}) = \det(I) = 1

Thus det(A)0\det(A) \neq 0 and det(A1)=1/det(A)\det(A^{-1}) = 1/\det(A).

Conversely, if det(A)0\det(A) \neq 0, the inverse formula A1=1det(A)adj(A)A^{-1} = \frac{1}{\det(A)}\text{adj}(A) shows AA is invertible.

TheoremProperties Under Matrix Operations

Let AA be an n×nn \times n matrix.

  1. Transpose: det(AT)=det(A)\det(A^T) = \det(A)
  2. Scalar multiple: det(cA)=cndet(A)\det(cA) = c^n \det(A) for scalar cc
  3. Powers: det(Ak)=[det(A)]k\det(A^k) = [\det(A)]^k for positive integer kk
  4. Similar matrices: If B=P1APB = P^{-1}AP, then det(B)=det(A)\det(B) = \det(A)
  5. Block diagonal: If A=[B00C]A = \begin{bmatrix} B & 0 \\ 0 & C \end{bmatrix}, then det(A)=det(B)det(C)\det(A) = \det(B)\det(C)
ExampleUsing Multiplicativity

Suppose det(A)=2\det(A) = 2 and det(B)=3\det(B) = -3 for 3×33 \times 3 matrices. Find det(A2B1)\det(A^2B^{-1}).

det(A2B1)=det(A2)det(B1)=[det(A)]21det(B)=413=43\det(A^2B^{-1}) = \det(A^2)\det(B^{-1}) = [\det(A)]^2 \cdot \frac{1}{\det(B)} = 4 \cdot \frac{1}{-3} = -\frac{4}{3}

TheoremDeterminant of Elementary Matrices

Each elementary row operation corresponds to multiplication by an elementary matrix:

  1. Row swap: det(E)=1\det(E) = -1
  2. Row scaling by cc: det(E)=c\det(E) = c
  3. Row addition: det(E)=1\det(E) = 1

Since any invertible matrix is a product of elementary matrices, det(A)=det(E1Ek)=det(E1)det(Ek)\det(A) = \det(E_1 \cdots E_k) = \det(E_1) \cdots \det(E_k).

Remark

The multiplicativity property det(AB)=det(A)det(B)\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.