A system of equations is said to be consistent if there is at least one solution; it is inconsistent if there are no solutions.
A linear system is inconsistent if and only if the reduced row-echelon form of its augmented matrix contains the row [ 0 0 ... 0 | 1], representing the equation 0 = 1.
If a linear system is consistent, then it has either
- infinitely many solutions (if there is at least one free variable), or
- exactly one solution (if all the variables are leading).
The rank of a matrix A is the number of leading 1s in rref(A).
A linear system with fewer equations than unknowns has either no solutions or infinitely many solutions.
A linear system of n equations in n variables has a unique solution if and only if the rank of its coefficient matrix A is n.