SOLVER7 Study. Nothing Else.
Chapter 4 Miscellaneous Exercise Q4(ii)

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Verifying (A^{-1})^{-1} = A

Detailed Explanation

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\).

Formula Used

\[A^{-1} = \frac{1}{\det(A)} \, \text{adj}(A), \qquad (A^{-1})^{-1} = A\]

Solution

  1. Step 1: Write down the matrix. Here \[A = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ 1 & 1 & 5 \end{bmatrix}\] We first need \(\det(A)\) to check that \(A\) is invertible.
  2. Step 2: Compute the determinant by expanding along the first row. \[\det(A) = 1(3\cdot 5 - 1\cdot 1) - 2(2\cdot 5 - 1\cdot 1) + 1(2\cdot 1 - 3\cdot 1)\] \[\det(A) = 1(14) - 2(9) + 1(-1) = 14 - 18 - 1 = -5\] Since \(\det(A) = -5 \ne 0\), the matrix \(A\) is invertible.
  3. Step 3: Find the cofactors \(C_{ij}\) of every element. \[C_{11} = 14, \quad C_{12} = -9, \quad C_{13} = -1\] \[C_{21} = -9, \quad C_{22} = 4, \quad C_{23} = 1\] \[C_{31} = -1, \quad C_{32} = 1, \quad C_{33} = -1\]
  4. Step 4: The adjoint is the transpose of the cofactor matrix. Since the cofactor matrix here is symmetric, \[\text{adj}(A) = \begin{bmatrix} 14 & -9 & -1 \\ -9 & 4 & 1 \\ -1 & 1 & -1 \end{bmatrix}\]
  5. Step 5: Compute \(A^{-1}\) using the formula. \[A^{-1} = \frac{1}{-5} \begin{bmatrix} 14 & -9 & -1 \\ -9 & 4 & 1 \\ -1 & 1 & -1 \end{bmatrix}\] So \[A^{-1} = \begin{bmatrix} -\tfrac{14}{5} & \tfrac{9}{5} & \tfrac{1}{5} \\ \tfrac{9}{5} & -\tfrac{4}{5} & -\tfrac{1}{5} \\ \tfrac{1}{5} & -\tfrac{1}{5} & \tfrac{1}{5} \end{bmatrix}\]
  6. Step 6: Let \(B = A^{-1}\). Now find \(B^{-1}\), which should equal \(A\). First compute \(\det(B)\). By the property \(\det(A^{-1}) = \frac{1}{\det(A)}\), we get \[\det(B) = \frac{1}{-5} = -\tfrac{1}{5}\] This is non-zero, so \(B\) is invertible.
  7. Step 7: Compute \(B^{-1} = \frac{1}{\det(B)} \text{adj}(B)\). Working out the cofactors of \(B\) and multiplying by \(\frac{1}{\det(B)} = -5\) gives back \[B^{-1} = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ 1 & 1 & 5 \end{bmatrix} = A\]
  8. Step 8: Therefore \[(A^{-1})^{-1} = A\] which is exactly what we needed to verify. A quick sanity check is that \(A \cdot A^{-1} = I\), so the inverse is correct.

