Compound Inequalities | Varsity Tutors

SECTION 1

Historical Context & Motivation

The concept of inequality has deep roots in the history of mathematics, stretching back to ancient civilizations that grappled with problems of measurement, resource allocation, and geometric comparison. While equations describe exact relationships, inequalities capture the far more common real-world scenario in which quantities must satisfy bounds, thresholds, or ranges rather than precise values. The evolution from simple inequalities to compound inequalities — statements that combine two or more inequality conditions using logical connectives — reflects a broader mathematical trend toward expressing complex constraints within a unified algebraic framework.

c. 300 BCE

Euclid's Elements

Euclid employed geometric inequalities — such as the triangle inequality — to establish foundational relationships between magnitudes, though without modern symbolic notation.

1631

Harriot's Symbolic Notation

Thomas Harriot's posthumous work introduced the modern < and > symbols, replacing verbal descriptions with concise notation and enabling algebraic manipulation of inequalities.

1821

Cauchy's Cours d'Analyse

Augustin-Louis Cauchy formalized the rigorous use of inequalities in analysis, particularly bounding expressions and establishing convergence criteria — tasks that inherently require compound conditions.

1847

Boole's Mathematical Logic

George Boole's algebraic treatment of logic provided the connectives AND and OR, giving a precise framework for combining inequality statements into compound conditions.

20th Century

Linear Programming & Optimization

The development of linear programming by Kantorovich and Dantzig placed systems of compound inequalities at the heart of operations research, economics, and engineering design.

This historical trajectory underscores a persistent question in mathematics: how do we express and solve conditions that restrict a variable not to a single value but to a range of permissible values? Compound inequalities provide the answer by combining simple inequality statements through the logical operations of conjunction (AND) and disjunction (OR), enabling us to model real-world constraints such as temperature tolerances, dosage ranges, and engineering specifications with algebraic precision.

SECTION 2

Core Principles & Definitions

A compound inequality is a mathematical statement formed by joining two simple inequalities with either the word "and" (conjunction) or the word "or" (disjunction). The logical connective determines how the individual solution sets combine: an "and" compound inequality requires a value to satisfy both conditions simultaneously, while an "or" compound inequality requires a value to satisfy at least one of the two conditions. Understanding this distinction is fundamental to correctly interpreting, solving, and graphing these expressions.

Conjunction (AND)

The solution set is the intersection of the two individual solution sets. A value must satisfy both inequalities. Notation: A ∩ B.

Disjunction (OR)

The solution set is the union of the two individual solution sets. A value need satisfy only one (or both) of the inequalities. Notation: A ∪ B.

Compact (Three-Part) Form

An "and" compound inequality can be written in compact form: a < x < b. This notation emphasizes that x is sandwiched between two bounds and is equivalent to a < x AND x < b.

Interval Notation

Solutions are expressed using parentheses ( ) for strict inequalities and brackets [ ] for inclusive ones. For example, −3 ≤ x < 5 is written [−3, 5). Unions use the symbol ∪.

Empty & Universal Sets

An "and" compound inequality may have no solution (∅) if the conditions are contradictory, while an "or" compound inequality may yield all real numbers (−∞, ∞) if every value satisfies at least one condition.

✦ KEY TAKEAWAY

Think of compound inequalities as a Venn diagram for number lines. An "and" inequality is like the overlapping region of two circles — only values in both sets qualify. An "or" inequality is like the entire shaded area of two circles — any value in either set qualifies. This set-theoretic perspective connects elementary algebra to the formal language of analysis and topology you will encounter in advanced coursework.

SECTION 3

Visual Explanation — Number Line Representations

The most intuitive way to understand compound inequalities is through number line diagrams. Each simple inequality corresponds to a ray or segment on the number line, and the compound inequality's solution set is determined by how those regions overlap (AND) or combine (OR). The following diagram contrasts the two types side by side, illustrating the solution sets for −2 ≤ x < 4 (an "and" compound inequality) and x < −1 or x ≥ 3 (an "or" compound inequality).

The top number line shows the "and" compound inequality −2 ≤ x < 4 as a bounded segment with a filled circle at −2 (included) and an open circle at 4 (excluded). The bottom number line shows the "or" compound inequality x < −1 or x ≥ 3 as two rays extending in opposite directions, with an open circle at −1 and a filled circle at 3.

Observe how the nature of the logical connective determines the geometry of the solution set. An "and" compound inequality produces a bounded interval — a finite segment sandwiched between two endpoints — because the variable must simultaneously satisfy both constraints. In contrast, an "or" compound inequality typically produces two disjoint rays extending toward infinity, since satisfying either condition is sufficient. This visual distinction is a reliable heuristic: if your solution set looks like a single bounded segment, you likely have an intersection; if it looks like two separate rays, you likely have a union.

SECTION 4

Mathematical Framework

