A point is a solution to a system of inequalities only when it satisfies every inequality in the system at the same time—substitute its coordinates into each one, and if a single inequality fails, the point is not a solution. Two conditions decide every case: the arithmetic must come out true, and for strict inequalities the point must not sit exactly on the boundary line. Work each inequality separately, track the true/false results, and let the worst one veto the point. A point that passes three of four is still a failure.

Substitute the Coordinates in the Right Order and Watch What the Numbers Do

Every system of inequalities has the same skeleton: two or more conditions joined by "and," all of which must hold simultaneously. Write the system down with the variables labeled and note which value is x and which is y. Swapping them is the single most common mechanical error, and it silently changes the answer more often than any algebraic slip.

Do the substitution in parentheses before doing arithmetic. For the point (2, 5) against y < 2x + 1, that means writing 5 < 2(2) + 1, then 5 < 5. The comparison is the whole test: read the symbol as a question and the numbers as the answer. Never slide the coordinates into the expression without the comparison, because the inequality sign is the step students most often drop.

Evaluate one inequality at a time and record pass or fail before moving on. A result of 5 < 5 is false, not "close"—strict symbols < and > exclude the boundary while ≤ and ≥ include it. If the left side equals the right side, the line type on the graph and the symbol in the inequality must agree, and this is exactly where an otherwise correct student loses the point.

Keep inputs tidy: put negative numbers in parentheses so signs don't disappear, and use the original inequality for the check rather than a rearranged form. If the problem lists several candidate points, build one row per point instead of a column per inequality—it keeps the final verdict in the same place on the page.

Run the Substitution Check on Three Worked Examples, From Pass to Fail

Step one: copy the system and label x and y. Step two: plug the point into the first inequality inside parentheses. Step three: simplify both sides and compare. Step four: repeat for the second inequality, using the same point. Step five: combine the verdicts—not a solution the instant one comparison is false; a solution only when all comparisons are true. Step six: for strict inequalities, check the point isn't exactly on the line by confirming the two sides are unequal.

1: System: y > x + 1 and y < 3x − 1; point (2, 4). Check y > x + 1: 4 > 2(1) + 1 gives 4 > 3, true. Check y < 3x − 1: 4 < 3(2) − 1 gives 4 < 5, true. The point is a solution. 2: System: 2x + y ≤ 6 and x − y > 1; point (3, 4). Check 2x + y ≤ 6: 6 + 4 = 10, and 10 ≤ 6 is false. Stop worrying about the second inequality—the system fails. Not a solution. 3: System: y ≥ x² − 4 and y < 2x; point (1, 3). Check y ≥ x² − 4: 3 ≥ 1 − 4 = −3, true. Check y < 2x: 3 < 2, false. Not a solution, even though it passed a nonlinear inequality.

Failure handling is the part most students skip. If a result comes out false and you expected true, re-check the direction of each sign and whether you swapped x and y. If the substitution produced equality in a strict inequality, the point is on the boundary line and does not count—that's the answer, not a calculation error. Reread the original problem text once to confirm which symbol was printed.

Treat Strict Versus Non-Strict Inequalities as a Boundary Rule, Not a Technicality

The symbols ≤ and ≥ include the boundary line, so a point exactly on the line passes that inequality. The symbols < and > exclude the boundary, so a point on the line fails even when the arithmetic is neat. This distinction is why shading a graph with a solid line for ≤ but forgetting that strictness affects the test-point decision causes wrong answers on final exams.

Worked comparison: the point (0, 2) against y ≤ 2x + 2 is true (2 ≤ 2), while the same point against y < 2x + 2 is false (2 < 2 is not true). Identical line, identical coordinates, opposite verdict. A single symbol change flips the result, and this is the fastest example to show a student why reading the symbol matters more than doing the algebra.

For systems that mix symbols, check them separately. A point can sit on the boundary of one inequality and cleanly inside another; it fails the system because of the strict one. When a test asks whether a point "belongs to the solution set," the correct answer accounts for every inequality with its own symbol and line type.

Graphically, the solution set of a system is the overlap of all shaded regions. The test-point method and the graphing method must produce the same verdict. If the overlap region includes the point and your substitution said no, one of the two has an error—use the disagreement as a diagnostic, not as a reason to pick the answer you like.

Read the Solution Set as the Overlap Region So the Check Matches the Graph

Every point in the overlap region satisfies all inequalities simultaneously, which is why the graph method is faster for big pictures and the substitution method is faster for a single candidate point. Plot each boundary as a solid line for ≤ and ≥ or a dashed line for < and >, shade the half-plane that contains a quick test point, and the doubly shaded overlap is the solution set. The candidate point then either lands inside that overlap or it doesn't.

Locating a point on the graph is a fast sanity check, but it's approximate. Coordinates like (2.5, 1.2) are hard to place by eye, and this is where the algebra wins. A point that sits just outside the shaded band can look "inside" when drawn poorly; substitution gives the exact verdict that a graph can only suggest.

