Skip to content

Chapter 13. Determinants

A determinant is a scalar attached to a square matrix. It measures several things at once: whether the matrix is invertible, how the corresponding linear transformation scales volume, and whether orientation is preserved or reversed. A matrix has a determinant only when it is square. For an n×nn\times n matrix AA, the determinant is written as

det(A) \det(A)

or

A. |A|.

The determinant is zero exactly when the matrix is singular. Equivalently, a square matrix is invertible exactly when its determinant is nonzero.

13.1 Determinants of 1×11\times 1 Matrices

The determinant of a 1×11\times 1 matrix is its only entry:

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

For example,

det([7])=7. \det([7])=7.

This base case is used in recursive definitions of larger determinants.

13.2 Determinants of 2×22\times 2 Matrices

For a 2×22\times 2 matrix

A=[abcd], A= \begin{bmatrix} a&b\\ c&d \end{bmatrix},

the determinant is

det(A)=adbc. \det(A)=ad-bc.

For example,

det[3254]=3425=1210=2. \det \begin{bmatrix} 3&2\\ 5&4 \end{bmatrix} = 3\cdot 4-2\cdot 5 = 12-10 = 2.

The two products adad and bcbc compare the two diagonal contributions. If they cancel, the determinant is zero.

13.3 Area Interpretation in the Plane

Let

A=[abcd]. A= \begin{bmatrix} a&b\\ c&d \end{bmatrix}.

The columns of AA are

u=[ac],v=[bd]. u= \begin{bmatrix} a\\ c \end{bmatrix}, \qquad v= \begin{bmatrix} b\\ d \end{bmatrix}.

The absolute value

det(A) |\det(A)|

is the area of the parallelogram spanned by uu and vv.

If

det(A)>0, \det(A)>0,

the transformation preserves orientation. If

det(A)<0, \det(A)<0,

the transformation reverses orientation. If

det(A)=0, \det(A)=0,

the parallelogram has zero area, so the two column vectors are linearly dependent.

13.4 Determinants of 3×33\times 3 Matrices

For

A=[abcdefghi], A= \begin{bmatrix} a&b&c\\ d&e&f\\ g&h&i \end{bmatrix},

one formula is

det(A)=a(eifh)b(difg)+c(dheg). \det(A) = a(ei-fh)-b(di-fg)+c(dh-eg).

For example,

A=[123045106]. A= \begin{bmatrix} 1&2&3\\ 0&4&5\\ 1&0&6 \end{bmatrix}.

Then

det(A)=1(4650)2(0651)+3(0041). \det(A) = 1(4\cdot 6-5\cdot 0) - 2(0\cdot 6-5\cdot 1) + 3(0\cdot 0-4\cdot 1).

Thus

det(A)=242(5)+3(4)=24+1012=22. \det(A)=24-2(-5)+3(-4)=24+10-12=22.

The absolute value of a 3×33\times 3 determinant is the volume of the parallelepiped spanned by its three column vectors.

13.5 Minors

Let AA be an n×nn\times n matrix. The minor MijM_{ij} is the determinant of the matrix obtained by deleting row ii and column jj from AA.

For example, if

A=[123456789], A= \begin{bmatrix} 1&2&3\\ 4&5&6\\ 7&8&9 \end{bmatrix},

then the minor M12M_{12} is obtained by deleting row 11 and column 22:

M12=det[4679]. M_{12} = \det \begin{bmatrix} 4&6\\ 7&9 \end{bmatrix}.

Therefore

M12=4967=3642=6. M_{12}=4\cdot 9-6\cdot 7=36-42=-6.

13.6 Cofactors

The cofactor CijC_{ij} is the signed minor

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

The signs follow the checkerboard pattern

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

For the previous example,

C12=(1)1+2M12=M12=6. C_{12}=(-1)^{1+2}M_{12}=-M_{12}=6.

