Skip to content

Chapter 14. Cofactors and Adjugates

Cofactors and adjugates give a structured way to express determinants, inverses, and solutions of square systems. They are built from minors. A minor is a smaller determinant obtained by deleting one row and one column. A cofactor is a signed minor. The adjugate is the transpose of the cofactor matrix. For a square matrix AA, the central identity is

Aadj(A)=adj(A)A=det(A)I. A\operatorname{adj}(A)=\operatorname{adj}(A)A=\det(A)I.

When det(A)0\det(A)\ne 0, this identity gives

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

This formula is important theoretically. It explains why determinants control invertibility and why entries of an inverse are ratios of determinants. The adjugate is the transpose of the cofactor matrix, and it satisfies the determinant identity above. (en.wikipedia.org)

14.1 Minors

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

For example, let

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

To compute M12M_{12}, delete row 11 and column 22. The remaining matrix is

[4679]. \begin{bmatrix} 4&6\\ 7&9 \end{bmatrix}.

Thus

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

A minor is always a determinant. It is not the smaller matrix itself.

14.2 Cofactors

The cofactor CijC_{ij} is the signed minor

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

The sign factor alternates according to the checkerboard pattern

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

For the previous matrix,

M12=6. M_{12}=-6.

Since

(1)1+2=1, (-1)^{1+2}=-1,

we have

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

The cofactor differs from the minor only by this sign.

14.3 Cofactor Matrix

The cofactor matrix of AA is the matrix whose (i,j)(i,j)-entry is CijC_{ij}:

C=[C11C12C1nC21C22C2nCn1Cn2Cnn]. C= \begin{bmatrix} C_{11}&C_{12}&\cdots&C_{1n}\\ C_{21}&C_{22}&\cdots&C_{2n}\\ \vdots&\vdots&\ddots&\vdots\\ C_{n1}&C_{n2}&\cdots&C_{nn} \end{bmatrix}.

The cofactor matrix has the same size as AA. Each entry records the determinant of the complementary submatrix, with the correct sign.

For a 2×22\times 2 matrix

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

the cofactor matrix is

C=[dcba]. C= \begin{bmatrix} d&-c\\ -b&a \end{bmatrix}.

Indeed,

C11=d,C12=c,C21=b,C22=a. C_{11}=d,\quad C_{12}=-c,\quad C_{21}=-b,\quad C_{22}=a.

14.4 The Adjugate Matrix

The adjugate of AA, written

adj(A), \operatorname{adj}(A),

is the transpose of the cofactor matrix:

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

Thus the (i,j)(i,j)-entry of adj(A)\operatorname{adj}(A) is

Cji. C_{ji}.

For

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

the cofactor matrix is

C=[dcba], C= \begin{bmatrix} d&-c\\ -b&a \end{bmatrix},

so the adjugate is

adj(A)=CT=[dbca]. \operatorname{adj}(A) = C^T = \begin{bmatrix} d&-b\\ -c&a \end{bmatrix}.

This is the familiar matrix appearing in the 2×22\times 2 inverse formula.

14.5 Cofactor Expansion

The determinant of AA may be expanded along any row or column.

Expansion along row ii is

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

Expansion along column jj is

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

This is called cofactor expansion or Laplace expansion. It expresses a determinant in terms of smaller determinants. (en.wikipedia.org)

For example, if

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

expanding along the first row gives

det(A)=2C11+0C12+1C13. \det(A) = 2C_{11}+0C_{12}+1C_{13}.

Compute

C11=det[4152]=13, C_{11} = \det \begin{bmatrix} 4&-1\\ 5&2 \end{bmatrix} = 13,

and

C13=det[3405]=15. C_{13} = \det \begin{bmatrix} 3&4\\ 0&5 \end{bmatrix} = 15.

Therefore

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

14.6 Expansion Along a Different Row or Column

Cofactor expansion gives the same determinant no matter which row or column is chosen.

