Systems in Two Variables
Learning goals
- Read the solution set as one point, none, or a line
- Prove no other count is possible for two lines
- Detect the case from how elimination ends
- Name a system consistent or inconsistent, independent or dependent
- Compare the three coefficient ratios in standard form
- Describe an infinite solution set explicitly, as
A system asks where two lines meet
You already know that a single linear equation in two variables, such as , does not have one answer. Its solutions are all the pairs that make it true, and when you plot them they form a straight line. The equation and the line are two views of the same object: the line is the solution set of that one equation.
A system stacks two such equations and asks for the pairs that satisfy both at once:
A pair solves the system exactly when it lies on the first line and on the second. So the solution set of the system is precisely the set of points the two lines have in common, their intersection. The whole question “how many solutions can a system have” becomes a geometry question you can picture: in how many points can two lines in a plane meet?
Three shapes, and no others
Take any two lines drawn in the same plane. Run through the possibilities. They might cross at a single point. They might run parallel and never touch. Or the two equations might, once simplified, describe the very same line lying on top of itself. Those three pictures give one shared point, no shared point, and every point shared. What is remarkable is that this list is complete: no arrangement of two straight lines produces exactly two crossings, or exactly five. The reason is short and worth seeing in full.
A linear system in two variables has one, no, or infinitely many solutions, and nothing else#
A solution of the system is a point lying on both lines, so the solution set is exactly the collection of points the two lines share. Two lines are either the same line or two genuinely different lines, so handle those cases.
If the two equations describe the same line, then every point of that line lies on both. Since a line has infinitely many points, the system then has infinitely many solutions.
If the two lines are different, they can share at most one point. Here is why. Suppose, for contradiction, that two different lines passed through two different shared points. A straight line is completely determined by any two of its points: through two given points there is exactly one line. So both lines, passing through the same two points, would have to be the identical line, contradicting that they are different. Two distinct lines therefore meet in at most one point, which leaves only two options: they cross at exactly one point, or they never meet at all.
Collecting the cases, the solution set is the whole line (same line), a single point (distinct lines that cross), or empty (distinct lines that never meet). A count of “two or more, but finitely many” is impossible, because the two-points argument forbids two distinct lines from sharing even two points. That is the entire list.
The three outcomes are easy to tell apart once each line is in slope-intercept form , because the slope controls the direction. Different slopes force a single crossing. Equal slopes with different intercepts give parallel lines that never meet. Equal slopes with the same intercept are the same line drawn twice.
Check your understanding
How many solutions does this system have: and ?
Both lines are already in slope-intercept form, so read off the slopes and intercepts. Both slopes equal , so the lines are parallel, but the intercepts and differ, so they are not the same line.
Parallel lines that are not identical never meet, so there is no solution.
Those three panels are drawn side by side because a page cannot show one turning into another, and that is the one thing worth seeing. The figure below is a single pair of lines carrying all three cases, and the route between them is short.
The figure opens crossing, at : one solution. Note that a crossing point is under no obligation to land on a grid intersection, which is the practical reason the algebra is worth more than the picture. Now bring the dashed line’s slope onto the solid line’s, a rise of over a run of . The dot goes out and the sentence stops naming a point: parallel, no solution. Hold the slopes there and walk the dashed line’s crossing point down to , where the solid line meets the axis. The two lines merge into what looks like one, and the count jumps from none to infinitely many.
Watch that last step closely, because it is where the picture gives out. Once the slopes match, the only thing separating “no solution” from “infinitely many” is the value of one control. The second of those two cases draws a figure a reader cannot distinguish from a single line. The proof above is what tells the two apart, and the sentence under the figure is doing the same job the proof does.
One pair of lines, all three cases
y = (1/2)x + 1. y = -x + 3. The slopes 1/2 and -1 are different, so they cross exactly once. They cross at (4/3, 5/3).
Reading the three cases off the algebra
You do not need a graph to know which case you are in. Substitution and elimination already report it, if you listen to what they output. Both methods work by removing one variable to get a single equation, and that final equation lands in exactly one of three states, matching the three pictures one for one. Think of elimination less as a way to grind out an answer and more as a detector for which case a system is in.
Start with the case you expect most often, a single crossing point.
Worked example 1 One solution: the algebra ends at a value
Solve the system
The slopes differ ( against ), so expect a single crossing. Eliminate by scaling the second equation by so the terms become opposites:
Add this to the first equation. The and cancel:
Back-substitute into to get , so . The elimination ended at a genuine value, , which then pinned to a single number. That is the signature of the one-solution case:
A quick check confirms it: and , both true.
Now watch what changes when the lines are parallel. The arithmetic does something that looks alarming the first time you see it, but it is exactly the report you want.
Worked example 2 No solution: the algebra ends at a falsehood
Solve the system
Rewrite each in slope-intercept form to see the geometry: the first is and the second is . Same slope , different intercepts, so the lines are parallel and should share no point. Watch elimination confirm it. Scale the first equation by :
Subtract the second equation, , from this. Both variables cancel at once:
The statement is false, and no choice of or can make it true, because and have already vanished from it. So there is no pair satisfying both equations. The system has no solution, which is precisely the parallel-lines picture.
The last case is the strangest of the three, because the answer is not a point and not “nothing” but an entire line’s worth of solutions. When elimination wipes out both variables and leaves a statement that is simply true, the second equation was telling you nothing new.
Worked example 3 Infinitely many: describing the whole solution set
Solve the system
Divide the first equation by and it becomes , identical to the second. The two equations are the same line wearing different clothes. Elimination makes this explicit: scale the second by to get , then subtract the first:
The statement is always true, so the second equation added no restriction the first had not already imposed. Every point on the shared line solves the system, so there are infinitely many solutions.
“Infinitely many” is not a complete answer, though; you should say which pairs. Solve the common line for to get . Then any you like is allowed, and is forced to match, so the solution set is every pair of the form
For instance gives , and gives ; both satisfy the original two equations. Writing the answer as captures all of them at once.
These three endings are the whole story, and they are the algebraic mirror of the geometry.
Why elimination can only end in a value, a falsehood, or an identity#
Take a system in which each equation genuinely involves both variables. Eliminate one variable, say , by scaling the two equations so their -coefficients match and then subtracting. The terms cancel by design, and what remains is one equation whose only variable is . Exactly one of two things happens to the term.
Either some nonzero multiple of survives, giving an equation of the form with . Then is forced to a single value, back-substitution forces one matching , and the system has exactly one solution.
Or the term cancels along with the term, leaving a bare numerical statement . This is exactly the case where the two equations have proportional left-hand sides, one being a constant multiple of the other in its and parts. Now records whether the constant terms respect that same proportion. If the statement is false and the system has no solution. If the statement holds for every pair, and the second equation is a rescaling of the first. The two then describe one line, and every point on it is a solution, infinitely many.
So the only possible endings are (one solution), (none), and (infinitely many), matching crossing lines, parallel lines, and one repeated line. There is no fourth ending.
Check your understanding
Solving a system by elimination, a student correctly reduces it to the single statement . What should they conclude?
Both variables have canceled, leaving a pure number statement. Check whether it is true or false: is false.
A false ending with no variables left means the two lines are parallel and share no point, so the system has no solution. Reaching is not itself a mistake; it is the report that tells you the case.
Consistent, inconsistent, dependent, independent
Because these three cases come up constantly, they carry standard names, and the names split the idea along two independent questions.
The first question is whether any solution exists at all. A system with at least one solution is consistent; a system with no solution is inconsistent. The parallel-lines system from Worked Example 2, which ended in , is inconsistent.
The second question, asked only when the system is consistent, is whether the two equations carry genuinely different information. If the equations describe different lines, they pin down a single crossing point, and the system is independent. If one equation is just a rescaling of the other, so they describe the same line, the system is dependent, and it has infinitely many solutions. Combining the two questions gives exactly the three cases:
- Consistent and independent: one solution (lines cross).
- Consistent and dependent: infinitely many solutions (same line).
- Inconsistent: no solution (parallel lines).
When both equations are written in standard form with nonzero coefficients and constant terms, you can classify a system at a glance by comparing the ratios of matching coefficients. Two lines have the same slope exactly when , and they are the same line when the constants keep that ratio too:
| Coefficient ratios | Lines | Solutions | Classification |
|---|---|---|---|
| cross once | exactly one | consistent, independent | |
| parallel | none | inconsistent | |
| same line | infinitely many | consistent, dependent |
The middle and bottom rows differ only in whether the constant term joins the pattern. That difference is the same thing as asking whether is nonzero or zero at the end of elimination.
Forcing a case: solving for a parameter
Once you can read the case off the coefficients, you can run the question backward. Instead of being handed a fixed system and asked how many solutions it has, you are handed a system with an unknown constant in it. You are then asked to choose that constant so that a particular case occurs. This is where the classification earns its keep.
Worked example 4 Choose k so the system has no solution, then infinitely many
For which values of does this system have no solution, and for which does it have infinitely many?
Look at the left-hand sides. The second, , is exactly twice the first, . So no matter what is, the two lines have the same slope; they can only ever be parallel or identical, never crossing. Which one it is depends on the constant. Scale the first equation by :
Compare with the second equation, . Subtracting gives
If , this is , the two equations are the same line, and there are infinitely many solutions. If , this is , the lines are parallel, and there is no solution.
Notice there is no value of that gives a single solution here. The left sides are locked into the same slope, so a lone crossing point is off the table from the start.
When the unknown sits in a coefficient instead of a constant, it controls the slope, and the reasoning shifts to matching slopes. The next checkpoint is that version.
Check your understanding
For which value of does the system and fail to have exactly one solution?
A single solution requires different slopes, so it fails exactly when the slopes match. In standard form the slopes match when the coefficient ratios agree.
At the second equation is , which is parallel to (the first equation times ), so the system has no solution rather than one. Every other gives different slopes and exactly one solution.