← Mathematics — Std 12
📐

Matrices

Ch. 2Std 12

Easy Overview

Imagine a giant spreadsheet of numbers — rows and columns, neat and organised. That's a matrix. On its own, it looks boring. But matrices are actually one of the most powerful tools in all of mathematics. They're used to solve systems of equations in seconds, rotate 3D objects in computer graphics, encode and decode secret messages in cryptography, run neural networks in AI, model economic systems, and even simulate quantum mechanics. Every time you see a CGI explosion in a movie or play a 3D video game, matrices are doing the heavy lifting behind the scenes. So what exactly is a matrix? It's simply a rectangular arrangement of numbers enclosed in brackets. The numbers inside are called entries or elements. The size (or order) of a matrix is given as rows × columns — so a 2×3 matrix has 2 rows and 3 columns. We use capital letters like A, B, C to name matrices, and the entry in the i-th row and j-th column is written as aᵢⱼ. We'll start with the different types of matrices you need to know: row matrix (just one row), column matrix (one column), square matrix (same rows and columns), diagonal matrix (non-zero only on the diagonal), scalar matrix (diagonal with all equal entries), identity matrix (1s on the diagonal, 0s elsewhere), zero matrix (all zeros), upper triangular, lower triangular, symmetric (A = Aᵀ), and skew-symmetric (Aᵀ = −A). Each type has special properties that make calculations easier. Then comes matrix operations — addition, subtraction, and scalar multiplication are straightforward (just do the same thing to every entry). But matrix multiplication? That's where things get interesting. To multiply two matrices, the number of columns in the first must equal the number of rows in the second. The entry at position (i,j) in the result is the dot product of row i from the first matrix with column j from the second. And here's the weird part: in general, AB ≠ BA. Matrix multiplication is NOT commutative. This is a big deal — it means order matters. You'll also learn about the transpose of a matrix (flip rows and columns), which has properties like (Aᵀ)ᵀ = A and (AB)ᵀ = BᵀAᵀ. Determinants are next — a special number calculated from a square matrix that tells you important things like whether the matrix has an inverse. For a 2×2 matrix, the determinant is ad − bc. For a 3×3 matrix, you expand using minors and cofactors. Properties of determinants — like swapping rows flips the sign, multiplying a row by a scalar multiplies the determinant — can save you a lot of calculation time. The adjoint of a matrix is the transpose of the cofactor matrix, and the inverse A⁻¹ = (adj A) / |A|. If |A| = 0, the matrix is singular and has no inverse — it's like division by zero. Finally, you'll use all of this to solve systems of linear equations. Write the system as AX = B, where A is the coefficient matrix, X is the variable matrix, and B is the constant matrix. Then X = A⁻¹B. Bam — one formula solves it all. You'll also learn elementary row operations and the rank of a matrix as alternative methods. By the end of this chapter, you'll be able to solve any system of linear equations, find inverses of matrices up to 3×3, and understand how matrices power the algorithms behind modern technology.

Definition and Order of a Matrix

A matrix is a rectangular array of numbers arranged in rows and columns. The order (or dimension) is given as m × n, where m is the number of rows and n is the number of columns. A matrix A of order m × n has entries aᵢⱼ where i = 1,...,m and j = 1,...,n. We write A = [aᵢⱼ]ₘₓₙ. The plural of matrix is matrices. Don't mix up rows and columns — rows go left to right, columns go top to bottom.

Types of Matrices — Row, Column, Square, and More

Row matrix: 1 × n (one row). Column matrix: m × 1 (one column). Square matrix: m = n (same rows and columns). Diagonal matrix: square with non-zero entries only on the main diagonal. Scalar matrix: diagonal where all diagonal entries are equal. Identity matrix I: diagonal with all 1s on the diagonal. Zero matrix O: all entries are 0. Upper triangular: all entries below the diagonal are 0. Lower triangular: all entries above the diagonal are 0. Each type has distinct properties.

Symmetric and Skew-Symmetric Matrices

A square matrix A is symmetric if Aᵀ = A, meaning aᵢⱼ = aⱼᵢ. The matrix is symmetric about the main diagonal. Example: [1 2; 2 3]. A is skew-symmetric if Aᵀ = −A, meaning aᵢⱼ = −aⱼᵢ. The diagonal entries of a skew-symmetric matrix are always 0 (since aᵢᵢ = −aᵢᵢ ⇒ aᵢᵢ = 0). Any square matrix can be expressed as the sum of a symmetric and a skew-symmetric matrix: A = ½(A + Aᵀ) + ½(A − Aᵀ).

