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 A, the central identity is
Aadj(A)=adj(A)A=det(A)I.
When det(A)=0, this identity gives
A−1=det(A)1adj(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 A be an n×n matrix. The minor Mij is the determinant of the (n−1)×(n−1) matrix obtained by deleting row i and column j from A.
For example, let
A=147258369.
To compute M12, delete row 1 and column 2. The remaining matrix is
[4769].
Thus
M12=det[4769]=4⋅9−6⋅7=−6.
A minor is always a determinant. It is not the smaller matrix itself.
14.2 Cofactors
The cofactor Cij is the signed minor
Cij=(−1)i+jMij.
The sign factor alternates according to the checkerboard pattern
+−+−⋮−+−+⋮+−+−⋮−⋯+⋯−⋯+⋯⋮.
For the previous matrix,
M12=−6.
Since
(−1)1+2=−1,
we have
C12=(−1)M12=6.
The cofactor differs from the minor only by this sign.
14.3 Cofactor Matrix
The cofactor matrix of A is the matrix whose (i,j)-entry is Cij:
The cofactor matrix has the same size as A. Each entry records the determinant of the complementary submatrix, with the correct sign.
For a 2×2 matrix
A=[acbd],
the cofactor matrix is
C=[d−b−ca].
Indeed,
C11=d,C12=−c,C21=−b,C22=a.
14.4 The Adjugate Matrix
The adjugate of A, written
adj(A),
is the transpose of the cofactor matrix:
adj(A)=CT.
Thus the (i,j)-entry of adj(A) is
Cji.
For
A=[acbd],
the cofactor matrix is
C=[d−b−ca],
so the adjugate is
adj(A)=CT=[d−c−ba].
This is the familiar matrix appearing in the 2×2 inverse formula.
14.5 Cofactor Expansion
The determinant of A may be expanded along any row or column.
Expansion along row i is
det(A)=j=1∑naijCij.
Expansion along column j is
det(A)=i=1∑naijCij.
This is called cofactor expansion or Laplace expansion. It expresses a determinant in terms of smaller determinants. (en.wikipedia.org)
For example, if
A=2300451−12,
expanding along the first row gives
det(A)=2C11+0C12+1C13.
Compute
C11=det[45−12]=13,
and
C13=det[3045]=15.
Therefore
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=104206357.
Expand along row 2:
det(A)=0C21+0C22+5C23.
Now
C23=(−1)2+3det[1426].
Thus
C23=−(1⋅6−2⋅4)=−(6−8)=2.
Therefore
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.
Also,
adj(A)A=det(A)I.
These identities hold for every square matrix A, whether or not A is invertible. (en.wikipedia.org)
The diagonal entries of Aadj(A) are cofactor expansions of 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), and let C=(Cij) be its cofactor matrix. Since
adj(A)=CT,
the (i,k)-entry of
Aadj(A)
is
j=1∑naijCkj.
If i=k, this is the cofactor expansion of det(A) along row i:
j=1∑naijCij=det(A).
If i=k, the sum is the determinant of a matrix obtained from A by replacing row k with row i. That matrix has two equal rows, so its determinant is zero.
Thus
Aadj(A)
has det(A) on the diagonal and 0 off the diagonal. Hence
Aadj(A)=det(A)I.
14.9 Inverse Formula
If A is invertible, then
det(A)=0.
From the adjugate identity,
Aadj(A)=det(A)I.
Divide by det(A):
A(det(A)1adj(A))=I.
Therefore
A−1=det(A)1adj(A).
This formula is valid exactly when det(A)=0. It gives a closed form for the inverse using determinants. (en.wikipedia.org)
This follows from the fact that minors of AT correspond to transposed minors of A, 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 A is n×n and c is a scalar, then
adj(cA)=cn−1adj(A).
The exponent is n−1 because each cofactor is the determinant of an (n−1)×(n−1) matrix. Multiplying A by c multiplies each such submatrix by c, so each cofactor is multiplied by
cn−1.
14.17 Determinant of the Adjugate
If A is n×n, then
det(adj(A))=det(A)n−1.
When A is invertible, this follows from
adj(A)=det(A)A−1.
Taking determinants gives
det(adj(A))=det(det(A)A−1).
Since scaling an n×n matrix by det(A) multiplies its determinant by det(A)n,
This does not mean that adj(A) must be the zero matrix. It means that every column of adj(A) lies in the null space of A.
For example,
A=[1224].
Then
adj(A)=[4−2−21].
The determinant is zero, and indeed
Aadj(A)=0.
Since A 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×n matrix A:
Rank of A
Behavior of adj(A)
n
adj(A) is invertible
n−1
adj(A) may be nonzero and has rank 1
≤n−2
adj(A)=0
This follows from the fact that entries of the adjugate are (n−1)×(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
Mistake
Correction
Confusing minor with cofactor
A cofactor is a signed minor
Forgetting the checkerboard signs
Use Cij=(−1)i+jMij
Forgetting to transpose the cofactor matrix
adj(A)=CT
Using the inverse formula when det(A)=0
The formula requires nonzero determinant
Calling the adjugate the same as the adjoint operator
In many contexts, adjoint means transpose or conjugate transpose
Taking cofactors from the wrong deleted row or column
Mij deletes row i and column j
14.22 Summary
Minors, cofactors, and adjugates refine the determinant into matrix form.
The main definitions are:
Object
Definition
Minor Mij
Determinant after deleting row i, column j
Cofactor Cij
(−1)i+jMij
Cofactor matrix C
Matrix with entries Cij
Adjugate adj(A)
CT
The central identity is
Aadj(A)=adj(A)A=det(A)I.
When det(A)=0, it gives
A−1=det(A)1adj(A).
Cofactors and adjugates provide the algebraic bridge from determinants to inverses, Cramer’s rule, and symbolic matrix formulas.
← → section · ↑ ↓ slide · Space next · F fullscreen · Esc exit