← 🔗 Systems of Linear Equations
Subtopic 1 of 4

4.1Consistency: the rank test

The idea

A system Ax = b has a solution exactly when rank A equals the rank of [A | b]. The ranks and the number of unknowns decide everything.

Think of it like this: A set of clues about one mystery: it has no answer if the clues contradict, one answer if they pin it down, and many if they leave freedom.

Why it exists

This is the standard way to answer "how many solutions does it have?".

How it works

  1. Row reduce the augmented matrix [A | b].
  2. A row [0 … 0 | c] with c ≠ 0 means rank A < rank [A | b]: no solution.
  3. Otherwise, if rank = n: exactly one solution.
  4. Otherwise (rank < n): infinitely many, with n − rank free variables.

Worked example: GATE 2014

Four equations, three unknowns: 3x + 2y = 1, 4x + 7z = 1, x + y + z = 3, x − 2y + 7z = 0. All three ranks are 3, so there is exactly one solution (−11/5, 19/5, 7/5).

Now play with it

  • →Cycle through the three examples (one, infinite, none).
  • →Load the GATE 2014 system and read the two ranks.
Augmented matrix [A | b]
1116
12314
23420
  • R2 ← R2 − (1)·R1
  • R3 ← R3 − (2)·R1
  • R1 ← R1 − (1)·R2
  • R3 ← R3 − (1)·R2
rank A2
rank [A | b]2
unknowns n3
free variables n − rank1
Infinitely many solutions

rank A = rank [A | b] = 2 < 3: 1 free variable(s).

One solution (free variables = 0)
-2
8
0
Add any combination of these (Ax = 0)
1
-2
1
rank A vs rank [A | b]Compared with nResult
equalrank = nexactly one solution
equalrank < ninfinitely many (n − rank free variables)
rank A < rank [A | b]anyno solution

For Ax = 0 the two ranks are always equal, so the system is always consistent: only the trivial solution when rank = n, non-trivial solutions when rank < n.

Check yourself

rank A = 2, rank [A | b] = 3, n = 3. The system has

Remember: Consistent ⇔ rank A = rank [A | b]; then rank = n gives one solution, rank < n gives infinitely many.
Exam notes (the dense version)

Write the system as Ax = b with A of size m×n and the augmented matrix [A | b]. Rouché–Capelli: the system is consistent exactly when rank A = rank [A | b]. Then if the rank equals n there is a unique solution, and if it is less than n there are infinitely many (n − rank free variables). If rank A < rank [A | b] there is no solution.

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.