A system of linear equations is consistent if it has at least one solution. You can tell whether a system is consistent by comparing the information in its coefficient matrix to its augmented matrix, or by reducing it to a simpler form and checking for contradictions. The core idea is straightforward: if the equations don’t contradict each other, the system is consistent.
What “Consistent” Actually Means
A consistent system is one where at least one set of values satisfies every equation simultaneously. That solution might be unique (exactly one answer) or there might be infinitely many answers. Either way, the system is consistent. An inconsistent system, by contrast, has no solution at all because the equations contradict each other.
Think of two lines on a graph. If they cross at a single point, the system is consistent with one solution. If they overlap perfectly (the same line), the system is consistent with infinitely many solutions. If the lines are parallel and never meet, the system is inconsistent.
The Rank Test
The most reliable method comes from a result called the Rouché-Capelli theorem. It says: a system of linear equations is consistent if and only if the rank of the coefficient matrix equals the rank of the augmented matrix.
Here’s what that means in practical terms. The coefficient matrix contains just the numbers in front of your variables. The augmented matrix includes those same numbers plus the constants on the right side of each equation. The rank of a matrix is essentially the number of independent pieces of information it contains, or more precisely, the number of non-zero rows after you reduce it to row echelon form.
If adding the constants column introduces new information (increases the rank), that means the constants are telling the system to do something the coefficients can’t accommodate. That’s a contradiction, and the system is inconsistent. If the rank stays the same, the constants are compatible with the coefficients, and at least one solution exists.
Applying the Rank Test
Start with your system of equations. Write the coefficient matrix (just the variable coefficients) and the augmented matrix (coefficients plus the constants column). Row reduce both to echelon form and count the non-zero rows. If both matrices have the same number of non-zero rows, the system is consistent. If the augmented matrix has more non-zero rows, it’s inconsistent.
In practice, most people just row reduce the augmented matrix once and check the result, since that gives you both ranks at the same time.
Spotting Contradictions in Row Echelon Form
The most common hands-on approach is to row reduce the augmented matrix and look for a specific red flag: a row that reads 0 0 0 … 0 | c, where c is some nonzero number. That row translates to the equation 0 = c, which is impossible. If you see one of those rows, the system is inconsistent. If you don’t, it’s consistent.
For example, suppose you reduce a system to:
- Row 1: 1x + 2y = 5
- Row 2: 0x + 1y = 3
- Row 3: 0x + 0y = 4
Row 3 says 0 = 4. That’s a contradiction, so this system is inconsistent. No values of x and y will satisfy all three original equations.
Now compare that to a system that reduces to:
- Row 1: 1x + 2y = 5
- Row 2: 0x + 1y = 3
- Row 3: 0x + 0y = 0
Row 3 just says 0 = 0, which is always true. No contradiction exists, so the system is consistent.
One Solution vs. Infinitely Many
Once you’ve confirmed a system is consistent, the next question is whether it has exactly one solution or infinitely many. This also comes from the rank test. If the rank of the coefficient matrix equals the number of variables, there is exactly one solution. If the rank is less than the number of variables, there are infinitely many solutions.
The gap between the rank and the number of variables tells you how many free variables the system has. Free variables are the ones you can set to any value, with the remaining variables adjusting accordingly. A system with two free variables, for instance, has a two-parameter family of solutions.
In reduced row echelon form, you can see this directly. Each pivot column corresponds to a variable that’s pinned down. Each non-pivot column corresponds to a free variable. If every variable column has a pivot, the solution is unique. If any columns lack a pivot, you have infinitely many solutions.
Quick Checks for Simple Systems
For small systems (two or three equations), you can often tell consistency without full row reduction.
A 2×2 system (two equations, two unknowns) is consistent unless the left sides are proportional but the right sides aren’t. For instance, x + 2y = 3 and 2x + 4y = 7 is inconsistent: the second equation is just double the first on the left, but 7 ≠ 6 on the right. If the left sides aren’t proportional, the system always has exactly one solution.
For a system with more equations than unknowns, redundancy is common. Extra equations are fine as long as they don’t contradict the others. A system with three equations and two unknowns can still be consistent if one equation is a combination of the other two.
For a system with fewer equations than unknowns, consistency almost always holds, and when it does, you’ll get infinitely many solutions. The only exception is if the equations themselves are contradictory (which is rare when you have fewer equations than variables).
A Step-by-Step Summary
- Write the augmented matrix for your system, with the coefficients on the left and the constants in the last column.
- Row reduce the matrix to echelon form using elementary row operations.
- Check for contradiction rows of the form [0 0 … 0 | c] where c ≠ 0. If one exists, the system is inconsistent.
- If no contradiction exists, the system is consistent. Count the pivots: if every variable has a pivot, the solution is unique. If not, there are infinitely many solutions, with free variables for each non-pivot column.
This process works for systems of any size, from two equations up to hundreds. The logic is always the same: reduce, check for contradictions, and count pivots.