Let \(A=\left[\begin{array}\text 1&\&2&1\\ \&2&3&1\\ 1&1&5\end{array}\right].\) verify that \((A^{-1})^{-1}=A\)
CBSE Class 12 Maths · Determinants
CBSE Class 12 Maths · Determinants
Imagine you have a magic box that scrambles your toys. The inverse of that box unscrambles them, giving you back exactly what you started with. A matrix works the same way. Taking the inverse of a matrix once "undoes" it. Taking the inverse a second time "undoes the undoing," so you land right back at the original matrix. For the matrix given, the number called the determinant turns out to be \( -5 \), which is not zero, so the inverse exists and the round-trip works perfectly.
Answer: Since \(\det(A) = -5 \ne 0\), the inverse \(A^{-1} = -\tfrac{1}{5}\,\text{adj}(A)\) exists, and inverting \(A^{-1}\) returns the original matrix. Hence \((A^{-1})^{-1} = A\) is verified.
For any invertible (non-singular) square matrix \(A\), taking the inverse twice brings you back to the original matrix, i.e. \((A^{-1})^{-1} = A\). This is because the inverse operation is its own reverse: if \(B = A^{-1}\), then by definition \(AB = BA = I\), which also means \(B^{-1} = A\). To verify this concretely, we first find \(A^{-1}\) using the formula \(A^{-1} = \frac{1}{\det(A)} \text{adj}(A)\). Then we invert that result and check that we recover \(A\).
\[A^{-1} = \frac{1}{\det(A)} \, \text{adj}(A), \qquad (A^{-1})^{-1} = A\]
Since \(\det(A) = -5 \ne 0\), the inverse \(A^{-1} = -\tfrac{1}{5}\,\text{adj}(A)\) exists, and inverting \(A^{-1}\) returns the original matrix. Hence \((A^{-1})^{-1} = A\) is verified.
A common mistake is forgetting to transpose the cofactor matrix when forming the adjoint, or dividing by the wrong determinant. Students also often forget to check \(\det(A) \ne 0\) before claiming the inverse exists.
Since \(\det(A) = -5 \ne 0\), the inverse \(A^{-1} = -\tfrac{1}{5}\,\text{adj}(A)\) exists, and inverting \(A^{-1}\) returns the original matrix. Hence \((A^{-1})^{-1} = A\) is verified.
One common mistake: students forget to transpose the cofactor matrix when forming the adjoint — they use the cofactor matrix directly instead of its transpose, which gives an incorrect \(A^{-1}\) and causes the verification to fail.
Answer: Since \(\det(A) = -5 \ne 0\), the inverse \(A^{-1} = -\tfrac{1}{5}\,\text{adj}(A)\) exists, and inverting \(A^{-1}\) returns the original matrix. Hence \((A^{-1})^{-1} = A\) is verified.
Question: Let \[ A = \begin{bmatrix} 2 & 1 & 0 \\ 1 & 3 & 1 \\ 0 & 1 & 2 \end{bmatrix} \] Find \( A^{-1} \) and verify that \( \left(A^{-1}\right)^{-1} = A \).
Solution: We first compute \( \det(A) \) by expanding along the first row. The cofactors along row 1 are: \( C_{11} = \begin{vmatrix} 3 & 1 \\ 1 & 2 \end{vmatrix} = 6 - 1 = 5 \) \( C_{12} = -\begin{vmatrix} 1 & 1 \\ 0 & 2 \end{vmatrix} = -(2 - 0) = -2 \) \( C_{13} = \begin{vmatrix} 1 & 3 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1 \) So \( \det(A) = 2(5) + 1(-2) + 0(1) = 10 - 2 = 8 \). Since \( \det(A) = 8 \ne 0 \), A is invertible. Now we find all nine cofactors: \( C_{11} = 5, \quad C_{12} = -2, \quad C_{13} = 1 \) \( C_{21} = -\begin{vmatrix} 1 & 0 \\ 1 & 2 \end{vmatrix} = -(2 - 0) = -2 \) \( C_{22} = \begin{vmatrix} 2 & 0 \\ 0 & 2 \end{vmatrix} = 4 - 0 = 4 \) \( C_{23} = -\begin{vmatrix} 2 & 1 \\ 0 & 1 \end{vmatrix} = -(2 - 0) = -2 \) \( C_{31} = \begin{vmatrix} 1 & 0 \\ 3 & 1 \end{vmatrix} = 1 - 0 = 1 \) \( C_{32} = -\begin{vmatrix} 2 & 0 \\ 1 & 1 \end{vmatrix} = -(2 - 0) = -2 \) \( C_{33} = \begin{vmatrix} 2 & 1 \\ 1 & 3 \end{vmatrix} = 6 - 1 = 5 \) The cofactor matrix is \[ \begin{bmatrix} 5 & -2 & 1 \\ -2 & 4 & -2 \\ 1 & -2 & 5 \end{bmatrix} \] So \[ \text{adj}(A) = \begin{bmatrix} 5 & -2 & 1 \\ -2 & 4 & -2 \\ 1 & -2 & 5 \end{bmatrix}^{T} = \begin{bmatrix} 5 & -2 & 1 \\ -2 & 4 & -2 \\ 1 & -2 & 5 \end{bmatrix} \] (The cofactor matrix is symmetric here, so the adjoint equals it.) Therefore \[ A^{-1} = \frac{1}{8} \begin{bmatrix} 5 & -2 & 1 \\ -2 & 4 & -2 \\ 1 & -2 & 5 \end{bmatrix} \] Now let \( B = A^{-1} = \dfrac{1}{8}\begin{bmatrix} 5 & -2 & 1 \\ -2 & 4 & -2 \\ 1 & -2 & 5 \end{bmatrix} \). We need to find \( B^{-1} \) and show it equals A. We compute \( \det(B) \). Since \( B = \dfrac{1}{8} M \) where \( M = \begin{bmatrix} 5 & -2 & 1 \\ -2 & 4 & -2 \\ 1 & -2 & 5 \end{bmatrix} \), we have \( \det(B) = \left(\dfrac{1}{8}\right)^3 \det(M) \). Expanding \( \det(M) \) along row 1: \( \det(M) = 5\begin{vmatrix} 4 & -2 \\ -2 & 5 \end{vmatrix} - (-2)\begin{vmatrix} -2 & -2 \\ 1 & 5 \end{vmatrix} + 1\begin{vmatrix} -2 & 4 \\ 1 & -2 \end{vmatrix} \) \( = 5(20 - 4) + 2(-10 + 2) + 1(4 - 4) \) \( = 5(16) + 2(-8) + 0 = 80 - 16 = 64 \) So \( \det(B) = \dfrac{64}{512} = \dfrac{1}{8} \). Note: An equivalent and faster approach uses the property \( \det(A^{-1}) = \dfrac{1}{\det(A)} = \dfrac{1}{8} \), which confirms the same result. Now we find \( \text{adj}(B) \). The cofactors of B are \( \dfrac{1}{8^2} \) times the cofactors of M (since each 2×2 minor of B picks up two factors of \( \dfrac{1}{8} \)). Cofactors of M (row 1): \( C_{11}^{M} = 5(20-4) \) — wait, let us directly compute each 2×2 determinant of M. Cofactors of M: \( C_{11}^{M} = \begin{vmatrix} 4 & -2 \\ -2 & 5 \end{vmatrix} = 20 - 4 = 16 \) \( C_{12}^{M} = -\begin{vmatrix} -2 & -2 \\ 1 & 5 \end{vmatrix} = -(-10+2) = 8 \) \( C_{13}^{M} = \begin{vmatrix} -2 & 4 \\ 1 & -2 \end{vmatrix} = 4 - 4 = 0 \) \( C_{21}^{M} = -\begin{vmatrix} -2 & 1 \\ -2 & 5 \end{vmatrix} = -(-10+2) = 8 \) \( C_{22}^{M} = \begin{vmatrix} 5 & 1 \\ 1 & 5 \end{vmatrix} = 25 - 1 = 24 \) \( C_{23}^{M} = -\begin{vmatrix} 5 & -2 \\ 1 & -2 \end{vmatrix} = -(-10+2) = 8 \) \( C_{31}^{M} = \begin{vmatrix} -2 & 1 \\ 4 & -2 \end{vmatrix} = 4 - 4 = 0 \) \( C_{32}^{M} = -\begin{vmatrix} 5 & 1 \\ -2 & -2 \end{vmatrix} = -(-10+2) = 8 \) \( C_{33}^{M} = \begin{vmatrix} 5 & -2 \\ -2 & 4 \end{vmatrix} = 20 - 4 = 16 \) So the cofactor matrix of M is \[ \begin{bmatrix} 16 & 8 & 0 \\ 8 & 24 & 8 \\ 0 & 8 & 16 \end{bmatrix} \] and \[ \text{adj}(M) = \begin{bmatrix} 16 & 8 & 0 \\ 8 & 24 & 8 \\ 0 & 8 & 16 \end{bmatrix}^{T} = \begin{bmatrix} 16 & 8 & 0 \\ 8 & 24 & 8 \\ 0 & 8 & 16 \end{bmatrix} \] The cofactors of B are \( \dfrac{1}{64} \) times those of M (since each 2×2 minor of B = \( \dfrac{1}{64} \times \) 2×2 minor of M), so \[ \text{adj}(B) = \frac{1}{64} \begin{bmatrix} 16 & 8 & 0 \\ 8 & 24 & 8 \\ 0 & 8 & 16 \end{bmatrix} \] Therefore \[ B^{-1} = \frac{\text{adj}(B)}{\det(B)} = \frac{\dfrac{1}{64}\begin{bmatrix} 16 & 8 & 0 \\ 8 & 24 & 8 \\ 0 & 8 & 16 \end{bmatrix}}{\dfrac{1}{8}} = \frac{8}{64}\begin{bmatrix} 16 & 8 & 0 \\ 8 & 24 & 8 \\ 0 & 8 & 16 \end{bmatrix} = \frac{1}{8}\begin{bmatrix} 16 & 8 & 0 \\ 8 & 24 & 8 \\ 0 & 8 & 16 \end{bmatrix} \] \[ = \begin{bmatrix} 2 & 1 & 0 \\ 1 & 3 & 1 \\ 0 & 1 & 2 \end{bmatrix} = A \] Hence \( \left(A^{-1}\right)^{-1} = A \) is verified.
Answer: \( A^{-1} = \dfrac{1}{8}\begin{bmatrix} 5 & -2 & 1 \\ -2 & 4 & -2 \\ 1 & -2 & 5 \end{bmatrix} \) and \( \left(A^{-1}\right)^{-1} = A \) is verified.
Question: Let \[ A = \begin{bmatrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 0 & 0 & 1 \end{bmatrix} \] Find \( A^{-1} \) and verify that \( \left(A^{-1}\right)^{-1} = A \).
Solution: Since A is upper triangular, \( \det(A) \) equals the product of its diagonal entries: \[ \det(A) = 1 \times 1 \times 1 = 1 \] Since \( \det(A) = 1 \ne 0 \), A is invertible. We now compute all cofactors of A. \( C_{11} = \begin{vmatrix} 1 & 4 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1 \) \( C_{12} = -\begin{vmatrix} 0 & 4 \\ 0 & 1 \end{vmatrix} = -(0 - 0) = 0 \) \( C_{13} = \begin{vmatrix} 0 & 1 \\ 0 & 0 \end{vmatrix} = 0 - 0 = 0 \) \( C_{21} = -\begin{vmatrix} 2 & 3 \\ 0 & 1 \end{vmatrix} = -(2 - 0) = -2 \) \( C_{22} = \begin{vmatrix} 1 & 3 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1 \) \( C_{23} = -\begin{vmatrix} 1 & 2 \\ 0 & 0 \end{vmatrix} = -(0 - 0) = 0 \) \( C_{31} = \begin{vmatrix} 2 & 3 \\ 1 & 4 \end{vmatrix} = 8 - 3 = 5 \) \( C_{32} = -\begin{vmatrix} 1 & 3 \\ 0 & 4 \end{vmatrix} = -(4 - 0) = -4 \) \( C_{33} = \begin{vmatrix} 1 & 2 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1 \) The cofactor matrix is \[ \begin{bmatrix} 1 & 0 & 0 \\ -2 & 1 & 0 \\ 5 & -4 & 1 \end{bmatrix} \] Taking the transpose (adjoint): \[ \text{adj}(A) = \begin{bmatrix} 1 & -2 & 5 \\ 0 & 1 & -4 \\ 0 & 0 & 1 \end{bmatrix} \] Since \( \det(A) = 1 \): \[ A^{-1} = \frac{1}{1}\begin{bmatrix} 1 & -2 & 5 \\ 0 & 1 & -4 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & -2 & 5 \\ 0 & 1 & -4 \\ 0 & 0 & 1 \end{bmatrix} \] Now let \( B = A^{-1} = \begin{bmatrix} 1 & -2 & 5 \\ 0 & 1 & -4 \\ 0 & 0 & 1 \end{bmatrix} \). Since B is also upper triangular: \( \det(B) = 1 \times 1 \times 1 = 1 \ne 0 \), so B is invertible. Cofactors of B: \( C_{11}^{B} = \begin{vmatrix} 1 & -4 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1 \) \( C_{12}^{B} = -\begin{vmatrix} 0 & -4 \\ 0 & 1 \end{vmatrix} = -(0 - 0) = 0 \) \( C_{13}^{B} = \begin{vmatrix} 0 & 1 \\ 0 & 0 \end{vmatrix} = 0 - 0 = 0 \) \( C_{21}^{B} = -\begin{vmatrix} -2 & 5 \\ 0 & 1 \end{vmatrix} = -(-2 - 0) = 2 \) \( C_{22}^{B} = \begin{vmatrix} 1 & 5 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1 \) \( C_{23}^{B} = -\begin{vmatrix} 1 & -2 \\ 0 & 0 \end{vmatrix} = -(0 - 0) = 0 \) \( C_{31}^{B} = \begin{vmatrix} -2 & 5 \\ 1 & -4 \end{vmatrix} = 8 - 5 = 3 \) Wait — let us recompute: \( (-2)(-4) - (5)(1) = 8 - 5 = 3 \). \( C_{32}^{B} = -\begin{vmatrix} 1 & 5 \\ 0 & -4 \end{vmatrix} = -(-4 - 0) = 4 \) \( C_{33}^{B} = \begin{vmatrix} 1 & -2 \\ 0 & 1 \end{vmatrix} = 1 - 0 = 1 \) Cofactor matrix of B: \[ \begin{bmatrix} 1 & 0 & 0 \\ 2 & 1 & 0 \\ 3 & 4 & 1 \end{bmatrix} \] Taking the transpose: \[ \text{adj}(B) = \begin{bmatrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 0 & 0 & 1 \end{bmatrix} \] Therefore \[ B^{-1} = \frac{1}{\det(B)} \cdot \text{adj}(B) = \frac{1}{1}\begin{bmatrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 0 & 0 & 1 \end{bmatrix} = A \] Hence \( \left(A^{-1}\right)^{-1} = A \) is verified.
Answer: \( A^{-1} = \begin{bmatrix} 1 & -2 & 5 \\ 0 & 1 & -4 \\ 0 & 0 & 1 \end{bmatrix} \) and \( \left(A^{-1}\right)^{-1} = A \) is verified.
Question: Let \[A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 2 \\ 1 & 0 & 1 \end{bmatrix}\] Verify that \( (A^{-1})^{-1} = A \).
Answer: Since \( \det(A) = 4 \ne 0 \), the inverse \( A^{-1} = \dfrac{1}{4}\,\text{adj}(A) \) exists. By definition of an inverse, \( A^{-1} \cdot A = I \), which means A is itself the inverse of \( A^{-1} \). Hence \( (A^{-1})^{-1} = A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 2 \\ 1 & 0 & 1 \end{bmatrix} \) is verified.