PYQ Vault

MHT-CET Maths · Formula sheet

Determinants and Matrices formulas

17 formulas and 17 common traps for MHT-CET Maths Determinants and Matrices, grouped by subtopic.

Full notes with worked examples

Determinants, Cofactors and the Adjoint Identities

Learn this subtopic in the notes

Determinants and Cofactors: Expansion Along a Row

Expansion and cofactors

∣A∣=∑jaijAij,Aij=(−1)i+jMij,∑jaijAkj=0 (k≠i)|A| = \sum_{j} a_{ij}A_{ij}, \qquad A_{ij} = (-1)^{i+j}M_{ij}, \qquad \sum_j a_{ij}A_{kj} = 0 \ (k \ne i)

The Adjoint and A·adj(A) = |A|·I

The adjoint identity

A adj⁡A=∣A∣ Iadj⁡(abcd)=(d−b−ca)(adj⁡A)−1=A∣A∣A\,\operatorname{adj}A = |A|\,I \qquad \operatorname{adj}\begin{pmatrix} a & b \\ c & d \end{pmatrix} = \begin{pmatrix} d & -b \\ -c & a \end{pmatrix} \qquad (\operatorname{adj}A)^{-1} = \frac{A}{|A|}

|adj A| = |A|ⁿ⁻¹ and |kA| = kⁿ|A|

Determinant identities

∣adj⁡A∣=∣A∣n−1∣kA∣=kn∣A∣∣AB∣=∣A∣∣B∣∣A−1∣=1∣A∣|\operatorname{adj}A| = |A|^{n-1} \qquad |kA| = k^n|A| \qquad |AB| = |A||B| \qquad |A^{-1}| = \frac{1}{|A|}

A·adj(A) = AAᵀ: Two Equations From the Diagonal and Off-Diagonal

The AAᵀ condition

A adj⁡A=AAT  ⟺  AAT=∣A∣ I  ⟺  (off-diagonal of AAT)=0 and (diagonal of AAT)=∣A∣A\,\operatorname{adj}A = AA^T \iff AA^T = |A|\,I \iff (\text{off-diagonal of } AA^T) = 0 \ \text{and}\ (\text{diagonal of } AA^T) = |A|

Determinant Equations: When Does |A| Vanish?

Vanishing determinant

∣A∣=0  ⟺  A singular  ⟺  A−1 does not exist1+ω+ω2=0, ω3=1|A| = 0 \iff A \text{ singular} \iff A^{-1} \text{ does not exist} \qquad 1 + \omega + \omega^2 = 0,\ \omega^3 = 1

Common traps

Reading (adj A)₂₃ as the cofactor A₂₃

The adjoint is the TRANSPOSE of the cofactor matrix, so its (2,3)(2, 3) element is A32A_{32}. With aij=2i+ja_{ij} = 2i + j that gives 44, and the untransposed reading gives −4-4 — both on the option list.

Substituting the relations before expanding

∣A∣=xyz−8x−4y−3z+28|A| = xyz - 8x - 4y - 3z + 28 contains BOTH given quantities and a constant. Using only 8x+4y+3z=208x + 4y + 3z = 20 gives 20I20I; the full expansion gives 68I68I. Expand first, substitute last.

Using |adj A| = |A|

For 3×33 \times 3, ∣adj⁡A∣=∣A∣2|\operatorname{adj}A| = |A|^2. Setting ∣P∣=4|P| = 4 instead of 1616 gives α=5\alpha = 5, which is the option planted for that mistake.

Equating AAᵀ to |A| only on the diagonal

The off-diagonal condition is the one that links aa and bb. Without it the diagonal gives one equation in two unknowns and every option looks reachable.

Stopping at cos 2B = 0

The trigonometric determinant is 1+cos⁡2B1 + \cos 2B, not cos⁡2B\cos 2B: the two squared terms add to 11. Zero requires cos⁡2B=−1\cos 2B = -1, giving (2n+1)π/2(2n+1)\pi/2 — the option (2n+1)π/4(2n+1)\pi/4 is the half-finished version.

Inverse of a Matrix — Adjoint Formula, Products and Verification

Learn this subtopic in the notes

Inverse of a 2 × 2 Matrix

2 × 2 inverse

