Skip to content

Applied Mathematics · Ch 2 — Algebra

Unit Summary

2.10

Unit Summary

This section pulls together the core definitions, properties and formulae of the Algebra unit of CBSE Class 12 Applied Mathematics (subject code 241) — matrices, their operations, determinants and their applications — as a single quick-revision recap for board-exam and previous-year-paper practice.

Matrices and their types

  • Matrix: A rectangular arrangement of numbers, symbols, expressions or functions set out in rows and columns is a matrix (plural matrices); each entry in the arrangement is an element of the matrix.
  • Notation and order: A matrix is named with a capital letter, A=[aij]A = [a_{ij}], where aija_{ij} is the element in the iith row and jjth column, with 1≤i≤m1 \le i \le m and 1≤j≤n1 \le j \le n. If AA has mm rows and nn columns, the expression m×nm \times n is its order. The entries aija_{ij} with i=ji = j (that is a11,a22,a33,…a_{11}, a_{22}, a_{33}, \dots) form the diagonal; entries with i≠ji \ne j are the non-diagonal elements.
  • Rectangular matrix: the number of rows is not equal to the number of columns.
  • Square matrix: the number of rows equals the number of columns.
  • Row matrix: exactly one row. Column matrix: exactly one column.
  • Diagonal matrix: a square matrix whose non-diagonal entries are all zero, i.e. aij=0a_{ij} = 0 for all i≠ji \ne j.
  • Scalar matrix: a diagonal matrix whose diagonal entries are all equal, i.e. aij=ka_{ij} = k for all i=ji = j, with k≠0k \ne 0.
  • Identity (unit) matrix: a scalar matrix whose diagonal entries are all 11, i.e. aij=1a_{ij} = 1 for all i=ji = j; denoted II.
  • Zero matrix: every element is zero, i.e. aij=0a_{ij} = 0; denoted OO.
  • Equal matrices: two matrices A=[aij]A = [a_{ij}] and B=[bij]B = [b_{ij}] of the same order m×nm \times n are equal when each corresponding element agrees, i.e. aij=bija_{ij} = b_{ij} for every 1≤i≤m, 1≤j≤n1 \le i \le m,\ 1 \le j \le n.

Algebra of matrices

  • Scalar multiplication: for a scalar kk, kA=k[aij]=[k aij]kA = k[a_{ij}] = [k\,a_{ij}] — every element is multiplied by kk. Scalar multiplication distributes both ways: k(A+B)=kA+kBk(A + B) = kA + kB and (k+p)A=kA+pA(k + p)A = kA + pA.
  • Negative of a matrix: for a non-zero matrix AA, the matrix −A-A of the same order satisfies A+(−A)=OA + (-A) = O, where OO is the zero matrix; it is the additive inverse of AA.
  • Addition: for A=[aij]A = [a_{ij}] and B=[bij]B = [b_{ij}] of the same order, the sum is S=A+B=[sij]S = A + B = [s_{ij}] with sij=aij+bijs_{ij} = a_{ij} + b_{ij}.
  • Properties of addition: matrices can be added only when they share the same order, and the result keeps that order. Addition is commutative (A+B=B+AA + B = B + A) and associative (A+(B+C)=(A+B)+CA + (B + C) = (A + B) + C); the zero matrix OO is the additive identity (A+O=O+A=AA + O = O + A = A); and −A-A is the additive inverse (A+(−A)=OA + (-A) = O).
  • Subtraction: the difference is D=A−B=[dij]D = A - B = [d_{ij}] with dij=aij−bijd_{ij} = a_{ij} - b_{ij} (same order).
  • Multiplication: for A=[aij]A = [a_{ij}] of order m×nm \times n and B=[bjk]B = [b_{jk}] of order n×pn \times p, the product P=AB=[pik]P = AB = [p_{ik}] has order m×pm \times p; each entry pairs the iith row of AA with the kkth column of BB: pik=ai1b1k+ai2b2k+ai3b3k+⋯+ainbnkp_{ik} = a_{i1}b_{1k} + a_{i2}b_{2k} + a_{i3}b_{3k} + \dots + a_{in}b_{nk}.
  • Properties of multiplication: matrix multiplication is associative, (AB)C=A(BC)(AB)C = A(BC), and distributive over addition and subtraction, A(B+C)=AB+ACA(B + C) = AB + AC and A(B−C)=AB−ACA(B - C) = AB - AC, whenever the products are defined.
  • Multiplicative identity: for a square matrix AA of order m×mm \times m there is an identity matrix II of the same order with IA=AI=AIA = AI = A.

Transpose, symmetric and skew-symmetric matrices

  • Transpose: interchanging the rows and columns of AA (order m×nm \times n) gives its transpose A′A' of order n×mn \times m.
  • Transpose properties: (A′)′=A(A')' = A; (kA)′=kA′(kA)' = kA' for any constant kk; (A+B)′=A′+B′(A + B)' = A' + B'; and (AB)′=B′A′(AB)' = B'A'.
  • Symmetric matrix: a square matrix with A′=AA' = A. Skew-symmetric matrix: a square matrix with A′=−AA' = -A.
  • For any square matrix AA with real entries, A+A′A + A' is a symmetric matrix and A−A′A - A' is a skew-symmetric matrix.

Determinants

  • Determinant: a rule that assigns to each square matrix a single number ∣A∣|A| (real or complex) — formally a function ff with f(A)=kf(A) = k.
  • Minor: the minor MijM_{ij} of element aija_{ij} is the determinant left after deleting the iith row and jjth column in which aija_{ij} lies.
  • Cofactor: the cofactor of aija_{ij}, written AijA_{ij} or CijC_{ij}, is Aij=(−1)i+jMijA_{ij} = (-1)^{i+j} M_{ij}, where MijM_{ij} is the minor of aija_{ij}.
  • Adjoint: the adjoint adj⁡A\operatorname{adj} A is the transpose of the matrix of cofactors of the square matrix AA.
  • Adjoint properties: for a square matrix AA of order nn, A(adj⁡A)=(adj⁡A) A=∣A∣ IA(\operatorname{adj} A) = (\operatorname{adj} A)\,A = |A|\,I (with II the identity of order nn), and ∣adj⁡(A)∣=∣A∣ n−1|\operatorname{adj}(A)| = |A|^{\,n-1}.
  • Singular / non-singular: AA is singular when ∣A∣=0|A| = 0 and non-singular when ∣A∣≠0|A| \ne 0. …