A useful strategy is to expand along a row or column with many zeros.

For example,

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

Expand along row 22:

det(A)=0C21+0C22+5C23. \det(A)=0C_{21}+0C_{22}+5C_{23}.

Now

C23=(1)2+3det[1246]. C_{23}=(-1)^{2+3} \det \begin{bmatrix} 1&2\\ 4&6 \end{bmatrix}.

Thus

C23=(1624)=(68)=2. C_{23} = - (1\cdot 6-2\cdot 4) = - (6-8) = 2.

Therefore

det(A)=5(2)=10. \det(A)=5(2)=10.

The zeros remove two terms from the expansion.

14.7 The Adjugate Identity

The fundamental identity for the adjugate is

Aadj(A)=det(A)I. A\operatorname{adj}(A)=\det(A)I.

Also,

adj(A)A=det(A)I. \operatorname{adj}(A)A=\det(A)I.

These identities hold for every square matrix AA, whether or not AA is invertible. (en.wikipedia.org)

The diagonal entries of Aadj(A)A\operatorname{adj}(A) are cofactor expansions of det(A)\det(A). The off-diagonal entries are cofactor expansions of matrices with two equal rows, whose determinants are zero.

This explains why the product is a scalar multiple of the identity.

14.8 Proof Idea for the Adjugate Identity

Let A=(aij)A=(a_{ij}), and let C=(Cij)C=(C_{ij}) be its cofactor matrix. Since

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

the (i,k)(i,k)-entry of

Aadj(A) A\operatorname{adj}(A)

is

j=1naijCkj. \sum_{j=1}^{n}a_{ij}C_{kj}.

If i=ki=k, this is the cofactor expansion of det(A)\det(A) along row ii:

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

If iki\ne k, the sum is the determinant of a matrix obtained from AA by replacing row kk with row ii. That matrix has two equal rows, so its determinant is zero.

Thus

Aadj(A) A\operatorname{adj}(A)

has det(A)\det(A) on the diagonal and 00 off the diagonal. Hence

Aadj(A)=det(A)I. A\operatorname{adj}(A)=\det(A)I.

14.9 Inverse Formula

If AA is invertible, then

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

From the adjugate identity,

Aadj(A)=det(A)I. A\operatorname{adj}(A)=\det(A)I.

Divide by det(A)\det(A):

A(1det(A)adj(A))=I. A\left(\frac{1}{\det(A)}\operatorname{adj}(A)\right)=I.

Therefore

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

This formula is valid exactly when det(A)0\det(A)\ne 0. It gives a closed form for the inverse using determinants. (en.wikipedia.org)

14.10 Example: 2×22\times 2 Inverse

Let

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

Then

adj(A)=[dbca]. \operatorname{adj}(A) = \begin{bmatrix} d&-b\\ -c&a \end{bmatrix}.

Since

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

the inverse is

A1=1adbc[dbca], A^{-1} = \frac{1}{ad-bc} \begin{bmatrix} d&-b\\ -c&a \end{bmatrix},

provided

adbc0. ad-bc\ne 0.

For example,

A=[2153]. A= \begin{bmatrix} 2&1\\ 5&3 \end{bmatrix}.

Then

det(A)=2315=1. \det(A)=2\cdot 3-1\cdot 5=1.

Thus

A1=[3152]. A^{-1} = \begin{bmatrix} 3&-1\\ -5&2 \end{bmatrix}.

14.11 Example: Cofactor Matrix of a 3×33\times 3 Matrix

Let

A=[120011101]. A= \begin{bmatrix} 1&2&0\\ 0&1&1\\ 1&0&1 \end{bmatrix}.

Compute the cofactors.

First row:

