4 Determinants

A progressive guide to computing determinants, tracking row-operation effects, interpreting geometric meaning, testing invertibility, and applying determinants to linear systems.

Foundations and basic formulas

A is a single scalar associated with a square matrix, not another matrix. It is written as det⁡(A)\det(A) or ∣A∣|A|, and it is defined only when the number of rows equals the number of columns.

For a 1×11\times 1 matrix,

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

For a 2×22\times 2 matrix,

A=[abcd],det⁡(A)=ad−bc.A=\begin{bmatrix}a&b\\c&d\end{bmatrix}, \qquad \det(A)=ad-bc.

For example,

det⁡[3214]=3(4)−2(1)=10.\det\begin{bmatrix}3&2\\1&4\end{bmatrix}=3(4)-2(1)=10.

The order of the products matters: the product of the main-diagonal entries is reduced by the product of the other-diagonal entries.

Takeaway: A is a scalar, and the 2×22\times 2 rule is ad−bcad-bc.

Row operations and triangular matrices

Elementary row operations simplify calculations, but each operation has a specific effect:

  1. Interchanging two rows changes the sign of the .

  2. Multiplying one row by a scalar kk multiplies the by kk.

  3. Adding a multiple of one row to another row leaves the unchanged.

For example, replacing row 22 with row 2−3row 12-3\text{row }1 changes

[1234]to[120−2]\begin{bmatrix}1&2\\3&4\end{bmatrix} \quad\text{to}\quad \begin{bmatrix}1&2\\0&-2\end{bmatrix}

without changing the . The resulting triangular matrix has

1(−2)=−2.1(-2)=-2.

A row of zeros forces the to be zero. Two equal or proportional rows also force the to be zero because the rows are linearly dependent.

For an upper triangular, lower triangular, or diagonal matrix, multiply the diagonal entries:

det⁡(A)=a11a22⋯ann.\det(A)=a_{11}a_{22}\cdots a_{nn}.

Thus,

det⁡[21−304500−2]=2⋅4⋅(−2)=−16.\det\begin{bmatrix} 2&1&-3\\ 0&4&5\\ 0&0&-2 \end{bmatrix}=2\cdot4\cdot(-2)=-16.

When using elimination, record row interchanges and row scalings. Row replacements require no adjustment.

Takeaway: Elimination is efficient when its effects are tracked accurately.

Core identities

Several identities connect determinants with familiar matrix operations. For square matrices of the same size,

det⁡(AB)=det⁡(A)det⁡(B),\det(AB)=\det(A)\det(B),
det⁡(AT)=det⁡(A),\det(A^T)=\det(A),

and

det⁡(I)=1.\det(I)=1.

If AA is invertible, then

det⁡(A−1)=1det⁡(A).\det(A^{-1})=\frac{1}{\det(A)}.

For an n×nn\times n matrix, multiplying every entry by kk multiplies every row by kk, so

det⁡(kA)=kndet⁡(A).\det(kA)=k^n\det(A).

The exponent is nn, because all nn rows are scaled. These identities can replace lengthy calculations: known determinants of factors immediately give the of a product, and the of an inverse is the reciprocal of the original when that reciprocal exists.

Takeaway: Determinants behave predictably under products, transposes, inverses, identity matrices, and scalar multiplication.

Geometric meaning

The describes how the transformation x↦Ax\mathbf{x}\mapsto A\mathbf{x} changes signed volume. Its absolute value gives the scale factor for area, volume, or higher-dimensional volume; its sign indicates whether orientation is preserved or reversed.

For a 2×22\times 2 matrix whose columns are two vectors, the area of their parallelogram is

area=∣det⁡(A)∣.\text{area}=|\det(A)|.

For a 3×33\times 3 matrix, ∣det⁡(A)∣|\det(A)| is the volume of the parallelepiped formed by its columns. More generally, for an n×nn\times n matrix, it is the corresponding nn-dimensional volume scale factor.

For example,

A=[2003]A=\begin{bmatrix}2&0\\0&3\end{bmatrix}

maps the unit square to a rectangle with area 2⋅3=62\cdot3=6, and det⁡(A)=6\det(A)=6. Thus, areas are multiplied by 66.

A negative means that the transformation reverses orientation while scaling volume by its absolute value. A reflection across the xx-axis has −1-1: it preserves lengths and areas but reverses orientation.

When det⁡(A)=0\det(A)=0, the transformation collapses space into a lower-dimensional set. A region with positive area can collapse to a line, or a solid with positive volume can collapse to a plane. This geometric collapse explains why a zero signals non-invertibility.