Solving compound inequalities requires the same algebraic operations used for simple inequalities — addition, subtraction, multiplication, and division — applied to each component inequality, with careful attention to the sign-reversal rule when multiplying or dividing by a negative number. Below we formalize the two primary structures.

CONJUNCTION (AND) — COMPACT FORM

a ≤ f(x) ≤ b ⟺ a ≤ f(x) AND f(x) ≤ b

Here a and b are real constants with a ≤ b, and f(x) is an algebraic expression in x. All three parts of the inequality must be operated on simultaneously when isolating x.

DISJUNCTION (OR) — SEPARATE FORM

f(x) < a OR f(x) > b

Each inequality is solved independently. The final solution set is the union of the two individual solution sets: S₁ ∪ S₂. If the two sets overlap, the union may simplify (e.g., to all real numbers).

SIGN-REVERSAL RULE

If c < 0, then a < b ⟹ ac > bc

When multiplying or dividing all parts of an inequality by a negative number c, every inequality symbol must be reversed. In a three-part inequality, this means both ≤ (or <) signs flip, and the order of the outer bounds swaps.

⚠️ Common Pitfall

When solving a three-part inequality such as −5 < −2x + 1 ≤ 7, students often forget to reverse both inequality signs and to swap the positions of the outer bounds after dividing by −2. The correct final step yields −3 ≤ x < 3, not −3 < x ≤ 3 or 3 > x ≥ −3 written in the wrong order.

SECTION 5

Classification of Solution Types

Not every compound inequality behaves the same way. The relationship between the two component inequalities determines whether the solution set is a bounded interval, a pair of rays, all real numbers, or the empty set. A systematic classification helps you anticipate what form the answer will take before you begin solving, which serves as an important sanity check on your work.

The decision tree classifies compound inequalities by connective (AND vs. OR) and then by the relationship between the component solution sets. Note that AND can produce a bounded interval or the empty set, while OR can produce disjoint rays or all real numbers.

Summary of compound inequality solution types

Type	Connective	Condition	Solution Set
Bounded interval	AND	Solution sets overlap	[a, b], (a, b), etc.
Empty set	AND	Solution sets do not overlap	∅ (no solution)
Two disjoint rays	OR	Solution sets are separated	(−∞, a) ∪ (b, ∞)
All real numbers	OR	Solution sets cover ℝ	(−∞, ∞)

SECTION 6

Worked Example

We now solve a compound inequality of each type, demonstrating the complete algebraic procedure and the translation into interval notation and number line representation.

Example A: Conjunction (AND)

Solve −7 < 3 − 2x ≤ 11 and express the solution in interval notation.

Solving −7 < 3 − 2x ≤ 11

Step 1 — Isolate the Variable TermSubtract 3 from all three parts of the inequality: −7 − 3 < 3 − 2x − 3 ≤ 11 − 3, which simplifies to −10 < −2x ≤ 8.

−10 < −2x ≤ 8

Step 2 — Divide by −2 and Reverse the Inequality SignsDivide all three parts by −2. Because we are dividing by a negative number, both inequality signs reverse direction: −10 / (−2) > x ≥ 8 / (−2), which gives 5 > x ≥ −4.

5 > x ≥ −4

Step 3 — Rewrite in Standard OrderConvention places the smaller value on the left: −4 ≤ x < 5. This is equivalent to the previous expression but is easier to read and graph.

−4 ≤ x < 5

Step 4 — Express in Interval NotationThe bracket at −4 indicates inclusion (≤), and the parenthesis at 5 indicates exclusion (<).

[−4, 5)

Step 5 — Verify with a Test ValueChoose x = 0 (inside the interval): 3 − 2(0) = 3. Check: −7 < 3 ≤ 11 ✓. Choose x = 5 (boundary): 3 − 2(5) = −7. Check: −7 < −7 is false ✗, confirming 5 is excluded.

Example B: Disjunction (OR)

Solve 4x + 1 ≤ −7 or 2x − 3 > 5 and express the solution in interval notation.

Solving 4x + 1 ≤ −7 or 2x − 3 > 5

Step 1 — Solve the First Inequality4x + 1 ≤ −7 → 4x ≤ −8 → x ≤ −2.

x ≤ −2, i.e., (−∞, −2]

Step 2 — Solve the Second Inequality2x − 3 > 5 → 2x > 8 → x > 4.

x > 4, i.e., (4, ∞)

Step 3 — Form the UnionBecause the connective is OR, the solution set is the union of the two individual sets. Since (−∞, −2] and (4, ∞) are disjoint, their union is simply their combination.

(−∞, −2] ∪ (4, ∞)

Step 4 — Verify with Test ValuesChoose x = −3 (in the left ray): 4(−3) + 1 = −11 ≤ −7 ✓. Choose x = 0 (gap region): 4(0) + 1 = 1, which is not ≤ −7, and 2(0) − 3 = −3, which is not > 5. Neither condition holds ✗. Choose x = 5 (in the right ray): 2(5) − 3 = 7 > 5 ✓.

