← Mathematics — Std 11
📐

Determinants and Matrices

Ch. 4Std 11

Easy Overview

Matrices and determinants might look like a bunch of numbers in neat boxes, but they're actually one of the most powerful tools ever invented. Need to solve a system of equations with three variables? Matrices make it systematic. Want to rotate a shape in computer graphics? That's a matrix multiplication. Ever wondered how search engines rank web pages? The mathematics behind it involves eigenvalues — a more advanced matrix concept. Let's start with the basics. A matrix is a rectangular arrangement of numbers in rows and columns. We denote its size as m × n (rows × columns). That's it — just a tidy way to organise data. A 2×3 matrix has 2 rows and 3 columns. We refer to individual elements by their position: aᵢⱼ is the entry in row i, column j. There are various types of matrices: row matrices (one row), column matrices (one column), square matrices (same number of rows and columns), diagonal matrices (non-zero only on the diagonal), identity matrices (1s on the diagonal, 0s elsewhere), zero matrices (all zeros), symmetric matrices (A = Aᵀ), and skew-symmetric matrices (A = −Aᵀ). Each type has special properties that become important in different contexts. Matrix operations are straightforward. Addition and subtraction are element-wise — you just add or subtract matching positions. Scalar multiplication multiplies every entry by that number. Matrix multiplication is more involved: you take the dot product of each row of the first matrix with each column of the second. Crucially, AB is NOT generally equal to BA — matrix multiplication doesn't commute. A determinant is a single number associated with a square matrix. For a 2×2 matrix [[a, b], [c, d]], the determinant is ad − bc. For a 3×3 matrix, you expand using minors and cofactors. The determinant tells you important things: if det(A) = 0, the matrix is singular (not invertible). If det(A) ≠ 0, the matrix is invertible and you can find its inverse. The inverse of a matrix A, written A⁻¹, satisfies A × A⁻¹ = I. For a 2×2 matrix, there's a simple formula: swap a and d, negate b and c, and divide by the determinant. For larger matrices, you use the adjoint method or row operations. The inverse is invaluable for solving systems of linear equations: Ax = b becomes x = A⁻¹b. Cramer's rule provides an alternative way to solve linear systems using determinants. It's elegant but computationally expensive for large systems — fine for 2×2 and 3×3, impractical beyond that. By the end, you'll be comfortable with matrix operations, able to calculate determinants and inverses, and know how to use them to solve real problems. These skills open doors to linear algebra, which is the language of machine learning, quantum mechanics, and much more.

Definition and order of a matrix

A matrix is a rectangular array of numbers enclosed in brackets (round or square). If it has m rows and n columns, its order or dimension is m × n. For example, a matrix with 2 rows and 3 columns is a 2×3 matrix. The number of entries is m × n. Individual entries are denoted aᵢⱼ where i is the row and j is the column. Matrices are usually denoted by capital letters (A, B, C) and entries by corresponding lowercase letters.

Types of matrices — a classification guide

Row matrix: only one row (1×n). Column matrix: only one column (m×1). Square matrix: same number of rows and columns (n×n). Diagonal matrix: a square matrix with non-zero entries only on the main diagonal. Scalar matrix: a diagonal matrix where all diagonal entries are equal. Identity matrix (I): diagonal matrix with all diagonal entries = 1. Zero matrix (O): all entries are 0. Each type has special algebraic properties.

Equality of matrices

Two matrices are equal if and only if they have the same order AND every corresponding entry is equal. So A = B means aᵢⱼ = bᵢⱼ for all i, j. You can't compare a 2×2 matrix with a 2×3 matrix — they're automatically not equal because their orders differ. This concept comes up when you solve matrix equations with unknown entries.

Addition and subtraction of matrices

