4.2Homogeneous systems Ax = 0
The idea
A homogeneous system Ax = 0 always has the zero solution. The only question is whether there are others.
Think of it like this: A seesaw in balance: sitting still is always balanced; you only ask if any other arrangement also balances.
Why it exists
It links independence of columns, determinants and null spaces.
How it works
- Ax = 0 is always consistent (x = 0 works).
- Non-trivial solutions exist ⇔ rank A < n (⇔ the columns are dependent).
- For square A this means det A = 0.
- If there are more unknowns than equations (n > m), non-trivial solutions always exist.
Worked example: The matrix with rows (1,2,3), (4,5,6), (7,8,9)
Its rank is 2 < 3, so there is a non-trivial solution, found as the null-space vector (1, −2, 1).
Now play with it
- →Compare the homogeneous examples: one has only x = 0, the other has a line of solutions.
- →Try the 2 × 4 example: more unknowns than equations.
| 1 | 2 | 3 | 0 |
| 4 | 5 | 6 | 0 |
| 7 | 8 | 9 | 0 |
- R2 ← R2 − (4)·R1
- R3 ← R3 − (7)·R1
- R2 ← R2 / -3
- R1 ← R1 − (2)·R2
- R3 ← R3 − (-6)·R2
rank A = rank [A | b] = 2 < 3: 1 free variable(s).
| 0 |
| 0 |
| 0 |
| 1 |
| -2 |
| 1 |
Check yourself
A is 3 × 5. The system Ax = 0 has
Exam notes (the dense version)
x = 0 is always a solution (the system is always consistent). A non-trivial solution exists exactly when rank A < n, that is, when the columns are dependent. For a square A this means det A = 0. If there are more unknowns than equations (n > m), non-trivial solutions always exist, and they form a space of dimension at least n − m.
Previous year questions: Systems of Linear Equations (5)
PYQs are grouped by topic, so this is the full set for Systems of Linear Equations; try the ones that match this subtopic. Open all 5 on the topic page.