Matrix Addition and Subtraction

Two matrices can be added or subtracted only if they have the SAME order. Add (or subtract) corresponding entries: if A = [aᵢⱼ] and B = [bᵢⱼ], then A + B = [aᵢⱼ + bᵢⱼ] and A − B = [aᵢⱼ − bᵢⱼ]. Properties: commutative (A + B = B + A), associative (A + (B + C) = (A + B) + C), additive identity (A + O = A), additive inverse (A + (−A) = O). Simple as matching positions.

Scalar Multiplication

Multiply every entry of the matrix by the scalar (number). If k is a scalar and A = [aᵢⱼ], then kA = [k·aᵢⱼ]. Properties: k(A + B) = kA + kB, (k₁ + k₂)A = k₁A + k₂A, (k₁k₂)A = k₁(k₂A), 1·A = A. Think of it as scaling the entire matrix up or down.

Matrix Multiplication — The Big One

Multiply A (m × n) and B (n × p): the number of columns of A must equal the number of rows of B. The result C = AB has order m × p. Entry cᵢⱼ = Σ aᵢₖ × bₖⱼ (sum over k = 1 to n). In plain English: take row i from A and column j from B, multiply corresponding entries and add them up. Properties: associative (AB)C = A(BC), distributive A(B+C) = AB + AC. NOT commutative: AB ≠ BA in general. The order of multiplication is crucial.

Transpose of a Matrix

The transpose Aᵀ of an m × n matrix A is an n × m matrix obtained by interchanging rows and columns. Row i becomes column i. Properties: (Aᵀ)ᵀ = A, (A + B)ᵀ = Aᵀ + Bᵀ, (kA)ᵀ = kAᵀ, (AB)ᵀ = BᵀAᵀ (note the reverse order!). Transpose is used to define symmetric (A = Aᵀ) and skew-symmetric (A = −Aᵀ) matrices.

Determinant of a Matrix

A determinant is a scalar value associated with a square matrix. For a 2×2 matrix A = [a b; c d], |A| = ad − bc. For a 3×3 matrix, expand along any row or column using minors and cofactors. Minor Mᵢⱼ is the determinant of the submatrix after removing row i and column j. Cofactor Cᵢⱼ = (−1)ⁱ⁺ʲ Mᵢⱼ. Then |A| = Σ aᵢⱼ Cᵢⱼ along any row or column. The determinant tells you if the matrix is invertible (non-zero) or singular (zero).

Properties of Determinants

These save you massive calculation time. (1) |Aᵀ| = |A|. (2) Swapping two rows/columns flips the sign. (3) Multiplying a row by k multiplies the determinant by k. (4) Adding a multiple of one row to another doesn't change the determinant. (5) If two rows are identical or proportional, |A| = 0. (6) |AB| = |A||B|. (7) |kA| = kⁿ|A| for an n×n matrix. Use these to simplify before expanding.

Adjoint of a Matrix

The adjoint (or adjugate) of a square matrix A is the transpose of the cofactor matrix. First find the cofactor matrix [Cᵢⱼ] where Cᵢⱼ = (−1)ⁱ⁺ʲ Mᵢⱼ. Then take its transpose: adj A = [Cⱼᵢ]. Property: A·(adj A) = (adj A)·A = |A|·I. This is the key relationship that leads to the inverse formula.

Inverse of a Matrix

A⁻¹ exists only if |A| ≠ 0 (non-singular). Formula: A⁻¹ = (adj A) / |A|. For a 2×2 matrix A = [a b; c d], A⁻¹ = (1/(ad−bc)) [d −b; −c a]. Properties: (A⁻¹)⁻¹ = A, (AB)⁻¹ = B⁻¹A⁻¹, (Aᵀ)⁻¹ = (A⁻¹)ᵀ, |A⁻¹| = 1/|A|. The inverse is the 'undo' button — multiply a matrix by its inverse and you get the identity matrix.

Elementary Row Operations

Three types of operations on rows that don't change the solution set: (1) Swap two rows Rᵢ ↔ Rⱼ. (2) Multiply a row by a non-zero scalar k: Rᵢ → kRᵢ. (3) Add a multiple of one row to another: Rᵢ → Rᵢ + kRⱼ. These are used to find inverses (by reducing [A|I] to [I|A⁻¹]) and to solve systems (Gaussian elimination). Column operations work the same way for column transformations.

