Q.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∣
🔒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 n×n matrix A, the determinant of its adjoint is ∣adj A∣=∣A∣n−1.
Step 1 — Recall the fundamental relation:
A⋅(adj A)=∣A∣In.
Step 2 — Take determinants on both sides:
∣A⋅adj A∣=∣A∣In.
Step 3 — Use ∣AB∣=∣A∣∣B∣ and ∣kIn∣=kn:
∣A∣⋅∣adj A∣=∣A∣n. …
For any n×n nonsingular matrix A, the determinant of its adjugate is ∣adj A∣=∣A∣n−1. Here n=3, so ∣adj A∣=∣A∣2. The correct option is (B).
The key idea is that the adjugate matrix is built from cofactors, and its product with A gives a scalar matrix. That relationship directly links their determinants.
We start from the fundamental property of the adjugate:
A⋅(adj A)=(adj A)⋅A=∣A∣In
This holds for any square matrix A of order n. For a nonsingular A, ∣A∣=0, so the adjugate is essentially ∣A∣ times the inverse.
Now take determinants on both sides of A⋅(adj A)=∣A∣In.
- Determinant of a product — For any two square matrices X and Y of the same order, ∣XY∣=∣X∣∣Y∣. So:
∣A⋅(adj A)∣=∣A∣∣adj A∣
- Determinant of a scalar multiple — The right side is ∣A∣In. The determinant of kIn (where k is a scalar) is kn, because multiplying a single row by k multiplies the determinant by k, and there are n rows. So:
∣∣A∣In∣=(∣A∣)n
- Equate the two:
∣A∣∣adj A∣=(∣A∣)n
- Since A is nonsingular, ∣A∣=0, we can divide both sides by ∣A∣:
∣adj A∣=(∣A∣)n−1
For n=3, this becomes: …
Method: Determinant of the Adjoint, ∣adjA∣=∣A∣n−1
This method derives (rather than memorises) the relationship between ∣adjA∣ and ∣A∣ for any square matrix of order n, so it works no matter what order the question asks about.
Steps
Step 1: Start from the defining identity of the adjoint
A⋅adj(A)=∣A∣In
This holds for every square matrix — it is the fact the whole "inverse via adjoint" method is built on.
Step 2: Take the determinant of both sides
Use ∣XY∣=∣X∣∣Y∣ on the left, and ∣kIn∣=kn on the right (scaling a single row by k scales the determinant by k, and there are n rows to scale):
∣A∣⋅∣adjA∣=∣A∣n …
Common Mistakes
Mistake 1: Using the wrong exponent — picking ∣A∣ or ∣A∣n instead of ∣A∣n−1
Why it's wrong: the identity ∣adjA∣=∣A∣n−1 comes from dividing both sides of ∣A∣⋅∣adjA∣=∣A∣n by ∣A∣ — skipping that division, or misremembering the formula, leads directly to choosing option (A) ∣A∣ or wrongly guessing ∣A∣3 (which is ∣A∣n, not ∣A∣n−1). Correct approach: re-derive the exponent from A⋅adj(A)=∣A∣In each time rather than recalling "n−1" by rote — for n=3 this gives ∣A∣3−1=∣A∣2.
Mistake 2: Confusing this property with det(A−1)=detA1 …
Showing the 12 most recent of 20 on this concept.
- AP EAPCET 2023Set eng-2023-05-15-AN1 markMCQQ.If det(AB)=(detA)(detB) and A is a non-singular matrix of order 3×3, then det(adj A)= (A) det(A) (B) (det(A))−1 (C) (det(A))2 (D) (det(A))3
›Reveal solutionSolution
The standard identity det(adjA)=(detA)n−1 for an n×n matrix gives (detA)2 for n=3. Answer: (C).
Concept and Intuition
The adjugate satisfies A⋅adjA=(detA)I. Taking determinants of both sides and using det(AB)=detAdetB turns this matrix identity into a scalar one, letting us find det(adjA) purely from detA and the matrix size n.
Step-by-Step Solution
- Start from A(adjA)=(detA)In.
- Take determinants of both sides: det(A)det(adjA)=det((detA)In).
- For a scalar k multiplying an n×n identity matrix, det(kIn)=kn. Here k=detA, so RHS is (detA)n.
- So det(A)det(adjA)=(detA)n. …
- AP EAPCET 2026Set eng-2026-05-15-FN1 markMCQQ.For a 3×3 non singular matrix A, if Adj(Adj(Adj(Adj(A))))=∣A∣nA, then n= (A) 3 (B) 4 (C) 8 (D) 5
›Reveal solutionSolution
The key idea is that repeatedly applying the adjugate to a 3×3 matrix scales it by a power of its determinant. Using the property Adj(Adj(A))=∣A∣n−2A for an n×n matrix, we find that after four adjugates the exponent is 34=81, so n=81 — but the problem’s given form ∣A∣nA forces us to match exponents, leading to n=8.
We are given a 3×3 non-singular matrix A and the equation
Adj(Adj(Adj(Adj(A))))=∣A∣nA.
We need to find n.
1. Recall the fundamental adjugate property
For any invertible m×m matrix M,
Adj(M)=∣M∣⋅M−1.
This is the definition: the adjugate is the transpose of the cofactor matrix, and it satisfies M⋅Adj(M)=∣M∣I.
2. Apply it once
Let A be 3×3. Then
Adj(A)=∣A∣⋅A−1.
3. Apply it twice
Now compute Adj(Adj(A)).
Let B=Adj(A)=∣A∣A−1.
Then
Adj(B)=∣B∣⋅B−1.
We need ∣B∣:
∣B∣=∣A∣A−1=∣A∣3⋅∣A−1∣=∣A∣3⋅∣A∣1=∣A∣2.
Also B−1=(∣A∣A−1)−1=∣A∣1A.
Thus
Adj(Adj(A))=∣A∣2⋅∣A∣1A=∣A∣A.
TipFor an m×m matrix, Adj(Adj(A))=∣A∣m−2A. Here m=3, so ∣A∣3−2=∣A∣1, matching our result.
4. Apply it three times
Let C=Adj(Adj(A))=∣A∣A.
Then
Adj(C)=∣C∣⋅C−1.
Now ∣C∣=∣A∣A=∣A∣3⋅∣A∣=∣A∣4.
And C−1=(∣A∣A)−1=∣A∣1A−1.
So
Adj(C)=∣A∣4⋅∣A∣1A−1=∣A∣3A−1.
5. Apply it four times …
- AP EAPCET 2026Set eng-2026-05-18-AN1 markMCQQ.A,B are 3rd order non-singular square matrices and K is a real number. Which of the following is true? (A) Adj(AB)=(AdjB)(AdjA) and adj(A−1)=(adjA)−1 (B) Adj(KA)=KAdj(A) and ∣KA∣=K3∣A∣ (C) ∣B−1AB∣=∣A∣ and (A+B)2=A2+2AB+B2 (D) (adjA)−1=∣A∣A and (AB)−1=B−1A−1
›Reveal solutionSolution
The key idea is to test each statement using standard matrix properties for non‑singular matrices. Only option (D) contains two statements that are both true.
-
Check option (A):
- The first part, Adj(AB)=(AdjB)(AdjA), is a true property of adjugates for square matrices (order doesn’t matter as long as they are square).
- The second part claims Adj(A−1)=(AdjA)−1. But we know Adj(A−1)=∣A−1∣A=∣A∣1A, and (AdjA)−1=∣A∣A (since AdjA=∣A∣A−1). These are equal, so the inequality is false. Hence (A) is not fully true.
-
Check option (B):
- Adj(KA)=Kn−1AdjA for an n×n matrix. Here n=3, so Adj(KA)=K2AdjA, not KAdjA. So the first part is false.
- The second part ∣KA∣=K3∣A∣ is true (since determinant scales by Kn). But because the first part is false, (B) is incorrect.
-
Check option (C):
- ∣B−1AB∣=∣B−1∣∣A∣∣B∣=∣B∣1∣A∣∣B∣=∣A∣ — this is true (similarity transformation preserves determinant).
- However, (A+B)2=A2+AB+BA+B2. For matrices, AB=BA in general, so (A+B)2=A2+2AB+B2 holds only if A and B commute. No such condition is given, so this is false. Hence (C) is not fully true.
-
Check option (D): …
-
- AP EAPCET 2024Set eng-2024-05-21-AN1 markMCQQ.Assertion (A): If B is a 3×3 matrix and ∣B∣=6, then ∣Adj(B)∣=36. Reason (R): If B is a square matrix of order n, then ∣Adj(B)∣=∣B∣n (A) Both (A) and (R) are true and (R) is the correct explanation of (A) (B) Both (A) and (R) are true but (R) is not the correct explanation of (A) (C) (A) is true but (R) is false (D) (A) is false but (R) is true
›Reveal solutionSolution
The correct identity is ∣Adj(B)∣=∣B∣n−1; this makes Assertion (A)'s numeric value (36) actually correct, but Reason (R) states the wrong general formula (∣B∣n), so (R) is false even though (A) is true.
Concept and Intuition
For an n×n invertible matrix B, the adjugate satisfies B⋅Adj(B)=∣B∣I. Taking determinants of both sides: ∣B∣⋅∣Adj(B)∣=∣B∣n (since det(∣B∣I)=∣B∣n for an n×n identity scaled by ∣B∣). Dividing by ∣B∣ (nonzero, since B is invertible as ∣B∣=6=0) gives ∣Adj(B)∣=∣B∣n−1.
Step-by-Step Solution
- Derive the correct formula: from B⋅Adj(B)=∣B∣In, take determinants: ∣B∣⋅∣Adj(B)∣=∣B∣n, so ∣Adj(B)∣=∣B∣n−1 (for invertible B).
- Apply to this problem: n=3, ∣B∣=6. Correct value: ∣Adj(B)∣=63−1=62=36.
- Assertion (A) claims ∣Adj(B)∣=36 — this numeric value is correct (matches the true formula's output), so (A) is true.
- Reason (R) states the general rule as ∣Adj(B)∣=∣B∣n — but the actual rule is ∣B∣n−1. As a general statement, (R) is false (if you actually used ∣B∣n here you'd wrongly get 63=216=36). …
- AP EAPCET 2024Set eng-2024-05-22-FN1 markMCQQ.If P and Q are two 3×3 matrices such that ∣PQ∣=1 and ∣P∣=9, then the determinant of adjoint of the matrix P⋅Adj3Q is (A) 94 (B) 941 (C) 92 (D) 921
›Reveal solutionSolution
Using ∣Q∣=1/∣P∣⋅∣PQ∣, the scaling property Adj(kA)=kn−1AdjA, and ∣AdjM∣=∣M∣n−1 for 3×3 matrices gives 94.
Concept and Intuition
For an n×n matrix, ∣kA∣=kn∣A∣, Adj(kA)=kn−1AdjA, and ∣AdjA∣=∣A∣n−1. Chaining these scaling rules for n=3 solves the problem without ever computing P or Q explicitly.
Step-by-Step Solution
- ∣PQ∣=∣P∣∣Q∣=1⇒∣Q∣=1/9 (since ∣P∣=9).
- Adj(3Q)=33−1AdjQ=9AdjQ.
- Let M=P⋅Adj(3Q)=9(P⋅AdjQ).
- ∣P⋅AdjQ∣=∣P∣⋅∣AdjQ∣=∣P∣⋅∣Q∣3−1=9⋅(91)2=819=91.
- ∣M∣=93⋅∣P⋅AdjQ∣=729⋅91=81=92. …
- AP EAPCET 2023Set eng-2023-05-18-FN1 markMCQQ.If A and B are non-singular matrices and det(AB)=(detA)(detB), then ((detA)(detB))B−1A−1= (A) Adj(BA) (B) Adj(A)+Adj(B) (C) Adj(AB) (D) (AdjB)(AdjA)
›Reveal solutionSolution
Using the identity det(M)M⁻¹ = Adj(M) with M = AB (noting (AB)⁻¹ = B⁻¹A⁻¹) gives the answer directly as Adj(AB).
Concept and Intuition
For any invertible square matrix M, the adjugate satisfies Adj(M) = det(M)·M⁻¹. This is a standard identity coming from M·Adj(M) = det(M)·I.
Step-by-Step Solution
- Recall (AB)⁻¹ = B⁻¹A⁻¹ (reverse order rule for inverses of a product).
- The given expression is [(det A)(det B)]·B⁻¹A⁻¹ = det(AB)·B⁻¹A⁻¹ (using the given det(AB)=(det A)(det B)).
- Rewrite B⁻¹A⁻¹ as (AB)⁻¹.
- So the expression equals det(AB)·(AB)⁻¹. …
- AP EAPCET 2022Set eng-2022-07-08-FN1 markMCQQ.If A=1−23−31223−1 then A2AdjA= (A) 21A (B) −42A (C) 7A−1 (D) 14(AdjA)
›Reveal solutionSolution
This tests the identity A⋅Adj(A)=(detA)I applied cleverly to reduce A2AdjA.
Concept and Intuition
Rather than computing AdjA explicitly (tedious for a 3×3), use the fundamental relation A⋅AdjA=(detA)I to convert one factor of A times AdjA directly into a scalar multiple of the identity, leaving a single A behind.
Step-by-Step Solution
- Compute detA for A=1−23−31223−1: detA=1(1⋅(−1)−3⋅2)−(−3)((−2)(−1)−3⋅3)+2((−2)(2)−1⋅3) =1(−7)+3(−7)+2(−7)=−7−21−14=−42. …
- AP EAPCET 2025Set eng-2025-05-26-AN1 markMCQQ.If B is the inverse of a third order matrix A and detB=k, then (adj(adjA))−1= (A) kB (B) k1B (C) kB−1 (D) B+kI
›Reveal solutionSolution
Using adj(adjA)=(detA)n−2A for n=3, together with detA=1/k, gives (adj(adjA))−1=kB.
Concept and Intuition
For an n×n invertible matrix, the double-adjugate identity is adj(adjA)=(detA)n−2A. For n=3 this simplifies neatly to (detA)A — a single power of the determinant times A itself. Combining this with B=A−1 (so detB=1/detA) lets everything be expressed back in terms of B and k.
Step-by-Step Solution
- B=A−1 and detB=k ⇒ detA=detB1=k1.
- For a 3×3 matrix: adj(adjA)=(detA)3−2A=(detA)A.
- Take the inverse of both sides:
(adj(adjA))−1=[(detA)A]−1=detA1A−1=detA1B
- Substitute detA1=k (from step 1): …
- AP EAPCET 2025Set eng-2025-05-22-AN1 markMCQQ.If A=112231356 and ∣adj(adjA)∣(adjA)−1=kA, then k= (A) 1296 (B) 216 (C) 36 (D) 432
›Reveal solutionSolution
Using the standard adjugate identities for a 3×3 matrix, k=∣A∣3; direct computation gives ∣A∣=6, so k=216 — option (B).
Concept and Intuition
The adjugate (classical adjoint) of an n×n matrix satisfies two workhorse identities: ∣adjA∣=∣A∣n−1, and (applying that twice) ∣adj(adjA)∣=∣A∣(n−1)2. Also, since A⋅adjA=∣A∣I, we get adjA=∣A∣A−1, i.e. (adjA)−1=∣A∣A. Combining these turns the whole expression into a scalar power of ∣A∣ times A — exactly the form kA the question wants.
Step-by-Step Solution
- For n=3: ∣adjA∣=∣A∣n−1=∣A∣2, so ∣adj(adjA)∣=∣adjA∣n−1=(∣A∣2)2=∣A∣4.
- (adjA)−1=∣A∣A (from AadjA=∣A∣I).
- So ∣adj(adjA)∣(adjA)−1=∣A∣4⋅∣A∣A=∣A∣3A. Comparing to kA: k=∣A∣3. …
- AP EAPCET 2021Set eng-2021-10-05-FN1 markMCQQ.If A=−122−21−2−2−21 then adj(A)=? (A) 2AT (B) AT (C) 3AT (D) 4AT
›Reveal solutionSolution
A's rows are mutually orthogonal with equal norm, so AAT=9I; combined with detA=27, this gives adj(A)=3AT directly, without computing all nine cofactors.
Concept and Intuition
For any invertible square matrix, adj(A)=det(A)A−1. If A happens to have orthogonal rows of equal length (a scaled orthogonal matrix), AAT collapses to a scalar multiple of I, instantly giving A−1 (and hence the adjugate) without a full cofactor expansion.
Step-by-Step Solution
- A=−122−21−2−2−21. Compute detA by cofactor expansion along row 1: detA=−1(1⋅1−(−2)(−2))−(−2)(2⋅1−(−2)⋅2)+(−2)(2(−2)−1⋅2) =−1(1−4)+2(2+4)−2(−4−2)=3+12+12=27. …
- AP EAPCET 2024Set eng-2024-05-21-FN1 markMCQQ.Let A be a 4×4 matrix and P be its adjoint matrix. If ∣P∣=2A, then ∣A−1∣= (A) ±41 (B) ±8 (C) ±2 (D) ±4
›Reveal solutionSolution
Using |adj(A)| = |A|^(n−1) for n=4 and |kA| = k^n|A|, the given equation reduces to |A|² = 1/16, so |A| = ±1/4 and |A⁻¹| = ±4.
Concept and Intuition
Two standard determinant identities are needed here:
- For an n×n matrix A, det(adjA)=(detA)n−1 (this follows from A⋅adj(A)=∣A∣I, taking determinants of both sides: ∣A∣⋅∣adjA∣=∣A∣n, so if ∣A∣=0, ∣adjA∣=∣A∣n−1).
- For a scalar k and n×n matrix A: det(kA)=kndet(A) (each of the n rows contributes a factor of k).
Step-by-Step Solution
- A is 4×4, so n=4. Given P=adj(A), we have ∣P∣=∣A∣4−1=∣A∣3.
- 2A=(21)4∣A∣=161∣A∣.
- Given ∣P∣=2A: ∣A∣3=161∣A∣.
- Since A−1 is asked for, A must be invertible, i.e. ∣A∣=0. Divide both sides by ∣A∣ (valid since ∣A∣=0): ∣A∣2=161.
- So ∣A∣=±41. …
- AP EAPCET 2026Set eng-2026-05-18-FN1 markMCQQ.If A=2−31−31−21−23, then Adj(A)= (A) 1−75−75−15−17 (B) 17−5751−517 (C) −17575151−7 (D) −17−57−51−51−7
›Reveal solutionSolution
A is symmetric, so its adjoint equals its cofactor matrix; computing the cofactors gives −17575151−7.
Setup. Adj(A) is the transpose of the cofactor matrix. Here
A=2−31−31−21−23
is symmetric, so the adjoint is also symmetric.
Cofactors.
C11=1−2−23=3−4=−1,C12=−−31−23=−(−9+2)=7,C13=−311−2=6−1=5,
C22=2113=6−1=5,C23=−21−3−2=−(−4+3)=1,C33=2−3−31=2−9=−7. …
🎓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.