Q.Let A=121231115. Verify that
🔒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 — Adjoint Matrix Property
The Adjoint Matrix and Its Central Property
You have a square matrix A and want to find A−1. There is a clean route through the adjoint (or adjugate) of A — a matrix built from the cofactors of A that has a beautiful relationship with A itself.
The intuition
For a 2×2 matrix you already know the inverse:
A=(acbd),A−1=ad−bc1(d−c−ba).
That second matrix, (d−c−ba), is exactly adj(A). The adjoint is the object you multiply by 1/det(A) to recover the inverse.
In Indian exam usage, "adjoint" always means the adjugate — the transpose of the cofactor matrix — not the Hermitian conjugate.
Building the adjoint
For each entry aij of an n×n matrix, the cofactor is
Cij=(−1)i+jMij,
where Mij is the minor (the determinant left after deleting row i and column j). Collect the cofactors into the cofactor matrix, then transpose:
adj(A)=[Cij]T,
so the (i,j) entry of adj(A) is Cji.
The central property
A⋅adj(A)=adj(A)⋅A=det(A)In.
Why? The (i,i) entry of Aadj(A) is ai1Ci1+⋯+ainCin — precisely the expansion of det(A) along row i. An off-diagonal (i,j) entry is the expansion of a determinant with two equal rows, which is 0.
Consequences
- If det(A)=0: A−1=det(A)1adj(A).
- If det(A)=0: A⋅adj(A)=O, so the adjoint annihilates A.
- Order fact: det(adj(A))=det(A)n−1. …
Concept: Adjoint Matrix Property — For any invertible matrix A, the adjoint satisfies (adj A)−1=adj(A−1).
Step 1: Compute detA
Using expansion along first row:
detA=1(3⋅5−1⋅1)−2(2⋅5−1⋅1)+1(2⋅1−3⋅1)
=1(15−1)−2(10−1)+1(2−3)=14−18−1=−5=0, so A is invertible.
Step 2: Verify (A−1)−1=A
By definition, A−1A=I. Taking inverse of both sides gives (A−1)−1=A. This holds for any invertible matrix — no computation needed.
Step 3: Verify (adj A)−1=adj(A−1)
We use the identity A−1=detAadj A. Then adj A=(detA)A−1. …
For A=121231115, det(A)=−5. Both identities hold: each side of (i) equals detA1A, and (ii) is the defining property of the inverse.
Setup. Expanding along the first row,
det(A)=1(3⋅5−1⋅1)−2(2⋅5−1⋅1)+1(2⋅1−3⋅1)=14−18−1=−5.
The cofactor matrix is symmetric here, so
adj(A)=14−9−1−941−11−1,A−1=−51adj(A).
Part (i): (adj A)−1=adj(A−1).
Use the standard identity adj(A)=det(A)A−1, valid for any invertible A.
- Left side: (adj A)−1=(det(A)A−1)−1=det(A)1A.
- Right side: adj(A−1)=det(A−1)(A−1)−1=det(A)1A. …
Method: Verifying a Matrix-Inverse Identity Using adj(A)=det(A)A−1
When asked to "verify" a general identity like (adjA)−1=adj(A−1) for a specific matrix, the fast, reliable route is to substitute the standard adjoint-inverse relationship algebraically, rather than computing A−1, adj(A−1), and (adjA)−1 all separately from scratch.
Steps
Step 1: Compute det(A) once
This single number is all you need to connect every quantity in the identity — compute it carefully via cofactor expansion, since every later step depends on it.
Step 2: Recall the identity adj(A)=det(A)A−1
This follows directly from A−1=detA1adj(A) rearranged — it holds for any invertible matrix, not just this specific A.
Step 3: Rewrite BOTH sides of the identity to be verified in terms of A, A−1, and det(A) …
Common Mistakes
Mistake 1: Computing A−1, adj(A−1), and (adjA)−1 separately as three full numeric computations
Why it's wrong: this brute-force route needs several full 3×3 adjoint/inverse computations, each carrying its own risk of a sign or transpose slip, when the identity adj(A)=det(A)A−1 proves the result algebraically in a few lines. Correct approach: substitute the standard identity and simplify symbolically; only fall back to full numeric computation if asked to "verify by direct calculation" explicitly.
Mistake 2: Treating det(A−1) as det(A) instead of 1/det(A)
Why it's wrong: this is a distinct, well-known fact (det(A−1)=1/det(A)) that's easy to misremember as just det(A), and using the wrong value derails the algebraic verification of adj(A−1). Correct approach: explicitly write det(A−1)=1/det(A) before substituting it into any adjoint formula. …
- GUJCET 2025Set 031 markMCQQ.Let A be an invertible square matrix of order 3×3. Then ∣(adjA)⋅A∣ is _____. (A) 3∣A∣ (B) ∣A∣2 (C) ∣A∣3 (D) ∣A∣
›Reveal solutionSolution
Use (adjA)A=∣A∣In; taking the determinant of ∣A∣I3 gives ∣A∣3.
For an order-3 matrix, (adjA)⋅A=∣A∣I3. Hence …
- GSEB Higher Secondary Certificate (HSC) Examination 2026Set ANNUAL1 markMCQQ.If A is an invertible matrix of order two, then ∣A−1∣= ____.(a) ∣A∣(b) ∣A∣−1(c) 1(d) 0
›Reveal solutionSolution
This is the standard determinant identity for an inverse matrix.
For any invertible matrix A, ∣A−1∣=∣A∣1=∣A∣−1 (this holds regardless of …
- GSEB Higher Secondary Certificate (HSC) Examination 2025Set ANNUAL1 markMCQQ.If A=13503200−1 is a square matrix of order 3×3, then ∣adj A∣ = ____.(a) −3(b) −9(c) 3(d) 9
›Reveal solutionSolution
Use the identity ∣adj A∣=∣A∣n−1 for an n×n matrix.
Expanding along row 1 (which has two zeros): ∣A∣=1(3×(−1)−0×2)=1(−3)=−3.
…
- GSEB Higher Secondary Certificate (HSC) Examination 2024Set ANNUAL1 markMCQQ.If A=101020031, then ∣adj A∣= ______.(a) 2(b) 4(c) 8(d) 6
›Reveal solutionSolution
Use ∣adjA∣=∣A∣n−1 for an n×n matrix.
Expanding along the first row, ∣A∣=1(2⋅1−3⋅0)−0+0=2.
…
- GSEB Higher Secondary Certificate (HSC) Examination 2024Set ANNUAL1 markMCQQ.If A=[54−23], then A(adj A)= ______.(a) I(b) A(c) 23I(d) 23A
›Reveal solutionSolution
Use the identity A(adjA)=∣A∣I.
∣A∣=5(3)−(−2)(4)=15+8=23.
…
- GSEB Higher Secondary Certificate (HSC) Examination 2022Set ANNUAL1 markMCQQ.Let A be a nonsingular square matrix of order 3×3. Then ∣adj A∣ is equal to ___.(a) ∣A∣(b) ∣A∣2(c) ∣A∣3(d) 3∣A∣
›Reveal solutionSolution
Use ∣adj A∣=∣A∣n−1 for an n×n matrix.
…
- GSEB Higher Secondary Certificate (HSC) Examination 2020Set ANNUAL1 markMCQQ.A is 3×3 matrix and det(A)=7. If B=adjA then det(AB)= ___(a) 75(b) 72(c) 7(d) 73
›Reveal solutionSolution
Use the multiplicative property det(AB)=detA⋅detB together with det(adjA)=(detA)n−1.
…
🎓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.