Takeaway: The absolute measures volume scaling, the sign records orientation, and zero indicates collapse.

Minors and

For a square matrix A=[aij]A=[a_{ij}], the MijM_{ij} is found by deleting row ii and column jj, then taking the of the remaining matrix. The corresponding is

Cij=(−1)i+jMij.C_{ij}=(-1)^{i+j}M_{ij}.

The signs follow the checkerboard pattern

[+−+−−+−++−+−−+−+].\begin{bmatrix} +&-&+&-\\ -&+&-&+\\ +&-&+&-\\ -&+&-&+ \end{bmatrix}.

can be performed along any row or column. Expanding along row ii gives

det⁡(A)=∑j=1naijCij,\det(A)=\sum_{j=1}^{n}a_{ij}C_{ij},

and expanding along column jj gives

det⁡(A)=∑i=1naijCij.\det(A)=\sum_{i=1}^{n}a_{ij}C_{ij}.

For

A=[1203−14205],A=\begin{bmatrix} 1&2&0\\ 3&-1&4\\ 2&0&5 \end{bmatrix},

expanding along the first row gives

det⁡(A)=1∣−1405∣−2∣3425∣+0∣3−120∣.\det(A)=1\begin{vmatrix}-1&4\\0&5\end{vmatrix}-2\begin{vmatrix}3&4\\2&5\end{vmatrix}+0\begin{vmatrix}3&-1\\2&0\end{vmatrix}.

Therefore,

det⁡(A)=1(−5)−2(15−8)=−5−14=−19.\det(A)=1(-5)-2(15-8)=-5-14=-19.

Choose a row or column with many zeros whenever possible. Although this method works for every square matrix, repeated expansion is usually inefficient for large matrices, where elimination is preferable.

Takeaway: Minors provide subdeterminants, cofactors provide signed subdeterminants, and expansion combines them into the .

Invertibility and the inverse

For an n×nn\times n matrix AA, the provides a complete test for invertibility:

A is invertible  ⟺  det⁡(A)≠0.A\text{ is invertible}\iff \det(A)\neq0.

When the is nonzero, these conditions are equivalent:

  • The rows and columns of AA are linearly independent.

  • The matrix has a pivot in every row and every column.

  • The equation Ax=0A\mathbf{x}=\mathbf{0} has only the trivial solution.

  • The transformation x↦Ax\mathbf{x}\mapsto A\mathbf{x} is one-to-one and onto.

  • The matrix has an inverse.

When det⁡(A)=0\det(A)=0, the matrix is a . Its columns are dependent, and some nonzero vector is mapped to the zero vector. The associated transformation collapses at least one direction.

The matrix is C=[Cij]C=[C_{ij}]. Its transpose is the :

adj⁡(A)=CT.\operatorname{adj}(A)=C^T.

If det⁡(A)≠0\det(A)\neq0, the inverse is

A−1=1det⁡(A)adj⁡(A).A^{-1}=\frac{1}{\det(A)}\operatorname{adj}(A).

This formula explains the relationship between determinants and inverses, although Gaussian elimination is generally faster for numerical calculations.

Takeaway: An has a nonzero and no collapsed direction; a has zero and dependent rows and columns.

Applications and problem-solving strategy

Consider the square system

Ax=b.A\mathbf{x}=\mathbf{b}.

If det⁡(A)≠0\det(A)\neq0, then the system has exactly one solution for every vector b\mathbf{b}:

x=A−1b.\mathbf{x}=A^{-1}\mathbf{b}.

If det⁡(A)=0\det(A)=0, the system may have no solution or infinitely many solutions, depending on b\mathbf{b}. It cannot have a unique solution for every right-hand side.

gives a -based formula for each component. For an nn-equation, nn-unknown system with det⁡(A)≠0\det(A)\neq0,

xi=det⁡(Ai)det⁡(A),x_i=\frac{\det(A_i)}{\det(A)},

where AiA_i is formed by replacing column ii of AA with b\mathbf{b}. is useful conceptually and for small systems, but it is usually inefficient for large systems because it requires many calculations.

Determinants also support area and volume calculations. When vectors are placed as the columns of a matrix, the gives the signed area or volume of the associated parallelogram or parallelepiped.

Problem-solving checklist:

  1. Confirm that the matrix is square.

  2. Choose an efficient method: a basic formula, elimination, triangularization, or .

  3. Track row swaps and row scalings.

  4. Interpret a zero or nonzero result in terms of invertibility and solutions.

  5. Use the absolute value for geometric size and the sign for orientation.

Takeaway: Determinants combine computation with structural information about linear systems and geometric transformations.