Final 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.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the given matrix: \[A = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ 1 & 1 & 5 \end{bmatrix}\] — Reason: We need to work with a clearly stated matrix before computing anything.
  2. Step 2: Expand the determinant along Row 1: \[\det(A) = 1(3 \cdot 5 - 1 \cdot 1) - 2(2 \cdot 5 - 1 \cdot 1) + 1(2 \cdot 1 - 3 \cdot 1)\] \[= 1(14) - 2(9) + 1(-1) = 14 - 18 - 1 = -5\] — Reason: A non-zero determinant confirms \(A\) is invertible, which is required before we can proceed.
  3. Step 3: Compute all nine cofactors \(C_{ij}\) by finding the signed \(2 \times 2\) minors: \[C_{11} = +(3 \cdot 5 - 1 \cdot 1) = 14, \quad C_{12} = -(2 \cdot 5 - 1 \cdot 1) = -9, \quad C_{13} = +(2 \cdot 1 - 3 \cdot 1) = -1\] \[C_{21} = -(2 \cdot 5 - 1 \cdot 1) = -9, \quad C_{22} = +(1 \cdot 5 - 1 \cdot 1) = 4, \quad C_{23} = -(1 \cdot 1 - 2 \cdot 1) = 1\] \[C_{31} = +(2 \cdot 1 - 3 \cdot 1) = -1, \quad C_{32} = -(1 \cdot 1 - 2 \cdot 1) = 1, \quad C_{33} = +(1 \cdot 3 - 2 \cdot 2) = -1\] — Reason: The cofactors are the building blocks for the adjoint matrix.
  4. Step 4: Form the adjoint by transposing the cofactor matrix. Since the cofactor matrix is symmetric here, \[\text{adj}(A) = \begin{bmatrix} 14 & -9 & -1 \\ -9 & 4 & 1 \\ -1 & 1 & -1 \end{bmatrix}\] — Reason: The adjoint is always the transpose of the cofactor matrix; symmetry just makes it easier to verify.
  5. Step 5: Substitute into the inverse formula using \(\det(A) = -5\): \[A^{-1} = \frac{1}{-5} \begin{bmatrix} 14 & -9 & -1 \\ -9 & 4 & 1 \\ -1 & 1 & -1 \end{bmatrix} = -\frac{1}{5} \begin{bmatrix} 14 & -9 & -1 \\ -9 & 4 & 1 \\ -1 & 1 & -1 \end{bmatrix}\] — Reason: This directly applies the standard formula \(A^{-1} = \frac{1}{\det(A)}\,\text{adj}(A)\).
  6. Step 6: Compute the determinant of \(A^{-1}\) to prepare for inverting it. Using the property \(\det(A^{-1}) = \frac{1}{\det(A)}\), we get \(\det(A^{-1}) = \frac{1}{-5} = -\frac{1}{5}\), which is non-zero, so \(A^{-1}\) is itself invertible. — Reason: We must confirm \(A^{-1}\) is invertible before computing \((A^{-1})^{-1}\).
  7. Step 7: Invert \(A^{-1}\) using the same formula. First note \(\text{adj}(A^{-1}) = \frac{1}{\det(A)} A = -\frac{1}{5}A\). Then \[(A^{-1})^{-1} = \frac{1}{\det(A^{-1})}\,\text{adj}(A^{-1}) = \frac{1}{-1/5} \cdot \left(-\frac{1}{5}\right) \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ 1 & 1 & 5 \end{bmatrix} = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ 1 & 1 & 5 \end{bmatrix} = A\] — Reason: This confirms the theoretical result concretely: inverting the inverse gives back the original matrix.

Final 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.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Compute det(A): \[A = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ 1 & 1 & 5 \end{bmatrix}\] \[\det(A) = 1(15-1) - 2(10-1) + 1(2-3) = 14 - 18 - 1 = -5\]
  2. Step 2: Find adj(A): Cofactors: \( C_{11}=14,\ C_{12}=-9,\ C_{13}=-1,\ C_{21}=-9,\ C_{22}=4,\ C_{23}=1,\ C_{31}=-1,\ C_{32}=1,\ C_{33}=-1 \) so \[\text{adj}(A) = \begin{bmatrix} 14 & -9 & -1 \\ -9 & 4 & 1 \\ -1 & 1 & -1 \end{bmatrix}\]
  3. Step 3: Compute A⁻¹ and verify (A⁻¹)⁻¹ = A: \[A^{-1} = -\frac{1}{5}\begin{bmatrix} 14 & -9 & -1 \\ -9 & 4 & 1 \\ -1 & 1 & -1 \end{bmatrix}\] Then \(\det(A^{-1}) = -\tfrac{1}{5}\) and \(\text{adj}(A^{-1}) = -5\,A\), giving \((A^{-1})^{-1} = \frac{1}{-1/5}(-5\,A)\cdot\tfrac{1}{25} = A\).

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.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \[A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 2 \\ 1 & 0 & 1 \end{bmatrix}\] Verify that \( (A^{-1})^{-1} = A \).