(abcd)−1=1ad−bc(d−b−ca),ad−bc≠0\begin{pmatrix} a & b \\ c & d \end{pmatrix}^{-1} = \frac{1}{ad - bc}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}, \quad ad - bc \ne 0

Invert an Expression: Compute A² − 5A or A + B First, Then Invert

Order of operations

(A2−5A)−1=(the matrix A2−5A)−1≠(A2)−1−(5A)−1,(A+B)−1≠A−1+B−1(A^2 - 5A)^{-1} = \left(\text{the matrix } A^2 - 5A\right)^{-1} \ne (A^2)^{-1} - (5A)^{-1}, \qquad (A + B)^{-1} \ne A^{-1} + B^{-1}

Matrices with tan x Entries: |A| = sec²x and adj A = Aᵀ

The tan-entry matrix

A=(1tan⁡x−tan⁡x1): ∣A∣=sec⁡2x, adj⁡A=AT, A−1=cos⁡2x AT, ATA−1=(cos⁡2x−sin⁡2xsin⁡2xcos⁡2x)A = \begin{pmatrix} 1 & \tan x \\ -\tan x & 1 \end{pmatrix}:\ |A| = \sec^2x,\ \operatorname{adj}A = A^T,\ A^{-1} = \cos^2x\,A^T,\ A^TA^{-1} = \begin{pmatrix} \cos 2x & -\sin 2x \\ \sin 2x & \cos 2x \end{pmatrix}

(AB)⁻¹ = B⁻¹A⁻¹: Inverting Products and Recovering a Factor

Inverse of a product

(AB)−1=B−1A−1B−1=(AB)−1A(A−1)−1=A(AT)−1=(A−1)T(AB)^{-1} = B^{-1}A^{-1} \qquad B^{-1} = (AB)^{-1}A \qquad (A^{-1})^{-1} = A \qquad (A^T)^{-1} = (A^{-1})^T

Unknown Entries and A⁻¹ = A³: Use AA⁻¹ = I

The defining property of the inverse

AB=I  ⟺  B=A−1A−1=A3  ⟺  A4=IAB = I \iff B = A^{-1} \qquad A^{-1} = A^{3} \iff A^{4} = I

Common traps

Swapping signs on the diagonal instead of the off-diagonal

The adjoint of (abcd)\begin{pmatrix} a & b \\ c & d \end{pmatrix} is (d−b−ca)\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}: the diagonal entries SWAP places and keep their signs; the off-diagonal entries stay put and change sign. Every option list contains the other three sign patterns.

Distributing the inverse over a sum

There is no rule for (A+B)−1(A + B)^{-1} or (A2−5A)−1(A^2 - 5A)^{-1} except to form the matrix and invert it. The distractors are exactly what distributing produces.

Sign of the sin 2x entries

ATA−1A^TA^{-1} has −sin⁡2x-\sin 2x in the top-right and +sin⁡2x+\sin 2x in the bottom-left. The four sign arrangements are all offered; compute the (1,2)(1,2) entry explicitly — −tan⁡x−tan⁡x1+tan⁡2x=−sin⁡2x\dfrac{-\tan x - \tan x}{1 + \tan^2x} = -\sin 2x.

Keeping the order

(AB)−1=A−1B−1(AB)^{-1} = A^{-1}B^{-1} is false unless the matrices commute. Reversing is the whole rule; with it, B−1=(AB)−1AB^{-1} = (AB)^{-1}A and NOT A (AB)−1A\,(AB)^{-1}.

Solving all nine entries

Three unknowns need three equations; the other six entries are checks. Choosing the entries that isolate one unknown each keeps the arithmetic to a few lines — solving the whole product is where time goes.

Cayley–Hamilton, Matrix Polynomials and Powers

Learn this subtopic in the notes

Cayley–Hamilton for 2 × 2: A² − (tr A)A + |A|·I = 0

Cayley–Hamilton (2 × 2)

A2−(tr⁡A) A+∣A∣ I=OA−1=(tr⁡A) I−A∣A∣A^2 - (\operatorname{tr}A)\,A + |A|\,I = O \qquad A^{-1} = \frac{(\operatorname{tr}A)\,I - A}{|A|}
  • tr⁡A\operatorname{tr}Asum of the diagonal entries
  • OOthe zero matrix

A⁻¹ = αI + βA: Read α and β From the Theorem

Inverse as a combination

