A solution to a system must satisfy every inequality simultaneously. Each inequality contributes a half-plane; the final solution is their geometric intersection, not every individually shaded area.
Graph and intersect every constraint
System graphing workflow
- Graph the first boundary
Determine its solid or dashed style and valid half-plane.
- Repeat
Graph and shade every remaining inequality independently.
- Intersect
Keep only points lying in every valid half-plane.
- Check boundaries
A boundary segment belongs to the solution only when its inequality includes equality and all other constraints hold there.
- Verify a point
Substitute one point from the final region into every original inequality.
Vertical, horizontal, and sloped constraints
The solution lies right of the vertical boundary, below the horizontal boundary, and above the sloped boundary.
The vertical and sloped boundaries are solid because their operators include equality. The horizontal boundary is dashed. The mint polygon is computed by clipping the coordinate window against all three algebraic half-planes.
Two sloped inequalities
Equivalently, the solution is below or on \(y=-x+3\) and strictly above \(y=\frac12x-2\).
Test an ordered pair without graphing
Test one candidate
Does \((2,1)\) satisfy \(x+y\le4\), \(y>x-3\), and \(x\ge0\)?
- First inequality
\(2+1\le4\) is true.
- Second inequality
\(1>2-3\) is true.
- Third inequality
\(2\ge0\) is true.
- Conclude
Every statement is true, so the point is a system solution.
Identify a labeled solution region
The highlighted Region A satisfies both \(y\ge x+1\) and \(y\ge-x+1\). A point in any other labeled region lies below at least one boundary and fails the system.
Quadrant analysis
To decide whether a quadrant contains solutions, combine sign restrictions with the system. For example, \(x\ge2\) and \(y\le-1\) force positive \(x\) and negative \(y\), so all solutions lie in Quadrant IV; the other three quadrants contain none.
Check your understanding
Which point satisfies \(y\ge x-1\) and \(y<-x+5\)?
- \((0,0)\)
- \((2,2)\)
- \((4,0)\)
- \((3,5)\)
Show answer and explanation
Answer: \((2,2)\)
At \((2,2)\), \(2\ge1\) and \(2<3\). Each other point fails at least one inequality.
What to remember
- A system solution satisfies every inequality.
- The final region is the intersection of all half-planes.
- Boundary inclusion is decided separately for each inequality.
- Candidate-point testing and labeled-region testing use the same all-statements-must-be-true rule.
Put these notes into practice
Apply the ideas with SAT-style questions, then reinforce key details with flashcards.