Adjoint and inverse
In the previous subtopic we built the cofactor matrix of a square A A A . Its transpose is called the adjoint of A A A (also adjugate; in older Indian textbooks called the classical adjoint ). The adjoint satisfies A ⋅ adj A = ( det A ) I A \cdot \text{adj}\,A = (\det A)\,I A ⋅ adj A = ( det A ) I , which gives an explicit formula for the inverse:
A − 1 = 1 det A adj A , provided det A ≠ 0. A^{-1} = \frac{1}{\det A}\,\text{adj}\,A, \quad \text{provided } \det A \neq 0. A − 1 = d e t A 1 adj A , provided det A = 0.
This is the adjoint method for inverting a matrix.
Definition
The adjoint of a square matrix A A A is the transpose of its cofactor matrix:
adj ( A ) = cof ( A ) T . \text{adj}(A) = \text{cof}(A)^T. adj ( A ) = cof ( A ) T .
So ( adj A ) i j = C j i (\text{adj}\,A)_{ij} = C_{ji} ( adj A ) ij = C j i , where C j i C_{ji} C j i is the ( j , i ) (j, i) ( j , i ) cofactor of A A A .
The main identity
Theorem. For any square A A A ,
A ⋅ adj ( A ) = adj ( A ) ⋅ A = ( det A ) I . A \cdot \text{adj}(A) = \text{adj}(A) \cdot A = (\det A) I. A ⋅ adj ( A ) = adj ( A ) ⋅ A = ( det A ) I .
Proof sketch. The ( i , k ) (i, k) ( i , k ) entry of A ⋅ adj ( A ) A \cdot \text{adj}(A) A ⋅ adj ( A ) is ∑ j a i j ( adj A ) j k = ∑ j a i j C k j \sum_j a_{ij} (\text{adj} A)_{jk} = \sum_j a_{ij} C_{kj} ∑ j a ij ( adj A ) j k = ∑ j a ij C k j . By cofactor orthogonality this equals det A \det A det A if i = k i = k i = k , and 0 0 0 otherwise. So the product is ( det A ) I (\det A) I ( det A ) I .
Dividing both sides by det A \det A det A (when nonzero):
A − 1 = 1 det A adj ( A ) . A^{-1} = \frac{1}{\det A}\,\text{adj}(A). A − 1 = d e t A 1 adj ( A ) .
This is the adjoint formula for the inverse. It is explicit, clean, and central to proofs.
Worked computation
Find the inverse of A = ( 2 3 1 1 2 2 3 1 − 1 ) A = \begin{pmatrix} 2 & 3 & 1 \\ 1 & 2 & 2 \\ 3 & 1 & -1 \end{pmatrix} A = 2 1 3 3 2 1 1 2 − 1 .
Step 1. Compute det A \det A det A by expansion along row 1.
det A = 2 ( 2 ⋅ − 1 − 2 ⋅ 1 ) − 3 ( 1 ⋅ − 1 − 2 ⋅ 3 ) + 1 ( 1 ⋅ 1 − 2 ⋅ 3 ) \det A = 2(2 \cdot -1 - 2 \cdot 1) - 3(1 \cdot -1 - 2 \cdot 3) + 1(1 \cdot 1 - 2 \cdot 3) det A = 2 ( 2 ⋅ − 1 − 2 ⋅ 1 ) − 3 ( 1 ⋅ − 1 − 2 ⋅ 3 ) + 1 ( 1 ⋅ 1 − 2 ⋅ 3 )
= 2 ( − 4 ) − 3 ( − 7 ) + 1 ( − 5 ) = − 8 + 21 − 5 = 8 = 2(-4) - 3(-7) + 1(-5) = -8 + 21 - 5 = 8 = 2 ( − 4 ) − 3 ( − 7 ) + 1 ( − 5 ) = − 8 + 21 − 5 = 8 .
So det A = 8 ≠ 0 \det A = 8 \neq 0 det A = 8 = 0 . The matrix is invertible.
Step 2. Compute the cofactors.
C 11 = + det ( 2 2 1 − 1 ) = − 4 C_{11} = +\det\begin{pmatrix} 2 & 2 \\ 1 & -1 \end{pmatrix} = -4 C 11 = + det ( 2 1 2 − 1 ) = − 4 .
C 12 = − det ( 1 2 3 − 1 ) = − ( − 1 − 6 ) = 7 C_{12} = -\det\begin{pmatrix} 1 & 2 \\ 3 & -1 \end{pmatrix} = -(-1 - 6) = 7 C 12 = − det ( 1 3 2 − 1 ) = − ( − 1 − 6 ) = 7 .
C 13 = + det ( 1 2 3 1 ) = − 5 C_{13} = +\det\begin{pmatrix} 1 & 2 \\ 3 & 1 \end{pmatrix} = -5 C 13 = + det ( 1 3 2 1 ) = − 5 .
C 21 = − det ( 3 1 1 − 1 ) = − ( − 3 − 1 ) = 4 C_{21} = -\det\begin{pmatrix} 3 & 1 \\ 1 & -1 \end{pmatrix} = -(-3 - 1) = 4 C 21 = − det ( 3 1 1 − 1 ) = − ( − 3 − 1 ) = 4 .
C 22 = + det ( 2 1 3 − 1 ) = − 5 C_{22} = +\det\begin{pmatrix} 2 & 1 \\ 3 & -1 \end{pmatrix} = -5 C 22 = + det ( 2 3 1 − 1 ) = − 5 .
C 23 = − det ( 2 3 3 1 ) = − ( 2 − 9 ) = 7 C_{23} = -\det\begin{pmatrix} 2 & 3 \\ 3 & 1 \end{pmatrix} = -(2 - 9) = 7 C 23 = − det ( 2 3 3 1 ) = − ( 2 − 9 ) = 7 .
C 31 = + det ( 3 1 2 2 ) = 4 C_{31} = +\det\begin{pmatrix} 3 & 1 \\ 2 & 2 \end{pmatrix} = 4 C 31 = + det ( 3 2 1 2 ) = 4 .
C 32 = − det ( 2 1 1 2 ) = − ( 4 − 1 ) = − 3 C_{32} = -\det\begin{pmatrix} 2 & 1 \\ 1 & 2 \end{pmatrix} = -(4 - 1) = -3 C 32 = − det ( 2 1 1 2 ) = − ( 4 − 1 ) = − 3 .
C 33 = + det ( 2 3 1 2 ) = 1 C_{33} = +\det\begin{pmatrix} 2 & 3 \\ 1 & 2 \end{pmatrix} = 1 C 33 = + det ( 2 1 3 2 ) = 1 .
Step 3. Assemble the cofactor matrix and transpose:
cof ( A ) = ( − 4 7 − 5 4 − 5 7 4 − 3 1 ) \text{cof}(A) = \begin{pmatrix} -4 & 7 & -5 \\ 4 & -5 & 7 \\ 4 & -3 & 1 \end{pmatrix} cof ( A ) = − 4 4 4 7 − 5 − 3 − 5 7 1 .
adj ( A ) = ( − 4 4 4 7 − 5 − 3 − 5 7 1 ) \text{adj}(A) = \begin{pmatrix} -4 & 4 & 4 \\ 7 & -5 & -3 \\ -5 & 7 & 1 \end{pmatrix} adj ( A ) = − 4 7 − 5 4 − 5 7 4 − 3 1 .
Step 4. A − 1 = 1 8 adj ( A ) = 1 8 ( − 4 4 4 7 − 5 − 3 − 5 7 1 ) A^{-1} = \tfrac{1}{8}\,\text{adj}(A) = \tfrac{1}{8}\begin{pmatrix} -4 & 4 & 4 \\ 7 & -5 & -3 \\ -5 & 7 & 1 \end{pmatrix} A − 1 = 8 1 adj ( A ) = 8 1 − 4 7 − 5 4 − 5 7 4 − 3 1 .
Useful identities about the adjoint
For an n × n n \times n n × n matrix A A A :
A ⋅ adj ( A ) = adj ( A ) ⋅ A = ( det A ) I A \cdot \text{adj}(A) = \text{adj}(A) \cdot A = (\det A) I A ⋅ adj ( A ) = adj ( A ) ⋅ A = ( det A ) I .
adj ( A T ) = ( adj A ) T \text{adj}(A^T) = (\text{adj}\,A)^T adj ( A T ) = ( adj A ) T .
det ( adj A ) = ( det A ) n − 1 \det(\text{adj}\,A) = (\det A)^{n - 1} det ( adj A ) = ( det A ) n − 1 .
adj ( A B ) = adj ( B ) ⋅ adj ( A ) \text{adj}(AB) = \text{adj}(B) \cdot \text{adj}(A) adj ( A B ) = adj ( B ) ⋅ adj ( A ) .
adj ( λ A ) = λ n − 1 adj ( A ) \text{adj}(\lambda A) = \lambda^{n - 1}\,\text{adj}(A) adj ( λ A ) = λ n − 1 adj ( A ) .
The reversal in (4) parallels ( A B ) − 1 = B − 1 A − 1 (AB)^{-1} = B^{-1}A^{-1} ( A B ) − 1 = B − 1 A − 1 and is often tested in JEE.
Worked examples
Example 1. Find the adjoint and inverse of A = ( 1 2 3 4 ) A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} A = ( 1 3 2 4 ) .
det A = − 2 \det A = -2 det A = − 2 . cof ( A ) = ( 4 − 3 − 2 1 ) \text{cof}(A) = \begin{pmatrix} 4 & -3 \\ -2 & 1 \end{pmatrix} cof ( A ) = ( 4 − 2 − 3 1 ) . adj ( A ) = ( 4 − 2 − 3 1 ) \text{adj}(A) = \begin{pmatrix} 4 & -2 \\ -3 & 1 \end{pmatrix} adj ( A ) = ( 4 − 3 − 2 1 ) . A − 1 = − 1 2 ( 4 − 2 − 3 1 ) = ( − 2 1 3 / 2 − 1 / 2 ) A^{-1} = -\tfrac{1}{2}\begin{pmatrix} 4 & -2 \\ -3 & 1 \end{pmatrix} = \begin{pmatrix} -2 & 1 \\ 3/2 & -1/2 \end{pmatrix} A − 1 = − 2 1 ( 4 − 3 − 2 1 ) = ( − 2 3/2 1 − 1/2 ) .
Example 2. Verify A ⋅ adj ( A ) = ( det A ) I A \cdot \text{adj}(A) = (\det A) I A ⋅ adj ( A ) = ( det A ) I for the matrix in Example 1.
A ⋅ adj ( A ) = ( 1 2 3 4 ) ( 4 − 2 − 3 1 ) = ( 4 − 6 − 2 + 2 12 − 12 − 6 + 4 ) = ( − 2 0 0 − 2 ) = − 2 I A \cdot \text{adj}(A) = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}\begin{pmatrix} 4 & -2 \\ -3 & 1 \end{pmatrix} = \begin{pmatrix} 4 - 6 & -2 + 2 \\ 12 - 12 & -6 + 4 \end{pmatrix} = \begin{pmatrix} -2 & 0 \\ 0 & -2 \end{pmatrix} = -2 I A ⋅ adj ( A ) = ( 1 3 2 4 ) ( 4 − 3 − 2 1 ) = ( 4 − 6 12 − 12 − 2 + 2 − 6 + 4 ) = ( − 2 0 0 − 2 ) = − 2 I . ✓ \checkmark ✓
Example 3. If det A = 5 \det A = 5 det A = 5 for a 3 × 3 3 \times 3 3 × 3 matrix, find det ( adj A ) \det(\text{adj}\,A) det ( adj A ) .
By property (3): det ( adj A ) = 5 3 − 1 = 25 \det(\text{adj}\,A) = 5^{3 - 1} = 25 det ( adj A ) = 5 3 − 1 = 25 .
Example 4. If A A A is a 3 × 3 3 \times 3 3 × 3 matrix with det A = 4 \det A = 4 det A = 4 , find ∣ adj ( 2 A ) ∣ |\text{adj}(2 A)| ∣ adj ( 2 A ) ∣ .
det ( 2 A ) = 2 3 det A = 32 \det(2 A) = 2^3 \det A = 32 det ( 2 A ) = 2 3 det A = 32 . ∣ adj ( 2 A ) ∣ = 32 3 − 1 = 1024 |\text{adj}(2A)| = 32^{3 - 1} = 1024 ∣ adj ( 2 A ) ∣ = 3 2 3 − 1 = 1024 .
Example 5. Show that for a 2 × 2 2 \times 2 2 × 2 matrix, adj ( adj ( A ) ) = A \text{adj}(\text{adj}(A)) = A adj ( adj ( A )) = A .
adj ( A ) = ( d − b − c a ) \text{adj}(A) = \begin{pmatrix} d & -b \\ -c & a \end{pmatrix} adj ( A ) = ( d − c − b a ) . Compute its adjoint: swap diagonal and negate off-diagonal: ( a b c d ) = A \begin{pmatrix} a & b \\ c & d \end{pmatrix} = A ( a c b d ) = A . ✓ \checkmark ✓ (For higher orders, adj ( adj ( A ) ) = ( det A ) n − 2 A \text{adj}(\text{adj}(A)) = (\det A)^{n-2} A adj ( adj ( A )) = ( det A ) n − 2 A .)
Example 6. Solve { 2 x + 3 y + z = 11 x + 2 y + 2 z = 13 3 x + y − z = 5 \begin{cases} 2x + 3y + z = 11 \\ x + 2y + 2z = 13 \\ 3x + y - z = 5 \end{cases} ⎩ ⎨ ⎧ 2 x + 3 y + z = 11 x + 2 y + 2 z = 13 3 x + y − z = 5 using the adjoint method.
Write A X = B AX = B A X = B . A = ( 2 3 1 1 2 2 3 1 − 1 ) A = \begin{pmatrix} 2 & 3 & 1 \\ 1 & 2 & 2 \\ 3 & 1 & -1 \end{pmatrix} A = 2 1 3 3 2 1 1 2 − 1 , B = ( 11 13 5 ) B = \begin{pmatrix} 11 \\ 13 \\ 5 \end{pmatrix} B = 11 13 5 .
From the worked computation above, A − 1 = 1 8 ( − 4 4 4 7 − 5 − 3 − 5 7 1 ) A^{-1} = \tfrac{1}{8} \begin{pmatrix} -4 & 4 & 4 \\ 7 & -5 & -3 \\ -5 & 7 & 1 \end{pmatrix} A − 1 = 8 1 − 4 7 − 5 4 − 5 7 4 − 3 1 .
X = A − 1 B = 1 8 ( − 44 + 52 + 20 77 − 65 − 15 − 55 + 91 + 5 ) = 1 8 ( 28 − 3 41 ) X = A^{-1} B = \tfrac{1}{8}\begin{pmatrix} -44 + 52 + 20 \\ 77 - 65 - 15 \\ -55 + 91 + 5 \end{pmatrix} = \tfrac{1}{8}\begin{pmatrix} 28 \\ -3 \\ 41 \end{pmatrix} X = A − 1 B = 8 1 − 44 + 52 + 20 77 − 65 − 15 − 55 + 91 + 5 = 8 1 28 − 3 41 .
Hmm , let me double-check by substituting into the first equation: 2 ⋅ 28 / 8 + 3 ⋅ ( − 3 ) / 8 + 41 / 8 = ( 56 − 9 + 41 ) / 8 = 88 / 8 = 11 2 \cdot 28/8 + 3 \cdot (-3)/8 + 41/8 = (56 - 9 + 41)/8 = 88/8 = 11 2 ⋅ 28/8 + 3 ⋅ ( − 3 ) /8 + 41/8 = ( 56 − 9 + 41 ) /8 = 88/8 = 11 . ✓ \checkmark ✓ . So X = ( 7 / 2 , − 3 / 8 , 41 / 8 ) X = (7/2, -3/8, 41/8) X = ( 7/2 , − 3/8 , 41/8 ) . (This system has a non-integer solution; you can re-solve with different RHS for a cleaner answer.)
Try it yourself
Find the adjoint of ( 1 2 3 4 ) \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} ( 1 3 2 4 ) .
Find the adjoint of I 3 I_3 I 3 .
Find the inverse of ( 2 5 − 3 1 ) \begin{pmatrix} 2 & 5 \\ -3 & 1 \end{pmatrix} ( 2 − 3 5 1 ) using the adjoint method.
Find the inverse of ( 1 1 1 0 1 1 0 0 1 ) \begin{pmatrix} 1 & 1 & 1 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{pmatrix} 1 0 0 1 1 0 1 1 1 .
Verify A ⋅ adj ( A ) = ( det A ) I A \cdot \text{adj}(A) = (\det A) I A ⋅ adj ( A ) = ( det A ) I for ( 1 0 2 0 1 1 1 1 0 ) \begin{pmatrix} 1 & 0 & 2 \\ 0 & 1 & 1 \\ 1 & 1 & 0 \end{pmatrix} 1 0 1 0 1 1 2 1 0 .
For a 3 × 3 3 \times 3 3 × 3 matrix with det = 7 \det = 7 det = 7 , find det ( adj A ) \det(\text{adj}\,A) det ( adj A ) .
Find adj ( adj ( I 3 ) ) \text{adj}(\text{adj}(I_3)) adj ( adj ( I 3 )) .
Verify adj ( A B ) = adj ( B ) adj ( A ) \text{adj}(AB) = \text{adj}(B)\,\text{adj}(A) adj ( A B ) = adj ( B ) adj ( A ) for some 2 × 2 2 \times 2 2 × 2 matrices.
Find A − 1 A^{-1} A − 1 for A = ( cos θ − sin θ sin θ cos θ ) A = \begin{pmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{pmatrix} A = ( cos θ sin θ − sin θ cos θ ) , note it should be the rotation by − θ -\theta − θ .
Show that if A A A is symmetric and invertible, then adj ( A ) \text{adj}(A) adj ( A ) is symmetric.
If A A A is skew-symmetric of even order, must adj ( A ) \text{adj}(A) adj ( A ) be invertible?
Show that for any invertible A A A , ( A − 1 ) T = ( A T ) − 1 (A^{-1})^T = (A^T)^{-1} ( A − 1 ) T = ( A T ) − 1 .
Use adj \text{adj} adj to invert ( 2 1 1 1 2 1 1 1 2 ) \begin{pmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{pmatrix} 2 1 1 1 2 1 1 1 2 .
Show that adj ( λ A ) = λ n − 1 adj ( A ) \text{adj}(\lambda A) = \lambda^{n - 1} \text{adj}(A) adj ( λ A ) = λ n − 1 adj ( A ) for an n × n n \times n n × n matrix.
Pitfalls / Tricks
Adjoint is the transpose of the cofactor matrix, not the cofactor matrix itself.
Do not forget the 1 det A \tfrac{1}{\det A} d e t A 1 factor when computing the inverse.
det ( adj A ) = ( det A ) n − 1 \det(\text{adj}\,A) = (\det A)^{n - 1} det ( adj A ) = ( det A ) n − 1 is a JEE staple; memorise.
The adjoint method scales poorly with size; for n ≥ 4 n \ge 4 n ≥ 4 row reduction is faster.
For a 2 × 2 2 \times 2 2 × 2 matrix, adjoint = swap diagonal entries and negate off-diagonals.
Next we apply these tools to solve linear systems via Cramer's rule.