ConceptComplete

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

Definition4.1Determinant (recursive)

The determinant det⁡:Mn×n(F)→F\det : M_{n \times n}(F) \to F is defined recursively:

Base case (n=1n = 1): det⁡(a)=a\det(a) = a.

Recursive step: For n≥2n \geq 2, expanding along the first row:

det⁡(A)=∑j=1n(−1)1+ja1jdet⁡(A1j)\det(A) = \sum_{j=1}^n (-1)^{1+j} a_{1j} \det(A_{1j})

where A1jA_{1j} is the (n−1)×(n−1)(n-1) \times (n-1) matrix obtained by deleting row 1 and column jj.

Definition4.2Determinant via permutations (Leibniz formula)

Equivalently,

det⁡(A)=∑σ∈Snsgn(σ)∏i=1nai,σ(i)\det(A) = \sum_{\sigma \in S_n} \text{sgn}(\sigma) \prod_{i=1}^n a_{i,\sigma(i)}

where SnS_n is the symmetric group on {1,…,n}\{1, \ldots, n\} and sgn(σ)=±1\text{sgn}(\sigma) = \pm 1 is the sign of the permutation.


Small cases

Example1 x 1 determinant

det⁡(a)=a\det(a) = a.

Example2 x 2 determinant

det⁡(abcd)=ad−bc.\det\begin{pmatrix} a & b \\ c & d \end{pmatrix} = ad - bc.

This is the area of the parallelogram spanned by the column vectors (a,c)(a, c) and (b,d)(b, d), with sign indicating orientation.

Example3 x 3 determinant (Sarrus' rule)

det⁡(abcdefghi)=aei+bfg+cdh−ceg−bdi−afh.\det\begin{pmatrix} a & b & c \\ d & e & f \\ g & h & i \end{pmatrix} = aei + bfg + cdh - ceg - bdi - afh.

This is the signed volume of the parallelepiped spanned by the three column vectors.

ExampleDeterminant of the identity

det⁡(In)=1\det(I_n) = 1 for all nn. (The identity preserves volume and orientation.)

ExampleDeterminant of a diagonal matrix

det⁡(diag(d1,…,dn))=d1d2⋯dn\det(\text{diag}(d_1, \ldots, d_n)) = d_1 d_2 \cdots d_n. The determinant of a diagonal matrix is the product of the diagonal entries.

ExampleDeterminant of a triangular matrix

For upper or lower triangular matrices, the determinant equals the product of the diagonal entries:

det⁡(2310−14005)=2⋅(−1)⋅5=−10.\det\begin{pmatrix} 2 & 3 & 1 \\ 0 & -1 & 4 \\ 0 & 0 & 5 \end{pmatrix} = 2 \cdot (-1) \cdot 5 = -10.

ExampleZero row or column

If AA has a row (or column) of all zeros, then det⁡(A)=0\det(A) = 0. (In the permutation formula, every term contains a factor ai,σ(i)=0a_{i,\sigma(i)} = 0 from the zero row.)


Properties

Theorem4.1Properties of the determinant

For A,B∈Mn×n(F)A, B \in M_{n \times n}(F) and c∈Fc \in F:

  1. Multiplicativity: det⁡(AB)=det⁡(A)⋅det⁡(B)\det(AB) = \det(A) \cdot \det(B).
  2. Transpose: det⁡(AT)=det⁡(A)\det(A^T) = \det(A).
  3. Scalar multiple: det⁡(cA)=cndet⁡(A)\det(cA) = c^n \det(A).
  4. Inverse: If AA is invertible, det⁡(A−1)=(det⁡A)−1\det(A^{-1}) = (\det A)^{-1}.
  5. Row operations:
    • Row swap: det⁡\det changes sign.
    • Scale row by cc: det⁡\det multiplies by cc.
    • Add multiple of one row to another: det⁡\det unchanged.
ExampleMultiplicativity

A=(2003)A = \begin{pmatrix} 2 & 0 \\ 0 & 3 \end{pmatrix}, B=(1101)B = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}.

det⁡(A)=6\det(A) = 6, det⁡(B)=1\det(B) = 1. AB=(2203)AB = \begin{pmatrix} 2 & 2 \\ 0 & 3 \end{pmatrix}, det⁡(AB)=6=6⋅1\det(AB) = 6 = 6 \cdot 1.

ExampleScalar multiple

det⁡(2I3)=23=8\det(2I_3) = 2^3 = 8, not 22. This is a common mistake: scaling an n×nn \times n matrix by cc multiplies the determinant by cnc^n, not cc.

ExampleDeterminant is NOT additive

In general, det⁡(A+B)≠det⁡(A)+det⁡(B)\det(A + B) \neq \det(A) + \det(B).

A=B=I2A = B = I_2: det⁡(A+B)=det⁡(2I2)=4≠2=1+1\det(A + B) = \det(2I_2) = 4 \neq 2 = 1 + 1.

ExampleSimilar matrices have the same determinant

If B=P−1APB = P^{-1}AP, then det⁡(B)=det⁡(P−1)det⁡(A)det⁡(P)=det⁡(A)\det(B) = \det(P^{-1})\det(A)\det(P) = \det(A). The determinant is a similarity invariant and hence an invariant of the linear operator, independent of the choice of basis.

ExampleComputing det via row operations

det⁡(1234567810)\det\begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 10 \end{pmatrix}:

R2→R2−4R1R_2 \to R_2 - 4R_1, R3→R3−7R1R_3 \to R_3 - 7R_1: (1230−3−60−6−11)\begin{pmatrix} 1 & 2 & 3 \\ 0 & -3 & -6 \\ 0 & -6 & -11 \end{pmatrix}.

R3→R3−2R2R_3 \to R_3 - 2R_2: (1230−3−6001)\begin{pmatrix} 1 & 2 & 3 \\ 0 & -3 & -6 \\ 0 & 0 & 1 \end{pmatrix}.

det⁡=1⋅(−3)⋅1=−3\det = 1 \cdot (-3) \cdot 1 = -3 (product of pivots, no row swaps so sign is positive).


Geometric interpretation

RemarkVolume and orientation

For A∈Mn×n(R)A \in M_{n \times n}(\mathbb{R}) with columns v1,…,vnv_1, \ldots, v_n:

  • ∣det⁡(A)∣|\det(A)| = the nn-dimensional volume of the parallelepiped spanned by v1,…,vnv_1, \ldots, v_n.
  • sgn(det⁡(A))\text{sgn}(\det(A)) = the orientation: +1+1 preserves orientation, −1-1 reverses it.
  • det⁡(A)=0\det(A) = 0 iff the vectors are linearly dependent (the parallelepiped is degenerate, with zero volume).
ExampleArea of a parallelogram

Columns (3,0)T(3, 0)^T and (1,2)T(1, 2)^T: det⁡(3102)=6\det\begin{pmatrix} 3 & 1 \\ 0 & 2 \end{pmatrix} = 6. The parallelogram has area ∣6∣=6|6| = 6.

ExampleRotation preserves volume

det⁡(Rθ)=cos⁡2θ+sin⁡2θ=1\det(R_\theta) = \cos^2\theta + \sin^2\theta = 1. Rotations preserve both area and orientation.

ExampleReflection reverses orientation

det⁡(100−1)=−1\det\begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} = -1. Reflection preserves area but reverses orientation.

RemarkLooking ahead

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.