Skip to content
Part IA Michaelmas, Lent, Easter Term

Matrices

Definition

An m×nm \times n matrix is a rectangular array:

A=(a11a12a1na21a22a2nam1am2amn)A = \begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{m1} & a_{m2} & \cdots & a_{mn} \end{pmatrix}

Element aija_{ij} is in row ii, column jj.


Basic Operations

Addition

For m×nm \times n matrices AA and BB:

(A+B)ij=aij+bij(A + B)_{ij} = a_{ij} + b_{ij}

Scalar Multiplication

(λA)ij=λaij(\lambda A)_{ij} = \lambda a_{ij}

Matrix Multiplication

For AA (m×pm \times p) and BB (p×np \times n):

(AB)ij=k=1paikbkj(AB)_{ij} = \sum_{k=1}^{p} a_{ik}b_{kj}

Matrix multiplication showing row i of A times column j of B gives element (i,j) of AB

Condition: Number of columns of AA = number of rows of BB.

Warning: Matrix multiplication is not commutative: ABBAAB \neq BA in general.


Transpose

AijT=AjiA^T_{ij} = A_{ji}

Properties:

  • (AT)T=A(A^T)^T = A
  • (A+B)T=AT+BT(A + B)^T = A^T + B^T
  • (AB)T=BTAT(AB)^T = B^T A^T (reversed order)

Trace

The trace of a square n×nn \times n matrix:

Tr(A)=i=1naii\text{Tr}(A) = \sum_{i=1}^{n} a_{ii}

Properties:

  • Tr(A+B)=Tr(A)+Tr(B)\text{Tr}(A + B) = \text{Tr}(A) + \text{Tr}(B)
  • Tr(λA)=λTr(A)\text{Tr}(\lambda A) = \lambda\,\text{Tr}(A)
  • Tr(AB)=Tr(BA)\text{Tr}(AB) = \text{Tr}(BA) (cyclic property)

Identity Matrix

In=(100010001)I_n = \begin{pmatrix} 1 & 0 & \cdots & 0 \\ 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & 1 \end{pmatrix}

AI=IA=AAI = IA = A for compatible matrices.


Special Types

TypeDefinition
Diagonalaij=0a_{ij} = 0 for iji \neq j
Upper triangularaij=0a_{ij} = 0 for i>ji > j
Lower triangularaij=0a_{ij} = 0 for i<ji < j
SymmetricAT=AA^T = A
AntisymmetricAT=AA^T = -A
OrthogonalATA=IA^T A = I

Complex Matrices

Complex Conjugate

(A)ij=aˉij(A^*)_{ij} = \bar{a}_{ij}

Hermitian Conjugate

A=(AT)A^\dagger = (A^T)^*

Hermitian Matrix

A=AA^\dagger = A

Hermitian matrices have real eigenvalues (important in quantum mechanics).


Representing Linear Maps

A matrix AA (m×nm \times n) represents a linear map RnRm\mathbb{R}^n \to \mathbb{R}^m:

y=Ax\mathbf{y} = A\mathbf{x}

where xRn\mathbf{x} \in \mathbb{R}^n (column vector) and yRm\mathbf{y} \in \mathbb{R}^m.


Example: Rotation Matrix

2D rotation by angle θ\theta:

R(θ)=(cosθsinθsinθcosθ)R(\theta) = \begin{pmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{pmatrix}

Properties:

  • R(θ)R(ϕ)=R(θ+ϕ)R(\theta)R(\phi) = R(\theta + \phi)
  • R(θ)1=R(θ)R(\theta)^{-1} = R(-\theta)
  • det(R)=1\det(R) = 1
  • Orthogonal: RTR=IR^T R = I

Why Matrices Matter

  • Represent linear systems of equations compactly
  • Encode transformations (rotations, scaling, reflections)
  • Essential for computer graphics and physics simulations
  • Foundation for quantum mechanics (operators)