The Problem
Solve the system:
⎩⎨⎧a11x1+a12x2+⋯+a1nxn=b1a21x1+a22x2+⋯+a2nxn=b2⋮am1x1+am2x2+⋯+amnxn=bm
In matrix form: Ax=b.
Gaussian Elimination
Transform to row echelon form:
a110⋮0a12a22′0⋯⋯⋱⋯a1na2n′ank′∣∣∣∣b1b2′⋮bm′
Row operations:
- Swap rows
- Multiply row by non-zero scalar
- Add multiple of one row to another
Classification of Solutions

| Case | Condition | Solutions |
|---|
| Unique | det(A)=0 (square) | Exactly one |
| Underdetermined | Rank < number of variables | Infinitely many |
| Overdetermined | Inconsistent equations | No solutions |
| Dependent equations | Rows linearly dependent | Redundant equations |
Rank
The rank of A 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))
Rank theorem:
rank(A)+dim(ker(A))=n
(for m×n matrix)
Example: 2×2 System
Solve:
{2x+y=53x+2y=8
Matrix form:
(2312)(xy)=(58)
Row operations:
[2 1 ∣ 5]
[3 2 ∣ 8]
→ subtract 23 of row 1 from row 2:
[2 1 ∣ 5]
[0 21 ∣ 21]
→ back-substitute: y=1, then 2x+1=5, so x=2.
Cramer’s Rule
For n×n system with det(A)=0:
xi=det(A)det(Ai)
where Ai is A with column i replaced by b.
Impractical for large n — use Gaussian elimination instead.
Homogeneous Systems
Ax=0
- Always has trivial solution x=0
- Non-trivial solutions exist ⇔ det(A)=0
Kernel and Image
Kernel: ker(A)={x:Ax=0}
Image: im(A)={Ax:x∈Rn}
Fundamental theorem:
- ker(A) gives the “freedom” in solutions
- b∈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.