PYQ Vault

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

Thirty-seven 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

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)=det⁡A det⁡B\det(AB) = \det A\,\det B
  • Transpose: det⁡(AT)=det⁡A\det(A^T) = \det A
  • Scalar: det⁡(kA)=kndet⁡A\det(kA) = k^n\det A (the order nn is the exponent)
  • Power: det⁡(Am)=(det⁡A)m\det(A^m) = (\det A)^m, and det⁡(A−1)=1/det⁡A\det(A^{-1}) = 1/\det A

Determinant identities

det⁡(AB)=det⁡A det⁡B,det⁡(AT)=det⁡A,det⁡(kA)=k ndet⁡A\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

The same idea in a real exam question:

JEE Mains · 2024 · 1 February 2024 · Q63Moderate

Example 1 · Matrices · Adjoint, Inverse and Determinant Identities

If A=[21−12],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:

det⁡(kA)=k ndet⁡A\det(kA) = k^{\,n}\det A, NOT kdet⁡Ak\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∣=8∣A∣|2A| = 8|A|, not 2∣A∣2|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|ⁿ⁻¹

You almost never compute an adjoint on JEE Mains. Instead you use its two defining facts: multiplying AA by its adjoint gives ∣A∣I|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(adj⁡A)=(adj⁡A)A=∣A∣ InA(\operatorname{adj}A) = (\operatorname{adj}A)A = |A|\,I_n
  • Determinant: ∣adj⁡A∣=∣A∣ n−1|\operatorname{adj}A| = |A|^{\,n-1}
  • Scalar: adj⁡(kA)=k n−1adj⁡A\operatorname{adj}(kA) = k^{\,n-1}\operatorname{adj}A
  • 2×2 shortcut: adj⁡(abcd)=(d−b−ca)\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(adj⁡A)=∣A∣ In,∣adj⁡A∣=∣A∣ n−1,adj⁡(kA)=k n−1adj⁡AA(\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 ∣adj⁡A∣|\operatorname{adj}A|, and state A(adj⁡A)A(\operatorname{adj}A).
Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

JEE Mains · 2022 · 14 June 2022 · Q69Moderate

Example 2 · Matrices · Adjoint, Inverse and Determinant Identities

Let S={n:1≤n≤50\mathbf{S = \{}\sqrt{n}:1 \leq n \leq 50 and nn is odd }\} Let a∈Sa \in S and A=[10a−110−a01]A =\begin{bmatrix} 1 & 0 & a \\ - 1 & 1 & 0 \\ - a & 0 & 1 \end{bmatrix} If ∑a∈Sdet(adjA)=100λ\sum_{a \in S} det(adjA) = 100\lambda, then λ\lambda is equal to

∣adj⁡A∣=∣A∣ n−1|\operatorname{adj}A| = |A|^{\,n-1} — the exponent is n−1n-1, NOT nn

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

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

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

Concept 3 of 7: Adjoint of the adjoint

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⁡(adj⁡A)=∣A∣ A\operatorname{adj}(\operatorname{adj}A) = |A|\,A and ∣adj⁡(adj⁡A)∣=∣A∣4|\operatorname{adj}(\operatorname{adj}A)| = |A|^4.

Definition

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

  • Double adjoint: adj⁡(adj⁡A)=∣A∣ n−2A\operatorname{adj}(\operatorname{adj}A) = |A|^{\,n-2}A
  • Its determinant: ∣adj⁡(adj⁡A)∣=∣A∣ (n−1)2|\operatorname{adj}(\operatorname{adj}A)| = |A|^{\,(n-1)^2}

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

Double adjoint

adj⁡(adj⁡A)=∣A∣ n−2A,∣adj⁡(adj⁡A)∣=∣A∣ (n−1)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⁡(adj⁡A)\operatorname{adj}(\operatorname{adj}A) and ∣adj⁡(adj⁡A)∣|\operatorname{adj}(\operatorname{adj}A)|.
Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

JEE Mains · 2025 · 22 Jan 2025 · Q129Moderate

Example 3 · Matrices · Adjoint, Inverse and Determinant Identities

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:

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

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

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

The determinant of the double adjoint carries the exponent (n−1)2(n-1)^2. For a 3×33\times3 that is (3−1)2=4(3-1)^2 = 4, giving ∣A∣4|A|^4. It is easy to stop at ∣A∣2|A|^2 (the single-adjoint power) or at ∣A∣n−2=∣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

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

Definition

A−1=adj⁡A∣A∣A^{-1} = \dfrac{\operatorname{adj}A}{|A|}, defined iff ∣A∣≠0|A| \neq 0. Consequences used in PYQs:

  • From a product = I: AB=I⇒B=A−1AB = I \Rightarrow B = A^{-1}, so ∣B∣=1/∣A∣|B| = 1/|A|
  • From PQ=kInPQ = kI_n: Q=kP−1Q = kP^{-1}, so ∣Q∣=k n∣P∣|Q| = \dfrac{k^{\,n}}{|P|}
  • Adjoint from inverse: adj⁡A=∣A∣ A−1\operatorname{adj}A = |A|\,A^{-1} (rearranging the defining identity)

Inverse and PQ = kI

A−1=adj⁡A∣A∣ (∣A∣≠0),PQ=kIn⇒Q=kP−1,  ∣Q∣=k n∣P∣A^{-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

The same idea in a real exam question:

JEE Mains · 2021 · Paper 1 · Q81Moderate

Example 4 · Matrices · Adjoint, Inverse and Determinant Identities

Let P=[3−1−220α3−50]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 k∈Rk\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

PQ=kIn⇒∣Q∣=k n/∣P∣PQ = kI_n \Rightarrow |Q| = k^{\,n}/|P| — the knk^n, not kk

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

Concept 5 of 7: Inverse via Cayley–Hamilton (A⁻¹ = αA + βI)

Every 2×22\times2 matrix satisfies its own characteristic equation A2−(tr⁡A)A+(det⁡A)I=OA^2 - (\operatorname{tr}A)A + (\det A)I = O. Multiply through by A−1A^{-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−(tr⁡A)A+(det⁡A)I=OA^2 - (\operatorname{tr}A)A + (\det A)I = O. Multiplying by A−1A^{-1}:

A−1=(tr⁡A) I−Adet⁡AA^{-1} = \frac{(\operatorname{tr}A)\,I - A}{\det A}
so in the form A−1=αA+βIA^{-1} = \alpha A + \beta I, α=−1det⁡A\alpha = -\dfrac{1}{\det A} and β=tr⁡Adet⁡A\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 Y−1=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−(tr⁡A)A+(det⁡A)I=O ⇒ A−1=(tr⁡A)I−Adet⁡AA^{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 A−1=αA+βIA^{-1} = \alpha A + \beta I and find α,β\alpha,\beta.
Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

JEE Mains · 2021 · 2021 Compilation Paper 16 · Q56Moderate

Example 5 · Matrices · Adjoint, Inverse and Determinant Identities

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

Divide by det⁡A\det A — Cayley–Hamilton gives A−1A^{-1}, not adj⁡A\operatorname{adj}A

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

Concept 6 of 7: When is a matrix invertible? (det ≠ 0)

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)   ⟺  ∣A∣≠0\iff |A| \neq 0.

  • Linear system: Ax=bAx = b has a unique solution   ⟺  ∣A∣≠0\iff |A| \neq 0.
  • Two-sided inverse: for square A,BA,B, AB=I⇒BA=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 N−1N^{-1}); hence ∣M∣=0|M| = 0.

Invertibility test

A−1 exists  ⟺  ∣A∣≠0andAB=I⇒BA=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

The same idea in a real exam question:

JEE Mains · 2021 · Paper 17 · Q79Moderate

Example 6 · Matrices · Adjoint, Inverse and Determinant Identities

Let AA and BB be two 3×33 \times 3 real matrices such that (A2−B2)\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:

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 N−1N^{-1}. Questions like 'A2−B2A^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

A grab-bag of inverse twists: the reversal law flips the order of a product's inverse, involutory matrices satisfy A=A−1A = 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=B−1A−1(AB)^{-1} = B^{-1}A^{-1} and adj⁡(AB)=adj⁡B adj⁡A\operatorname{adj}(AB) = \operatorname{adj}B\,\operatorname{adj}A; with adj⁡M=∣M∣M−1\operatorname{adj}M = |M|M^{-1}, expressions like A(adj⁡A−1+adj⁡B−1)−1BA(\operatorname{adj}A^{-1} + \operatorname{adj}B^{-1})^{-1}B simplify to a multiple of adj⁡A+adj⁡B\operatorname{adj}A + \operatorname{adj}B.
  • Involutory / self-inverse: A=A−1  ⟺  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)=det⁡A+tr⁡A+1\det(A + I) = \det A + \operatorname{tr}A + 1 (and det⁡(adj⁡A+I)=det⁡A+tr⁡A+1\det(\operatorname{adj}A + I) = \det A + \operatorname{tr}A + 1 too, since tr⁡(adj⁡A)=tr⁡A\operatorname{tr}(\operatorname{adj}A) = \operatorname{tr}A).

Reversal law and self-inverse

(AB)−1=B−1A−1,A=A−1  ⟺  A2=I,det⁡(A+I)=det⁡A+tr⁡A+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 det⁡A=−1\det A = -1. Simplify det⁡((A+I)(adj⁡A+I))\det\big((A + I)(\operatorname{adj}A + I)\big) in terms of tr⁡A\operatorname{tr}A.
Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

JEE Mains · 2022 · 26 July 2022 · Q180Moderate

Example 7 · Matrices · Adjoint, Inverse and Determinant Identities

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=A−1A =A^{- 1}, is

A=A−1A = 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=A−1A = A^{-1}' asks for ALL solutions of A2=IA^2 = I, which can number in the dozens.

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

Adding II to a 2×22\times2 shifts the determinant by tr⁡A+1\operatorname{tr}A + 1, not just 11 — the trace term is easy to drop. This is the crux of the (A+I)(adj⁡A+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)=det⁡A det⁡B,det⁡(AT)=det⁡A,det⁡(kA)=k ndet⁡A\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(adj⁡A)=∣A∣ In,∣adj⁡A∣=∣A∣ n−1,adj⁡(kA)=k n−1adj⁡AA(\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⁡(adj⁡A)=∣A∣ n−2A,∣adj⁡(adj⁡A)∣=∣A∣ (n−1)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

    A−1=adj⁡A∣A∣ (∣A∣≠0),PQ=kIn⇒Q=kP−1,  ∣Q∣=k n∣P∣A^{-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−(tr⁡A)A+(det⁡A)I=O ⇒ A−1=(tr⁡A)I−Adet⁡AA^{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

    A−1 exists  ⟺  ∣A∣≠0andAB=I⇒BA=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=B−1A−1,A=A−1  ⟺  A2=I,det⁡(A+I)=det⁡A+tr⁡A+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)

Test yourself on Matrices

20 past JEE Mains questions from this chapter, timed at 48 minutes and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.

Related notes