JEE Mains Maths · Matrices

Adjoint, Inverse & Determinant Identities

The identity toolkit that turns adjoint, inverse and determinant questions into one-line exponent arithmetic — det(AB)=det A·det B, |adj A|=|A|ⁿ⁻¹, adj(adj A)=|A|ⁿ⁻² A, and A⁻¹=adj A/|A|.

Why this matters

Twenty-five PYQs, and JEE Mains repeats this cluster almost every session. Very few of them ask you to actually compute an adjoint or an inverse entry-by-entry — the paper rewards students who KNOW the identities cold and finish in three lines of exponent arithmetic. The heaviest hitter is the adjoint-of-adjoint family: for a 3×3 matrix, adj(adj A)=|A|·A and |adj(adj A)|=|A|⁴, and getting the order n and the power right is the whole question. The rest split between the Cayley–Hamilton route to a 2×2 inverse (A⁻¹=αA+βI), invertibility conditions (det≠0), and a few counting/special-inverse twists. Seven concepts cover every one.

Concept 1 of 7

Determinant of products, transposes and scalar multiples

Intuition

The determinant is multiplicative: it splits across products, ignores transpose, and pulls a scalar out as knk^n. These three facts collapse a fearsome-looking product like ATC2AA^TC^2A into a product of numbers.

Definition

For n×nn\times n matrices:

  • Product: det(AB)=detAdetB\det(AB) = \det A\,\det B
  • Transpose: det(AT)=detA\det(A^T) = \det A
  • Scalar: det(kA)=kndetA\det(kA) = k^n\det A (the order nn is the exponent)
  • Power: det(Am)=(detA)m\det(A^m) = (\det A)^m, and det(A1)=1/detA\det(A^{-1}) = 1/\det A

Determinant identities

det(AB)=detAdetB,det(AT)=detA,det(kA)=kndetA\det(AB)=\det A\,\det B,\quad \det(A^T)=\det A,\quad \det(kA)=k^{\,n}\det A

Worked example

Let A,BA,B be 3×33\times3 matrices with A=2|A| = 2 and B=5|B| = 5. Find 2ATB|2A^TB|.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 1MatricesMODERATE
If A=[2112],B=[1011],C=ABATA =\begin{bmatrix} \sqrt{2} & 1 \\ - 1 & \sqrt{2} \end{bmatrix},B =\begin{bmatrix} 1 & 0 \\ 1 & 1 \end{bmatrix},C =ABA^{T} and XX =ATC2 A=A^{T}C^{2}\text{ }A, then detXdetX is equal to:

[Q63 · 1 February 2024 · 2024]

det(kA)=kndetA\det(kA) = k^{\,n}\det A, NOT kdetAk\det A

Every scalar multiple of an n×nn\times n matrix multiplies the determinant by knk^n — one factor of kk per row. For a 3×33\times3 matrix, 2A=8A|2A| = 8|A|, not 2A2|A|. Forgetting the power nn is the single most common determinant slip.

Concept 2 of 7

Adjoint identities: A·adj A = |A|I and |adj A| = |A|ⁿ⁻¹

Intuition

You almost never compute an adjoint on JEE Mains. Instead you use its two defining facts: multiplying AA by its adjoint gives AI|A|I, and the determinant of the adjoint is a single power of A|A|. Those two identities close most 'adjoint' questions in one line.

Definition

For an n×nn\times n matrix:

  • Defining identity: A(adjA)=(adjA)A=AInA(\operatorname{adj}A) = (\operatorname{adj}A)A = |A|\,I_n
  • Determinant: adjA=An1|\operatorname{adj}A| = |A|^{\,n-1}
  • Scalar: adj(kA)=kn1adjA\operatorname{adj}(kA) = k^{\,n-1}\operatorname{adj}A
  • 2×2 shortcut: adj(abcd)=(dbca)\operatorname{adj}\begin{pmatrix}a&b\\c&d\end{pmatrix} = \begin{pmatrix}d&-b\\-c&a\end{pmatrix} (swap the diagonal, negate the off-diagonal)

Adjoint identities

A(adjA)=AIn,adjA=An1,adj(kA)=kn1adjAA(\operatorname{adj}A) = |A|\,I_n, \qquad |\operatorname{adj}A| = |A|^{\,n-1}, \qquad \operatorname{adj}(kA) = k^{\,n-1}\operatorname{adj}A

Worked example

