Skip to content
Part IA Michaelmas, Lent, Easter Term

Linear Simultaneous Equations

The Problem

Solve the system:

{a11x1+a12x2+⋯+a1nxn=b1a21x1+a22x2+⋯+a2nxn=b2⋮am1x1+am2x2+⋯+amnxn=bm\begin{cases} a_{11}x_1 + a_{12}x_2 + \cdots + a_{1n}x_n = b_1 \\ a_{21}x_1 + a_{22}x_2 + \cdots + a_{2n}x_n = b_2 \\ \vdots \\ a_{m1}x_1 + a_{m2}x_2 + \cdots + a_{mn}x_n = b_m \end{cases}

In matrix form: Ax=bA\mathbf{x} = \mathbf{b}.


Gaussian Elimination

Transform to row echelon form:

(a11a12⋯a1n∣b10a22′⋯a2n′∣b2′⋮⋱∣⋮00⋯ank′∣bm′)\begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1n} & | & b_1 \\ 0 & a'_{22} & \cdots & a'_{2n} & | & b'_2 \\ \vdots & & \ddots & & | & \vdots \\ 0 & 0 & \cdots & a'_{nk} & | & b'_m \end{pmatrix}

Row operations:

  1. Swap rows
  2. Multiply row by non-zero scalar
  3. Add multiple of one row to another

Classification of Solutions

Three cases for linear systems: unique solution (lines meet at point), no solution (parallel lines), infinitely many solutions (same line)

CaseConditionSolutions
Uniquedet⁡(A)≠0\det(A) \neq 0 (square)Exactly one
UnderdeterminedRank < number of variablesInfinitely many
OverdeterminedInconsistent equationsNo solutions
Dependent equationsRows linearly dependentRedundant equations

Rank

The rank of AA is:

  • Number of non-zero rows in row echelon form
  • Number of linearly independent rows (or columns)
  • Dimension of the image: rank(A)=dim⁡(im(A))\text{rank}(A) = \dim(\text{im}(A))

Rank theorem:

rank(A)+dim⁡(ker⁡(A))=n\text{rank}(A) + \dim(\ker(A)) = n

(for m×nm \times n matrix)


Example: 2×22 \times 2 System

Solve: {2x+y=53x+2y=8\begin{cases} 2x + y = 5 \\ 3x + 2y = 8 \end{cases}

Matrix form: (2132)(xy)=(58)\begin{pmatrix} 2 & 1 \\ 3 & 2 \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 5 \\ 8 \end{pmatrix}

Row operations: [2 1 ∣ 5][2\ 1\ |\ 5] [3 2 ∣ 8][3\ 2\ |\ 8] →\to subtract 32\frac{3}{2} of row 1 from row 2: [2 1 ∣ 5][2\ 1\ |\ 5] [0 12 ∣ 12][0\ \frac{1}{2}\ |\ \frac{1}{2}] →\to back-substitute: y=1y = 1, then 2x+1=52x + 1 = 5, so x=2x = 2.


Cramer’s Rule

For n×nn \times n system with det⁡(A)≠0\det(A) \neq 0:

xi=det⁡(Ai)det⁡(A)x_i = \frac{\det(A_i)}{\det(A)}

where AiA_i is AA with column ii replaced by b\mathbf{b}.

Impractical for large nn — use Gaussian elimination instead.


Homogeneous Systems

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

  • Always has trivial solution x=0\mathbf{x} = \mathbf{0}
  • Non-trivial solutions exist ⇔\Leftrightarrow det⁡(A)=0\det(A) = 0

Kernel and Image

Kernel: ker⁡(A)={x:Ax=0}\ker(A) = \{\mathbf{x} : A\mathbf{x} = \mathbf{0}\}

Image: im(A)={Ax:x∈Rn}\text{im}(A) = \{A\mathbf{x} : \mathbf{x} \in \mathbb{R}^n\}

Fundamental theorem:

  • ker⁡(A)\ker(A) gives the “freedom” in solutions
  • b∈im(A)\mathbf{b} \in \text{im}(A) is required for solution to exist

Why Linear Systems Matter

  • Engineering: structures, circuits, control systems
  • Economics: input-output models
  • Statistics: regression (least squares)
  • Physics: equilibrium problems, eigenvalue problems

Almost every quantitative problem involves solving linear systems at some stage.