C11=det[1101]=1, C_{11} = \det \begin{bmatrix} 1&1\\ 0&1 \end{bmatrix} =1, C12=det[0111]=(1)=1, C_{12} = - \det \begin{bmatrix} 0&1\\ 1&1 \end{bmatrix} = -(-1)=1, C13=det[0110]=1. C_{13} = \det \begin{bmatrix} 0&1\\ 1&0 \end{bmatrix} =-1.

Second row:

C21=det[2001]=2, C_{21} = - \det \begin{bmatrix} 2&0\\ 0&1 \end{bmatrix} =-2, C22=det[1011]=1, C_{22} = \det \begin{bmatrix} 1&0\\ 1&1 \end{bmatrix} =1, C23=det[1210]=2. C_{23} = - \det \begin{bmatrix} 1&2\\ 1&0 \end{bmatrix} =2.

Third row:

C31=det[2011]=2, C_{31} = \det \begin{bmatrix} 2&0\\ 1&1 \end{bmatrix} =2, C32=det[1001]=1, C_{32} = - \det \begin{bmatrix} 1&0\\ 0&1 \end{bmatrix} =-1, C33=det[1201]=1. C_{33} = \det \begin{bmatrix} 1&2\\ 0&1 \end{bmatrix} =1.

Thus the cofactor matrix is

C=[111212211]. C= \begin{bmatrix} 1&1&-1\\ -2&1&2\\ 2&-1&1 \end{bmatrix}.

14.12 Example: Adjugate and Inverse

Using the same matrix

A=[120011101], A= \begin{bmatrix} 1&2&0\\ 0&1&1\\ 1&0&1 \end{bmatrix},

the adjugate is the transpose of the cofactor matrix:

adj(A)=CT=[122111121]. \operatorname{adj}(A) = C^T = \begin{bmatrix} 1&-2&2\\ 1&1&-1\\ -1&2&1 \end{bmatrix}.

The determinant may be computed from the first row:

det(A)=1C11+2C12+0C13. \det(A)=1C_{11}+2C_{12}+0C_{13}.

Thus

det(A)=1+2=3. \det(A)=1+2=3.

Therefore

A1=13[122111121]. A^{-1} = \frac13 \begin{bmatrix} 1&-2&2\\ 1&1&-1\\ -1&2&1 \end{bmatrix}.

This agrees with the general formula

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

14.13 Cofactors and Cramer’s Rule

Cofactors also explain Cramer’s rule.

For an invertible system

Ax=b, Ax=b,

the solution is

x=A1b. x=A^{-1}b.

Using the adjugate formula,

x=1det(A)adj(A)b. x=\frac{1}{\det(A)}\operatorname{adj}(A)b.

The ii-th component of this vector can be written as

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

where Ai(b)A_i(b) is obtained by replacing column ii of AA by bb.

This gives Cramer’s rule. It is mainly a theoretical formula, since elimination is more efficient for large systems.

14.14 Adjugate of a Product

If AA and BB are square matrices of the same size, then

adj(AB)=adj(B)adj(A). \operatorname{adj}(AB)=\operatorname{adj}(B)\operatorname{adj}(A).

The order reverses, just as it does for inverses:

(AB)1=B1A1. (AB)^{-1}=B^{-1}A^{-1}.

When AA and BB are invertible, the formula follows from

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

The identity also holds in general. (en.wikipedia.org)

14.15 Transpose and Adjugate

The adjugate interacts naturally with transpose:

adj(AT)=adj(A)T. \operatorname{adj}(A^T)=\operatorname{adj}(A)^T.

This follows from the fact that minors of ATA^T correspond to transposed minors of AA, and determinants are unchanged by transpose.

For real matrices, this formula is often enough. For complex matrices, one must distinguish transpose from conjugate transpose. The classical adjugate uses cofactors and transpose, not the Hilbert-space adjoint.

14.16 Scalar Multiples

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

adj(cA)=cn1adj(A). \operatorname{adj}(cA)=c^{n-1}\operatorname{adj}(A).

