Q.(AB)−1=A−1⋅B−1, where A and B are invertible matrices satisfying commutative property with respect to multiplication.
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Inverse of a Product
Inverse of a Product: The "Socks and Shoes" Principle
You put on your socks first, then your shoes. To take them off, you can't remove the socks while the shoes are still on — you must reverse the order: shoes off first, then socks.
That's exactly the inverse of a product of matrices. If you apply transformation A first, then B, the combined effect is BA (read right-to-left: A acts first, then B). To undo it, undo B first, then A:
(AB)−1=B−1A−1
The order flips — forced by the logic of undoing.
Why the order must reverse
Check that B−1A−1 is the inverse of AB. We need (AB)(B−1A−1)=I and (B−1A−1)(AB)=I:
(AB)(B−1A−1)=A(BB−1)A−1=AIA−1=AA−1=I
B and B−1 cancel first, leaving A and A−1 to cancel. The other check works the same way:
(B−1A−1)(AB)=B−1(A−1A)B=B−1IB=B−1B=I
If you tried (AB)−1=A−1B−1 instead:
(AB)(A−1B−1)=A(BA−1)B−1
and BA−1 is not I — the matrices are in the wrong order. So the reversal is essential.
A common mistake is writing (AB)−1=A−1B−1. This is false unless A and B commute (which they almost never do). Always flip the order.
A concrete example with numbers
Let A=(1021) and B=(1101), with inverses:
A−1=(10−21),B−1=(1−101)
Then:
AB=(1021)(1101)=(3121),(AB)−1=(1−1−23)
Now compute B−1A−1:
B−1A−1=(1−101)(10−21)=(1−1−23)
They match. Try A−1B−1 and you'll get a different matrix — the wrong answer.
--- …
For invertible matrices the always-true rule is (AB)−1=B−1A−1 (verify: (AB)(B−1A−1)=A(BB−1)A−1=I). The question, however, adds that A and B commute (AB=BA). Taking inverses of AB=BA gives B−1A−1=A−1B−1, so the two orders are equal. Therefore $( …
Under the given condition that A and B commute (AB=BA), the statement (AB)−1=A−1B−1 is true.
The general rule first
For any two invertible matrices, the inverse of a product reverses the order:
(AB)−1=B−1A−1.
This is easy to verify: (AB)(B−1A−1)=A(BB−1)A−1=AIA−1=AA−1=I, and similarly (B−1A−1)(AB)=I. So B−1A−1 is indeed the inverse of AB.
Using the extra condition
The question adds that A and B commute, i.e. AB=BA. When two invertible matrices commute, their inverses commute too. To see this, take inverses of both sides of AB=BA:
(AB)−1=(BA)−1⇒B−1A−1=A−1B−1.
So under the commuting condition, B−1A−1 and A−1B−1 are the same matrix.
Conclusion …
Method: Applying the Reversal Law for the Inverse of a Product
Use this for any claim about the inverse of a product. Like the transpose, the inverse of a product reverses order; a stated commuting condition can then make the reversed and un-reversed forms coincide.
Steps
Step 1: Recall the general rule.
For invertible A,B,
(AB)−1=B−1A−1.
Verify by (AB)(B−1A−1)=A(BB−1)A−1=AA−1=I — the "socks and shoes" order.
Step 2: Compare the claim against the true form.
If the statement writes A−1B−1, that matches B−1A−1 only when the two inverses commute. …
Common Mistakes
Mistake 1: Writing (AB)−1=A−1B−1 in general.
Why it's wrong: the correct rule reverses order to B−1A−1; the un-reversed form is valid only when A,B commute. Correct approach: default to B−1A−1 and only drop the reversal under a commuting hypothesis.
Mistake 2: Overlooking the commuting condition stated in the problem. …
- TG EAPCET 2024Set eng-2024-05-11-FN1 markMCQQ.If A is a non singular matrix, then Adj(A−1)= (A) (AdjA)−1 (B) ∣A∣1A−1 (C) ∣A∣A−1 (D) ∣A∣A
›Reveal solutionSolution
The adjugate of the inverse of a non-singular matrix equals the inverse of the adjugate of the original matrix. The correct choice is (A).
Concept & Intuition
The adjugate (or classical adjoint) of a matrix is intimately tied to its inverse via the formula A−1=detAAdj(A). This relationship is symmetric: if we replace A by A−1, we get Adj(A−1)=(detA−1)A. But since detA−1=1/detA, this simplifies to detA1A. That looks like option (B) at first glance — but wait: we must check whether this equals the inverse of the adjugate. Using the same fundamental formula on Adj(A) itself reveals the elegant identity Adj(A−1)=(AdjA)−1. Let’s verify step by step.
Step-by-step reasoning
- Recall the fundamental adjugate-inverse relation For any invertible matrix A,
A−1=detAAdj(A).
This is the definition of the adjugate: it’s the transpose of the cofactor matrix, and it satisfies A⋅Adj(A)=detA⋅I.
- Apply the same relation to A−1 Since A−1 is also invertible, we have
(A−1)−1=det(A−1)Adj(A−1).
But (A−1)−1=A, so
A=det(A−1)Adj(A−1).
Rearranging gives
Adj(A−1)=A⋅det(A−1).
- Simplify det(A−1) For any invertible matrix, det(A−1)=detA1. Thus
Adj(A−1)=A⋅detA1=detA1A.
This matches option (B) — but we must check if it’s also equal to the inverse of the adjugate.
- Find (AdjA)−1 From the fundamental relation again, Adj(A)=(detA)A−1. Taking the inverse of both sides: (AdjA)−1=((detA)A−1)−1=detA1(A−1)−1=detA1A. …
- TG EAPCET 2023Set eng-2023-05-12-AN1 markMCQQ.If A is a non-singular matrix such that (A−2I)(A−3I)=0, then 51A+56A−1= (A) O (B) I (C) 2I (D) 3I
›Reveal solutionSolution
The given matrix equation implies that A satisfies A2−5A+6I=0, which can be rearranged to express A−1 in terms of A. Substituting that expression into 51A+56A−1 simplifies to I.
The key here is that the equation (A−2I)(A−3I)=0 is a polynomial relation satisfied by the matrix A. Since A is non-singular (invertible), we can manipulate this relation algebraically, just like we would with numbers, but carefully respecting matrix multiplication (which is not commutative, though here all terms involve A and I, which commute).
- Expand the given equation. Multiply out:
(A−2I)(A−3I)=A2−3A−2A+6I=A2−5A+6I=0.
So we have:
A2−5A+6I=0.
- Rearrange to isolate A−1. Since A is invertible, multiply the whole equation by A−1 on the left (or right — it commutes with I):
A−5I+6A−1=0.
This gives:
6A−1=5I−A.
Hence:
A−1=65I−61A.
TipThis step is the heart of the trick: instead of computing A−1 directly, we express it in terms of A itself using the polynomial relation. This works because the polynomial is quadratic and A is invertible.
- Substitute into the target expression. We need 51A+56A−1. Replace A−1:
51A+56(65I−61A).
Simplify the second term: …
- TG EAPCET 2022Set eng-2022-07-19-FN1 markMCQQ.If (2x−y+1)+i(x−2y−1)=2−3i, then the multiplicative inverse of (x−iy) is (A) 4115+4112i (B) 296+2915i (C) 2915+296i (D) 4112+4115i
›Reveal solutionSolution
Equating real and imaginary parts gives x=34,y=35; then x−iy1=4112+4115i.
Equate real and imaginary parts of (2x−y+1)+i(x−2y−1)=2−3i:
2x−y+1=2⟹2x−y=1
x−2y−1=−3⟹x−2y=−2
Solve: from the first, y=2x−1. Substitute into the second:
x−2(2x−1)=−2⟹−3x+2=−2⟹x=34,y=35 …
- TG EAPCET 2026Set eng-2026-05-11-AN1 markMCQQ.If A=Adj(−2(Adj(P−1))) and P=110201112, then ∣A∣= (A) −41 (B) 41 (C) 43 (D) 32
›Reveal solutionSolution
The problem reduces to computing the determinant of a matrix built from nested adjugates and scalar multiplications. Using the property Adj(kM)=kn−1Adj(M) and Adj(Adj(M))=∣M∣n−2M, we find ∣A∣=41, so the correct option is (B).
We start with the matrix
P=110201112.
We are given
A=Adj(−2(Adj(P−1)))
and need ∣A∣.
Concept & Intuition
The adjugate (classical adjoint) satisfies two key identities for an n×n matrix M:
- Adj(kM)=kn−1Adj(M) for a scalar k.
- Adj(Adj(M))=∣M∣n−2M (for n≥2).
Here n=3, so n−1=2 and n−2=1. That means the second property simplifies to Adj(Adj(M))=∣M∣M.
We also know Adj(M)=∣M∣M−1 when M is invertible.
The plan: work from the inside out, applying these properties step by step, and take determinants at the end.
Step-by-step solution
- Find ∣P∣ Compute determinant of P:
∣P∣=1⋅(0⋅2−1⋅1)−2⋅(1⋅2−1⋅0)+1⋅(1⋅1−0⋅0)
=1⋅(0−1)−2⋅(2−0)+1⋅(1−0)=−1−4+1=−4.
So ∣P∣=−4.
- Find Adj(P−1) Since P is invertible (∣P∣=0), P−1=∣P∣1Adj(P). But we need Adj(P−1). Using Adj(M)=∣M∣M−1:
Adj(P−1)=∣P−1∣⋅(P−1)−1=∣P∣−1⋅P.
Because ∣P−1∣=1/∣P∣ and (P−1)−1=P.
So
Adj(P−1)=−41P=−41P.
-
Multiply by −2 inside the outer adjugate
We have the matrix M=−2(Adj(P−1))=−2⋅(−41P)=21P.
So M=21P.
-
Take the adjugate of M
A=Adj(M)=Adj(21P). …
🎓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.