SECTION 7

AND vs. OR — Strengths & Common Errors

The following table contrasts the two types of compound inequalities across several dimensions, highlighting the structural differences that most frequently lead to algebraic errors. Understanding these distinctions prevents the single most common mistake in this topic: confusing intersection with union.

Comparison of AND and OR compound inequalities

Feature	AND (Conjunction)	OR (Disjunction)
Set operation	Intersection (∩)	Union (∪)
Compact notation	Yes: a < x < b	No compact form; must state both conditions
Typical graph	Single bounded segment	Two rays pointing outward
Can yield ∅?	Yes — contradictory conditions	No (unless both components are already ∅)
Can yield ℝ?	Only trivially (e.g., x > −∞ and x < ∞)	Yes — overlapping conditions cover all values
Solving strategy	Operate on all three parts simultaneously	Solve each inequality independently, then unite

✦ KEY TAKEAWAY

Think of compound inequalities like pass/fail criteria in quality control. An AND compound inequality is like requiring a manufactured part to pass every inspection checkpoint — a single failure disqualifies it. An OR compound inequality is like having multiple acceptable pathways — satisfying any one criterion is sufficient for acceptance. In optimization and feasibility analysis, this distinction directly determines whether a design constraint narrows or broadens the space of admissible solutions.

SECTION 8

Connections to Advanced Theory

Compound inequalities are not merely an algebraic exercise; they are the conceptual gateway to several powerful areas of mathematics. Recognizing how this foundational topic connects to more advanced frameworks enriches your understanding and prepares you for courses in analysis, optimization, and applied mathematics.

How compound inequalities connect to advanced mathematics

Concept in This Lesson	Advanced Extension	Where You'll See It
Intersection of intervals (AND)	Feasible regions in linear programming	Operations Research, Economics
Union of intervals (OR)	Domain restrictions, piecewise functions	Calculus, Real Analysis
Interval notation [a, b)	Open and closed sets in topology	Topology, Functional Analysis
Three-part inequalities	Epsilon-delta definitions (\|f(x) − L\| < ε)	Calculus I, Analysis
Sign-reversal rule	Ordered field axioms, absolute value inequalities	Abstract Algebra, Number Theory

Perhaps the most immediate connection is to the epsilon-delta definition of a limit in calculus. The statement |x − c| < δ is equivalent to the compound inequality c − δ < x < c + δ, a three-part "and" inequality that defines a symmetric neighborhood around the point c. Mastering the algebraic mechanics of compound inequalities now will make the transition to limit arguments considerably smoother. Similarly, when you study linear programming, each constraint in the optimization problem is an inequality, and the feasible region is precisely the intersection of all constraint half-planes — a higher-dimensional generalization of the "and" compound inequality.

SECTION 9

Practice Problems

PROBLEM 1 — CONCEPTUAL

Explain why the compound inequality x > 7 AND x < 3 has no solution, while the compound inequality x > 7 OR x < 3 has infinitely many solutions. Reference the concepts of intersection and union in your answer.

PROBLEM 2 — BASIC CALCULATION

Solve the compound inequality 1 ≤ 2x − 5 < 9 and express the solution in interval notation.

PROBLEM 3 — INTERMEDIATE

Solve −3 < (4 − x) / 2 ≤ 5 and express the solution in interval notation. Be careful with the sign-reversal rule.

PROBLEM 4 — APPLIED

A pharmaceutical company requires that the active ingredient concentration C (in mg/mL) in a drug batch satisfies 12.0 ≤ C ≤ 15.5, and the pH level p satisfies 6.8 ≤ p ≤ 7.4. If C = 3x + 0.5 and p = −0.2x + 8 where x is a process parameter, find the values of x for which both the concentration and pH constraints are simultaneously satisfied.

PROBLEM 5 — CRITICAL THINKING

Let a and b be real numbers with a < b. Prove that the compound inequality x < a OR x > b always has a nonempty solution set, while the compound inequality x > b AND x < a always has an empty solution set. Then determine for what relationship between a and b the inequality a < x < b yields exactly one solution.

SUMMARY

Summary

A compound inequality combines two simple inequalities using a logical connective. When the connective is AND (conjunction), the solution is the intersection of the two individual solution sets, typically producing a bounded interval or possibly the empty set. When the connective is OR (disjunction), the solution is the union of the sets, often producing two disjoint rays or, when conditions overlap, all real numbers.

The essential algebraic technique is to solve each component inequality using standard operations while respecting the sign-reversal rule (reverse inequality direction when multiplying or dividing by a negative). Solutions are expressed in interval notation using brackets for inclusive endpoints and parentheses for exclusive ones, and visualized on number lines with filled or open circles. This foundational skill underpins domains from linear programming and optimization to the epsilon-delta definitions of calculus.