Linear Inequalities

⚡ Key Takeaways

Linear inequalities are statements that compare a linear expression to a value using $<$ , $\le$ , $>$ , or $\ge$ rather than $=$ . Their solution is not a single value but a range (an interval, half-plane, or region). They appear everywhere from budgeting to engineering design constraints. Studied systematically since the development of Linear Programming in the 1940s, with roots in the work of Fourier in the 1820s.

💡 The Core Insight

An inequality describes a boundary and a direction. Solving it means finding the boundary point (or line) where the two sides are equal, then determining which side satisfies the relation. The entire difficulty reduces to two questions: Where is the boundary? and Which side? Every operation you perform must preserve — or deliberately flip — the direction of that comparison.

DefinitionLinear Inequality in One Variable

A linear inequality in one variable $x$ is any statement equivalent to one of:

1

\quad ax + b < 0,\quad ax+b \le 0,\quad ax+b > 0,\quad ax+b \ge 0

Derivation hint: any linear inequality can be rearranged so one side is $0$ by subtracting the right-hand side from both sides. where $a, b \in \mathbb{R}$ and $a \neq 0$ . The solution set is the set of all real numbers $x$ making the statement true.

DefinitionLinear Inequality in Two Variables

A linear inequality in two variables has the form

2

\quad ax + by + c < 0 \quad(\text{or } \le, >, \ge)

Derivation hint: generalizes [1] by adding a second first-degree term $by$ . with $a, b$ not both zero. Its solution set is a half-plane bounded by the line $ax + by + c = 0$ .

TheoremOrder-Preserving and Order-Reversing Operations

For real numbers $u, v, k$ with $u < v$ :

3

\quad u < v \implies u + k < v + k \quad\text{(adding any } k \text{ preserves order)}

Derivation hint: $(v+k)-(u+k) = v-u > 0$ .

4

\quad u < v,\ k > 0 \implies ku < kv \quad\text{(positive multiple preserves order)}

Derivation hint: $kv - ku = k(v-u)$ is a positive times a positive.

5

\quad u < v,\ k < 0 \implies ku > kv \quad\text{(negative multiple reverses order)}

Derivation hint: $kv - ku = k(v-u)$ is a negative times a positive, hence negative, so $ku > kv$ .

ProofWhy the Sign Flips Under Negative Multiplication

We prove the key result of equation [5] from the definition of order on $\mathbb{R}$ .

Step 1. By definition, $u < v$ means $v - u > 0$ ; that is, $v - u$ is a positive real number.

Step 2. Let $k < 0$ , so $k$ is negative. Consider the product $k(v-u)$ .

Step 3. A negative number times a positive number is negative. Therefore

6

\quad k(v-u) < 0.

Derivation hint: sign rule for multiplication of reals, applied to $k<0$ and $(v-u)>0$ .

Step 4. Distribute: $k(v-u) = kv - ku$ . So $kv - ku < 0$ , which means $kv < ku$ .

Step 5. Rewriting, $ku > kv$ . This is exactly equation [5]. $\blacksquare$

∎

mathematician · Joseph Fourier | 1768–1830

Though celebrated for the Fourier Series, Joseph Fourier also pioneered the systematic study of systems of linear inequalities. Around 1826 he described a method — now called Fourier–Motzkin elimination — for eliminating variables from a system of inequalities, the inequality analogue of Gaussian elimination. His work anticipated linear programming by over a century and established inequalities as objects worthy of algebraic theory, not mere afterthoughts to equations.

🧠 Intuition

Think of an equation $ax + b = 0$ as asking "where does the line cross zero?" — a single dot. An inequality asks "where is the line below (or above) zero?" — an entire stretch. For one variable, picture a number line. The boundary point splits it into two rays; you shade the ray that works. For two variables, the line $ax+by+c=0$ splits the plane into two halves; you shade the half that works. Testing a single point not on the boundary tells you which side: if it satisfies the inequality, shade its side; if not, shade the other. The sign-flip rule becomes intuitive with a concrete example: $2 < 4$ is true. Multiply both by $-1$ : is $-2 < -4$ ? No! On the number line $-2$ sits to the right of $-4$ , so $-2 > -4$ . Negation reflects the number line about zero, reversing all left-right (order) relationships.

Figure

Solution of

-2x + 1 \le 5

shown on a number line, giving

x \ge -2

ExampleOne Variable with a Sign Flip

Solve $-3x + 7 > 1$ .

Given: linear inequality in $x$ .

Step 1. Subtract $7$ from both sides (allowed freely, by [3]):

7

\quad -3x > 1 - 7 = -6.

Derivation hint: apply equation [3] with $k=-7$ .

Step 2. Divide both sides by $-3$ . Since $-3 < 0$ , reverse the sign by equation [5]:

8