Cofactors are used in Laplace expansion and in the adjugate formula for the inverse.

13.7 Laplace Expansion

The determinant can be computed by expanding along any row or column.

Expansion along row ii gives

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

Expansion along column jj gives

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

This is called Laplace expansion. It reduces an n×nn\times n determinant to determinants of (n1)×(n1)(n-1)\times(n-1) matrices.

13.8 Example of Cofactor Expansion

Let

A=[201341052]. A= \begin{bmatrix} 2&0&1\\ 3&4&-1\\ 0&5&2 \end{bmatrix}.

Expand along the first row:

det(A)=2det[4152]0det[3102]+1det[3405]. \det(A) = 2 \det \begin{bmatrix} 4&-1\\ 5&2 \end{bmatrix} - 0 \det \begin{bmatrix} 3&-1\\ 0&2 \end{bmatrix} + 1 \det \begin{bmatrix} 3&4\\ 0&5 \end{bmatrix}.

Compute the 2×22\times 2 determinants:

det[4152]=42(1)5=13, \det \begin{bmatrix} 4&-1\\ 5&2 \end{bmatrix} = 4\cdot 2-(-1)\cdot 5=13,

and

det[3405]=3540=15. \det \begin{bmatrix} 3&4\\ 0&5 \end{bmatrix} = 3\cdot 5-4\cdot 0=15.

Thus

det(A)=2(13)+15=41. \det(A)=2(13)+15=41.

Choosing a row or column with zeros reduces the amount of computation.

13.9 Triangular Matrices

If AA is upper triangular or lower triangular, then its determinant is the product of its diagonal entries.

For

A=[a110a2200ann], A= \begin{bmatrix} a_{11}&*&\cdots&*\\ 0&a_{22}&\cdots&*\\ \vdots&\vdots&\ddots&\vdots\\ 0&0&\cdots&a_{nn} \end{bmatrix},

we have

det(A)=a11a22ann. \det(A)=a_{11}a_{22}\cdots a_{nn}.

For example,

det[251034007]=2(3)(7)=42. \det \begin{bmatrix} 2&5&1\\ 0&-3&4\\ 0&0&7 \end{bmatrix} = 2(-3)(7) = -42.

This property is central to computing determinants by elimination.

13.10 Determinants and Row Operations

Elementary row operations affect determinants in simple ways.

Row operationEffect on determinant
Swap two rowsMultiplies determinant by 1-1
Multiply one row by ccMultiplies determinant by cc
Add a multiple of one row to anotherDoes not change determinant

These rules allow determinants to be computed by row reduction, provided the effects of row operations are tracked.

13.11 Example by Row Reduction

Let

A=[123257106]. A= \begin{bmatrix} 1&2&3\\ 2&5&7\\ 1&0&6 \end{bmatrix}.

Use row replacement operations, which do not change the determinant:

R2R22R1,R3R3R1. R_2\leftarrow R_2-2R_1, \qquad R_3\leftarrow R_3-R_1.

Then

[123011023]. \begin{bmatrix} 1&2&3\\ 0&1&1\\ 0&-2&3 \end{bmatrix}.

Now use

R3R3+2R2. R_3\leftarrow R_3+2R_2.

This gives

[123011005]. \begin{bmatrix} 1&2&3\\ 0&1&1\\ 0&0&5 \end{bmatrix}.

The matrix is upper triangular. Since only row replacement operations were used, the determinant has not changed. Therefore

det(A)=115=5. \det(A)=1\cdot 1\cdot 5=5.

13.12 Row Swaps and Scaling

If row swaps or row scalings are used, their effects must be recorded.

For example,

A=[0234]. A= \begin{bmatrix} 0&2\\ 3&4 \end{bmatrix}.

Swap rows:

[0234][3402]. \begin{bmatrix} 0&2\\ 3&4 \end{bmatrix} \longrightarrow \begin{bmatrix} 3&4\\ 0&2 \end{bmatrix}.

