Q.If A=2−13023035, then find A(adj 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: Eigenvalue Properties
For any square matrix A, the product A(adj A)=(detA)I. So we only need detA.
Step 1 – Compute detA by expanding along the first row (since it has two zeros):
detA=2⋅2335−0+0=2(2⋅5−3⋅3)=2(10−9)=2.
Step 2 – Therefore, …
For any square matrix A, the product A(adj A)=(detA)I. Here detA=2, so A(adj A)=2I=200020002.
The key idea is not to compute the adjoint explicitly — that would be tedious and error-prone. Instead, we use a fundamental property of square matrices: the product of a matrix and its adjoint equals the determinant times the identity matrix. This is one of the most elegant shortcuts in linear algebra.
For any n×n matrix A,
A(adj A)=(adj A)A=(detA)In
This works because each entry of adj A is a cofactor, and the dot product of a row of A with the corresponding column of cofactors gives detA, while a dot product with a different row's cofactors gives zero (by the property of determinants with repeated rows).
So the entire problem reduces to one number: the determinant of A.
- Compute detA. The matrix is 3×3, and the first row has two zeros — perfect for expansion along the first row:
detA=2⋅det[2335]−0+0=2(2⋅5−3⋅3)=2(10−9)=2
When a row or column has many zeros, expand along it. Here the first row gives the determinant in one step.
- Apply the property. …
Method: Using A(adj A) = |A| I to Avoid Computing the Adjoint Directly
This method solves "find A(adj A)" questions without ever building the adjoint matrix explicitly — the standard CBSE route, needed even when a question's underlying theme brushes against advanced linear-algebra ideas like eigenvalues, which sit outside the Class 12 Determinants syllabus.
Steps
Step 1: Recall the identity that bypasses the adjoint
For any square matrix A of order n,
A⋅adj(A)=∣A∣In.
This means the answer is always a scalar multiple of the identity matrix — you never need the individual cofactor entries.
Step 2: Compute only |A|, using cofactor expansion along the row/column with the most zeros …
Common Mistakes
Mistake 1: Computing the full adjoint matrix instead of using the shortcut
Why it's wrong: finding all 9 cofactors of the 3×3 matrix, transposing them, and then multiplying by A is slow and invites sign errors in the cofactors — when the question only needs detA. Correct approach: use A(adj A)=(detA)In directly and compute only detA.
Mistake 2: Picking a row/column to expand along that has no zeros
Why it's wrong: expanding detA along the second or third row (which have no zero entries) forces three separate 2×2 cofactor computations instead of one, multiplying the chance of an arithmetic slip. Correct approach: always expand along the row or column with the most zeros — here the first row, [2,0,0], collapses the expansion to a single term. …
Showing the 12 most recent of 31 on this concept.
- CBSE 2026Set 65/3/11 markMCQQ.If B(adj B)=310003100031, then the value of det(B−1) is: (A) 31 (B) 91 (C) 3 (D) 9
›Reveal solutionSolution
By recognizing the given matrix product B(adj B) as (detB)I, we find detB=31. Then, using the property det(B−1)=detB1, we calculate det(B−1)=3.
The problem asks for the determinant of the inverse of matrix B, given a relationship involving B and its adjoint. To solve this, we need to recall two fundamental properties of matrices and their determinants.
The first key idea is the relationship between a square matrix A, its adjoint adj A, and its determinant detA. This relationship is a cornerstone of matrix theory and is often used to define the inverse of a matrix. It states that the product of a matrix and its adjoint is equal to the determinant of the matrix multiplied by the identity matrix.
The second key idea is how the determinant of an inverse matrix relates to the determinant of the original matrix. If a matrix A is invertible, then the determinant of its inverse, A−1, is simply the reciprocal of the determinant of A.
Let's apply these concepts step-by-step.
-
Identify the fundamental matrix property.
We are given the equation B(adj B)=310003100031.
The crucial property connecting a square matrix A with its adjoint is:
A(adj A)=(detA)I
where I is the identity matrix of the same order as A.
From the given 3×3 matrix on the right-hand side, we can infer that B is a 3×3 matrix. Thus, I is the 3×3 identity matrix:
I=100010001.
-
Determine det(B) from the given equation.
Let's rewrite the given right-hand side in terms of the identity matrix:
310003100031=31100010001=31I.
Now, substitute this back into the original equation:
B(adj B)=31I. …
-
- CBSE 2026Set V11 markMCQQ.For the matrix A=(5005) the value of ∣adj A∣(a) 25(b) 5(c) 0(d) 1
›Reveal solutionSolution
∣adjA∣=∣A∣n−1=∣A∣ for a 2×2 matrix, and ∣A∣=25; answer (a).
A=(5005)⇒∣A∣=5⋅5−0=25. …
- CBSE 2026Set A1 markMCQQ.If A=[3−1−52] then adjA=(a) [2153](b) [2135](c) [1235](d) none of these
›Reveal solutionSolution
For a 2×2 matrix [acbd], adj=[d−c−ba].
Given A=[3−1−52], apply the rule (swap a,d; negate b,c): …
- CBSE 2025Set 65/1/11 markMCQQ.If A is a square matrix of order 2 such that det(A)=4, then det(4 adj A) is equal to : (A) 16 (B) 64 (C) 256 (D) 512
›Reveal solutionSolution
The key idea is to use the property det(adj A)=(detA)n−1 for an n×n matrix, then combine with the scalar multiplication rule det(kB)=kndetB. For a 2×2 matrix with detA=4, we get det(4 adj A)=42⋅42−1=16⋅4=64. The answer is (B).
The problem asks for det(4 adj A) given that A is a 2×2 matrix with detA=4. This is a classic exam question that tests two fundamental determinant properties together: how the determinant behaves when you multiply a matrix by a scalar, and the relationship between a matrix and its adjoint.
Let’s unpack the intuition first. The adjoint (or adjugate) of a matrix is the transpose of its cofactor matrix. For a 2×2 matrix, the adjoint has a simple form: if A=(acbd), then adj A=(d−c−ba). Notice that det(adj A)=ad−bc=detA. That’s not a coincidence — it’s a special case of a general rule.
For any n×n matrix A, det(adj A)=(detA)n−1.
For n=2, this gives det(adj A)=(detA)1=detA. So here, det(adj A)=4.
Now we need det(4 adj A). The scalar multiplication rule says: if you multiply an n×n matrix by a scalar k, the determinant gets multiplied by kn. Why? Because each of the n rows gets a factor of k, and pulling out k from each row gives kn times the original determinant.
Watch outA common mistake is to forget the exponent n and write det(kB)=kdetB. That’s only true for a 1×1 matrix. For a 2×2 matrix, it’s k2.
So here n=2 and k=4, so det(4 adj A)=42⋅det(adj A)=16⋅4=64.
Let’s walk through it step by step. …
- CBSE 2025Set X11 markMCQQ.Let A be a nonsingular matrix of order 3×3, then ∣adjA∣ is equal to(a) ∣A∣(b) 3∣A∣(c) ∣A∣3(d) ∣A∣2
›Reveal solutionSolution
Determinant of the adjoint of a 3×3 matrix — correct option is (d). …
- CBSE 2025Set E1 markMCQQ.Adjoint matrix of matrix [2534]=(a) [4−3−52](b) [4−5−32](c) [4352](d) [4532]
›Reveal solutionSolution
For a 2×2 matrix [acbd], adj=[d−c−ba].
For A=[2534], the adjoint is the transpose of the cofactor matrix. For a 2×2 this reduces to interchanging the leading-diagonal entries and changing the sign of the off- …
- CBSE 2025Set A1 markQ.If A=[1324], then write the value of ∣adj(A)∣.
›Reveal solutionSolution
For an n×n matrix, ∣adj(A)∣=∣A∣n−1; here n=2 so ∣adj(A)∣=∣A∣.
First compute ∣A∣ for A=[1324]:
∣A∣=1(4)−2(3)=4−6=−2
For a square matrix of order n, the standard identity is ∣adj(A)∣=∣A∣n−1. Here n=2, so:
∣adj(A)∣=∣A∣2−1=∣A∣=−2
…
- CBSE 2025Set ANNUAL1 markMCQQ.Let A be a nonsingular square matrix of order 3×3. Then ∣adj A∣ is equal to -(a) ∣A∣2(b) ∣A∣3(c) ∣A∣(d) 2∣A∣
›Reveal solutionSolution
For an n×n nonsingular matrix, ∣adjA∣=∣A∣n−1.
This follows from the identity A⋅(adjA)=∣A∣In, which on taking determinants gives ∣A∣⋅∣adjA∣=∣A∣n, so ∣adjA∣=∣A∣n−1 (valid since A is nonsingula …
- CBSE 2025Set ANNUAL1 markMCQQ.If A is a square matrix of order 2×2 and |A| = 5, then |Adj.(A)| is:(a) 25(b) 125(c) 5(d) 10
›Reveal solutionSolution
Use the identity ∣adj(A)∣=∣A∣n−1 for an n×n matrix.
For a square matrix A of order n, ∣adj(A)∣=∣A∣n−1.
…
- CBSE 2024Set 65/3/11 markMCQQ.Let A=(acbd) be a square matrix such that adjA=A. Then (a+b+c+d) is equal to: (A) 2a (B) 2b (C) 2c (D) 0
›Reveal solutionSolution
When the adjugate of a 2×2 matrix equals the matrix itself, the trace constraint forces a+d=1, and the off-diagonal symmetry gives b=c; together these yield a+b+c+d=1+2b=2a+2b−1, but the determinant condition ad−bc=1 combined with adjA=A ultimately forces a+b+c+d=1, which matches none of the options directly until we recognize the answer is (D) 0 when the special case a=d=21,b=c=0 is considered, or more generally the problem expects d=1−a and b=c=0.
The adjugate (or adjoint) of a matrix encodes how the matrix transforms cofactors. For a 2×2 matrix A=(acbd), the adjugate is constructed by swapping the diagonal entries, negating the off-diagonal ones, and transposing (though for 2×2 the transpose is automatic):
adjA=(d−c−ba).
The condition adjA=A means the matrix is its own adjugate, a rare and highly constrained situation. This forces four simultaneous equations that interlock the entries.
Setting up the equations
- Equate corresponding entries. From adjA=A:
(d−c−ba)=(acbd).
This gives:
- d=a
- −b=b⟹2b=0⟹b=0
- −c=c⟹2c=0⟹c=0
- a=d (redundant with the first equation).
- Interpret the constraints. We have a=d and b=c=0. So the matrix simplifies to:
A=(a00a)=aI,
a scalar multiple of the identity.
- Check the adjugate relation. …
- CBSE 2024Set ANNUAL1 markMCQQ.Let A be a non-singular 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 the standard result ∣Adj A∣=∣A∣n−1 for an n×n non-singular matrix.
For a non-singular square matrix A of order n×n, the determinant of its adjoint satisfies:
∣Adj A∣=∣A∣n−1 …
- CBSE 2024Set D1 markMCQQ.If A=[3−1−52] then adjoint A=(a) [2153](b) [2135](c) [1235](d) [2513]
›Reveal solutionSolution
adjA swaps the main-diagonal entries and negates the off-diagonal ones.
For A=[acbd], the adjoint is adjA=[d−c−ba].
Here a=3, b=−5, c=−1, d=2, so …
🎓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.