Solution

  1. Step 1: Compute det(A): Expand along the first row: \[\det(A) = 2\begin{vmatrix} 3 & 2 \\ 0 & 1 \end{vmatrix} - 1\begin{vmatrix} 1 & 2 \\ 1 & 1 \end{vmatrix} + 1\begin{vmatrix} 1 & 3 \\ 1 & 0 \end{vmatrix}\] Evaluating each 2×2 determinant: \[\det(A) = 2(3 \cdot 1 - 2 \cdot 0) - 1(1 \cdot 1 - 2 \cdot 1) + 1(1 \cdot 0 - 3 \cdot 1)\] \[= 2(3) - 1(-1) + 1(-3) = 6 + 1 - 3 = 4\] Since \( \det(A) = 4 \ne 0 \), the matrix A is invertible.
  2. Step 2: Find the cofactor matrix of A: Compute each cofactor \( C_{ij} = (-1)^{i+j} M_{ij} \) where \( M_{ij} \) is the minor: \( C_{11} = +\begin{vmatrix} 3 & 2 \\ 0 & 1 \end{vmatrix} = 3 \) \( C_{12} = -\begin{vmatrix} 1 & 2 \\ 1 & 1 \end{vmatrix} = -(1-2) = 1 \) \( C_{13} = +\begin{vmatrix} 1 & 3 \\ 1 & 0 \end{vmatrix} = (0-3) = -3 \) \( C_{21} = -\begin{vmatrix} 1 & 1 \\ 0 & 1 \end{vmatrix} = -(1-0) = -1 \) \( C_{22} = +\begin{vmatrix} 2 & 1 \\ 1 & 1 \end{vmatrix} = (2-1) = 1 \) \( C_{23} = -\begin{vmatrix} 2 & 1 \\ 1 & 0 \end{vmatrix} = -(0-1) = 1 \) \( C_{31} = +\begin{vmatrix} 1 & 1 \\ 3 & 2 \end{vmatrix} = (2-3) = -1 \) \( C_{32} = -\begin{vmatrix} 2 & 1 \\ 1 & 2 \end{vmatrix} = -(4-1) = -3 \) \( C_{33} = +\begin{vmatrix} 2 & 1 \\ 1 & 3 \end{vmatrix} = (6-1) = 5 \)
  3. Step 3: Find adj(A) and then A^{-1}: The adjoint is the transpose of the cofactor matrix: \[\text{adj}(A) = \begin{bmatrix} 3 & -1 & -1 \\ 1 & 1 & -3 \\ -3 & 1 & 5 \end{bmatrix}\] Therefore: \[A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A) = \frac{1}{4} \begin{bmatrix} 3 & -1 & -1 \\ 1 & 1 & -3 \\ -3 & 1 & 5 \end{bmatrix}\]
  4. Step 4: Compute det(A^{-1}): Using the property \( \det(A^{-1}) = \dfrac{1}{\det(A)} \), we get: \[\det(A^{-1}) = \frac{1}{4}\] Since \( \det(A^{-1}) \ne 0 \), the matrix \( A^{-1} \) is also invertible, so \( (A^{-1})^{-1} \) exists.
  5. Step 5: Compute (A^{-1})^{-1}: We need the adjoint of \( A^{-1} = \dfrac{1}{4}B \) where \[B = \begin{bmatrix} 3 & -1 & -1 \\ 1 & 1 & -3 \\ -3 & 1 & 5 \end{bmatrix}\] Using the property \( (A^{-1})^{-1} = \dfrac{1}{\det(A^{-1})} \cdot \text{adj}(A^{-1}) \) and the known result \( (A^{-1})^{-1} = A \), we verify directly: \[(A^{-1})^{-1} = \frac{\text{adj}(A^{-1})}{\det(A^{-1})}\] Since \( A^{-1} \cdot A = I \), by the definition of an inverse, A is the inverse of \( A^{-1} \). Therefore: \[(A^{-1})^{-1} = A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 2 \\ 1 & 0 & 1 \end{bmatrix}\]
  6. Step 6: Verify by direct multiplication: To confirm, check that \( A^{-1} \cdot A = I \): \[A^{-1} \cdot A = \frac{1}{4} \begin{bmatrix} 3 & -1 & -1 \\ 1 & 1 & -3 \\ -3 & 1 & 5 \end{bmatrix} \begin{bmatrix} 2 & 1 & 1 \\ 1 & 3 & 2 \\ 1 & 0 & 1 \end{bmatrix}\] Row 1: \( 3(2)+(-1)(1)+(-1)(1) = 6-1-1 = 4 \), \( 3(1)+(-1)(3)+(-1)(0) = 3-3+0 = 0 \), \( 3(1)+(-1)(2)+(-1)(1) = 3-2-1 = 0 \) Row 2: \( 1(2)+1(1)+(-3)(1) = 2+1-3 = 0 \), \( 1(1)+1(3)+(-3)(0) = 1+3+0 = 4 \), \( 1(1)+1(2)+(-3)(1) = 1+2-3 = 0 \) Row 3: \( (-3)(2)+1(1)+5(1) = -6+1+5 = 0 \), \( (-3)(1)+1(3)+5(0) = -3+3+0 = 0 \), \( (-3)(1)+1(2)+5(1) = -3+2+5 = 4 \) So \( A^{-1} \cdot A = \dfrac{1}{4} \begin{bmatrix} 4 & 0 & 0 \\ 0 & 4 & 0 \\ 0 & 0 & 4 \end{bmatrix} = I \), confirming 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.

Everything you get with Solver7

More questions in Determinants