Graphing Inequalities
Learning goals
- Draw the boundary dashed for strict and solid for inclusive
- Shade the half-plane a test point proves true
- Use the origin as the test point unless the line passes through
- Recognize as a vertical boundary and as horizontal
- Keep only the overlap for a system, the feasible region
The boundary line and the two half-planes
Every two-variable linear inequality has a matching equation, the one you get by replacing its inequality symbol with an equals sign. The graph of that equation is a straight line, and this line is the boundary of the solution region. It earns the name honestly: it is the exact border between the pairs that satisfy the inequality and the pairs that do not. Replacing with in gives , a line you can graph in seconds from its slope and intercept.
A single line splits the plane into two pieces, one on each side, and each piece is a half-plane. The boundary is the crease between them. The solutions of the inequality are exactly one of those two half-planes, never a mix of the two. That clean split between the two half-planes is what makes graphing an inequality quick. To see why an entire side either works or fails together, look at what the inequality is really measuring.
Why one whole side satisfies the inequality#
Put the inequality in the form , solving for first if it is not already there. Pick any input . On the boundary line the height at that input is exactly . A point sitting at that same input lies above the line when its height is greater than , and below the line when is less. So the quantity
the signed vertical distance from the line up to the point, is positive at every point above the line. That distance is zero at every point on the line, and negative at every point below it. The inequality is nothing more than the statement that this quantity is positive. The inequality is therefore true at every single point of the upper half-plane and false at every single point of the lower one. The boundary line is the only place where the verdict switches. The sign of cannot change without passing through zero, and that quantity reaches zero only on the line. So you cannot move from a solution to a non-solution without crossing the boundary. That is exactly why testing one point settles its whole side at once. A vertical boundary behaves the same way through the horizontal distance , and a standard-form inequality through the quantity . Each of those is again a single number that is zero on the line and one fixed sign on each side.
Picking the side with a test point
The proof hands you a shortcut. Because a whole side shares one verdict, you never have to reason about “above” or “below” yourself. Choose any point that is not on the boundary, substitute its coordinates into the original inequality, and check whether the statement comes out true. If it is true, that point is a solution, so shade the entire side it sits on. If it is false, the solutions are on the other side, so shade that one instead. A single substitution decides everything.
The handiest test point is almost always the origin , because setting and collapses most of the arithmetic to nothing. The one time you cannot use the origin is when the boundary passes through it. Then lies on the line, so the substitution returns a boundary result instead of a clear true or false. In that case pick another easy off-line point, such as or .
One more decision fixes how you draw the boundary. If the inequality is strict, or , the points on the line are not solutions. Then draw the boundary as a dashed line to show that the line is excluded. If the inequality is inclusive, or , the points on the line do satisfy it. Then draw the boundary solid to show that the line is part of the answer. You read this straight off the symbol, exactly like the open or filled circle you used on the number line.
Worked example 1 Graph
Start with the boundary. Replacing with gives , a line with slope and -intercept . Plot , step up and right to , and draw the line. The symbol is strict, so make it dashed: the points on the line are not part of the solution.
Now pick the side. Test the origin , which is not on the line, in the original inequality:
which is false. The origin is not a solution, so the solutions lie on the other side. Shade the half-plane that does not contain the origin, the region above the line.
The finished graph is a dashed line with the region above it shaded. As a check, the point is in the shaded region, and the original reads , which is true. The unshaded point , by contrast, gives , and is false.
Worked example 2 Graph
The boundary is , quickest from its intercepts. Setting gives , so and the -intercept is . Setting gives , so and the -intercept is . Draw the line through those two points. The symbol is , which is inclusive, so make the line solid: the points on it are solutions too.
Test the origin in the original inequality:
which is true. The origin is a solution, so shade the side that contains it, the region below the line.
Notice you never had to solve for or decide for yourself what “below” means. The test point did that work. As a check, the origin we tested is shaded. A point on the far side such as gives , and is false, so that point is correctly left unshaded.
Check your understanding
To graph , how should you draw the boundary line, and does the origin lie in the shaded region?
The symbol is , which is inclusive, so the boundary is drawn solid. Now test the origin in the inequality.
That is false, so the origin is not a solution and the shaded region is the side that does not contain it. A solid boundary with the origin unshaded is the matching pair.
Horizontal and vertical boundaries
Two special inequalities have boundaries that run straight across or straight up and down, yet nothing about the method changes. An inequality in alone, such as , has the vertical boundary . An inequality in alone, such as , has the horizontal boundary . Draw the boundary dashed or solid from the symbol as always, then test a point.
For the boundary is the vertical line two units left of the -axis, drawn dashed because the symbol is strict. Testing the origin gives , which is true, so shade the side holding the origin, everything to the right of the line.
For the boundary is the horizontal line one unit above the -axis, drawn solid because is inclusive. Testing the origin gives , which is true, so shade the side holding the origin, everything on or below the line.
There is a quick sense-check for the shading. The statement says ” is greater than ,” and greater lies to the right, so the region opens rightward. In the same way says ” is at most ,” and smaller lies downward, so the region opens downward. The test point confirms it, but the words already point the right way.
Checking whether a point is a solution
Reading a graph in the other direction matters just as much: given a point, is it in the solution region? Substitute its coordinates into the inequality and see whether the statement is true. If it is, the point is a solution and lies in the shaded region; if not, it lies outside. The only case that needs care is a point landing exactly on the boundary line. There the inequality becomes an equality, so the point counts as a solution only when the boundary is solid ( or ). The point is not a solution when the boundary is dashed ( or ).
Worked example 3 Test three points against
Check each point by substituting it into and judging the result.
The point : the right side is , so the statement is , which is false. This point is not a solution.
The point : the right side is , so the statement is , which is true. This point is a solution.
The point : the right side is , so the statement is , which is true. This point sits exactly on the boundary line, and because the symbol is the boundary is solid and its points count, so is a solution.
Had the inequality been the strict , the point would give , which is false, and it would not be a solution. The boundary is the one place where the dashed-or-solid distinction changes the answer.
Check your understanding
Is the point a solution of ?
Substitute and into the left side .
That is false, so the point is not a solution. In fact lands exactly on the boundary , and since the symbol is the strict , that boundary is dashed and its points are excluded.
Systems of linear inequalities
A system of linear inequalities asks for the points that satisfy several inequalities at the same time. Each inequality on its own shades a half-plane. A point that works for the whole system has to lie in every one of those half-planes at once. The solution of the system is therefore the region where all the shaded half-planes overlap. That common region is called the feasible region, and every point inside it satisfies every inequality in the system.
Graph a system by shading each inequality’s half-plane, then keeping only the part they all share. With two inequalities you look for the overlap of two half-planes; with three you look for the overlap of three, and so on. Testing the origin in each inequality is still the fastest way to orient the individual half-planes before you find where they meet.
Worked example 4 Graph the system and
Handle one inequality at a time, then take the overlap.
The first inequality has boundary , a line with slope and -intercept . The symbol is strict, so the line is dashed. Testing the origin, is , which is true, so shade the side containing the origin, above this line.
The second inequality has boundary , slope and -intercept . The symbol is inclusive, so the line is solid. Testing the origin, is , which is true, so shade the side containing the origin, below this line.
The two boundaries cross where , that is , so and then : the point . The feasible region is the wedge that is above the dashed line and below the solid line at the same time.
The origin sits inside the overlap, which agrees with both tests coming out true. A point in only one of the half-planes, such as , fails the system. That point gives , true for the first inequality, but , false for the second, so the point is left out of the feasible region.
Worked example 5 Graph the system , , and
The first two inequalities are the special vertical and horizontal kind. The region is on or to the right of the -axis, and is on or above the -axis. Together they pin everything to the first quadrant. Both boundaries are solid, since both symbols are inclusive.
The third inequality has boundary , the line through and , drawn solid. Testing the origin gives , which is true, so its half-plane is the side toward the origin, below the line.
Overlapping all three leaves a triangle. Its edges are the two axes and the line , and its three corners, where the boundaries meet in pairs, are , , and .
Every point of this triangle satisfies all three inequalities. The interior point , for instance, has , then , and then , all true. A point just outside, such as , has false, so it is not in the feasible region even though it clears the first two conditions. A bounded region like this triangle, described by its edges and its corner points, is exactly the picture the next lesson builds on.
Check your understanding
Which point lies in the feasible region of the system and ?
A point is in the feasible region only when it satisfies both inequalities, so test each candidate against and .
The point fails because is false; fails because is false; fails because is false. Only satisfies both.