The exponent is n1n-1 because each cofactor is the determinant of an (n1)×(n1)(n-1)\times(n-1) matrix. Multiplying AA by cc multiplies each such submatrix by cc, so each cofactor is multiplied by

cn1. c^{n-1}.

14.17 Determinant of the Adjugate

If AA is n×nn\times n, then

det(adj(A))=det(A)n1. \det(\operatorname{adj}(A))=\det(A)^{n-1}.

When AA is invertible, this follows from

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

Taking determinants gives

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

Since scaling an n×nn\times n matrix by det(A)\det(A) multiplies its determinant by det(A)n\det(A)^n,

det(adj(A))=det(A)ndet(A1)=det(A)n1det(A)=det(A)n1. \det(\operatorname{adj}(A)) = \det(A)^n\det(A^{-1}) = \det(A)^n\frac{1}{\det(A)} = \det(A)^{n-1}.

14.18 Singular Matrices

The adjugate is defined even when AA is singular.

If

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

then the adjugate identity becomes

Aadj(A)=0. A\operatorname{adj}(A)=0.

This does not mean that adj(A)\operatorname{adj}(A) must be the zero matrix. It means that every column of adj(A)\operatorname{adj}(A) lies in the null space of AA.

For example,

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

Then

adj(A)=[4221]. \operatorname{adj}(A) = \begin{bmatrix} 4&-2\\ -2&1 \end{bmatrix}.

The determinant is zero, and indeed

Aadj(A)=0. A\operatorname{adj}(A)=0.

Since AA is singular, the inverse formula cannot be used.

14.19 Rank and the Adjugate

The adjugate reflects the rank of a square matrix.

For an n×nn\times n matrix AA:

Rank of AABehavior of adj(A)\operatorname{adj}(A)
nnadj(A)\operatorname{adj}(A) is invertible
n1n-1adj(A)\operatorname{adj}(A) may be nonzero and has rank 11
n2\le n-2adj(A)=0\operatorname{adj}(A)=0

This follows from the fact that entries of the adjugate are (n1)×(n1)(n-1)\times(n-1) minors. If all such minors vanish, the adjugate is zero.

14.20 Computational Role

Cofactors and adjugates are valuable for theory, symbolic formulas, and small matrices.

For large numerical matrices, they are usually not the preferred method for computing inverses. Cofactor expansion grows rapidly in cost. Row reduction, LU decomposition, QR decomposition, and other factorizations are more efficient and numerically better behaved.

Thus the adjugate formula should be understood as a structural identity first and a computational method only for small or symbolic cases.

14.21 Common Mistakes

MistakeCorrection
Confusing minor with cofactorA cofactor is a signed minor
Forgetting the checkerboard signsUse Cij=(1)i+jMijC_{ij}=(-1)^{i+j}M_{ij}
Forgetting to transpose the cofactor matrixadj(A)=CT\operatorname{adj}(A)=C^T
Using the inverse formula when det(A)=0\det(A)=0The formula requires nonzero determinant
Calling the adjugate the same as the adjoint operatorIn many contexts, adjoint means transpose or conjugate transpose
Taking cofactors from the wrong deleted row or columnMijM_{ij} deletes row ii and column jj

14.22 Summary

Minors, cofactors, and adjugates refine the determinant into matrix form.

The main definitions are:

ObjectDefinition
Minor MijM_{ij}Determinant after deleting row ii, column jj
Cofactor CijC_{ij}(1)i+jMij(-1)^{i+j}M_{ij}
Cofactor matrix CCMatrix with entries CijC_{ij}
Adjugate adj(A)\operatorname{adj}(A)CTC^T

The central identity is

Aadj(A)=adj(A)A=det(A)I. A\operatorname{adj}(A)=\operatorname{adj}(A)A=\det(A)I.

When det(A)0\det(A)\ne 0, it gives

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

Cofactors and adjugates provide the algebraic bridge from determinants to inverses, Cramer’s rule, and symbolic matrix formulas.