The triangular determinant is

32=6. 3\cdot 2=6.

But one row swap was used, so the original determinant is

det(A)=6. \det(A)=-6.

Indeed,

det(A)=0423=6. \det(A)=0\cdot 4-2\cdot 3=-6.

13.13 Zero Determinants

A square matrix has determinant zero when its rows or columns are linearly dependent.

For example,

A=[1224]. A= \begin{bmatrix} 1&2\\ 2&4 \end{bmatrix}.

The second row is twice the first. Therefore the rows are dependent.

Compute:

det(A)=1422=44=0. \det(A)=1\cdot 4-2\cdot 2=4-4=0.

Geometrically, the corresponding transformation collapses area or volume to zero. Algebraically, the matrix is singular.

13.14 Determinants and Invertibility

For an n×nn\times n matrix AA,

A is invertible A \text{ is invertible}

if and only if

det(A)0. \det(A)\ne 0.

Equivalently,

A is singular A \text{ is singular}

if and only if

det(A)=0. \det(A)=0.

This criterion connects determinants with rank, nullity, pivots, and solutions of linear systems.

13.15 Determinant of a Product

If AA and BB are n×nn\times n matrices, then

det(AB)=det(A)det(B). \det(AB)=\det(A)\det(B).

This rule is one of the most important determinant identities. It says that volume-scaling factors multiply under composition of linear transformations.

For example, if

det(A)=3 \det(A)=3

and

det(B)=2, \det(B)=-2,

then

det(AB)=6. \det(AB)=-6.

13.16 Determinant of an Inverse

If AA is invertible, then

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

This follows from

AA1=I AA^{-1}=I

and the product rule:

det(A)det(A1)=det(I)=1. \det(A)\det(A^{-1})=\det(I)=1.

Thus the determinant of the inverse is the reciprocal of the determinant.

13.17 Determinant of a Transpose

For every square matrix AA,

det(AT)=det(A). \det(A^T)=\det(A).

Therefore every row property of determinants has a corresponding column property. For example, swapping two columns changes the sign of the determinant, multiplying one column by cc multiplies the determinant by cc, and adding a multiple of one column to another leaves the determinant unchanged.

13.18 Determinant of a Scalar Multiple

If AA is an n×nn\times n matrix and cc is a scalar, then

det(cA)=cndet(A). \det(cA)=c^n\det(A).

The exponent nn appears because multiplying the whole matrix by cc multiplies every row by cc. Since there are nn rows, the determinant is multiplied by cc exactly nn times.

For example, if AA is 3×33\times 3, then

det(2A)=23det(A)=8det(A). \det(2A)=2^3\det(A)=8\det(A).

13.19 Determinants and Volume

If AA is an n×nn\times n real matrix, then det(A)|\det(A)| is the factor by which the linear transformation xAxx\mapsto Ax scales nn-dimensional volume.

For example, if

det(A)=5, \det(A)=5,

then AA multiplies volumes by 55.

If

det(A)=5, \det(A)=-5,

then AA still multiplies volumes by 55, but it reverses orientation.

If

det(A)=0, \det(A)=0,

then AA collapses nn-dimensional volume to zero.

13.20 Orientation

In R2\mathbb{R}^2, a positive determinant preserves counterclockwise orientation. A negative determinant reverses it.

For example,

A=[1001] A= \begin{bmatrix} 1&0\\ 0&1 \end{bmatrix}

has determinant 11, so it preserves orientation.

The reflection matrix

B=[1001] B= \begin{bmatrix} 1&0\\ 0&-1 \end{bmatrix}

has determinant 1-1, so it reverses orientation.

The sign of the determinant therefore records orientation, while its absolute value records volume scaling.

13.21 Determinants and Eigenvalues

If AA is an n×nn\times n matrix with eigenvalues

λ1,λ2,,λn, \lambda_1,\lambda_2,\ldots,\lambda_n,