Solving Systems of Linear Equations — Matrix Method

Write the system as AX = B, where A is the coefficient matrix, X is the column matrix of variables, and B is the column matrix of constants. If |A| ≠ 0, then X = A⁻¹B. This gives a unique solution. Steps: find |A|, find adj A, find A⁻¹ = (adj A)/|A|, multiply A⁻¹B to get X. This method works for any number of equations (as long as A is square and non-singular).

Solving Systems — Rank Method

When |A| = 0 or the system isn't square, use rank. The rank of a matrix is the number of non-zero rows in its row echelon form. For a system AX = B, form the augmented matrix [A|B]. If rank(A) = rank([A|B]) = number of variables, there's a unique solution. If rank(A) = rank([A|B]) < number of variables, infinite solutions exist. If rank(A) ≠ rank([A|B]), the system is inconsistent (no solution).

Consistency of Systems

A system of equations can be: consistent with a unique solution (|A| ≠ 0), consistent with infinitely many solutions (|A| = 0 but rank condition holds), or inconsistent (no solution, rank condition fails). For homogeneous systems (B = O), there's always the trivial solution X = O. Non-trivial solutions exist if |A| = 0. This is crucial for understanding whether equations have one answer, many answers, or none at all.

Application — Cramer's Rule

Cramer's rule solves AX = B using determinants. For variable xᵢ: xᵢ = |Aᵢ| / |A|, where Aᵢ is A with column i replaced by B. Works for any square system with |A| ≠ 0. For two equations: x = |D₁|/|D|, y = |D₂|/|D| where D = [a₁ b₁; a₂ b₂], D₁ = [c₁ b₁; c₂ b₂], D₂ = [a₁ c₁; a₂ c₂]. Cramer's rule is elegant but computationally expensive for large systems.

Key Points

  • •Order of matrix = rows × columns (m × n)
  • •Symmetric: Aᵀ = A (aᵢⱼ = aⱼᵢ); Skew-symmetric: Aᵀ = −A (aᵢᵢ = 0)
  • •Matrix addition/subtraction requires SAME order — add corresponding entries
  • •Scalar multiplication: multiply every entry by the scalar
  • •For AB to exist: columns of A = rows of B; result has rows of A × columns of B
  • •Matrix multiplication is NOT commutative: AB ≠ BA in general
  • •Transpose: (AB)ᵀ = BᵀAᵀ — note the reversal
  • •Determinant of 2×2 [a b; c d] = ad − bc
  • •|AB| = |A||B| — determinant of a product is the product of determinants
  • •|kA| = kⁿ|A| for an n×n matrix
  • •A·(adj A) = (adj A)·A = |A|·I
  • •A⁻¹ exists iff |A| ≠ 0; formula: A⁻¹ = (adj A) / |A|
  • •(AB)⁻¹ = B⁻¹A⁻¹ — inverse reverses order
  • •AX = B ⇒ X = A⁻¹B (if |A| ≠ 0) — master formula for solving systems
  • •Three elementary row operations: swap, multiply by scalar, add multiple of another row
  • •Rank(A) = rank([A|B]) = n ⇒ unique solution; < n ⇒ infinite; ranks differ ⇒ no solution
  • •Homogeneous system AX = O: always has trivial solution; non-trivial if |A| = 0
  • •Cramer's rule: xᵢ = |Aᵢ| / |A| for each variable

Practice Questions

  • If A = [2 3; 1 −4] and B = [0 1; 2 5], find 3A − 2B and verify (Aᵀ)ᵀ = A.
  • Find AB and BA for A = [1 2; 3 4], B = [2 0; 1 3]. Is AB = BA? Comment.
  • Find the inverse of A = [3 1; 5 2] using the adjoint method.
  • Solve the system using matrices: 2x + 3y = 8, x − 2y = −3.
  • If A = [1 2 3; 2 3 4; 3 4 5], show that |A| = 0. What does this mean about the inverse?
  • Using elementary row operations, find the inverse of A = [1 2; 3 5].
  • For what value of k does the system x + 2y = 3, 2x + ky = 6 have (i) unique solution (ii) infinite solutions (iii) no solution?
  • Express A = [3 5; 1 2] as the sum of a symmetric and a skew-symmetric matrix.