Choose the method by the question. For "is (-3, 1) a solution?" use substitution—three inequalities at most. For "graph the system" the overlap region is the deliverable, and test-point substitution should be reserved for the shading step. For "how many of the five given points are solutions," build the row table and count the all-true rows.

Verify a graph against its own test: pick any point clearly inside the overlap and substitute; it must pass every inequality. Pick a point clearly outside and it must fail at least one. When the graph and the arithmetic disagree, check the symbol before re-shading, because a ≤ drawn as a dashed line produces a boundary that the point either crosses or does not.

See How One Failed Inequality Vetoes the Others

A pass-fail system behaves like a chain that breaks at one link. A point satisfying three of four inequalities is not a solution, and the failure must be reported. This sounds obvious, but the most common error students make on a multiple-choice question is counting the passes and missing the single veto. The system's answer is the intersection of the conditions, not a vote.

Consider a point passing the two easiest inequalities in a four-inequality system and failing the third. The point is excluded, and students should say so explicitly: "It satisfies the first two, but not 2x − y > 5, so it is not a solution." That sentence structure is what earns full-credit on constructed-response questions because it proves the reasoning, not just the final label.

A point that fails zero of the inequalities passes the system; a point failing exactly one is a near-miss; a point failing two or more is clearly outside. Record which inequality failed—problem sets and tests frequently ask for that detail, and the answer is a sentence, not a checkbox. Definitional precision matters even more in applied work: in a linear program, a point that fails any constraint is infeasible, and that word carries consequences for the next step.

The strategic consequence: solve the inequality most likely to fail first. For a point with a large positive x and small y, check the inequalities with minus x coefficients first. For a point on the boundary, check the strict ones first. That ordering saves work and reduces the chance of a sloppy pass on an inequality that should have failed.

Check Nonlinear Systems With the Same Steps but Different Curves

Nonlinear inequalities—y < x², circles, and absolute-value conditions—still accept a direct substitution. The only change is that the boundary is a curve, not a line, and the "inside the curve" region can be several disconnected pieces. The test-point method remains exactly the same, and its verdict still wins.

Worked example: x² + y² < 9 (inside the circle of radius 3) and y > x. Test (0, 1): 0 + 1 < 9 true; 1 > 0 true; the point is a solution. Test (1, 3): 1 + 9 = 10 < 9 false; the point is outside the circle and fails immediately. Test (−2, −1): 4 + 1 = 5 < 9 true, but −1 > −2 false; it fails on the linear inequality. The circle didn't change the process, only the arithmetic.

A quadratic inequality like y ≥ x² − 4 opens a region above the parabola. Points inside the parabola's "U" near the vertex typically fail because the curve dips below them; points above the rim pass. Sketching the parabola and picking a test point above and below is the fastest way to orient, then substitute to confirm.

Systems mixing curves and lines are common in algebra courses, and they invite a shortcut error: guessing from the sketch. The sketch is a map, not the answer. Substitute, then use the sketch to explain why. When the quadratic involves squares, watch for two roots sharing a y-value—points on either side of the axis can differ only by sign of x, and the sign matters in the linear inequality.

Escape the Four Traps That Flip a Correct Answer

Trap one: mathematically correct but graph-blind. A student substitutes carefully but shades the wrong region and then judges the point by the flawed picture. Substitution wins; the graph is a guide. Trap two: symbol blindness. Turning 4 < 5 into 4 ≤ 5, or reading ≤ as <, changes a pass into a fail on the boundary with no other error. Trap three: coordinate swap. (2, 5) is not (5, 2), and swapping changes both sides of many expressions.

Trap four: the isolated variable. Rearranging y > 2x + 1 into y − 2x > 1 is fine, but dividing or multiplying by a negative flips the direction—students who substitute into a rearranged form can inherit the flip and mislabel the verdict. Keep the original for checking.

Boundary conflicts matter too. System y > x + 1 and y < x + 1 has no solution at all; the two half-planes face opposite directions. If a point fails both, that's expected—no point can pass both, and the system's solution set is empty. Contrast with y ≥ x + 1 and y ≤ x + 1, where the only possible solutions lie exactly on the line—a point on it passes both, and points off it fail one.

A negative-slope special case trips people too. When the line falls from left to right, the "above the line" region is the upper-left for one part of the graph, and "below" is the lower-right. Substitution sidesteps the visual confusion entirely, which is why the algebraic check is the safer route when the graph is messy.

Turn the Check Into a Five-Minute Test-Point Routine

The routine, timed at about five minutes for a typical three-inequality system:

1: Label x and y from the point, 15 seconds. 2: Substitute into inequality 1 with parentheses, simplify, write pass or fail, 1 minute. 3: Repeat for inequalities 2 and 3, 2–3 minutes. 4: If any fail, stop and state not a solution, 15 seconds. 5: If all pass, confirm no point sits on a strict boundary and state the properties—solution, satisfies all three, region overlap, 1 minute.

Run the routine twice on the worked examples earlier in this article and you'll be at exam speed.