counted with algebraic multiplicity, then

det(A)=λ1λ2λn. \det(A)=\lambda_1\lambda_2\cdots\lambda_n.

This fact is developed later through the characteristic polynomial. It explains why a zero eigenvalue is equivalent to a zero determinant.

13.22 Determinants and Linear Independence

The columns of an n×nn\times n matrix AA are linearly independent if and only if

det(A)0. \det(A)\ne 0.

They are linearly dependent if and only if

det(A)=0. \det(A)=0.

Thus the determinant tests whether the columns form a basis of FnF^n.

For example, if

A=[a1a2an], A= \begin{bmatrix} |&|&&|\\ a_1&a_2&\cdots&a_n\\ |&|&&| \end{bmatrix},

then

det(A)0 \det(A)\ne 0

means that a1,,ana_1,\ldots,a_n form a basis of FnF^n.

13.23 Determinants and Rank

For an n×nn\times n matrix AA,

det(A)0 \det(A)\ne 0

if and only if

rank(A)=n. \operatorname{rank}(A)=n.

If

det(A)=0, \det(A)=0,

then

rank(A)<n. \operatorname{rank}(A)<n.

Thus determinant zero means that at least one pivot is missing.

13.24 Cramer’s Rule

Cramer’s rule gives a formula for solving a square system

Ax=b Ax=b

when

det(A)0. \det(A)\ne 0.

Let Ai(b)A_i(b) be the matrix obtained from AA by replacing column ii with bb. Then the solution satisfies

xi=det(Ai(b))det(A). x_i=\frac{\det(A_i(b))}{\det(A)}.

Cramer’s rule is theoretically important because it gives an explicit formula for the solution. For computation, elimination and matrix factorizations are usually preferred, especially for large systems.

13.25 Determinants and Computation

Cofactor expansion is useful for small matrices or matrices with many zeros. For large dense matrices, row reduction is more efficient.

The practical method is:

StepAction
1Use row operations to reduce to triangular form
2Track row swaps and row scalings
3Multiply the diagonal entries
4Adjust for recorded row operations

This connects determinant computation directly with Gaussian elimination.

13.26 Common Mistakes

MistakeCorrection
Taking determinants of non-square matricesDeterminants are defined for square matrices
Forgetting sign changes from row swapsEach row swap multiplies determinant by 1-1
Treating row scaling as harmlessScaling a row by cc scales determinant by cc
Forgetting that row replacement preserves determinantAdding a multiple of one row to another leaves determinant unchanged
Assuming det(A+B)=det(A)+det(B)\det(A+B)=\det(A)+\det(B)This is generally false
Writing det(cA)=cdet(A)\det(cA)=c\det(A) for n×nn\times n matricesCorrect formula is det(cA)=cndet(A)\det(cA)=c^n\det(A)
Ignoring orientationThe sign of the determinant has geometric meaning

13.27 Summary

The determinant is a scalar invariant of a square matrix. It detects invertibility, measures volume scaling, and records orientation.

The main formulas are:

ConceptFormula
1×11\times 1 determinantdet([a])=a\det([a])=a
2×22\times 2 determinantdet[abcd]=adbc\det\begin{bmatrix}a&b\\c&d\end{bmatrix}=ad-bc
Triangular matrixProduct of diagonal entries
Productdet(AB)=det(A)det(B)\det(AB)=\det(A)\det(B)
Inversedet(A1)=1/det(A)\det(A^{-1})=1/\det(A)
Transposedet(AT)=det(A)\det(A^T)=\det(A)
Scalar multipledet(cA)=cndet(A)\det(cA)=c^n\det(A)
InvertibilityAA invertible iff det(A)0\det(A)\ne 0

Determinants are not only formulas. They encode how a square matrix changes space. A nonzero determinant means the transformation preserves full dimension. A zero determinant means the transformation collapses space in at least one direction.