Class 12 (CBSE) /Mathematics

Matrices & Determinants

Matrices & Determinants · free study notes

Matrices & Determinants

Class 12 – CBSE Mathematics
(For advanced students – MIT‑level treatment with first principles, rigorous proofs, edge cases, and a challenging problem.)


1. Introduction

  • Matrix – an array of numbers (or other algebraic objects) arranged in rows and columns.

    • Notation: (A = [a_{ij}]) where (i) indexes the row and (j) the column.
    • Size: (m \times n) matrix has (m) rows and (n) columns.
  • Determinant – a scalar value associated with a square matrix that encapsulates many of its properties (invertibility, eigenvalues, volume scaling, etc.).

The study of matrices and determinants is central to linear algebra, differential equations, geometry, and many areas of science and engineering.


2. Matrix Operations – First Principles

Operation Definition Domain Notes
Addition ((A+B){ij}=a{ij}+b_{ij}) (m\times n) matrices of same size Bilinear
Scalar multiplication ((cA){ij}=c,a{ij}) (c\in\mathbb{F}) (field)
Multiplication ((AB){ik}=\sum{j=1}^{n} a_{ij}b_{jk}) (A) (m\times n), (B) (n\times p) Associative, not commutative
Transpose ((A^T){ij}=a{ji}) Any (m\times n) ((A^T)^T=A)
Inverse (A^{-1}) such that (AA^{-1}=A^{-1}A=I_m) Only for square (A) with (\det(A)\neq0)
Adjoint (Adjugate) (\operatorname{adj}(A)=) transpose of cofactor matrix Square (n\times n) (A\cdot \operatorname{adj}(A)=\operatorname{adj}(A)\cdot A=\det(A)I_n)
Rank Maximum number of linearly independent rows/columns Any (m\times n) Equals dimension of image of linear map (x\mapsto Ax)
Trace (\operatorname{tr}(A)=\sum_{i=1}^n a_{ii}) Square (n\times n) Linear, invariant under similarity

2.1 Proof of Bilinearity of Determinant

Theorem: For a fixed (n\times n) matrix (A), the determinant (\det(A)) is a multilinear alternating function of the columns (or rows).

Proof Sketch:

  1. Linearity in one column: Expand (\det(A)) by cofactor expansion along that column; each cofactor is independent of that column.
  2. Alternating property: Swapping two columns changes sign because the expansion changes sign in every term.
  3. Uniqueness: Any function satisfying multilinearity and alternation must be a scalar multiple of (\det); normalization on the identity matrix fixes the scalar to 1.

3. Determinants – Theory & Properties

3.1 Definition (Laplace Expansion)

For an (n\times n) matrix (A=[a_{ij}]),

[ \det(A)=\sum_{j=1}^{n} (-1)^{i+j} a_{ij} C_{ij}\quad \text{(expansion along row }i) ]

where (C_{ij}) is the determinant of the ((n-1)\times(n-1)) submatrix obtained by deleting row (i) and column (j).

Edge cases:

  • 1×1 matrix: (\det([a])=a).
  • 0×0 matrix: convention (\det([,])=1) (empty product).

3.2 Cofactor Matrix and Adjugate

  • Cofactor: (C_{ij}=(-1)^{i+j}\det(M_{ij})) where (M_{ij}) is the minor.
  • Adjugate: (\operatorname{adj}(A) = [C_{ji}]) (transpose of cofactor matrix).

Key Identity: [ A,\operatorname{adj}(A)=\operatorname{adj}(A),A=\det(A),I_n ] Proof: Expand ((A,\operatorname{adj}(A))_{ik}) using definition of adjugate; each term is the determinant of a matrix with two identical rows, hence zero unless (i=k).

3.3 Determinant of Product

[ \det(AB)=\det(A)\det(B)\quad \forall, A,B\in M_n(\mathbb{F}) ] Proof: Use multilinearity and the Laplace expansion; or view determinant as the volume scaling factor of the linear map.

3.4 Determinant of Transpose

[ \det(A^T)=\det(A) ] Proof: Cofactor expansion along columns equals expansion along rows due to symmetry of minors.

3.5 Determinant of Upper/Lower Triangular

If (A) is triangular, (\det(A)=\prod_{i=1}^n a_{ii}).

Proof: Expand along the first row; all minors outside the diagonal vanish, leaving product of diagonal entries.

3.6 Invariant under Elementary Row Operations

  • Row swap: (\det) changes sign.
  • Row addition: (\det) unchanged.
  • Row scaling: (\det) multiplied by scalar.

These rules give a practical algorithm: reduce (A) to upper triangular form via elementary operations, keeping track of sign and scalars, then multiply diagonal elements.

3.7 Computing Determinants Efficiently

  • LU decomposition: (A=LU) with (L) unit lower triangular, (U) upper triangular. Then (\det(A)=\prod \text{diag}(U)).
  • Cofactor recursion: (O(n!)) – not efficient for large (n).
  • Gaussian elimination: (O(n^3)).

4. Advanced Topics

4.1 Eigenvalues & Determinant

The

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.