If \(A=\left[\begin{array} \text 3&2\\ 7&5\end{array}\right],\ B=\left[\begin{array}\text 6&7\\ 8&9\end{array}\right],\) then show that \((AB)^{–1} = B^{–1}A^{–1}.\)
CBSE Class 12 Maths · Matrices
CBSE Class 12 Maths · Matrices
Imagine putting on your shoes and socks. To undo that, you take off your shoes first, then your socks — the reverse order. Matrices work the same way. When two matrices are multiplied together and then flipped (inverted), you must flip them in the opposite order. Both sides of this rule give the exact same result, which is how we know the rule is true. It is a beautiful pattern that always holds whenever both matrices can be inverted.
Answer: Both \((AB)^{-1}\) and \(B^{-1}A^{-1}\) equal \(\begin{bmatrix} -47 & \frac{39}{2} \\ 41 & -17 \end{bmatrix}\). Hence \((AB)^{-1} = B^{-1}A^{-1}\) is proved.
For any two invertible matrices \(A\) and \(B\) of the same order, the reversal law states that \((AB)^{-1} = B^{-1}A^{-1}\). Notice the order is reversed on the right side. To find the inverse of a \(2 \times 2\) matrix \(M = \begin{bmatrix} a & b \\ c & d \end{bmatrix}\), we use \(M^{-1} = \frac{1}{\det(M)}\,\text{adj}(M)\), where the adjoint swaps the diagonal entries and negates the off-diagonal entries. To prove the statement, we compute both sides separately and show they are equal.
For an invertible matrix \(M = \begin{bmatrix} a & b \\ c & d \end{bmatrix}\), \[M^{-1} = \frac{1}{ad - bc}\begin{bmatrix} d & -b \\ -c & a \end{bmatrix}\] and the reversal law is \[(AB)^{-1} = B^{-1}A^{-1}.\]
Both \((AB)^{-1}\) and \(B^{-1}A^{-1}\) equal \(\begin{bmatrix} -47 & \frac{39}{2} \\ 41 & -17 \end{bmatrix}\). Hence \((AB)^{-1} = B^{-1}A^{-1}\) is proved.
A very common error is computing the right side as \(A^{-1}B^{-1}\) instead of the reversed order \(B^{-1}A^{-1}\). Because matrix multiplication is not commutative, keeping the correct reversed order is essential; \(A^{-1}B^{-1}\) will generally give a different matrix.
Both \((AB)^{-1}\) and \(B^{-1}A^{-1}\) equal \(\begin{bmatrix} -47 & \frac{39}{2} \\ 41 & -17 \end{bmatrix}\). Hence \((AB)^{-1} = B^{-1}A^{-1}\) is proved.
One common mistake: students write \( (AB)^{-1} = A^{-1}B^{-1} \) (same order) instead of reversing the order to \( B^{-1}A^{-1} \). Matrix multiplication is not commutative, so the order of factors must be swapped when taking the inverse of a product.
Answer: Both \((AB)^{-1}\) and \(B^{-1}A^{-1}\) equal \(\begin{bmatrix} -47 & \frac{39}{2} \\ 41 & -17 \end{bmatrix}\). Hence \((AB)^{-1} = B^{-1}A^{-1}\) is proved.
Question: If \[A = \begin{bmatrix} 2 & 1 \\ 5 & 3 \end{bmatrix}, \quad B = \begin{bmatrix} 4 & 5 \\ 3 & 4 \end{bmatrix}\] then verify that \((AB)^{-1} = B^{-1}A^{-1}\).
Solution: First, find \(A^{-1}\). We have \(\det(A) = (2)(3) - (1)(5) = 6 - 5 = 1\). Since \(\det(A) \ne 0\), A is invertible. The adjoint of A is \[\text{adj}(A) = \begin{bmatrix} 3 & -1 \\ -5 & 2 \end{bmatrix}\] So \[A^{-1} = \frac{1}{1} \begin{bmatrix} 3 & -1 \\ -5 & 2 \end{bmatrix} = \begin{bmatrix} 3 & -1 \\ -5 & 2 \end{bmatrix}\] Next, find \(B^{-1}\). We have \(\det(B) = (4)(4) - (5)(3) = 16 - 15 = 1\). Since \(\det(B) \ne 0\), B is invertible. The adjoint of B is \[\text{adj}(B) = \begin{bmatrix} 4 & -5 \\ -3 & 4 \end{bmatrix}\] So \[B^{-1} = \frac{1}{1} \begin{bmatrix} 4 & -5 \\ -3 & 4 \end{bmatrix} = \begin{bmatrix} 4 & -5 \\ -3 & 4 \end{bmatrix}\] Now compute AB. \[AB = \begin{bmatrix} 2 & 1 \\ 5 & 3 \end{bmatrix} \begin{bmatrix} 4 & 5 \\ 3 & 4 \end{bmatrix} = \begin{bmatrix} (2)(4)+(1)(3) & (2)(5)+(1)(4) \\ (5)(4)+(3)(3) & (5)(5)+(3)(4) \end{bmatrix} = \begin{bmatrix} 11 & 14 \\ 29 & 37 \end{bmatrix}\] Now find \((AB)^{-1}\). We have \(\det(AB) = (11)(37) - (14)(29) = 407 - 406 = 1\). The adjoint of AB is \[\text{adj}(AB) = \begin{bmatrix} 37 & -14 \\ -29 & 11 \end{bmatrix}\] So \[(AB)^{-1} = \frac{1}{1} \begin{bmatrix} 37 & -14 \\ -29 & 11 \end{bmatrix} = \begin{bmatrix} 37 & -14 \\ -29 & 11 \end{bmatrix}\] Now compute \(B^{-1}A^{-1}\). \[B^{-1}A^{-1} = \begin{bmatrix} 4 & -5 \\ -3 & 4 \end{bmatrix} \begin{bmatrix} 3 & -1 \\ -5 & 2 \end{bmatrix}\] \[= \begin{bmatrix} (4)(3)+(-5)(-5) & (4)(-1)+(-5)(2) \\ (-3)(3)+(4)(-5) & (-3)(-1)+(4)(2) \end{bmatrix}\] \[= \begin{bmatrix} 12+25 & -4-10 \\ -9-20 & 3+8 \end{bmatrix} = \begin{bmatrix} 37 & -14 \\ -29 & 11 \end{bmatrix}\] Since \((AB)^{-1} = \begin{bmatrix} 37 & -14 \\ -29 & 11 \end{bmatrix} = B^{-1}A^{-1}\), the result is verified.
Answer: Both \((AB)^{-1}\) and \(B^{-1}A^{-1}\) equal \(\begin{bmatrix} 37 & -14 \\ -29 & 11 \end{bmatrix}\), hence \((AB)^{-1} = B^{-1}A^{-1}\) is verified.
Question: If \[A = \begin{bmatrix} 1 & 2 \\ 3 & 7 \end{bmatrix}, \quad B = \begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\] then show that \((AB)^{-1} = B^{-1}A^{-1}\).
Solution: First, find \(A^{-1}\). We have \(\det(A) = (1)(7) - (2)(3) = 7 - 6 = 1\). Since \(\det(A) \ne 0\), A is invertible. The adjoint of A is \[\text{adj}(A) = \begin{bmatrix} 7 & -2 \\ -3 & 1 \end{bmatrix}\] So \[A^{-1} = \frac{1}{1} \begin{bmatrix} 7 & -2 \\ -3 & 1 \end{bmatrix} = \begin{bmatrix} 7 & -2 \\ -3 & 1 \end{bmatrix}\] Next, find \(B^{-1}\). We have \(\det(B) = (2)(1) - (1)(1) = 2 - 1 = 1\). Since \(\det(B) \ne 0\), B is invertible. The adjoint of B is \[\text{adj}(B) = \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\] So \[B^{-1} = \frac{1}{1} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix} = \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\] Now compute AB. \[AB = \begin{bmatrix} 1 & 2 \\ 3 & 7 \end{bmatrix} \begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} (1)(2)+(2)(1) & (1)(1)+(2)(1) \\ (3)(2)+(7)(1) & (3)(1)+(7)(1) \end{bmatrix} = \begin{bmatrix} 4 & 3 \\ 13 & 10 \end{bmatrix}\] Now find \((AB)^{-1}\). We have \(\det(AB) = (4)(10) - (3)(13) = 40 - 39 = 1\). The adjoint of AB is \[\text{adj}(AB) = \begin{bmatrix} 10 & -3 \\ -13 & 4 \end{bmatrix}\] So \[(AB)^{-1} = \frac{1}{1} \begin{bmatrix} 10 & -3 \\ -13 & 4 \end{bmatrix} = \begin{bmatrix} 10 & -3 \\ -13 & 4 \end{bmatrix}\] Now compute \(B^{-1}A^{-1}\). \[B^{-1}A^{-1} = \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix} \begin{bmatrix} 7 & -2 \\ -3 & 1 \end{bmatrix}\] \[= \begin{bmatrix} (1)(7)+(-1)(-3) & (1)(-2)+(-1)(1) \\ (-1)(7)+(2)(-3) & (-1)(-2)+(2)(1) \end{bmatrix}\] \[= \begin{bmatrix} 7+3 & -2-1 \\ -7-6 & 2+2 \end{bmatrix} = \begin{bmatrix} 10 & -3 \\ -13 & 4 \end{bmatrix}\] Since \((AB)^{-1} = \begin{bmatrix} 10 & -3 \\ -13 & 4 \end{bmatrix} = B^{-1}A^{-1}\), the result is verified.
Answer: Both \((AB)^{-1}\) and \(B^{-1}A^{-1}\) equal \(\begin{bmatrix} 10 & -3 \\ -13 & 4 \end{bmatrix}\), hence \((AB)^{-1} = B^{-1}A^{-1}\) is verified.
Question: If \( A = \begin{bmatrix} 2 & 1 \\ 5 & 3 \end{bmatrix} \) and \( B = \begin{bmatrix} 4 & 5 \\ 3 & 4 \end{bmatrix} \), show that \( (AB)^{-1} = B^{-1}A^{-1} \).
Answer: Both \( (AB)^{-1} \) and \( B^{-1}A^{-1} \) equal \( \begin{bmatrix} 37 & -14 \\ -29 & 11 \end{bmatrix} \). Hence \( (AB)^{-1} = B^{-1}A^{-1} \) is proved.