For a 3×33\times3 matrix AA with A=4|A| = 4, find adjA|\operatorname{adj}A|, and state A(adjA)A(\operatorname{adj}A).
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 2MatricesMODERATE
Let S={n:1n50\mathbf{S = \{}\sqrt{n}:1 \leq n \leq 50 and nn is odd }\} Let aSa \in S and A=[10a110a01]A =\begin{bmatrix} 1 & 0 & a \\ - 1 & 1 & 0 \\ - a & 0 & 1 \end{bmatrix} If aSdet(adjA)=100λ\sum_{a \in S} det(adjA) = 100\lambda, then λ\lambda is equal to

[Q69 · 14 June 2022 · 2022]

adjA=An1|\operatorname{adj}A| = |A|^{\,n-1} — the exponent is n1n-1, NOT nn

For a 3×33\times3 matrix, adjA=A2|\operatorname{adj}A| = |A|^2, not A3|A|^3 and not A|A|. Students who write A3|A|^3 (over-counting) or A|A| (dropping the power) walk into the two standard distractors.

adj(kA)=kn1adjA\operatorname{adj}(kA) = k^{\,n-1}\operatorname{adj}A — note n1n-1, not nn

The adjoint scales by kn1k^{n-1}, one power LESS than the determinant's knk^n. For a 3×33\times3, adj(2A)=4adjA\operatorname{adj}(2A) = 4\operatorname{adj}A, not 8adjA8\operatorname{adj}A. Mixing up which one loses the power of nn is the trap.

Concept 3 of 7

Adjoint of the adjoint

Intuition

This is the most-tested identity in the whole subtopic. The double adjoint gives back AA scaled by a power of its determinant, and its determinant is a single high power of A|A|. For a 3×33\times3 matrix the numbers are clean: adj(adjA)=AA\operatorname{adj}(\operatorname{adj}A) = |A|\,A and adj(adjA)=A4|\operatorname{adj}(\operatorname{adj}A)| = |A|^4.

Definition

For an n×nn\times n non-singular matrix:

  • Double adjoint: adj(adjA)=An2A\operatorname{adj}(\operatorname{adj}A) = |A|^{\,n-2}A
  • Its determinant: adj(adjA)=A(n1)2|\operatorname{adj}(\operatorname{adj}A)| = |A|^{\,(n-1)^2}

For n=3n = 3: adj(adjA)=AA\operatorname{adj}(\operatorname{adj}A) = |A|\,A and adj(adjA)=A4|\operatorname{adj}(\operatorname{adj}A)| = |A|^{4}. For n=2n = 2: adj(adjA)=A\operatorname{adj}(\operatorname{adj}A) = A.

Double adjoint

adj(adjA)=An2A,adj(adjA)=A(n1)2\operatorname{adj}(\operatorname{adj}A) = |A|^{\,n-2}A, \qquad |\operatorname{adj}(\operatorname{adj}A)| = |A|^{\,(n-1)^2}

Worked example

For a 3×33\times3 matrix AA with A=3|A| = 3, find adj(adjA)\operatorname{adj}(\operatorname{adj}A) and adj(adjA)|\operatorname{adj}(\operatorname{adj}A)|.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 3MatricesMODERATE
For a 3×33 \times 3 matrix M , let trace (M)(M) denote the sum of all the diagonal elements of M . Let A be a 3×33 \times 3 matrix such that A=12|A| =\frac{1}{2} and trace (A)=3(A) = 3. If B=adj(adj(2A))B = adj(adj(2A)), then the value of B+trace(B)|B| + trace(B) equals:

[Q129 · 22 Jan 2025 · 2025]

adj(adjA)=An2A\operatorname{adj}(\operatorname{adj}A) = |A|^{\,n-2}A: for 3×33\times3 it's AA|A|\cdot A, for 2×22\times2 it's just AA

The power on A|A| is n2n-2. For n=3n = 3 that is A1|A|^1, so adj(adjA)=AA\operatorname{adj}(\operatorname{adj}A) = |A|A; for n=2n = 2 it is A0=1|A|^0 = 1, so adj(adjA)=A\operatorname{adj}(\operatorname{adj}A) = A. Writing AA|A|A for a 2×22\times2 is a classic over-application.

adj(adjA)=A4|\operatorname{adj}(\operatorname{adj}A)| = |A|^{4} for 3×33\times3, NOT A2|A|^2

The determinant of the double adjoint carries the exponent (n1)2(n-1)^2. For a 3×33\times3 that is (31)2=4(3-1)^2 = 4, giving A4|A|^4. It is easy to stop at A2|A|^2 (the single-adjoint power) or at An2=A|A|^{n-2}=|A| (the matrix power) — both are wrong for the determinant.

Concept 4 of 7

Inverse from the adjoint and PQ = kI

