Linear Inequalities and Interval Notation

The concept of inequality — the idea that one quantity may exceed, fall short of, or merely differ from another — is as old as mathematics itself. Ancient Babylonian scribes solving tax and irrigation problems implicitly dealt with constraints like "this canal must carry at least this much water," even though they lacked a formal symbolic language for such statements. The Greeks, particularly Archimedes, employed reasoning about bounds when approximating π using inscribed and circumscribed polygons, establishing that the ratio lay between 3 10/71 and 3 1/7. Yet for centuries, the absence of algebraic notation meant these ideas remained embedded in geometric arguments and rhetorical prose rather than concise symbolic expressions.

The modern treatment of linear inequalities required two parallel developments: a symbolic algebra capable of expressing relationships beyond strict equality, and a rigorous concept of the real number line on which solution sets could be visualized. Once these tools converged in the seventeenth through nineteenth centuries, inequalities became indispensable in analysis, optimization, and applied science. Today, interval notation provides a compact, universally understood way to describe the solution sets that arise from solving such inequalities.

The central question this lesson addresses is straightforward yet far-reaching: given a linear inequality in one variable, how do we solve it algebraically, represent its solution set on a number line, and express that set using interval notation? Mastering this skill is not merely an exercise in symbol manipulation — it underpins everything from defining function domains to formulating constraints in linear programming and understanding the ε–δ definitions that appear in calculus.

Before diving into techniques, it is essential to establish the foundational concepts that govern how inequalities behave and how their solutions are communicated. A linear inequality in one variable is a statement of the form ax + b < 0 (or with ≤, >, ≥) where a and b are real constants and a ≠ 0. Unlike an equation, which typically yields a single value, an inequality produces an infinite set of values — a solution set — and we need efficient ways to describe that set.

The number line is the natural habitat of a one-variable inequality's solution set. Each type of inequality — strict (<, >) or non-strict (≤, ≥) — produces a characteristic graphical signature: an open circle at the boundary point for strict inequalities (indicating the point is excluded) and a filled circle for non-strict inequalities (indicating inclusion). The shaded ray then extends in the direction of all values satisfying the inequality. The diagram below illustrates the four fundamental cases and their corresponding interval notation.

Notice the consistent pairing between the graphical representation and the notation: a parenthesis "(" or ")" always pairs with an open circle, while a bracket "[" or "]" always pairs with a filled circle. This is not mere convention but a reflection of the underlying set-theoretic distinction between open and closed sets. In Case 1, the value x = 3 does not satisfy x > 3, so it is excluded — hence the open circle and the parenthesis. In Case 2, x = 3 does satisfy x ≤ 3, so it is included — hence the filled circle and the bracket. Internalizing this correspondence is critical, as it eliminates the most common notational errors students encounter.

Solving a linear inequality follows the same algebraic steps as solving a linear equation — isolate the variable using inverse operations — with one crucial caveat. The properties of inequality govern which operations preserve the direction of the inequality and which reverse it. The formal properties are stated below.

These properties can be justified rigorously from the ordered field axioms of ℝ. The reversal rule, in particular, follows from the fact that multiplying by a negative number reflects the number line about the origin: if a lies to the left of b on the number line, their reflections −a and −b swap relative positions, placing −a to the right of −b. This geometric insight explains why the inequality flips — it is not an arbitrary rule but a consequence of the structure of the real numbers.

Interval notation provides a compact representation for connected subsets of the real number line. While linear inequalities in one variable produce only rays or the entire real line, understanding the full taxonomy of intervals is essential for describing domains, ranges, and compound inequalities. The table below catalogs every interval type you will encounter in college algebra and beyond.

A few subtleties deserve emphasis. First, the union operator ∪ is used to combine disjoint intervals. For instance, the solution set of |x| > 2 is (−∞, −2) ∪ (2, ∞). Second, the intersection operator ∩ identifies values common to two intervals; for example, (1, 5) ∩ [3, 8] = [3, 5). Finally, the empty set ∅ results when an inequality has no solution — as with x + 3 < x + 1, which simplifies to the false statement 3 < 1.

Let us walk through a complete example that involves distributing, combining like terms, and applying the reversal rule. We will solve the inequality, graph its solution on a number line, and express the answer in interval notation.

Linear equations and linear inequalities share the same algebraic toolkit — distribution, combining like terms, inverse operations — yet they differ profoundly in both their solutions and their interpretive scope. Understanding where each formulation excels illuminates why inequalities are indispensable in modeling real-world constraints, where exact equality is the exception rather than the rule.

Linear inequalities in one variable are the simplest members of a large family of inequality problems. As you progress through college algebra and into calculus, linear algebra, and applied mathematics, the same core ideas — isolating the variable, attending to sign changes, and expressing solution sets as intervals or unions of intervals — reappear in increasingly sophisticated contexts. The table below maps the progression.

The conceptual leap from this lesson to, say, the simplex method in linear programming is smaller than it might appear. A linear programming problem is simply a system of linear inequalities (constraints) together with a linear objective function to maximize or minimize. Each constraint carves out a half-space, and the feasible region is the intersection of these half-spaces — a higher-dimensional analogue of the intervals you are learning to describe here. Similarly, in real analysis, the ε–δ definition of a limit is built entirely on inequalities and the interval-based neighborhoods they define. The fluency you develop now with single-variable linear inequalities and interval notation will pay compounding dividends.