Skip to content
Exercise 4.4 · Q2

Q.[1−12235−201]\begin{bmatrix} 1 & -1 & 2 \\ 2 & 3 & 5 \\ -2 & 0 & 1 \end{bmatrix} Verify A(adj A)=(adj A)A=∣A∣IA (\text{adj } A) = (\text{adj } A) A = |A| I in Exercises 3 and 4

Uttar Pradesh UpmspTextbookSubjective· 5mImportance★★★★★
21% · 31/146 Questions
✓ Free question

For any square matrix AA, the product A(adj A)A(\text{adj }A) equals (adj A)A=∣A∣I(\text{adj }A)A = |A|I. Here we verify this identity for the given 3×33\times 3 matrix by computing its determinant and adjoint, then checking both products.

The property A(adj A)=(adj A)A=∣A∣IA(\text{adj }A) = (\text{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 AA 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\text{adj }A is a cofactor (signed minor) of AA. When you multiply AA by adj A\text{adj }A, the (i,j)(i,j) entry becomes the sum of products of row ii of AA with column jj of cofactors. For i=ji=j, this sum is exactly the Laplace expansion of ∣A∣|A| along row ii. For i≠ji\neq j, it's like expanding a matrix with two identical rows — which gives zero. So the product is diagonal, with ∣A∣|A| on every diagonal entry.

Let's verify this concretely.

For a 3×33\times 3 matrix A=[aij]A = [a_{ij}], the adjoint is the transpose of the cofactor matrix: (adj A)ij=Cji(\text{adj }A)_{ij} = C_{ji}, where Cij=(−1)i+jMijC_{ij} = (-1)^{i+j} M_{ij} and MijM_{ij} is the minor (determinant after deleting row ii, column jj).


Step 1: Compute the determinant ∣A∣|A|.

We have

A=[1−12235−201].A = \begin{bmatrix} 1 & -1 & 2 \\ 2 & 3 & 5 \\ -2 & 0 & 1 \end{bmatrix}.

Expand along the third row (it has a zero, which saves work):

∣A∣=(−2)⋅(−1)3+1∣−1235∣+0⋅(… )+1⋅(−1)3+3∣1−123∣.|A| = (-2) \cdot (-1)^{3+1} \begin{vmatrix} -1 & 2 \\ 3 & 5 \end{vmatrix} + 0 \cdot (\dots) + 1 \cdot (-1)^{3+3} \begin{vmatrix} 1 & -1 \\ 2 & 3 \end{vmatrix}.

The first term: (−2)⋅(+1)⋅[(−1)(5)−(2)(3)]=(−2)[−5−6]=(−2)(−11)=22(-2) \cdot (+1) \cdot [(-1)(5) - (2)(3)] = (-2)[-5 - 6] = (-2)(-11) = 22.

The third term: 1⋅(+1)⋅[(1)(3)−(−1)(2)]=3+2=51 \cdot (+1) \cdot [(1)(3) - (-1)(2)] = 3 + 2 = 5.

So ∣A∣=22+5=27|A| = 22 + 5 = 27.

Note

Always double-check the sign pattern: (−1)i+j(-1)^{i+j} is ++ when i+ji+j is even, −- when odd. Row 3, column 1: 3+1=43+1=4 (even) → ++ sign. Row 3, column 3: 3+3=63+3=6 (even) → ++ sign.


Step 2: Find all cofactors CijC_{ij}.

We need nine cofactors. Let's compute them systematically.

  • C11=(−1)1+1∣3501∣=(3⋅1−5⋅0)=3C_{11} = (-1)^{1+1} \begin{vmatrix} 3 & 5 \\ 0 & 1 \end{vmatrix} = (3\cdot 1 - 5\cdot 0) = 3.
  • C12=(−1)1+2∣25−21∣=−[2⋅1−5⋅(−2)]=−[2+10]=−12C_{12} = (-1)^{1+2} \begin{vmatrix} 2 & 5 \\ -2 & 1 \end{vmatrix} = -[2\cdot 1 - 5\cdot(-2)] = -[2 + 10] = -12.
  • C13=(−1)1+3∣23−20∣=(2⋅0−3⋅(−2))=0+6=6C_{13} = (-1)^{1+3} \begin{vmatrix} 2 & 3 \\ -2 & 0 \end{vmatrix} = (2\cdot 0 - 3\cdot(-2)) = 0 + 6 = 6.
  • C21=(−1)2+1∣−1201∣=−[(−1)⋅1−2⋅0]=−[−1−0]=1C_{21} = (-1)^{2+1} \begin{vmatrix} -1 & 2 \\ 0 & 1 \end{vmatrix} = -[(-1)\cdot 1 - 2\cdot 0] = -[-1 - 0] = 1.
  • C22=(−1)2+2∣12−21∣=(1⋅1−2⋅(−2))=1+4=5C_{22} = (-1)^{2+2} \begin{vmatrix} 1 & 2 \\ -2 & 1 \end{vmatrix} = (1\cdot 1 - 2\cdot(-2)) = 1 + 4 = 5.
  • C23=(−1)2+3∣1−1−20∣=−[1⋅0−(−1)⋅(−2)]=−[0−2]=2C_{23} = (-1)^{2+3} \begin{vmatrix} 1 & -1 \\ -2 & 0 \end{vmatrix} = -[1\cdot 0 - (-1)\cdot(-2)] = -[0 - 2] = 2.
  • C31=(−1)3+1∣−1235∣=[(−1)⋅5−2⋅3]=−5−6=−11C_{31} = (-1)^{3+1} \begin{vmatrix} -1 & 2 \\ 3 & 5 \end{vmatrix} = [(-1)\cdot 5 - 2\cdot 3] = -5 - 6 = -11.
  • C32=(−1)3+2∣1225∣=−[1⋅5−2⋅2]=−[5−4]=−1C_{32} = (-1)^{3+2} \begin{vmatrix} 1 & 2 \\ 2 & 5 \end{vmatrix} = -[1\cdot 5 - 2\cdot 2] = -[5 - 4] = -1.
  • C33=(−1)3+3∣1−123∣=(1⋅3−(−1)⋅2)=3+2=5C_{33} = (-1)^{3+3} \begin{vmatrix} 1 & -1 \\ 2 & 3 \end{vmatrix} = (1\cdot 3 - (-1)\cdot 2) = 3 + 2 = 5.
Watch out

A common mistake: forgetting the (−1)i+j(-1)^{i+j} sign. For C12C_{12}, the minor is 2⋅1−5⋅(−2)=122\cdot 1 - 5\cdot(-2) = 12, but the sign is negative because 1+2=31+2=3 is odd. So C12=−12C_{12} = -12, not 1212.


Step 3: Write the adjoint matrix.

The adjoint is the transpose of the cofactor matrix:

adj A=[C11C21C31C12C22C32C13C23C33]=[31−11−125−1625].\text{adj }A = \begin{bmatrix} C_{11} & C_{21} & C_{31} \\ C_{12} & C_{22} & C_{32} \\ C_{13} & C_{23} & C_{33} \end{bmatrix} = \begin{bmatrix} 3 & 1 & -11 \\ -12 & 5 & -1 \\ 6 & 2 & 5 \end{bmatrix}.


Step 4: Compute A(adj A)A(\text{adj }A).

Multiply AA (on the left) by adj A\text{adj }A (on the right). Let's do it entry by entry.

Row 1 of AA: [1,−1,2][1, -1, 2].

  • (1,1)(1,1) entry: 1⋅3+(−1)⋅(−12)+2⋅6=3+12+12=271\cdot 3 + (-1)\cdot(-12) + 2\cdot 6 = 3 + 12 + 12 = 27.
  • (1,2)(1,2) entry: 1⋅1+(−1)⋅5+2⋅2=1−5+4=01\cdot 1 + (-1)\cdot 5 + 2\cdot 2 = 1 - 5 + 4 = 0.
  • (1,3)(1,3) entry: 1⋅(−11)+(−1)⋅(−1)+2⋅5=−11+1+10=01\cdot(-11) + (-1)\cdot(-1) + 2\cdot 5 = -11 + 1 + 10 = 0.

Row 2 of AA: [2,3,5][2, 3, 5].

  • (2,1)(2,1) entry: 2⋅3+3⋅(−12)+5⋅6=6−36+30=02\cdot 3 + 3\cdot(-12) + 5\cdot 6 = 6 - 36 + 30 = 0.
  • (2,2)(2,2) entry: 2⋅1+3⋅5+5⋅2=2+15+10=272\cdot 1 + 3\cdot 5 + 5\cdot 2 = 2 + 15 + 10 = 27.
  • (2,3)(2,3) entry: 2⋅(−11)+3⋅(−1)+5⋅5=−22−3+25=02\cdot(-11) + 3\cdot(-1) + 5\cdot 5 = -22 - 3 + 25 = 0.

Row 3 of AA: [−2,0,1][-2, 0, 1].

  • (3,1)(3,1) entry: (−2)⋅3+0⋅(−12)+1⋅6=−6+0+6=0(-2)\cdot 3 + 0\cdot(-12) + 1\cdot 6 = -6 + 0 + 6 = 0.
  • (3,2)(3,2) entry: (−2)⋅1+0⋅5+1⋅2=−2+0+2=0(-2)\cdot 1 + 0\cdot 5 + 1\cdot 2 = -2 + 0 + 2 = 0.
  • (3,3)(3,3) entry: (−2)⋅(−11)+0⋅(−1)+1⋅5=22+0+5=27(-2)\cdot(-11) + 0\cdot(-1) + 1\cdot 5 = 22 + 0 + 5 = 27.

So

A(adj A)=[270002700027]=27⋅I=∣A∣ I.A(\text{adj }A) = \begin{bmatrix} 27 & 0 & 0 \\ 0 & 27 & 0 \\ 0 & 0 & 27 \end{bmatrix} = 27 \cdot I = |A|\, I.


Step 5: Compute (adj A)A(\text{adj }A)A.

Now multiply adj A\text{adj }A (on the left) by AA (on the right).

Row 1 of adj A\text{adj }A: [3,1,−11][3, 1, -11].

  • (1,1)(1,1) entry: 3⋅1+1⋅2+(−11)⋅(−2)=3+2+22=273\cdot 1 + 1\cdot 2 + (-11)\cdot(-2) = 3 + 2 + 22 = 27.
  • (1,2)(1,2) entry: 3⋅(−1)+1⋅3+(−11)⋅0=−3+3+0=03\cdot(-1) + 1\cdot 3 + (-11)\cdot 0 = -3 + 3 + 0 = 0.
  • (1,3)(1,3) entry: 3⋅2+1⋅5+(−11)⋅1=6+5−11=03\cdot 2 + 1\cdot 5 + (-11)\cdot 1 = 6 + 5 - 11 = 0.

Row 2 of adj A\text{adj }A: [−12,5,−1][-12, 5, -1].

  • (2,1)(2,1) entry: (−12)⋅1+5⋅2+(−1)⋅(−2)=−12+10+2=0(-12)\cdot 1 + 5\cdot 2 + (-1)\cdot(-2) = -12 + 10 + 2 = 0.
  • (2,2)(2,2) entry: (−12)⋅(−1)+5⋅3+(−1)⋅0=12+15+0=27(-12)\cdot(-1) + 5\cdot 3 + (-1)\cdot 0 = 12 + 15 + 0 = 27.
  • (2,3)(2,3) entry: (−12)⋅2+5⋅5+(−1)⋅1=−24+25−1=0(-12)\cdot 2 + 5\cdot 5 + (-1)\cdot 1 = -24 + 25 - 1 = 0.

Row 3 of adj A\text{adj }A: [6,2,5][6, 2, 5].

  • (3,1)(3,1) entry: 6⋅1+2⋅2+5⋅(−2)=6+4−10=06\cdot 1 + 2\cdot 2 + 5\cdot(-2) = 6 + 4 - 10 = 0.
  • (3,2)(3,2) entry: 6⋅(−1)+2⋅3+5⋅0=−6+6+0=06\cdot(-1) + 2\cdot 3 + 5\cdot 0 = -6 + 6 + 0 = 0.
  • (3,3)(3,3) entry: 6⋅2+2⋅5+5⋅1=12+10+5=276\cdot 2 + 2\cdot 5 + 5\cdot 1 = 12 + 10 + 5 = 27.

Thus

(adj A)A=[270002700027]=27⋅I=∣A∣ I.(\text{adj }A)A = \begin{bmatrix} 27 & 0 & 0 \\ 0 & 27 & 0 \\ 0 & 0 & 27 \end{bmatrix} = 27 \cdot 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)(1,2) entry of A(adj A)A(\text{adj }A) is the expansion of a matrix where row 1 of AA 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∣IA(\text{adj }A) = (\text{adj }A)A = 27I = |A|I, confirming the identity.

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.