Adjoint, Inverse and Linear Systems: JEE Main Notes
Reviewed Last updated 2026-11-20. Syllabus topic: Adjoint, inverse and linear systems.
In short. The inverse of a non-singular square matrix is A^(-1) = adj A / det A, where adj A is the transpose of the cofactor matrix. A system AX = B has a unique solution X = A^(-1) B when det A is not zero; when det A is zero the system is either inconsistent or has infinitely many solutions, and that must be decided by elimination.
- adj A is the transpose of the cofactor matrix, and A (adj A) = (adj A) A = det A times I.
- A^(-1) exists only if det A is not zero, and then A^(-1) = adj A / det A; (AB)^(-1) = B^(-1) A^(-1).
- For an n x n matrix det(adj A) = (det A)^(n-1) and adj(kA) = k^(n-1) adj A.
- If det A is not zero, AX = B has exactly one solution X = A^(-1) B; the order matters, and XA = B gives X = B A^(-1).
- If det A is zero, test consistency by row reduction: a contradictory row means no solution, an all-zero row means infinitely many.
Syllabus line: MATRICES AND DETERMINANTS: Matrices, algebra of matrices, type of matrices, determinants and matrices of order two and three, evaluation of determinants, area of triangles using determinants; Adjoint and inverse of a square matrix; Test of consistency and solution of simultaneous linear equations in two or three variables using matrices. (NTA JEE (Main) 2026 syllabus, Mathematics, Unit 3 (https://jeemain.nta.nic.in/document/syllabus-2026/))
Before you start
Prerequisites
- Determinants and the area of a triangle: Cofactors, minors and the condition det A not equal to 0 come from the determinant lesson. Read this first if expanding a 3 x 3 determinant is slow.
- Matrices and their algebra: The inverse is defined through matrix multiplication, and (AB)^(-1) reverses the order. Read this first if non-commutativity is not clear.
Related topics
- Determinants and the area of a triangle
- Matrices and their algebra
- Matrices and Determinants (lesson planned)
- Three Dimensional Geometry (lesson planned)
The concept step by step
Step 1: Cofactors and the adjoint
For each entry of A delete its row and column, take the determinant of what is left and attach the sign (-1)^(i+j). These numbers form the cofactor matrix. Transposing it gives the adjoint adj A. For a 2 x 2 matrix with rows (a,b) and (c,d), adj A has rows (d,-b) and (-c,a). The transpose step is where most errors happen.
Step 2: The key identity and the inverse
Multiplying A by adj A gives det A on the diagonal and 0 elsewhere, so A (adj A) = (det A) I. If det A is not zero, dividing by it gives the inverse: A^(-1) = adj A / det A. If det A = 0 there is no inverse, and the matrix is called singular. For [[4,7],[2,6]], det is 10 and the inverse is (1/10) times [[6,-7],[-2,4]].
Step 3: Properties of the adjoint and inverse
For an n x n matrix, det(adj A) = (det A)^(n-1); for 3 x 3 this is (det A)². Scaling gives adj(kA) = k^(n-1) adj A. The inverse of a product reverses the order: (AB)^(-1) = B^(-1) A^(-1). Also det(A^(-1)) = 1/det A. These let you answer many questions without computing a single cofactor, so look for them before expanding anything.
Step 4: Solving AX = B
Write the equations as AX = B with A the coefficient matrix, X the column of unknowns and B the constants. If det A is not zero, multiply both sides on the left by A^(-1): X = A^(-1) B, one unique solution. For the matrix equation XA = B the inverse must multiply on the right, so X = B A^(-1). Always put the inverse on the same side as the matrix you are removing.
Step 5: Consistency, the three outcomes
A system is either inconsistent (no solution), or has exactly one solution, or has infinitely many. If det A is not zero the solution is unique. If det A is zero, the left sides are dependent, and the constants decide: if they obey the same dependency, there are infinitely many solutions; if they break it, there is no solution. Example: x + y + z = 6 and x + 2y + 3z = 10 with a third equation whose left side is the second one forces the third constant to be 10.
Step 6: Homogeneous systems and parameters
When all constants are zero the system AX = 0 always has the solution X = 0. A non-zero solution exists exactly when det A = 0. So to find the value of a parameter k that allows non-trivial solutions, expand the coefficient determinant in k and set it to zero. For rows (1,1,1), (1,2,3), (2,3,k) the determinant is k - 4, so k = 4. Check by seeing that row 3 becomes the sum of rows 1 and 2.
Worked examples
Each solution shows the marks every step would earn. The sanity check tests units and size of the answer.
Example 1 (easy)
Find the entry in the first row and second column of the inverse of A = [[4,7],[2,6]].
| Step | Marks |
|---|---|
| det A = 4 x 6 - 7 x 2 = 10. | 1 |
| adj A has rows (6, -7) and (-2, 4): swap the diagonal and negate the other entries. | 1 |
| A^(-1) = adj A / 10, so the (1,2) entry is -7/10 = -0.7. | 1 |
| Total: 3 marks | 3 |
Answer: -0.7
Fast method: Take -b / det A directly: -7/10.
Sanity check: Multiply the first row of A, (4, 7), by the second column of the inverse, (-0.7, 0.4): 4 x (-0.7) + 7 x 0.4 = -2.8 + 2.8 = 0, as an identity requires for an off-diagonal entry.
Example 2 (medium)
A is a 3 x 3 matrix with det A = 3. Find det(adj(2A)).
| Step | Marks |
|---|---|
| For a 3 x 3 matrix det(adj B) = (det B)², with B = 2A. | 1 |
| det(2A) = 2³ x 3 = 24. | 1 |
| det(adj(2A)) = 24² = 576. | 2 |
| Total: 4 marks | 4 |
Answer: 576
Fast method: Use det(adj B) = (det B)² with det(2A) = 24.
Sanity check: Rough size: adj(2A) = 4 adj A, and det(adj A) = 9, so det = 4³ x 9 = 576, which agrees by a second route.
Example 3 (medium)
Solve x + 2y + z = 8, 2x - y + z = 3, x + y - z = 0 and find the product xyz.
| Step | Marks |
|---|---|
| Write AX = B with rows (1,2,1), (2,-1,1), (1,1,-1) and B = (8, 3, 0). det A = 1(1 - 1) - 2(-2 - 1) + 1(2 + 1) = 9, which is not zero. | 2 |
| X = A^(-1) B gives x = 1, y = 2, z = 3 (check: 1 + 4 + 3 = 8; 2 - 2 + 3 = 3; 1 + 2 - 3 = 0). | 2 |
| xyz = 1 x 2 x 3 = 6. | 1 |
| Total: 5 marks | 5 |
Answer: 6
Fast method: Add equations 2 and 3: 3x = 3, so x = 1; then y + z = 5 and y - z = -1 give y = 2, z = 3.
Sanity check: All three original equations are satisfied by (1, 2, 3), and the product of three small positive integers is 6.
Example 4 (medium)
The system x + y + z = 0, x + 2y + 3z = 0, 2x + 3y + kz = 0 has a non-trivial solution. Find k.
| Step | Marks |
|---|---|
| A homogeneous system has a non-trivial solution exactly when the coefficient determinant is 0. | 1 |
| The determinant is 1(2k - 9) - 1(k - 6) + 1(3 - 4) = k - 4. | 2 |
| Setting k - 4 = 0 gives k = 4. | 1 |
| Total: 4 marks | 4 |
Answer: 4
Fast method: Row 3 equals row 1 plus row 2 only when k = 4, which makes the rows dependent.
Sanity check: For k = 4 the third row is the sum of the first two rows, a dependency that makes the determinant zero.
Example 5 (hard, multi-step)
Let A = [[2,3],[1,2]] and B = [[1,0],[2,3]]. If X A = B, find the sum of the squares of the entries of X.
| Step | Marks |
|---|---|
| det A = 4 - 3 = 1 and A^(-1) = [[2,-3],[-1,2]]. | 1 |
| From X A = B, multiply on the right: X = B A^(-1). | 2 |
| X = [[1,0],[2,3]] x [[2,-3],[-1,2]] = [[2,-3],[1,0]]. | 2 |
| Sum of squares = 4 + 9 + 1 + 0 = 14. | 1 |
| Total: 6 marks | 6 |
Answer: 14
Fast method: Write X = B A^(-1) at once (inverse on the same side as A), then multiply.
Sanity check: Check: X A = [[2,-3],[1,0]] x [[2,3],[1,2]] = [[4 - 3, 6 - 6],[2, 3]] = [[1,0],[2,3]] = B.
Example 6 (hard, multi-step)
The system x + y + z = 1, x + 2y + 3z = 2, x + 3y + az = b has infinitely many solutions for integers a and b. Find a + b.
| Step | Marks |
|---|---|
| The coefficient determinant is 1(2a - 9) - 1(a - 3) + 1(3 - 2) = a - 5. For a not equal to 5 the solution is unique, so we need a = 5. | 2 |
| With a = 5 the left side of equation 3 equals 2 x (equation 2) - (equation 1). | 2 |
| The constants must obey the same relation: b = 2 x 2 - 1 = 3 (any other b gives no solution). So a + b = 8. | 1 |
| Total: 5 marks | 5 |
Answer: 8
Fast method: Find the dependency of the left sides, apply it to the right sides: b = 2(2) - 1 = 3 with a = 5.
Sanity check: For a = 5, b = 3 the first two equations leave one free variable, so there are infinitely many solutions, for example (t, 1 - 2t, t).
Formulas and units
| Result | Formula | Valid when | Units or note | Worked example |
|---|---|---|---|---|
| Adjoint | adj A = transpose of the cofactor matrix | square matrix A | dimensionless | Example 1 |
| Key identity | A (adj A) = (adj A) A = (det A) I | square matrix A of any order | dimensionless | none |
| Inverse | A^(-1) = adj A / det A, defined if det A is not 0 | square matrix with det A not equal to 0 | dimensionless | Example 1 |
| 2 x 2 inverse | inverse of [[a,b],[c,d]] = (1/(ad - bc)) [[d,-b],[-c,a]] | 2 x 2 matrix with ad - bc not equal to 0 | dimensionless | Example 1 |
| Determinant of adjoint | det(adj A) = (det A)^(n-1) | n x n matrix | dimensionless | Example 2 |
| Adjoint of a scalar multiple | adj(kA) = k^(n-1) adj A | n x n matrix, any scalar k | dimensionless | none |
| Inverse of a product | (AB)^(-1) = B^(-1) A^(-1); det(A^(-1)) = 1 / det A | A and B invertible, same order | dimensionless | none |
| Solving AX = B | det A not 0: X = A^(-1) B; for XA = B: X = B A^(-1) | A invertible; the inverse goes on the same side as A | dimensionless | Example 3 |
| Homogeneous system | AX = 0 has a non-trivial solution if and only if det A = 0 | square system (as many equations as unknowns) | dimensionless | Example 4 |
Common mistakes and speed
- Reading an entry of the inverse from the cofactor of the same position instead of the transposed position. Why it tempts: The cofactor matrix is what you computed, and forgetting the transpose still gives a number of the right size; a wrong option is made this way.
- Using det(adj A) = det A, or forgetting that adj(kA) brings k^(n-1). Why it tempts: The adjoint looks like a rearrangement of A, so its determinant seems unchanged.
- Solving XA = B as X = A^(-1) B. Why it tempts: Left multiplication is the habit from AX = B, and the arithmetic still produces a clean matrix.
- Declaring a system with det A = 0 inconsistent, or consistent, without looking at the constants. Why it tempts: Singular suggests trouble, but both no solution and infinitely many solutions occur; only the constants decide.
- Forgetting that the inverse of a product reverses the order, (AB)^(-1) = B^(-1) A^(-1). Why it tempts: The transpose rule is also a reversal, and the unreversed form looks like ordinary algebra.
Time per question and fast method
Target: about 100 seconds per question.
For a 2 x 2 inverse write the swap-and-negate form at once. For one entry of a 3 x 3 inverse compute only the single cofactor you need, remembering the transpose. For adj and scalar results use the power n - 1. For consistency, find the dependency among left sides and apply it to the right sides; do not expand the determinant for every parameter.
Recall quiz
Pick an option for each question. Your answers stay on this page and are not sent anywhere.
Score: 0 of 5 correct. Pick an option for each question.
Practice
- For A = [[2,1,0],[0,1,3],[1,0,1]], the entry in the first row and second column of A^(-1) is Verified (T1)
- For A with rows (1, 2, 0), (0, 3, 1), (0, 0, 1), the determinant of adj A is Verified (T1)
- The system x + y + z = 6, x + 2y + 3z = 10, x + 2y + az = b has infinitely many solutions for integers a and… Verified (T1)
- Consider the system x + y + z = 1, x + 2y + 4z = L, x + 4y + 10z = L². Find the sum of all integer values of… Verified (T3)
Previous-year questions
Previous-year questions are not imported yet. Previous-year questions are not imported yet; see the official papers on the NTA site. Official NTA papers page.
Going deeper and revision
Cofactor matrix and adjoint
For a square matrix A, form the cofactor matrix whose (i,j) entry is C(i,j) = (-1)^(i+j) M(i,j). The adjoint (adjugate) adj A is the transpose of that matrix, so the (i,j) entry of adj A is the cofactor C(j,i). This transpose is the single commonest slip: the cofactor of the (1,2) entry sits in position (2,1) of adj A. For a 2 x 2 matrix with rows (a, b) and (c, d), adj A has rows (d, -b) and (-c, a): swap the diagonal entries and negate the off-diagonal ones. The defining identity is A (adj A) = (adj A) A = (det A) I. It holds because the entries of a row multiplied by their own cofactors give det A, while a row multiplied by the cofactors of a different row gives 0.
Inverse of a matrix
A square matrix A has an inverse B with AB = BA = I exactly when det A is not zero, and then A^(-1) = adj A / det A. The inverse is unique. Rules: (A^(-1))^(-1) = A, (AB)^(-1) = B^(-1) A^(-1) with the order reversed, (A^T)^(-1) = (A^(-1))^T, and det(A^(-1)) = 1 / det A. For a 2 x 2 matrix with rows (a, b) and (c, d) and determinant ad - bc, the inverse is (1/(ad - bc)) times the matrix with rows (d, -b) and (-c, a). For the inverse of a 3 x 3 matrix compute det A, the nine cofactors, transpose, and divide; check by multiplying one row of A with one column of the answer to get 1 or 0. A diagonal matrix has the inverse with reciprocal diagonal entries.
Properties of the adjoint
For an n x n matrix, det(adj A) = (det A)^(n-1), so for a 3 x 3 matrix det(adj A) = (det A)². Also adj(kA) = k^(n-1) adj A, adj(AB) = (adj B)(adj A) with the order reversed, adj(A^T) = (adj A)^T and adj(adj A) = (det A)^(n-2) A. If A is singular, then adj A is also singular for n at least 2 (its determinant is (det A)^(n-1) = 0) and A (adj A) is the zero matrix. If A is non-singular, adj A = (det A) A^(-1), which links the two ideas and gives most of these results in one line. The formula for det(adj(kA)) combines two rules: det(adj(2A)) = (det(2A))^(n-1), where det(2A) = 2ⁿ det A.
Solving AX = B with the inverse
A system of n linear equations in n unknowns is written AX = B, where A holds the coefficients, X the unknowns and B the constants. If det A is not zero, multiply on the left by A^(-1) to get X = A^(-1) B: the system has exactly one solution. The same idea solves a matrix equation: from XA = B, multiply on the right to get X = B A^(-1). The side matters because multiplication is not commutative; using the wrong side is a common trap. For two or three unknowns you may equally use elimination or the determinant method, but the exam expects you to recognise the matrix form. For a quick check, substitute the solution into one equation you did not use to find the last unknown.
Consistency: unique, none or infinitely many
A system is consistent if it has at least one solution. If det A is not zero, it is consistent with a unique solution. If det A is zero, the system is either inconsistent (no solution) or consistent with infinitely many solutions, and the determinant alone cannot say which. Reduce the augmented matrix by row operations: a row of the form (0, 0, 0 | c) with c not zero means no solution; if the rows reduce with no such contradiction, the system has infinitely many solutions. A textbook test uses (adj A) B: if det A = 0 and (adj A) B is not the zero matrix, the system is inconsistent; if (adj A) B is zero, the test does not decide and elimination must be used. For parameters in a system, find where det A = 0 and then examine the constants separately. A system of two lines is consistent if the lines meet or coincide, and inconsistent if they are parallel and distinct.
Homogeneous systems
A system AX = 0 always has the trivial solution X = 0. It has a non-trivial solution exactly when det A = 0, and then it has infinitely many solutions. In JEE Main this is used to find the parameter that makes a given homogeneous system have non-zero solutions: set the coefficient determinant equal to zero and solve for the parameter. For example the system x + y + z = 0, x + 2y + 3z = 0, 2x + 3y + kz = 0 has non-trivial solutions when the coefficient determinant, which equals k - 4, is zero, so k = 4. Do not confuse this with a non-homogeneous system, where det A = 0 only makes a unique solution impossible and does not by itself guarantee solutions.
What examiners test, edge cases and checking
Typical JEE Main items: one entry of the inverse or adjoint (the transpose trap), det(adj A) or det(A^(-1)) from det A, solving a 3 x 3 system and reporting a combination of the unknowns, parameter values for no solution or infinitely many solutions, parameter values for a homogeneous system with a non-trivial solution, and counting the parameter values that keep the system consistent. Edge cases: when det A = 0, the three cases split by the constants; a system with fewer independent equations than unknowns is never unique. To check: multiply A by your inverse and look at one entry; substitute a solution into all equations; for consistency, test the dependency among the left sides on the right sides, as in R3 = 3 R2 - 2 R1 requiring the constants to satisfy the same relation. The scope here is two or three variables, determinants up to order 3 and no echelon-rank theory beyond the consistency test.
Memory hook
Suppose a college canteen gives two friends their bills for the same day: the first friend had 2 teas and 1 samosa and paid Rs 25, the second had 1 tea and 2 samosas and paid Rs 35. You want the price of one tea and one samosa.
- Write the coefficients as a table with rows (2, 1) and (1, 2), and the bills as the column (25, 35). The table has determinant 3, which is not zero, so the prices are fixed: the system has one solution.
- Applying the inverse, (1/3) times the table with rows (2, -1) and (-1, 2), to the column (25, 35) gives a tea at Rs 5 and a samosa at Rs 15.
- If a third friend had ordered exactly double the first friend order and paid something other than Rs 50, the three bills would contradict one another: no solution.
A system AX = B has one answer when A can be inverted; when A cannot, the bills either repeat each other (infinitely many answers) or contradict each other (none).
Invertible means one answer; singular means none or many.
Revision card
Try to answer each without looking above.
- Define adj A and state the identity relating A, adj A and det A.
- Write the 2 x 2 inverse and the condition for an inverse to exist.
- State det(adj A) and adj(kA) for an n x n matrix.
- How is X found from AX = B and from XA = B?
- List the three outcomes for a linear system and what det A = 0 allows.
- When does a homogeneous system have a non-trivial solution?
Sources and review
Reviewed Reviewed on 2026-11-20: every number recomputed by code and independently reviewed; textbook section references pending.
- Method: Every number in worked examples, recall checks and notes recomputed by code; claims recomputed independently by a separate verifier run using other numerical methods; textbook section references not yet attached; wording defects found were fixed afterwards and re-linted (code checks re-run) but not re-reviewed by a second run; syllabus scope compared with the NTA JEE Main 2026 syllabus text (see content/reviews/scope-audit-2026-11-20.md)
- Reviewer: independent verifier agent run (not the author)
- Date: 2026-11-20
- Defects found: 1; fixed: 1
- Report: content/reviews/learn2-mat-2026-11-20.md
Textbook references
- NCERT Mathematics Part 1, Class 12 (reprint 2026-27), Chapter 4: Determinants, 4.5.1 Adjoint of a matrix (read 2026-11-22)
- NCERT Mathematics Part 1, Class 12 (reprint 2026-27), Chapter 4: Determinants, Summary Summary (read 2026-11-22)
- NCERT Mathematics Part 1, Class 12 (reprint 2026-27), Chapter 4: Determinants, 4.5 Adjoint and Inverse of a Matrix (read 2026-11-22)
- NCERT Mathematics Part 1, Class 12 (reprint 2026-27), Chapter 3: Matrices, 3.7 Invertible Matrices (read 2026-11-22)
- NCERT Mathematics Part 1, Class 12 (reprint 2026-27), Chapter 4: Determinants, 4.6.1 Solution of system of linear equations using inverse of a matrix (read 2026-11-22)
Sources used
- Syllabus: NTA JEE (Main) 2026 syllabus, Mathematics, Unit 3, line id jee-main-2026-U03 in syllabus/lines/jee-main/2026.json
- NCERT Class 12 Mathematics, Matrices and Determinants (read as a reference for scope only; content written fresh for this site, textbook section references still pending)
How labels work: see how answers and lessons are verified. Found a mistake? Use Report an error on any question page.