A−1=αI+βA  with  α=tr⁡A∣A∣, β=−1∣A∣A^{-1} = \alpha I + \beta A \ \text{ with } \ \alpha = \frac{\operatorname{tr}A}{|A|},\ \beta = -\frac{1}{|A|}

A Factored Polynomial in A Gives A⁻¹ in One Line

From a polynomial relation to the inverse

A2−pA+qI=O (q≠0) ⇒ A−1=pI−Aq(A+kI)−1: write A2−pA+qI=(A+kI)(A−mI)+cIA^2 - pA + qI = O \ (q \ne 0) \ \Rightarrow\ A^{-1} = \frac{pI - A}{q} \qquad (A + kI)^{-1}:\ \text{write } A^2 - pA + qI = (A + kI)(A - mI) + cI

Powers of a Matrix: Find the Cycle

Powers modulo a cycle

Am=cI ⇒ Amk+r=ckAr(i110)3=iI,i4=1A^m = cI \ \Rightarrow\ A^{mk + r} = c^k A^r \qquad \begin{pmatrix} i & 1 \\ 1 & 0 \end{pmatrix}^3 = iI,\quad i^4 = 1

Common traps

Sign of the determinant term

It is A2−(tr⁡A)A+∣A∣IA^2 - (\operatorname{tr}A)A + |A|I: minus the trace, PLUS the determinant. Writing −∣A∣I-|A|I turns a null-matrix answer into a wrong 'symmetric matrix' option.

α from the wrong entry

Matching the (1,1)(1,1) entry gives α+β\alpha + \beta, not α\alpha — for (12−14)\begin{pmatrix} 1 & 2 \\ -1 & 4 \end{pmatrix} that is 23\frac23, and reading it as α\alpha makes 4(α−β)=1034(\alpha - \beta) = \frac{10}{3}, which is offered. α=tr⁡A/∣A∣=56\alpha = \operatorname{tr}A/|A| = \frac56.

Concluding A = 3I or A = 5I

(A−3I)(A−5I)=O(A - 3I)(A - 5I) = O does NOT force either factor to be zero — matrices have zero divisors. The information is the polynomial relation, and only that.

Reducing 2029 modulo 3 instead of 12

A3=iIA^3 = iI is a scalar but NOT the identity; the cycle closes at A12=IA^{12} = I. Using 33 gives A2029=A1⋅i676=AA^{2029} = A^{1}\cdot i^{676} = A only by luck of the arithmetic — reduce modulo the exponent at which the power returns to II.

Systems of Linear Equations and Symmetric, Skew-Symmetric Matrices

Learn this subtopic in the notes

Solving AX = B: Elimination, or X = A⁻¹B

Linear system in matrix form

AX=B,∣A∣≠0 ⇒ X=A−1B (unique)AX = B,\quad |A| \ne 0 \ \Rightarrow\ X = A^{-1}B \ \text{(unique)}

Homogeneous Systems: Non-Trivial Solutions Need |A| = 0

Homogeneous system

AX=O has a non-trivial solution  ⟺  ∣A∣=0AX = O \text{ has a non-trivial solution} \iff |A| = 0

Symmetric + Skew-Symmetric: The Unique Split, and Why Odd-Order Skew Is Singular

Symmetric and skew-symmetric parts

M=M+MT2+M−MT2BT=−B, n odd ⇒ ∣B∣=0M = \frac{M + M^T}{2} + \frac{M - M^T}{2} \qquad B^T = -B,\ n \text{ odd} \ \Rightarrow\ |B| = 0

Common traps

Trusting a solution without checking every equation

One sitting's stored key gave (2,1,1)(2, 1, 1) for a system whose first equation that triple fails. Substitute the solution into ALL three equations before choosing — it takes ten seconds and catches both your slips and the paper's.

Reading |A| = 0 as 'no solution'

For a homogeneous system a zero determinant means infinitely many solutions, never none — X=OX = O always works. 'No solution' is only possible for AX=BAX = B with B≠OB \ne O.

Expecting a 2 × 2 skew-symmetric matrix to be singular

(0t−t0)\begin{pmatrix} 0 & t \\ -t & 0 \end{pmatrix} has determinant t2≠0t^2 \ne 0. The 'skew ⇒ singular' rule is for ODD order only; in even order the skew part is invertible whenever t≠0t \ne 0.

More MHT-CET Maths formula sheets