Let \(A=\left[\begin{array}\text 1&\&2&1\\ \&2&3&1\\ 1&1&5\end{array}\right].\) verify that \([adj A]^{-1}=adj(A^{-1})\)
CBSE Class 12 Maths · Determinants
CBSE Class 12 Maths · Determinants
Imagine a magic box that transforms numbers. Every magic box has a special "undo" button called the inverse. There is also a helper called the adjoint — think of it as the box's shadow. A beautiful rule says: undoing the shadow gives the same result as the shadow of the undo. We check this rule for the matrix \( A \). Both ways of calculating give the exact same grid of numbers, which proves the rule really works every time.
Answer: Both sides equal \[ \begin{bmatrix} -\tfrac{1}{5} & -\tfrac{2}{5} & -\tfrac{1}{5} \\ -\tfrac{2}{5} & -\tfrac{3}{5} & -\tfrac{1}{5} \\ -\tfrac{1}{5} & -\tfrac{1}{5} & -1 \end{bmatrix}, \] so \( (\text{adj}\,A)^{-1} = \text{adj}(A^{-1}) \) is verified.
For any invertible square matrix, the adjoint (adjugate) and inverse are linked by the identity \( A^{-1} = \dfrac{1}{\det(A)}\,\text{adj}(A) \). A standard property states that for an invertible matrix \( A \), taking the inverse of its adjoint gives the same matrix as taking the adjoint of its inverse; that is, \( (\text{adj}\,A)^{-1} = \text{adj}(A^{-1}) \). To verify this for a specific matrix, we compute the adjoint of \( A \), invert it, then separately find \( A^{-1} \) and compute its adjoint, and finally check that both results match. The interpreted matrix here is \[ A = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ 1 & 1 & 5 \end{bmatrix}. \]
\( A^{-1} = \dfrac{1}{\det(A)}\,\text{adj}(A) \) and the identity to verify: \( (\text{adj}\,A)^{-1} = \text{adj}(A^{-1}) \).
Both sides equal \[ \begin{bmatrix} -\tfrac{1}{5} & -\tfrac{2}{5} & -\tfrac{1}{5} \\ -\tfrac{2}{5} & -\tfrac{3}{5} & -\tfrac{1}{5} \\ -\tfrac{1}{5} & -\tfrac{1}{5} & -1 \end{bmatrix}, \] so \( (\text{adj}\,A)^{-1} = \text{adj}(A^{-1}) \) is verified.
A frequent error is forgetting the factor \( \det(A) \) and simply writing \( A^{-1} = \text{adj}(A) \). Remember \( A^{-1} = \dfrac{1}{\det(A)}\text{adj}(A) \); dropping the \( \det(A) \) division makes both sides come out wrong even though they might still look equal.
Both sides equal \[ \begin{bmatrix} -\tfrac{1}{5} & -\tfrac{2}{5} & -\tfrac{1}{5} \\ -\tfrac{2}{5} & -\tfrac{3}{5} & -\tfrac{1}{5} \\ -\tfrac{1}{5} & -\tfrac{1}{5} & -1 \end{bmatrix}, \] so \( (\text{adj}\,A)^{-1} = \text{adj}(A^{-1}) \) is verified.
One common mistake: students often forget that \( \text{adj}(A) \) is the TRANSPOSE of the cofactor matrix, not the cofactor matrix itself — writing the cofactors in their original row-column positions (instead of transposing) leads to a wrong adjoint and an incorrect final result.
Answer: Both sides equal \[ \begin{bmatrix} -\tfrac{1}{5} & -\tfrac{2}{5} & -\tfrac{1}{5} \\ -\tfrac{2}{5} & -\tfrac{3}{5} & -\tfrac{1}{5} \\ -\tfrac{1}{5} & -\tfrac{1}{5} & -1 \end{bmatrix}, \] so \( (\text{adj}\,A)^{-1} = \text{adj}(A^{-1}) \) is verified.
Question: Let \[A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 2 & 1 & 3 \end{bmatrix}\] Verify that \([\text{adj}(A)]^{-1} = \text{adj}(A^{-1})\).
Solution: We begin by computing \(|A|\). Expanding along the first row: \[|A| = 1 \cdot \begin{vmatrix} 1 & 1 \\ 1 & 3 \end{vmatrix} - 2 \cdot \begin{vmatrix} 0 & 1 \\ 2 & 3 \end{vmatrix} + 0 \cdot \begin{vmatrix} 0 & 1 \\ 2 & 1 \end{vmatrix}\] \[= 1(3 - 1) - 2(0 - 2) + 0 = 2 + 4 = 6\] Since \(|A| = 6 \ne 0\), A is invertible. Next, we find all cofactors of A. \(C_{11} = \begin{vmatrix} 1 & 1 \\ 1 & 3 \end{vmatrix} = 3 - 1 = 2\) \(C_{12} = -\begin{vmatrix} 0 & 1 \\ 2 & 3 \end{vmatrix} = -(0 - 2) = 2\) \(C_{13} = \begin{vmatrix} 0 & 1 \\ 2 & 1 \end{vmatrix} = 0 - 2 = -2\) \(C_{21} = -\begin{vmatrix} 2 & 0 \\ 1 & 3 \end{vmatrix} = -(6 - 0) = -6\) \(C_{22} = \begin{vmatrix} 1 & 0 \\ 2 & 3 \end{vmatrix} = 3 - 0 = 3\) \(C_{23} = -\begin{vmatrix} 1 & 2 \\ 2 & 1 \end{vmatrix} = -(1 - 4) = 3\) \(C_{31} = \begin{vmatrix} 2 & 0 \\ 1 & 1 \end{vmatrix} = 2 - 0 = 2\) \(C_{32} = -\begin{vmatrix} 1 & 0 \\ 0 & 1 \end{vmatrix} = -(1 - 0) = -1\) \(C_{33} = \begin{vmatrix} 1 & 2 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1\) Therefore: \[\text{adj}(A) = \begin{bmatrix} 2 & -6 & 2 \\ 2 & 3 & -1 \\ -2 & 3 & 1 \end{bmatrix}\] Now we compute \(A^{-1}\): \[A^{-1} = \frac{1}{6} \begin{bmatrix} 2 & -6 & 2 \\ 2 & 3 & -1 \\ -2 & 3 & 1 \end{bmatrix}\] Computing LHS: \([\text{adj}(A)]^{-1}\) Let \(B = \text{adj}(A)\). We find \(|B|\). We use the identity \(|\text{adj}(A)| = |A|^{n-1}\) where \(n = 3\): \[|\text{adj}(A)| = |A|^{2} = 36\] Using the key identity, we know: \[[\text{adj}(A)]^{-1} = \frac{A}{|A|} = \frac{1}{6} \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 2 & 1 & 3 \end{bmatrix}\] Computing RHS: \(\text{adj}(A^{-1})\) We use the identity \(\text{adj}(A^{-1}) = \frac{A}{|A|}\): \[\text{adj}(A^{-1}) = \frac{1}{6} \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 2 & 1 & 3 \end{bmatrix}\] Since LHS = RHS, we have verified that: \[[\text{adj}(A)]^{-1} = \text{adj}(A^{-1}) = \frac{1}{6} \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 2 & 1 & 3 \end{bmatrix}\]
Answer: Both \([\text{adj}(A)]^{-1}\) and \(\text{adj}(A^{-1})\) equal \(\frac{1}{6} \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 2 & 1 & 3 \end{bmatrix}\), verifying the identity.
Question: Let \[A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 0 \\ 0 & 1 & 2 \end{bmatrix}\] Verify that \([\text{adj}(A)]^{-1} = \text{adj}(A^{-1})\).
Solution: Step 1: Compute \(|A|\) by expanding along the first row. \[|A| = 2 \begin{vmatrix} 3 & 0 \\ 1 & 2 \end{vmatrix} - 1 \begin{vmatrix} 1 & 0 \\ 0 & 2 \end{vmatrix} + 1 \begin{vmatrix} 1 & 3 \\ 0 & 1 \end{vmatrix}\] \[= 2(6 - 0) - 1(2 - 0) + 1(1 - 0) = 12 - 2 + 1 = 11\] Since \(|A| = 11 \ne 0\), A is invertible. Step 2: Find the cofactors of A. \(C_{11} = \begin{vmatrix} 3 & 0 \\ 1 & 2 \end{vmatrix} = 6\) \(C_{12} = -\begin{vmatrix} 1 & 0 \\ 0 & 2 \end{vmatrix} = -2\) \(C_{13} = \begin{vmatrix} 1 & 3 \\ 0 & 1 \end{vmatrix} = 1\) \(C_{21} = -\begin{vmatrix} 1 & 1 \\ 1 & 2 \end{vmatrix} = -(2 - 1) = -1\) \(C_{22} = \begin{vmatrix} 2 & 1 \\ 0 & 2 \end{vmatrix} = 4\) \(C_{23} = -\begin{vmatrix} 2 & 1 \\ 0 & 1 \end{vmatrix} = -(2 - 0) = -2\) \(C_{31} = \begin{vmatrix} 1 & 1 \\ 3 & 0 \end{vmatrix} = 0 - 3 = -3\) \(C_{32} = -\begin{vmatrix} 2 & 1 \\ 1 & 0 \end{vmatrix} = -(0 - 1) = 1\) \(C_{33} = \begin{vmatrix} 2 & 1 \\ 1 & 3 \end{vmatrix} = 6 - 1 = 5\) Therefore: \[\text{adj}(A) = \begin{bmatrix} 6 & -1 & -3 \\ -2 & 4 & 1 \\ 1 & -2 & 5 \end{bmatrix}\] Step 3: Compute \(A^{-1}\). \[A^{-1} = \frac{1}{11} \begin{bmatrix} 6 & -1 & -3 \\ -2 & 4 & 1 \\ 1 & -2 & 5 \end{bmatrix}\] Step 4: Compute LHS — \([\text{adj}(A)]^{-1}\). Using the identity \([\text{adj}(A)]^{-1} = \frac{A}{|A|}\): \[[\text{adj}(A)]^{-1} = \frac{1}{11} \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 0 \\ 0 & 1 & 2 \end{bmatrix}\] Step 5: Compute RHS — \(\text{adj}(A^{-1})\). Using the identity \(\text{adj}(A^{-1}) = \frac{A}{|A|}\): \[\text{adj}(A^{-1}) = \frac{1}{11} \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 0 \\ 0 & 1 & 2 \end{bmatrix}\] Step 6: Since LHS = RHS, the identity is verified: \[[\text{adj}(A)]^{-1} = \text{adj}(A^{-1}) = \frac{1}{11} \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 0 \\ 0 & 1 & 2 \end{bmatrix}\]
Answer: Both \([\text{adj}(A)]^{-1}\) and \(\text{adj}(A^{-1})\) equal \(\frac{1}{11} \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 0 \\ 0 & 1 & 2 \end{bmatrix}\), verifying the identity.
Question: Let \[ B = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 1 \\ 1 & 1 & 4 \end{bmatrix}. \] Verify that \( (\text{adj}\, B)^{-1} = \text{adj}(B^{-1}) \).
Answer: Both sides equal \[ \frac{1}{17} \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 1 \\ 1 & 1 & 4 \end{bmatrix}, \] so \( (\text{adj}\, B)^{-1} = \text{adj}(B^{-1}) \) is verified.