Intuition

The inverse is the adjoint divided by the determinant. Two common disguises: AB=IAB = I means B=A1B = A^{-1}, and PQ=kIPQ = kI means Q=kP1Q = kP^{-1} — from which the determinant Q=kn/P|Q| = k^n/|P| drops out immediately.

Definition

A1=adjAAA^{-1} = \dfrac{\operatorname{adj}A}{|A|}, defined iff A0|A| \neq 0. Consequences used in PYQs:

  • From a product = I: AB=IB=A1AB = I \Rightarrow B = A^{-1}, so B=1/A|B| = 1/|A|
  • **From PQ=kInPQ = kI_n:** Q=kP1Q = kP^{-1}, so Q=knP|Q| = \dfrac{k^{\,n}}{|P|}
  • Adjoint from inverse: adjA=AA1\operatorname{adj}A = |A|\,A^{-1} (rearranging the defining identity)

Inverse and PQ = kI

A1=adjAA (A0),PQ=kInQ=kP1,  Q=knPA^{-1} = \frac{\operatorname{adj}A}{|A|}\ (|A|\neq0), \qquad PQ = kI_n \Rightarrow Q = kP^{-1},\ \ |Q| = \frac{k^{\,n}}{|P|}

Worked example

Let PP be a 3×33\times3 matrix with P=4|P| = 4, and let QQ satisfy PQ=2I3PQ = 2I_3. Find Q|Q|.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 4MatricesMODERATE
Let P=[31220α350]P=\begin{bmatrix} 3 & - 1 & - 2 \\ 2 & 0 & \alpha \\ 3 & - 5 & 0 \end{bmatrix}, where αR\alpha\in R. Suppose Q=[qij]Q=\left\lbrack q_{ij} \right\rbrack is a matrix satisfying PQ=kI3PQ=kI_{3} for some non-zero kRk\in R. If q23=k8q_{23}= -\frac{k}{8} and Q=k22|Q| =\frac{k^{2}}{2}, then α2+k2\alpha^{2}+k^{2} is equal to

[Q81 · Paper 1 · 2021]

PQ=kInQ=kn/PPQ = kI_n \Rightarrow |Q| = k^{\,n}/|P| — the knk^n, not kk

From Q=kP1Q = kP^{-1}, taking determinants pulls the scalar out as knk^n (order nn), so Q=knP1=kn/P|Q| = k^n|P^{-1}| = k^n/|P|. For a 3×33\times3, that is k3/Pk^3/|P|. Writing k/Pk/|P| forgets the knk^n rule and is the intended distractor.

Concept 5 of 7

Inverse via Cayley–Hamilton (A⁻¹ = αA + βI)

Intuition

Every 2×22\times2 matrix satisfies its own characteristic equation A2(trA)A+(detA)I=OA^2 - (\operatorname{tr}A)A + (\det A)I = O. Multiply through by A1A^{-1} and the inverse becomes a linear combination of AA and II — no adjoint needed. The same trick handles a nilpotent XX (X3=OX^3 = O) via the finite series for (αI+βX+γX2)1(\alpha I + \beta X + \gamma X^2)^{-1}.

Definition

2×2 Cayley–Hamilton: A2(trA)A+(detA)I=OA^2 - (\operatorname{tr}A)A + (\det A)I = O. Multiplying by A1A^{-1}:

A1=(trA)IAdetAA^{-1} = \frac{(\operatorname{tr}A)\,I - A}{\det A}
so in the form A1=αA+βIA^{-1} = \alpha A + \beta I, α=1detA\alpha = -\dfrac{1}{\det A} and β=trAdetA\beta = \dfrac{\operatorname{tr}A}{\det A}. Nilpotent case: if X3=OX^3 = O then Y=αI+βX+γX2Y = \alpha I + \beta X + \gamma X^2 has Y1=1α(IβαX+(β2α2γα)X2)Y^{-1} = \tfrac{1}{\alpha}\big(I - \tfrac{\beta}{\alpha}X + (\tfrac{\beta^2}{\alpha^2}-\tfrac{\gamma}{\alpha})X^2\big) — a terminating series because powers 3\ge 3 vanish.

2×2 inverse from Cayley–Hamilton

A2(trA)A+(detA)I=O  A1=(trA)IAdetAA^{2} - (\operatorname{tr}A)A + (\det A)I = O \ \Rightarrow\ A^{-1} = \frac{(\operatorname{tr}A)I - A}{\det A}

Worked example

