54. Linear System Solutions

A linear system 𝐴𝑥=𝑏 has exactly one of three outcomes:

  1. Unique solution — exactly one 𝑥 satisfies the system
  2. No solution — the system is inconsistent
  3. Infinitely many solutions — the system is underdetermined

The REF (or RREF) of the augmented matrix [𝐴|𝑏] tells you which case you’re in.

54.1. 1. Unique solution

Every column of 𝐴 has a pivot, no free variables, and no inconsistency:

[1𝑎12𝑎13𝑎14𝑏101𝑎23𝑎24𝑏2001𝑎34𝑏30001𝑏4]

Equivalently: rank(𝐴)=rank([𝐴|𝑏])=𝑛 (the number of unknowns).

54.2. 2. No solution (inconsistent)

A row of the form [0,0,,0|𝑐] with 𝑐0 — translates to “0=𝑐” which is impossible.

[113001]

The second row says 0𝑥+0𝑦=1. No 𝑥 satisfies this.

Equivalently: rank(𝐴)<rank([𝐴|𝑏]).

54.3. 3. Infinitely many solutions (free variables)

Some columns of 𝐴 have no pivot — those correspond to free variables you can set arbitrarily; the pivot variables are determined by them.

[1𝑎120𝑎14𝑏1001𝑎24𝑏20000000000]

Columns 2 and 4 have no pivot → 𝑥2,𝑥4 are free.

Equivalently: rank(𝐴)=rank([𝐴|𝑏])<𝑛. The solution set is an affine subspace of dimension 𝑛rank(𝐴) — see Rank–Nullity.

54.4. Rouché–Capelli summary

CaseRank conditionSolution set
Uniquerank(𝐴)=rank([𝐴|𝑏])=𝑛single point
Nonerank(𝐴)<rank([𝐴|𝑏])empty
Infiniterank(𝐴)=rank([𝐴|𝑏])<𝑛affine subspace of dim 𝑛rank(𝐴)

54.5. See also