What makes the routine reliable is the row format. One point per row, one column per inequality, and a final column for the verdict. For a homework set with five candidate points and three inequalities, that's fifteen substitutions and five verdicts in a single table—faster than rewriting sentences five times.

Failure cases inside the routine are usually arithmetic, not conceptual. A mistaken square of a negative number (e.g., evaluating −3² as 9 instead of −9) will pass a false point or fail a true one. Converting each fraction to a decimal early is another quiet source of error. Signs deserve double attention; every negative sign carries through the multiplication.

Routine discipline turns the check into a habit. By the third or fourth problem of the same type, lengths shorten, and the student's written work becomes a sequence of inequalities in parentheses followed by true or false—clean, auditable, and easy to grade. The final verdict in the last column is the answer.

Build a Side-by-Side Verdict Table and Read the Pattern in the Results

A comparison layout for a system, with one point per row, exposes verdict patterns quickly. The columns below are the right structure for any system in this article.

Point Inequality 1 (y > x + 1) Inequality 2 (y < 3x − 1) Boundary check Verdict
(2, 4) 4 > 3 true 4 < 5 true not on either line Solution
(3, 4) 4 > 4 false (boundary) 4 < 8 true on first line, strict Not a solution
(0, 0) 0 > 1 false 0 < −1 false not on either line Not a solution
(4, 7) 7 > 5 true 7 < 11 true not on either line Solution

Read the pattern: the two solutions sit well inside the overlap, and the boundary point sits exactly where a strict inequality deprives it of eligibility. The (0, 0) row shows that failing both is decisive. The table also doubles as a study sheet—each row is a complete worked example with the verdict proven.

This layout is better than a pass-only list because it shows which inequality failed. That's the diagnostic a teacher or a linear-programming tool needs, and it's the detail multiple-choice options often test. Build the table before writing any prose answer.

Rows are cheap: a sixth point adds one more line. Add the boundary check column whenever the system has any strict inequality, and add a "distance from boundary" note for points close to a line if you want precision. The pattern usually reveals the region more clearly than a sentence-by-sentence walkthrough.

FAQ

Do I have to test every inequality even after one fails?

No, and stopping early is acceptable practice. Testing one by one is a checklist until the first fail; the system's answer becomes "not a solution" immediately because every inequality must hold. What you should do instead is write down which inequality failed so your reasoning is complete. Teachers and graded rubrics generally accept "fails inequality 2, so not a solution" as a full answer.

What changes for a three-variable system?

The process is identical, but a point like (1, 2, 3) substitutes into x, y, and z, and the geometric picture is a region in 3D rather than a shaded overlap in 2D. The rule of simultaneous satisfaction does not change; the intersection of half-spaces can be bounded, unbounded, or empty. Boundary lines become boundary planes, and the strict/non-strict rule applies to each inequality just as before.

Is a point that fails one inequality but contains the point (−2, 4) of the origin special?

Not special in any useful way. The origin is often the easy test point for shading a single half-plane, but for a multi-inequality system the origin is just another point—it passes only if every inequality includes it. The origin is not privileged by geometry, and "the origin is covered" is not a general solution test. Build a five-point set including the origin plus a few chosen against the coefficients, and the verdict table does the rest.

How is a boundary point decided in an inequality that uses a solid vs. dashed line?

The symbol sets the rule, and the line style is a drawing convention that should mirror the symbol. Solid line pairs with ≤ or ≥, so points on the line are eligible and pass. Dashed line pairs with < or >, so points on the line are not eligible and fail. If the line style in a sketch disagrees with the symbol in the equation, trust the equation and fix the sketch.

When is testing a point faster than graphing the whole system?

Whenever the question is about one specific point or a handful of points—true or false, belongs or doesn't. For "shade the solution region," graph the inequalities first and use test points to confirm the shading. The break-even point is around four candidate points; beyond that a full graph becomes more economical. The choice of method never changes the mathematical definition.

Does order of evaluation matter in the table beyond sign checks?

Only strategically. Start with the inequality most likely to fail, then use the result as an early exit. For a point with a large positive x and a small y in a system where x has a negative coefficient, that inequality is the cheapest fail finder. Start every system with the same order for consistency, then reorder only to save work.

Why is a point equal to a non-strict inequality accepted but the same point with a strict inequality rejected?

Because the boundary contains the points and the strict symbols deliberately exclude them. The inequality y > 3 is not true when y = 3 even though y ≥ 3 is. Distinguishing these two cases is the most frequent error when students work quickly, and the points on the line are exactly where systems with contrasting symbols produce empty or single-line overlaps.

How do I check when the "point" came from a real-world word problem?

A word problem's inequalities usually describe constraints—minimum hours, maximum cost, nonnegative quantities—and the point is a candidate schedule, allocation, or dose. Check every constraint in the same order as the lesson above; the verdict is feasibility. The details of real-world feasibility labels vary by domain, so the constraints in the problem statement are the arbiter, not outside assumptions about what should be reasonable.

Test-point substitution settles any "is this a solution" question in arithmetic, and the pass/fail rule leads with the same sentence every time: all inequalities must hold at once, and the strict ones exclude the boundary.