You can only add or subtract matrices of the same order. Simply add or subtract the corresponding entries: (A ± B)ᵢⱼ = aᵢⱼ ± bᵢⱼ. Matrix addition is commutative (A + B = B + A) and associative (A + B) + C = A + (B + C). The zero matrix acts as the additive identity: A + O = A. Every matrix has an additive inverse: A + (−A) = O.

Scalar multiplication

Multiplying a matrix by a scalar (a real number) means multiplying every entry by that number: (kA)ᵢⱼ = k·aᵢⱼ. Scalar multiplication is distributive: k(A + B) = kA + kB and (k₁ + k₂)A = k₁A + k₂A. It's associative with scalars: k₁(k₂A) = (k₁k₂)A. This operation is used to scale transformations and in formula derivations.

Matrix multiplication — the dot product dance

If A is m×n and B is n×p, their product AB exists and is m×p. Entry (i,j) of AB = ∑ aᵢₖ·bₖⱼ (k from 1 to n) — essentially the dot product of row i of A with column j of B. The inner dimensions (n) must match. Matrix multiplication is associative and distributive over addition, but NOT commutative: AB ≠ BA in general. It can even be that AB exists but BA doesn't.

Properties of matrix multiplication

Key properties: (AB)C = A(BC) — associativity. A(B + C) = AB + AC and (A + B)C = AC + BC — distributivity. But AB ≠ BA generally (non-commutative). AB = O doesn't imply A = O or B = O (zero product property doesn't hold). AB = AC doesn't imply B = C (cancellation doesn't hold). These quirks make matrix algebra different from regular number algebra.

Transpose of a matrix

The transpose of an m×n matrix A, written Aᵀ or A', is the n×m matrix obtained by swapping rows and columns: (Aᵀ)ᵢⱼ = Aⱼᵢ. Properties: (Aᵀ)ᵀ = A, (A + B)ᵀ = Aᵀ + Bᵀ, (kA)ᵀ = kAᵀ, (AB)ᵀ = BᵀAᵀ (note the reversed order!). The transpose is used to define symmetric matrices and is crucial in many advanced applications.

Symmetric and skew-symmetric matrices

A square matrix A is symmetric if Aᵀ = A, meaning aᵢⱼ = aⱼᵢ for all i, j. The matrix is symmetric about its main diagonal. A matrix is skew-symmetric if Aᵀ = −A, meaning aᵢⱼ = −aⱼᵢ and the diagonal entries must be 0. Any square matrix can be expressed as the sum of a symmetric and a skew-symmetric matrix: A = ½(A + Aᵀ) + ½(A − Aᵀ).

Determinant of 2×2 and 3×3 matrices

For a 2×2 matrix A = [[a, b], [c, d]], det(A) = ad − bc. For 3×3, expand using the first row: det(A) = a₁₁·M₁₁ − a₁₂·M₁₂ + a₁₃·M₁₃, where Mᵢⱼ is the minor (determinant after deleting row i and column j). The signs alternate: +, −, + for row 1. You can expand along any row or column; the result is the same. This is called Laplace expansion.

Minors and cofactors

The minor Mᵢⱼ of entry aᵢⱼ is the determinant of the matrix obtained by deleting row i and column j. The cofactor Cᵢⱼ = (−1)^(i+j) × Mᵢⱼ. The (−1)^(i+j) gives the alternating sign pattern (+, −, +; −, +, −; +, −, + for a 3×3). The determinant can then be expressed as ∑ aᵢⱼ·Cᵢⱼ along any row or column. Cofactors are also used to find the adjoint and inverse.

Properties of determinants — shortcuts and insights

Key properties: (1) If two rows (or columns) are swapped, det flips sign. (2) If two rows are identical, det = 0. (3) If a row is multiplied by k, det is multiplied by k. (4) Adding a multiple of one row to another doesn't change det. (5) det(Aᵀ) = det(A). (6) det(AB) = det(A)·det(B). (7) det(kA) = kⁿ·det(A) for n×n matrix. These properties let you compute determinants faster and prove theoretical results.

