Which System Of Inequalities Describes The Graph

Which System of Inequalities Describes the Graph? A Visual Decoder Guide

Look at any shaded region on a coordinate plane, and you are not just seeing a picture—you are seeing the visual language of a system of inequalities. Every line, every shaded half-plane, and every overlapping intersection tells a story of constraints and possibilities. The ability to translate this visual story back into its algebraic code—the precise system of inequalities—is a fundamental skill that bridges abstract algebra and concrete geometry. It transforms a static graph into a dynamic set of rules. This guide will walk you through the exact, repeatable process to decode any graph and write the system of inequalities it represents, turning you from a passive observer into an active translator of mathematical visuals.

Understanding the Core Components: Lines, Shading, and Boundaries

Before decoding, you must understand the three essential elements that make up these graphs.

1. The Boundary Line: This is the line that forms the edge of the shaded region. Its form is your first clue.

• Solid Line: A solid, unbroken line indicates that points on the line itself are part of the solution. This corresponds to an inequality that includes equality: ≤ (less than or equal to) or ≥ (greater than or equal to).
• Dashed Line: A dashed or dotted line means points on the line are not included in the solution. This corresponds to a strict inequality: < (less than) or > (greater than).

2. The Shaded Region: This is the area that satisfies the inequality. The shading tells you which side of the boundary line contains the solutions.

• The rule is simple: shade the side where the inequality statement is true. If you have y > 2x + 1, you shade the region above the line y = 2x + 1. For y ≤ -x - 3, you shade the region below the line y = -x - 3.

3. The System's Solution: When multiple inequalities are graphed together, the final solution to the system is the region where all individual shaded areas overlap. This intersection is often a polygon (like a triangle or quadrilateral) or an unbounded area. Your final system must describe all boundaries that create this precise overlapping region.

The Step-by-Step Decoding Protocol

Follow this systematic checklist for any graph you encounter.

Step 1: Identify and Equation Each Boundary Line

Ignore the shading for a moment. Look at each distinct line that borders the shaded region.

1. Find two clear points on the line (e.g., where it crosses the x-axis and y-axis).
2. Calculate the slope (rise/run) and determine the y-intercept.
3. Write the equation in slope-intercept form (y = mx + b). This is your starting equation for the inequality.
4. Repeat for every boundary line. A graph with a triangular shaded region will have three boundary lines.

Step 2: Determine the Inequality Symbol for Each Line

This is the critical translation from visual to symbolic.

1. Check the line type: Solid? Use ≤ or ≥. Dashed? Use < or >.
2. Determine the shading direction relative to the line:
   • For non-vertical lines (y = mx + b): Pick a simple, obvious test point that is not on the line. The origin (0,0) is perfect unless the line passes through it. Plug the test point's x and y into your equation from Step 1.
     • If the resulting statement is true, then the shading is on the side containing your test point. The inequality symbol must make the statement true for points in the shaded region. To give you an idea, if your line is y = 2x + 1 and shading is above it (containing (0,0)? 0 > 1 is false, so (0,0) is not in the shaded region if shading is above. Let's correct: If shading is above the line y=2x+1, a point like (0,2) should work: 2 > 1 is true. So the inequality is y > 2x + 1.
     • If the resulting statement is false, then the shading is on the opposite side from your test point. Flip the inequality symbol.
   • For vertical lines (x = a): Shading to the right of the line means x > a (or x ≥ a). Shading to the left means x < a (or x ≤ a).
   • For horizontal lines (y = b): Shading above the line means y > b (or y ≥ b). Shading below means y < b (or y ≤ b).

Step 3: Write the Complete Inequality

Combine the equation from Step 1 with the correct inequality symbol from Step 2. Do this for every boundary line.

Continue exploring with our guides on which statements are true regarding the transformation select three options and why was the proclamation of 1763 issued.

Step 4: Verify the System

Take your completed system of inequalities and mentally (or quickly on scratch paper) check the corner points of the shaded region. Do they satisfy all inequalities? If your shaded region is a closed polygon, its vertices should satisfy all inequalities (using ≤/≥ appropriately). This final check catches errors in shading direction or symbol choice.

Worked Examples: From Graph to System

**Example 1: A Simple Triangle

Example 1: A Simple Triangle

Consider a triangle with vertices at (0,0), (4,0), and (0,3). The boundaries are solid lines, and the region inside the triangle is shaded.

• Boundary 1 (Base): Connects (0,0) and (4,0). This is the horizontal line y = 0. The shading is above this line (the triangle's interior has positive y-values). Since the line is solid, the inequality is y ≥ 0.
• Boundary 2 (Vertical Leg): Connects (0,0) and (0,3). This is the vertical line x = 0. The shading is to the right of this line (the triangle's interior has positive x-values). Solid line gives x ≥ 0.
• Boundary 3 (Hypotenuse): Connects (4,0) and (0,3). Slope = (3-0)/(0-4) = 3/-4 = -3/4. Using point (0,3), the y-intercept b is 3. Equation: y = (-3/4)x + 3. To determine the inequality, test point (0,0): 0 ? (-3/4)(0) + 3 → 0 ? 3. This is false. Since (0,0) is not in the shaded triangle, the shading must be on the opposite side of the line from (0,0). The opposite side is below the line. Which means, the inequality is y ≤ (-3/4)x + 3.

System of Inequalities:

x ≥ 0
y ≥ 0
y ≤ (-3/4)x + 3

Verification: Check the vertices.

• (0,0): 0≥0 (T), 0≥0 (T), 0 ≤ 3 (T) ✓
• (4,0): 4≥0 (T), 0≥0 (T), 0 ≤ (-3/4)(4)+3 = -3+3=0 → 0 ≤ 0 (T) ✓
• (0,3): 0≥0 (T), 3≥0 (T), 3 ≤ 3 (T) ✓

Example 2: An Unbounded Region

Now consider a region shaded above a dashed line y = 2x - 1 and to the left of a solid line x = 3. The intersection is an unbounded wedge.

1. Line 1: y = 2x - 1 (dashed). Test point (0,0): 0 ? 2(0)-1 → 0 ? -1. True. Since (0,0) is in the shaded region (above the line), the inequality is y > 2x - 1.
2. Line 2: x = 3 (solid). Shading is to the left, so x ≤ 3.

System of Inequalities:

y > 2x - 1
x ≤ 3

Verification: A corner point is where the lines intersect: 2x - 1 = y and x = 3 → y = 2(3)-1 = 5. Point (3,5) is on the dashed line boundary. Check: 5 > 2(3)-1 → 5 > 5 is false (as expected for a dashed line, the boundary is not included). For a point inside the region, like (2,3): 3 > 2(2)-1 → 3 > 3? False. Try (2