\quad x < \frac{-6}{-3} = 2.

Derivation hint: dividing by a negative flips $>$ to $<$ .

Check: test $x = 0$ : $-3(0)+7 = 7 > 1$ ✓ (and $0 < 2$ ✓).

\boxed{x < 2 \quad\Longleftrightarrow\quad x \in (-\infty,\, 2)}

ExampleTwo Variables — Half-Plane and a Budget Constraint

A student has $60. Notebooks cost $4, pens cost $3. Let $x$ = notebooks, $y$ = pens. Describe what they can afford.

Given: total cost cannot exceed $60, with $x, y \ge 0$ integers.

Step 1. Set up the constraint:

9

\quad 4x + 3y \le 60.

Derivation hint: cost per item times quantity, summed, at most the budget.

Step 2. Find the boundary line $4x + 3y = 60$ . Intercepts: set $y=0 \Rightarrow x = 15$ ; set $x=0 \Rightarrow y = 20$ .

Step 3. Test the origin $(0,0)$ : $4(0)+3(0) = 0 \le 60$ ✓ — so the affordable region is the side containing the origin, below the line.

Step 4. A sample affordable bundle: $x = 6, y = 8$ gives $4(6)+3(8) = 24+24 = 48 \le 60$ ✓.

\boxed{4x + 3y \le 60,\quad x \ge 0,\ y \ge 0 \quad(\text{triangular feasible region, vertices } (0,0),(15,0),(0,20))}

⚠️ Three Frequent Errors

1. Forgetting to flip the sign when multiplying or dividing by a negative. This is the single most common mistake. Equations never require this — inequalities do. 2. Flipping the sign when adding/subtracting a negative. Adding $-5$ to both sides does not flip anything; only multiplying/dividing by a negative does. Equation [3] holds for any $k$ , positive or negative. 3. Solid vs. dashed boundary. Use a solid line/filled dot for $\le, \ge$ (boundary included) and a dashed line/open dot for $<, >$ (boundary excluded).

CounterexampleWhy "Just Solve It Like an Equation" Fails

Consider $-2x < 6$ . Treating it as an equation and ignoring the sign rule gives $x < -3$ . Test $x = 0$ : $-2(0) = 0 < 6$ ✓ — but $0 < -3$ is false! The naïve answer excludes a valid solution. The correct step is to divide by $-2$ and flip:

10

\quad -2x < 6 \implies x > -3.

Derivation hint: divide by $-2<0$ , reversing $<$ to $>$ , per equation [5]. Now $x=0$ correctly lies in $x > -3$ . ✓

connection

Linear inequalities sit at the crossroads of several topics. They generalize Linear Equations by replacing $=$ with an order relation, and their two-variable form prepares directly for Systems of Linear Inequalities, where multiple half-planes intersect. The optimization of a linear objective over such a region is precisely Linear Programming. The number-line solution sets are expressed using Interval Notation, and compound inequalities connect to Set Theory via union and intersection. Absolute-value inequalities like $|x-3| < 5$ unpack into two linear inequalities, linking to Absolute Value.

🔬 Where this appears

⏳ History

- c. 300 BCE — Greek geometers (Euclid) use comparison of magnitudes ("greater than," "less than") rigorously, though without symbolic notation.

- 1631 — Thomas Harriot's posthumous Artis Analyticae Praxis introduces the symbols

<

and

>

for "less than" and "greater than."

- 1734 — Pierre Bouguer introduces

\le

and

\ge

(the "or equal to" variants) in their modern form.

- 1826 — Joseph Fourier presents a method to eliminate variables from systems of linear inequalities (later Fourier–Motzkin elimination).

- 1873 — Paul Gordan and contemporaries study systems of linear inequalities in the theory of invariants and polyhedral cones.

- 1936 — Theodore Motzkin's doctoral thesis systematizes the theory of linear inequalities, reviving Fourier's elimination method.

- 1939–1947 — Leonid Kantorovich and George Dantzig develop Linear Programming; Dantzig's simplex method (1947) solves systems of linear inequalities to optimize objectives.

- 1948 — Linear programming is applied to wartime/postwar logistics and economics, cementing inequalities as central to applied mathematics.

open-problem · Beyond the Linear Case

While a single linear inequality is trivial to solve, systems of many linear inequalities define convex polytopes whose complexity grows rapidly with dimension. Counting and describing the vertices of such regions, and finding the optimal vertex efficiently, drove decades of research; the simplex method works well in practice but has exponential worst-case behavior, while the interior-point methods (Karmarkar, 1984) achieve provable polynomial time. When variables are required to be integers (integer linear programming), the problem becomes NP-hard — no known efficient general algorithm exists. Thus the humble linear inequality, when stacked and constrained to integers, sits at the frontier of computational complexity theory.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also