Math notesAlgebraMatrices
Independent topic page
Matrices full marks come from structure first: order → trace/det → reduce (Cayley–Hamilton / nilpotent / adjoint) → only then multiply. Same process for systems and matching.
01. Why it matters: papers repeatedly ask Mⁿ, Adj/A⁻¹ identities, and AX=B with parameter conditions. Students who expand entry-wise waste minutes; toppers reduce using characteristic polynomial or structural split (I+N).
02. Syllabus anchors: types of matrices, operations, transpose, symmetric/skew, determinants and properties, adjoint & inverse, systems of linear equations. Cayley–Hamilton for 2×2/3×3 is a practical Advanced tool even when not named explicitly.
03. Common process: check order compatibility → compute tr/det early → choose reduction vs direct multiply → verify with a tiny numeric test when identities look opaque.
04. Exam habit: for MC on (AB)⁻¹ or Adj properties, test on a small invertible matrix if algebra is messy — one counterexample kills a false option.
05. Advanced lane: adjoint/inverse stems often hide a det=0 gate — compute det before chasing adj(A)/|A|. If singular, stop and read the ask (system inconsistency vs infinite solutions).
06. Cayley–Hamilton / Aⁿ questions: reduce the characteristic equation to a recurrence for powers; never expand A³ by hand when the char poly already gives A² in terms of A,I.
07. System of equations under parameter: treat the coefficient matrix as a family A(λ). Rank jumps at specific λ are the whole mark — write the condition before solving for x.
Official · 2026
Official syllabus points for Matrices & Determinants only — not the full Algebra portion map. Portion hub: Algebra · Algebra analysis.
No topic-specific exclusions flagged — finish the unit points below for Matrices.
Source: https://jeeadv.ac.in/documents/jee-advanced-2026-syllabus.pdf
Exam focusPowers via Cayley–Hamilton style reduction, adjoint/inverse order ≤3, linear systems.
Syllabus points
Do / check
2020–2026 paper weight
Topic match inside parent portion Algebra (37.2% of Math tags). Stats below are portion backdrop; matched subtopics show where Matrices & Determinants sits.
Portion-wide type/difficulty mix lives on the Algebra analysis — not repeated here so this page stays on Matrices.
01. Dominant subtopics: Probability (18), Matrices (15), Sets/Relations (12), Complex (12).
Cross-topic stems
Advanced rarely asks a chapter in isolation. These are tagged multi-idea Math stems that touch Matrices & Determinants — practise the knowledge bridge, not only the single-chapter drill.
No tagged mixed stem matched this topic’s keywords yet. Still revise the joins listed under Trends, and scan the mixed joins board for Calculus / Coordinate / Algebra bridges.
Why methods matter
If you treat Matrices as ‘multiply until tired’, Advanced will beat you on time. These methods force structure first — that is how toppers finish Mⁿ and singular systems while others are still expanding.
This is the difference between finishing Mⁿ in 40s and still multiplying at minute three.
Do thisFind CH / nilpotent / idempotent relation before multiplying repeatedly.
Turns M²⁶ into bookkeeping on scalars.
M=I+N with N²=0 ⇒ Mᵏ=I+kN. Sum of powers becomes arithmetic on k — never multiply 26 times.
Protects you from inventing an inverse that does not exist — a classic Advanced trap.
Do thisCompute det A before discussing solutions.
Separates unique vs singular cases in 15 seconds.
If det=0 and Adj A · B ≠ 0, inconsistent. If Adj A · B = 0, infinite (when rank allows).
Turns opaque MC identities into 20-second true/false — toppers use this constantly.
Do thisKill false identities on a 2×2 numeric example.
Faster than abstract algebra under MC pressure.
Suspect (AB)⁻¹=A⁻¹B⁻¹? Try numbers — false; correct is B⁻¹A⁻¹.
Stops silent sign errors that look like ‘careless arithmetic’ but are really method gaps.
Do thisTrack sign on swap; factor on row scale; invariance on adding multiple.
Prevents silent sign/factor errors.
Swap two rows ⇒ det flips sign. Multiply a row by k ⇒ det×k. Rᵢ→Rᵢ+λRⱼ leaves det unchanged.
Processed examples
Read the impact line first. Then notice which family/model was chosen. The solution is written the way your rough sheet should look in the hall.
Let M = [[1,1],[0,1]]. Find Mⁿ for positive integer n.
This is the classic ‘looks huge, collapses fast’ Advanced matrix. If you multiply entry-wise, you practise the wrong skill.
Model chosenSpot M = I+N with N²=0 → Mⁿ = I+nN.
Answer[[1, n], [0, 1]]
Takeaway: Structure before multiplication — every power stem starts here.
For what λ does [[1,2],[2,λ]] [x,y]ᵀ = [3,6]ᵀ have infinitely many solutions?
Advanced loves det=0 edges. Students who invert first lose the infinite/none distinction.
Model chosenBranch on det A; then consistency.
Answerλ = 4
Takeaway: det first, invert never-blindly.
A matrix M satisfies M² − 3M + 2I = 0. Express M²⁰²⁷ as a linear polynomial in M.
Huge exponents are free marks once you reduce modulo the annihilating polynomial — this is how Advanced asks ‘power’ without entry-wise work.
Model chosenInterpolate xⁿ ≡ ax + b at roots 1 and 2 of the char relation.
AnswerM²⁰²⁷ = (2²⁰²⁷ − 1)M + (2 − 2²⁰²⁷)I
Takeaway: Reduce large matrix powers modulo the given relation before multiplying.
Reusable models
Advanced stems cluster. Name the family in 10–15s, write the fast model, then run the same path. Do not invent a new plan each time.
Looks likeMⁿ, Mⁿ+Mⁿ⁻¹, f(M) for a polynomial f, sum of powers
Fast modelWrite tr, det (or spot I+N / idempotent) → reduce via CH or N²=0 before multiplying.
Avoids entry-wise multiplication that Advanced designs to waste time.
Do not multiply M by itself repeatedly for large n.
Looks likeSolve / discuss solutions; λ in matrix; unique/infinite/none
Fast modelBranch on det A first — never invert blindly.
Most options are decided by the det=0 branch alone.
Do not compute full inverse when only solvability is asked.
Looks like(AB)⁻¹, Adj(Adj A), symmetric/skew claims
Fast modelTreat each option as T/F; kill with a tiny 2×2 numeric test if algebra is opaque.
Numeric counterexamples beat long symbolic expansions under MC pressure.
Do not try to make option codes ‘look patterned’.
Looks likeEvaluate det after row/column operations or with parameters
Fast modelTrack sign on swap, factor on scale, invariance on Rᵢ+λRⱼ — then expand once.
Ops shrink the matrix before expansion.
Do not expand the original messy matrix first.
Hall timing
Underline whether matrices are square. If product appears, check size compatibility before anything else.
Write the characteristic idea early: for 2×2, λ²−(tr)λ+det=0. If N²=0 pattern exists, powers collapse.
For systems: form det A. If det≠0 unique; if det=0 check consistency. Never blindly invert.
For MC, verify each option independently. Plug n=1 or a 2×2 numeric matrix if stuck.
After the model is locked
det[[a,b],[c,d]]=ad−bc; A⁻¹=(1/det)[[d,−b],[−c,a]]
Fast 2×2 inverse and singularity check
A · (Adj A) = (Adj A) · A = (det A) I
Powers of Adj, relations without full inverse
A⁻¹ = (1/det A) Adj A (det A ≠ 0)
Explicit inverse asks
det(AB)=det(A)det(B); (AB)⁻¹=B⁻¹A⁻¹
Identity MC and inverse of products
|kA| = kⁿ |A| for n×n matrix
Scaled matrix determinants
A² − (tr A)A + (det A)I = 0
Reduce Aⁿ and polynomials in A
Unique iff det A ≠ 0; else check consistency of augmented system
Parameter / infinite solutions stems
Aᵀ=A symmetric; Aᵀ=−A skew (diag 0 over reals)
Classification MC
Make it automatic