Each line contains a wrong step. Say what broke and why it felt right.
Student writes: −4<−2x<6⇒2<x<−3 (divided by −2, flipped nothing).
Error: dividing by a negative must flip both relation signs, and "2<x<−3" is impossible (nothing is above 2 yet below −3). Correct: 2>x>−3, i.e. (−3,2).
Student writes: −4<−2x<6⇒2>x<−3 (flipped only the left sign).
Error: you can't flip one sign in a chain — that produces a self-contradictory mixed statement. Both signs flip together, giving 2>x>−3.
Student solves x>4 OR x<1 and reports ∅.
Error: they used the AND (overlap) reasoning on an OR. OR wants the union, which keeps both rays: (−∞,1)∪(4,∞).
Student solves x>4 AND x>1 and reports (1,∞).
Error: they took the union by keeping the looser ray. AND needs both, so only x>4 survives; the answer is (4,∞).
Student writes the AND-solution of x≥2 and x≤5 as [2,5).
Error: the right endpoint came from x≤5, which includes 5, so it must be a closed bracket. Correct: [2,5].
Student "simplifies" x<−2 OR x≥3 to −2≤x<3.
Error: they wrote the gap between the rays instead of the rays themselves, and even flipped inclusion. The union is (−∞,−2)∪[3,∞) — the two outer pieces, not the middle.
Student solves 0≤2x−1≤7 by adding 1 only to the middle: 0≤2x≤7.
Error: an operation must hit all three parts or the chain no longer holds. Adding 1 everywhere gives 1≤2x≤8, then 21≤x≤4.
Student claims x<5 AND x>2 has no solution "because the rays point apart".
Error: these rays point toward each other and overlap on (2,5); that misread of direction wrongly triggered the empty-AND reflex.
Why is AND the intersection and not just something we're told to memorise?
Because intersection is defined as "belongs to both sets," which is exactly what "condition 1 AND condition 2 both hold" means — the set operation is the logic, not a separate rule. See Set operations — union and intersection.
Why does x>3 AND x>5 collapse to the stricter inequality but their OR collapses to the looser one?
AND demands both, so it keeps only the smaller overlap (stricter bound); OR demands just one, so the weaker bound already satisfies it and the larger region wins.
Why is there a compact chained form for AND but never for OR?
The AND overlap is a single connected middle band, so one chain a<x<b captures it; an OR of separated rays is two disconnected pieces that no single chain can express.
Why does dividing a three-part inequality by a negative flip both signs at once?
Each of the two inequalities in the chain reverses when multiplied by a negative (same rule as Linear inequalities in one variable); since both flip, the chain stays consistent — flipping only one would break it.
Why does "temperature between 20°C and 25°C" translate to AND, not OR?
"Between" requires the value to clear the lower bound and stay under the upper one simultaneously, so both conditions must hold — that's the definition of AND.
Why can an OR of two rays give all of R while an AND of the same two rays gives a bounded interval?
OR keeps every point covered by either ray (their combined reach), while AND keeps only the shared overlap; overlapping rays can jointly cover the whole line yet share only a finite band.
Why does the empty set ∅ show up for AND but the whole line R show up for OR in "away-pointing" cases?
Rays pointing apart share nothing (empty overlap → AND fails everywhere), yet if they also overlap or meet they can cover everything (full union → OR succeeds everywhere) — opposite operations, opposite extremes.
Why does absolute value turn ∣x∣<3 into an AND but ∣x∣>3 into an OR?
∣x∣<3 means the distance from 0 is small, trapping x between −3 and 3 (both bounds → AND); ∣x∣>3 means the distance is large, sending x out past either end (one side or the other → OR). More in Absolute value inequalities.
The boundary and degenerate situations that trip people up.
Solve x>4 AND x<4.
No solution, ∅. No number can be both strictly above and strictly below 4; the strict inequalities exclude the meeting point 4 itself.
Solve x≥4 AND x≤4.
Exactly {4} — a single point. The overlap shrinks to the shared endpoint because both inequalities now include 4.
Solve x<4 OR x>4.
Everything except 4: (−∞,4)∪(4,∞). The single point 4 satisfies neither strict condition, so the union punches a hole there.
Solve x≤4 OR x≥4.
All reals R. The endpoint 4 is caught by both closed pieces, so the union has no gap.
Solve x>0 AND x>0 (same condition twice).
Just (0,∞). Intersecting a set with itself changes nothing; duplicate conditions are harmless.
Solve x<−100 OR x>−100.
(−∞,−100)∪(−100,∞) — all reals except −100; the two open rays leave only that one excluded point.
What is the solution set of a "compound inequality" whose two parts are identical under OR, e.g. x>2 OR x>2?
(2,∞). Union of a set with itself is the same set, so the OR adds nothing new.
In a<x<b, what happens if a=b, say 3<x<3?
∅. The band has zero width — no number is both greater than 3 and less than 3 at once.
In a≤x≤b, what happens if a=b, say 3≤x≤3?
{3}. With closed endpoints the degenerate band collapses to the single value 3.
In a<x<b, what happens if a>b, say 5<x<2?
∅. The lower bound sits above the upper one, so no value can satisfy both; always check that a<b before trusting a chain.
Recall One-line summary of every trap here
AND = overlap (can be ∅ or a single point); OR = combined coverage (can be all of R minus a hole). Strict vs closed endpoints decide whether boundary points join in, and a chain a<x<b is only legal when it's an AND with a<b.