The direct answer
The 7 Golden Properties of Determinants
| Property | Statement | JEE Application |
|---|---|---|
| 1. Transpose | |Aᵀ| = |A| | Row = column operations |
| 2. Row swap | Interchanging rows changes sign | Count swaps to track sign |
| 3. Identical rows | Same rows/columns → |A| = 0 | Instant zero detection |
| 4. Multiplication | |AB| = |A||B| | Product determinants |
| 5. Scalar multiple | |kA| = kⁿ|A| for n×n | k=2 for 3×3 → 8× |
| 6. Row operations | Rᵢ → Rᵢ + kRⱼ doesn't change |A| | Simplify before expanding |
| 7. Inverse | |A⁻¹| = 1/|A| | Inverse determinant |
🧠 Memory trick: "T-S-I-M-S-R-I" — Transpose, Swap, Identical, Multiply, Scalar, Row ops, Inverse. Think: "Toppers Solve Interesting Matrix Systems Rapidly Indeed".
Finding the Inverse: adj(A)/|A|
Formula: A⁻¹ = adj(A)/|A|
Steps:
1. Calculate |A| — if zero, no inverse (singular matrix)
2. Find cofactors: Cᵢⱼ = (−1)^(i+j) × minor of aᵢⱼ
3. Form the cofactor matrix
4. Transpose → adj(A)
5. Divide by |A|
2×2 shortcut: A = [a b; c d], A⁻¹ = (1/(ad−bc))[d −b; −c a]
🧠 Memory trick for 2×2: "Swap a and d, negate b and c, divide by determinant." For the adjoint: "Swap diagonal, change sign of off-diagonal".
Systems of Linear Equations — Cramer's Rule
| Condition | Type of Solution | Marks |
|---|---|---|
| |A| ≠ 0 | Unique solution | Consistent & independent |
| |A| = 0, rank(A) = rank(A|B) | Infinite solutions | Consistent & dependent |
| |A| = 0, rank(A) ≠ rank(A|B) | No solution | Inconsistent |
Cramer's rule: For AX = B, xᵢ = |Aᵢ|/|A|
Where Aᵢ is the matrix with column i replaced by B.
For homogeneous system AX = 0:
|A| ≠ 0 → trivial solution (x = 0)
|A| = 0 → non-trivial solutions exist
Rank of a Matrix
Definition: Rank = maximum number of linearly independent rows (or columns).
Equivalent to: Order of largest non-zero minor.
How to find: Use Gaussian elimination (row reduction) to convert to row echelon form. Rank = number of non-zero rows.
Key facts:
rank(A) ≤ min(m, n) for m×n matrix
rank(A) = rank(Aᵀ)
rank(AB) ≤ min(rank(A), rank(B))
rank(A + B) ≤ rank(A) + rank(B)
Cayley-Hamilton Theorem
Statement: Every square matrix satisfies its own characteristic equation.
For 2×2 matrix A:
Characteristic equation: λ² − (trace)λ + |A| = 0
Cayley-Hamilton: A² − (trace)A + |A|I = 0
Application: Find Aⁿ efficiently.
Example: For A with |A| = 1 and trace = 3:
A² = 3A − I
A³ = A·A² = A(3A−I) = 3A²−A = 3(3A−I)−A = 8A−3I
🧠 Memory trick: "A² − (trace)A + |A|I = 0" — this one formula lets you find any power of A as a linear combination of A and I.
Frequently Asked Questions
What are the most important properties of determinants?
Key properties: (1) |A^T| = |A|, (2) Interchanging two rows/columns changes sign, (3) If two rows are identical, |A| = 0, (4) |AB| = |A||B|, (5) |kA| = kⁿ|A| for n×n matrix, (6) Adding multiple of one row to another doesn't change |A|, (7) |A⁻¹| = 1/|A|.
How do I find the inverse of a matrix?
A⁻¹ = adj(A)/|A|, where adj(A) is the adjoint (transpose of cofactor matrix). Steps: (1) Calculate |A| — if zero, no inverse. (2) Find cofactors of all elements. (3) Form cofactor matrix. (4) Transpose to get adj(A). (5) Divide by |A|. For 2×2: A⁻¹ = (1/|A|)[d -b; -c a].
When does a system of equations have a unique solution?
For AX = B: unique solution if |A| ≠ 0 (rank = n). No solution if |A| = 0 and rank(A) ≠ rank(A|B). Infinite solutions if |A| = 0 and rank(A) = rank(A|B) < n.
What is the rank of a matrix?
Rank is the maximum number of linearly independent rows (or columns). It equals the order of the largest non-zero minor. For an m×n matrix, rank ≤ min(m,n). Use row reduction (Gaussian elimination) to find rank efficiently.
What is the Cayley-Hamilton theorem?
The Cayley-Hamilton theorem states that every square matrix satisfies its own characteristic equation. If |A - λI| = λ² - (trace)λ + |A| = 0 is the characteristic equation, then A² - (trace)A + |A|I = 0. This is used to find higher powers of matrices.
What are the most common matrices questions in JEE?
JEE frequently asks: (1) Determinant property applications, (2) Matrix multiplication and powers, (3) Finding inverse using adjoint, (4) Solving systems using Cramer's rule, (5) Rank of matrix, (6) Cayley-Hamilton theorem, (7) Symmetric/skew-symmetric properties, (8) Orthogonal matrices.
What are the shortcuts for 2x2 and 3x3 determinants?
2×2: |a b; c d| = ad - bc. 3×3: Use Sarrus rule — repeat first two columns, add products of main diagonals, subtract products of other diagonals. For JEE, learn to spot patterns: if row/column sums are equal, factor them out.
Explore more algebra resources
Master matrices, then move to coordinate geometry and calculus.
Putting this into practice
How to apply this: Open the page titled "Matrices and Determinants for JEE: Complete Advanced Guide", read the summary and key points, then pick one action from the "What to do next" section below. Write down the specific official source you need to verify (dates, fees, rules, or eligibility) and check it today instead of bookmarking it for later.
Common mistakes
Consuming without acting
Most people do: read the entire page and close the tab without doing anything. You should do: pick one action from the "What to do next" section and complete it today.
Not verifying with official sources
Most people do: trust any website (including this one) as the final authority. You should do: check the linked official portal for dates, fees, eligibility, or document rules before making decisions.
Bookmarking instead of executing
Most people do: save 20 tabs "for later" and never return. You should do: write one next step on paper right now, then close extra tabs.
Quick checklist
- I identified the key takeaway from this page.
- I checked the official source for any dates, fees, or rules mentioned.
- I wrote down one specific next action.
- I saved any links or resources I may need later.
- I moved to the next step instead of opening more tabs.