Singular and non-singular matrices

A square matrix is singular if its determinant is 0. A non-singular matrix has a non-zero determinant. Singular matrices: have no inverse, their rows/columns are linearly dependent, and the system Ax = 0 has non-trivial solutions. Non-singular matrices: have an inverse, their rows/columns are linearly independent, and the system Ax = 0 has only the trivial solution x = 0.

Adjoint of a matrix

The adjoint of a square matrix A, written adj(A), is the transpose of the cofactor matrix. Steps: (1) calculate all cofactors Cᵢⱼ, (2) form the cofactor matrix [Cᵢⱼ], (3) take its transpose. For a 2×2 matrix A = [[a, b], [c, d]], adj(A) = [[d, −b], [−c, a]]. The adjoint is a key stepping stone to finding the inverse.

Inverse of a matrix

For a non-singular matrix A, its inverse A⁻¹ = (1/det(A)) × adj(A). So A × A⁻¹ = A⁻¹ × A = I. For 2×2: if A = [[a, b], [c, d]], then A⁻¹ = (1/(ad−bc)) × [[d, −b], [−c, a]]. The inverse exists only if det(A) ≠ 0. The inverse is unique: if it exists, there's exactly one matrix that satisfies the definition.

Solving linear equations using matrix methods

A system of linear equations can be written in matrix form as AX = B, where A is the coefficient matrix, X is the column of variables, and B is the column of constants. If A is non-singular, the solution is X = A⁻¹B. For 2×2 and 3×3 systems, this is often the most systematic approach. Always check your answer by substituting back into the original equations.

Cramer's rule — solving systems with determinants

Cramer's rule solves AX = B using determinants. For a 2×2 system: x = det(Aₓ)/det(A) and y = det(A_y)/det(A), where Aₓ is A with the first column replaced by B, and A_y is A with the second column replaced by B. For 3×3, you do the same with each variable. Cramer's rule is elegant but computationally heavy — it involves computing (n+1) determinants for an n-variable system.

Key Points

  • •A matrix of order m×n has m rows and n columns
  • •Matrix addition: same order, add corresponding entries
  • •Scalar multiplication: multiply every entry by the scalar
  • •Matrix multiplication: (m×n)(n×p) = m×p; row i × column j, dot product
  • •AB ≠ BA in general — matrix multiplication does not commute
  • •(Aᵀ)ᵀ = A, (AB)ᵀ = BᵀAᵀ
  • •Symmetric: Aᵀ = A; Skew-symmetric: Aᵀ = −A
  • •Determinant of 2×2: ad − bc
  • •det(AB) = det(A)·det(B)
  • •Swapping two rows flips the sign of the determinant
  • •Matrix is singular iff det(A) = 0
  • •A⁻¹ = adj(A)/det(A) — exists only if det(A) ≠ 0
  • •For 2×2 inverse: swap a,d; negate b,c; divide by det
  • •Cramer's rule: x = det(Aₓ)/det(A), etc.
  • •System AX = B → solution X = A⁻¹B if A is non-singular

Practice Questions

  • Find the determinant of the 3×3 matrix [[1, 2, 3], [4, 5, 6], [7, 8, 10]] using expansion of minors.
  • If A = [[1, 3], [2, 7]], find A⁻¹ and verify that A·A⁻¹ = I.
  • Prove that the determinant of a matrix with two proportional rows is zero.
  • Solve the system: 2x + 3y = 7, 3x + 5y = 11 using both Cramer's rule and the matrix inverse method.
  • If A and B are square matrices of order 2, show that det(AB) = det(A)·det(B) with an example.
  • Find the values of x for which the matrix [[x, 2], [4, x]] is singular.
  • Express the matrix [[1, 4], [5, 6]] as the sum of a symmetric and a skew-symmetric matrix.
  • Solve the system using matrices: x + y + z = 6, 2x − y + z = 3, x + 2y − z = 2.