Matrices & Determinants

Matrices and Determinants form one of the most consistently high-scoring chapters in JEE Main, appearing in 3-4 questions every year. The chapter bridges pure algebra with linear transformations, systems of equations, and geometric interpretations.

A matrix is a rectangular array of numbers arranged in rows and columns. The algebra of matrices includes addition, scalar multiplication, and matrix multiplication, which is associative but not commutative (AB != BA in general). Special matrices include symmetric (A = A^T), skew-symmetric (A = -A^T), orthogonal (AA^T = I), idempotent ($A^{2}$ = A), involutory ($A^{2}$ = I), and nilpotent (A^k = 0) matrices. Every square matrix can be uniquely expressed as the sum of a symmetric and a skew-symmetric matrix: A = (A + A^T)/2 + (A - A^T)/2.

A determinant is a scalar value computed from a square matrix that encodes information about the matrix's invertibility, the volume scaling of associated linear transformations, and the solvability of linear systems. For a 2x2 matrix, det = ad - bc. For 3x3 matrices, cofactor expansion along any row or column yields the same value. Key properties: det(AB) = det(A)det(B), det(A^T) = det(A), det(kA) = k^n det(A) for an n x n matrix, and swapping two rows/columns changes the sign of the determinant.

The adjoint of a matrix is the transpose of its cofactor matrix: adj(A) = C^T. The inverse exists if and only if det(A) != 0, given by A^(-1) = adj(A)/det(A). Critical identities include: A * adj(A) = det(A) * I, det(adj(A)) = det(A)^(n-1), and adj(adj(A)) = det(A)^(n-2) * A.

For solving systems of linear equations, Cramer's Rule applies when the coefficient determinant D != 0. When D = 0, we check D₁, D₂, D₃: if all are zero, infinitely many solutions exist; if any is non-zero, no solution exists. The rank method using row echelon form provides a more general approach.

The key problem-solving concept is recognizing matrix properties (symmetric, orthogonal, idempotent) to simplify computations, using determinant properties to avoid brute-force expansion, and applying the relationship between rank, determinant, and solution existence for linear systems.

---