You have a square matrix A and want to find A−1. There is a clean route through the adjoint (or adjugate) of A — a matrix built from the cofactors of A that has a beautiful relationship with A itself.
The intuition
For a 2×2 matrix you already know the inverse:
A=(acbd),A−1=ad−bc1(d−c−ba).
That second matrix, (d−c−ba), is exactly adj(A). The adjoint is the object you multiply by 1/det(A) to recover the inverse.
Note
In Indian exam usage, "adjoint" always means the adjugate — the transpose of the cofactor matrix — not the Hermitian conjugate.
Building the adjoint
For each entry aij of an n×n matrix, the cofactor is
Cij=(−1)i+jMij,
where Mij is the minor (the determinant left after deleting row i and column j). Collect the cofactors into the cofactor matrix, then transpose:
adj(A)=[Cij]T,
so the (i,j) entry of adj(A) is Cji.
The central property
A⋅adj(A)=adj(A)⋅A=det(A)In.
Why? The (i,i) entry of Aadj(A) is ai1Ci1+⋯+ainCin — precisely the expansion of det(A) along row i. An off-diagonal (i,j) entry is the expansion of a determinant with two equal rows, which is 0.
Consequences
If det(A)=0: A−1=det(A)1adj(A).
If det(A)=0: A⋅adj(A)=O, so the adjoint annihilates A.
Order fact: det(adj(A))=det(A)n−1.
Watch out
The adjoint is the transpose of the cofactor matrix, not the cofactor matrix itself. Forgetting the transpose (which swaps the off-diagonal cofactors) is the most common slip.
For A=(1324), the cofactors give adj(A)=(4−3−21), and indeed Aadj(A)=(−200−2)=(−2)I2=det(A)I2.
The Adjoint Matrix Property connecting A · adj(A) to det(A)·I is central to the CBSE Class 12 Determinants chapter, where it forms the standard route to computing a matrix inverse using the adjoint method — a topic frequently listed under "adjoint and inverse of a matrix important questions" for board exams. This identity also underpins the matrix method for solving simultaneous linear equations, tested in both CBSE boards and JEE Main.
Concept: Adjoint Matrix Property — For any square matrix A, A(adj A)=(adj A)A=∣A∣I.
Step 1: Compute ∣A∣
Expanding along R1:
∣A∣=1(3⋅1−5⋅0)−(−1)(2⋅1−5⋅(−2))+2(2⋅0−3⋅(−2))
=1(3)+1(2+10)+2(0+6)=3+12+12=27.
Step 2: Find adj A
Cofactors:
C11=3, C12=−12, C13=6
C21=1, C22=5, C23=2
C31=−11, C32=−1, C33=5
So adj A=3−126152−11−15.
Step 3: Verify A(adj A)
A(adj A)=12−2−1302513−126152−11−15
=270002700027=27I.
Similarly, (adj A)A gives the same result.
✓Final answer
The property is verified: A(adj A)=(adj A)A=27I=∣A∣I.
For any square matrix A, the product A(adj A) equals (adj A)A=∣A∣I. Here we verify this identity for the given 3×3 matrix by computing its determinant and adjoint, then checking both products.
The property A(adj A)=(adj A)A=∣A∣I is one of the most elegant results in matrix algebra. It tells us that the adjoint (or adjugate) of a matrix is essentially a "scaled inverse" — when A is invertible, dividing the adjoint by the determinant gives the inverse. But the identity holds for any square matrix, invertible or not.
Why does this work? Each entry of adj A is a cofactor (signed minor) of A. When you multiply A by adj A, the (i,j) entry becomes the sum of products of row i of A with column j of cofactors. For i=j, this sum is exactly the Laplace expansion of ∣A∣ along row i. For i=j, it's like expanding a matrix with two identical rows — which gives zero. So the product is diagonal, with ∣A∣ on every diagonal entry.
Let's verify this concretely.
For a 3×3 matrix A=[aij], the adjoint is the transpose of the cofactor matrix: (adj A)ij=Cji, where Cij=(−1)i+jMij and Mij is the minor (determinant after deleting row i, column j).
Step 1: Compute the determinant ∣A∣.
We have
A=12−2−130251.
Expand along the third row (it has a zero, which saves work):
The first term: (−2)⋅(+1)⋅[(−1)(5)−(2)(3)]=(−2)[−5−6]=(−2)(−11)=22.
The third term: 1⋅(+1)⋅[(1)(3)−(−1)(2)]=3+2=5.
So ∣A∣=22+5=27.
Note
Always double-check the sign pattern: (−1)i+j is + when i+j is even, − when odd. Row 3, column 1: 3+1=4 (even) → + sign. Row 3, column 3: 3+3=6 (even) → + sign.
Step 2: Find all cofactors Cij.
We need nine cofactors. Let's compute them systematically.
C11=(−1)1+13051=(3⋅1−5⋅0)=3.
C12=(−1)1+22−251=−[2⋅1−5⋅(−2)]=−[2+10]=−12.
C13=(−1)1+32−230=(2⋅0−3⋅(−2))=0+6=6.
C21=(−1)2+1−1021=−[(−1)⋅1−2⋅0]=−[−1−0]=1.
C22=(−1)2+21−221=(1⋅1−2⋅(−2))=1+4=5.
C23=(−1)2+31−2−10=−[1⋅0−(−1)⋅(−2)]=−[0−2]=2.
C31=(−1)3+1−1325=[(−1)⋅5−2⋅3]=−5−6=−11.
C32=(−1)3+21225=−[1⋅5−2⋅2]=−[5−4]=−1.
C33=(−1)3+312−13=(1⋅3−(−1)⋅2)=3+2=5.
Watch out
A common mistake: forgetting the (−1)i+j sign. For C12, the minor is 2⋅1−5⋅(−2)=12, but the sign is negative because 1+2=3 is odd. So C12=−12, not 12.
Step 3: Write the adjoint matrix.
The adjoint is the transpose of the cofactor matrix:
Multiply A (on the left) by adj A (on the right). Let's do it entry by entry.
Row 1 of A: [1,−1,2].
(1,1) entry: 1⋅3+(−1)⋅(−12)+2⋅6=3+12+12=27.
(1,2) entry: 1⋅1+(−1)⋅5+2⋅2=1−5+4=0.
(1,3) entry: 1⋅(−11)+(−1)⋅(−1)+2⋅5=−11+1+10=0.
Row 2 of A: [2,3,5].
(2,1) entry: 2⋅3+3⋅(−12)+5⋅6=6−36+30=0.
(2,2) entry: 2⋅1+3⋅5+5⋅2=2+15+10=27.
(2,3) entry: 2⋅(−11)+3⋅(−1)+5⋅5=−22−3+25=0.
Row 3 of A: [−2,0,1].
(3,1) entry: (−2)⋅3+0⋅(−12)+1⋅6=−6+0+6=0.
(3,2) entry: (−2)⋅1+0⋅5+1⋅2=−2+0+2=0.
(3,3) entry: (−2)⋅(−11)+0⋅(−1)+1⋅5=22+0+5=27.
So
A(adj A)=270002700027=27⋅I=∣A∣I.
Step 5: Compute (adj A)A.
Now multiply adj A (on the left) by A (on the right).
Row 1 of adj A: [3,1,−11].
(1,1) entry: 3⋅1+1⋅2+(−11)⋅(−2)=3+2+22=27.
(1,2) entry: 3⋅(−1)+1⋅3+(−11)⋅0=−3+3+0=0.
(1,3) entry: 3⋅2+1⋅5+(−11)⋅1=6+5−11=0.
Row 2 of adj A: [−12,5,−1].
(2,1) entry: (−12)⋅1+5⋅2+(−1)⋅(−2)=−12+10+2=0.
(2,2) entry: (−12)⋅(−1)+5⋅3+(−1)⋅0=12+15+0=27.
(2,3) entry: (−12)⋅2+5⋅5+(−1)⋅1=−24+25−1=0.
Row 3 of adj A: [6,2,5].
(3,1) entry: 6⋅1+2⋅2+5⋅(−2)=6+4−10=0.
(3,2) entry: 6⋅(−1)+2⋅3+5⋅0=−6+6+0=0.
(3,3) entry: 6⋅2+2⋅5+5⋅1=12+10+5=27.
Thus
(adj A)A=270002700027=27⋅I=∣A∣I.
Both products give the same diagonal matrix, confirming the identity.
Tip
Notice that the off-diagonal entries all turned out to be zero. This is not a coincidence — it's the "two identical rows" phenomenon. For example, the (1,2) entry of A(adj A) is the expansion of a matrix where row 1 of A replaces row 2, giving two identical rows and hence determinant zero.
✓Final answer
We have verified that A(adj A)=(adj A)A=27I=∣A∣I, confirming the identity.
Method: Verifying A(adjA)=(adjA)A=∣A∣I
The standard procedure for any "verify the adjoint identity" question.
Steps
Step 1: Compute ∣A∣
Expand along whichever row or column has the most zeros (or the first row if none do).
Step 2: Compute all nine cofactors Cij=(−1)i+jMij
Work systematically through every entry, deleting its row and column to form the 2×2 minor, then applying the correct sign.
Step 3: Assemble the adjoint as the TRANSPOSE of the cofactor matrix
adj(A)=C11C12C13C21C22C23C31C32C33.
Don't skip the transpose — the adjoint is not simply the cofactor matrix itself.
Step 4: Multiply A⋅adj(A) entry by entry
Every diagonal entry of the product should come out equal to ∣A∣ (it is the row-expansion of ∣A∣ along that row); every off-diagonal entry should come out 0 (it is the expansion of a determinant with a repeated row).
Step 5: Repeat for (adjA)⋅A and confirm both equal ∣A∣I
The product in the reverse order gives the identical diagonal matrix, confirming the identity.
Common Mistakes
Mistake 1: Forgetting the (−1)i+j sign when computing a cofactor
Why it's wrong: for example C12's minor evaluates to 12, but the correct sign for position (1,2) is negative (since 1+2=3 is odd) — skipping the sign gives C12=12 instead of the correct −12, which then corrupts every product using it. Correct approach: write out (−1)i+j explicitly for every one of the nine cofactors before substituting the minor.
Mistake 2: Writing the adjoint as the cofactor matrix itself, without transposing
Why it's wrong: the adjoint is defined as the transpose of the cofactor matrix — using the untransposed cofactor matrix directly gives A(adjA) a non-diagonal result instead of ∣A∣I, since the off-diagonal entries won't cancel correctly. Correct approach: always swap rows and columns of the cofactor matrix (i.e. (adjA)ij=Cji) before multiplying by A.