For A=(2314)A = \begin{pmatrix}2 & 3\\1 & 4\end{pmatrix}, write A1=αA+βIA^{-1} = \alpha A + \beta I and find α,β\alpha,\beta.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 5MatricesMODERATE
If A=[1214]A1=αI+βAA=\begin{bmatrix} 1 & 2 \\ - 1 & 4 \end{bmatrix}A^{- 1}=\alpha I+\beta A, find 5(αβ)=5(\alpha-\beta) = ?

[Q56 · 2021 Compilation Paper 16 · 2021]

Divide by detA\det A — Cayley–Hamilton gives A1A^{-1}, not adjA\operatorname{adj}A

After multiplying A2(trA)A+(detA)I=OA^2 - (\operatorname{tr}A)A + (\det A)I = O by A1A^{-1}, you get (detA)A1=(trA)IA(\det A)A^{-1} = (\operatorname{tr}A)I - A. You MUST divide by detA\det A to isolate A1A^{-1}; stopping at (trA)IA(\operatorname{tr}A)I - A gives adjA\operatorname{adj}A (unnormalised), off by a factor of detA\det A.

Concept 6 of 7

When is a matrix invertible? (det ≠ 0)

Intuition

A square matrix is invertible exactly when its determinant is non-zero. That single test answers 'for which tt…', 'does the system have a unique solution', and 'is AλIA - \lambda I invertible'. And once AB=IAB = I for square A,BA,B, the inverse is two-sided: BA=IBA = I as well.

Definition

An n×nn\times n matrix AA is invertible (non-singular)     A0\iff |A| \neq 0.

  • Linear system: Ax=bAx = b has a unique solution     A0\iff |A| \neq 0.
  • Two-sided inverse: for square A,BA,B, AB=IBA=IAB = I \Rightarrow BA = I (a one-sided inverse is automatically two-sided in finite dimension).
  • Deducing a determinant from an invertible factor: if MN=OMN = O and NN is invertible, then M=OM = O (multiply by N1N^{-1}); hence M=0|M| = 0.

Invertibility test

A1 exists    A0andAB=IBA=I (square matrices)A^{-1}\text{ exists} \iff |A| \neq 0 \qquad\text{and}\qquad AB = I \Rightarrow BA = I \ \text{(square matrices)}

Worked example

For which real tt is M=(t14t)M = \begin{pmatrix}t & 1\\4 & t\end{pmatrix} invertible?
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 6MatricesMODERATE
Let AA and BB be two 3×33 \times 3 real matrices such that (A2B2)\left( A^{2}-B^{2} \right) is invertible matrix. If A5=B5A^{5}=B^{5} and A3B2=A2B3A^{3}B^{2}=A^{2}B^{3}, then the value of the determinant of the matrix A3+B3A^{3}+B^{3} is equal to:

[Q79 · Paper 17 · 2021]

MN=OMN = O with NN invertible forces M=OM = O (so M=0|M| = 0)

If a product is the zero matrix and one factor is invertible, the OTHER factor must be zero — multiply MN=OMN = O on the right by N1N^{-1}. Questions like 'A2B2A^2 - B^2 invertible, find det(A3+B3)\det(A^3 + B^3)' collapse to A3+B3=OA^3 + B^3 = O, so the determinant is 00. Don't try to compute entries.

Concept 7 of 7

Special inverses, counting, and the reversal law

Intuition

A grab-bag of inverse twists: the reversal law flips the order of a product's inverse, involutory matrices satisfy A=A1A = A^{-1} (i.e. A2=IA^2 = I) so counting them means counting A2=IA^2 = I, and for a 2×22\times2 the determinant of A+IA + I has a neat trace formula.

Definition

  • Reversal law: (AB)1=B1A1(AB)^{-1} = B^{-1}A^{-1} and adj(AB)=adjBadjA\operatorname{adj}(AB) = \operatorname{adj}B\,\operatorname{adj}A; with adjM=MM1\operatorname{adj}M = |M|M^{-1}, expressions like A(adjA1+adjB1)1BA(\operatorname{adj}A^{-1} + \operatorname{adj}B^{-1})^{-1}B simplify to a multiple of adjA+adjB\operatorname{adj}A + \operatorname{adj}B.
  • Involutory / self-inverse: A=A1    A2=IA = A^{-1} \iff A^2 = I; counting such matrices means counting solutions of A2=IA^2 = I.
  • 2×2 determinant shift: det(A+I)=detA+trA+1\det(A + I) = \det A + \operatorname{tr}A + 1 (and det(adjA+I)=detA+trA+1\det(\operatorname{adj}A + I) = \det A + \operatorname{tr}A + 1 too, since tr(adjA)=trA\operatorname{tr}(\operatorname{adj}A) = \operatorname{tr}A).

Reversal law and self-inverse

(AB)1=B1A1,A=A1    A2=I,det(A+I)=detA+trA+1 (2×2)(AB)^{-1} = B^{-1}A^{-1}, \qquad A = A^{-1} \iff A^{2} = I, \qquad \det(A + I) = \det A + \operatorname{tr}A + 1\ (2\times2)

Worked example

Let AA be a 2×22\times2 matrix with detA=1\det A = -1. Simplify det((A+I)(adjA+I))\det\big((A + I)(\operatorname{adj}A + I)\big) in terms of trA\operatorname{tr}A.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 7MatricesMODERATE
The number of matrices A=[abcd]A =\begin{bmatrix} a & b \\ c & d \end{bmatrix}, where a, b,c,d {1,0,1,2,3,,10}\mathbf{\in \{ - 1,0,1,2,3,\ldots\ldots,10\}}, such that A=A1A =A^{- 1}, is

[Q180 · 26 July 2022 · 2022]

A=A1A = A^{-1} means A2=IA^2 = I, NOT A=IA = I

Self-inverse (involutory) matrices are far more than just the identity — any matrix with A2=IA^2 = I qualifies, including I-I, reflections, and many trace-zero 2×22\times2 matrices. A counting question 'A=A1A = A^{-1}' asks for ALL solutions of A2=IA^2 = I, which can number in the dozens.

det(A+I)=detA+trA+1\det(A + I) = \det A + \operatorname{tr}A + 1 for 2×22\times2, NOT detA+1\det A + 1

Adding II to a 2×22\times2 shifts the determinant by trA+1\operatorname{tr}A + 1, not just 11 — the trace term is easy to drop. This is the crux of the (A+I)(adjA+I)(A + I)(\operatorname{adj}A + I) family of questions.

Summary — formulas & gotchas at a glance

A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.

Formulas (7)

  • Determinant of products, transposes and scalar multiples

    Determinant identities

    det(AB)=detAdetB,det(AT)=detA,det(kA)=kndetA\det(AB)=\det A\,\det B,\quad \det(A^T)=\det A,\quad \det(kA)=k^{\,n}\det A
  • Adjoint identities: A·adj A = |A|I and |adj A| = |A|ⁿ⁻¹

    Adjoint identities

    A(adjA)=AIn,adjA=An1,adj(kA)=kn1adjAA(\operatorname{adj}A) = |A|\,I_n, \qquad |\operatorname{adj}A| = |A|^{\,n-1}, \qquad \operatorname{adj}(kA) = k^{\,n-1}\operatorname{adj}A
  • Adjoint of the adjoint

    Double adjoint

    adj(adjA)=An2A,adj(adjA)=A(n1)2\operatorname{adj}(\operatorname{adj}A) = |A|^{\,n-2}A, \qquad |\operatorname{adj}(\operatorname{adj}A)| = |A|^{\,(n-1)^2}
  • Inverse from the adjoint and PQ = kI

    Inverse and PQ = kI

    A1=adjAA (A0),PQ=kInQ=kP1,  Q=knPA^{-1} = \frac{\operatorname{adj}A}{|A|}\ (|A|\neq0), \qquad PQ = kI_n \Rightarrow Q = kP^{-1},\ \ |Q| = \frac{k^{\,n}}{|P|}
  • Inverse via Cayley–Hamilton (A⁻¹ = αA + βI)

    2×2 inverse from Cayley–Hamilton

    A2(trA)A+(detA)I=O  A1=(trA)IAdetAA^{2} - (\operatorname{tr}A)A + (\det A)I = O \ \Rightarrow\ A^{-1} = \frac{(\operatorname{tr}A)I - A}{\det A}
  • When is a matrix invertible? (det ≠ 0)

    Invertibility test

    A1 exists    A0andAB=IBA=I (square matrices)A^{-1}\text{ exists} \iff |A| \neq 0 \qquad\text{and}\qquad AB = I \Rightarrow BA = I \ \text{(square matrices)}
  • Special inverses, counting, and the reversal law

    Reversal law and self-inverse

    (AB)1=B1A1,A=A1    A2=I,det(A+I)=detA+trA+1 (2×2)(AB)^{-1} = B^{-1}A^{-1}, \qquad A = A^{-1} \iff A^{2} = I, \qquad \det(A + I) = \det A + \operatorname{tr}A + 1\ (2\times2)

Watch out for (10)

Drill every past-year question on this subtopic

25 questions from the bank — paginated, with cart and Word-export support.

Related notes