Absolute Value Equations and Inequalities
Learning goals
- Read the definition as a case split, and as
- Require when solving
- Split with no check needed
- Turn a band or two rays out of an inequality
- Use breakpoints to solve a sum of two absolute values
The definition is a case split
You already met the absolute value as distance from zero: is the length you get by dropping a number’s sign, so and . That picture is the right intuition, and this lesson leans on the exact rule behind it, the piecewise definition
Read it as an instruction that branches. To evaluate you first ask a yes-or-no question about , is it nonnegative, and only then do you know which formula applies. The bars are not a single operation the way adding or squaring is; they are a hidden if. Every difficulty in this lesson traces back to that one fact. When the quantity inside the bars contains an unknown, you cannot answer the branching question in advance. So you are forced to carry both branches until something later settles which one you are in.
There is a second way to write the same rule, with no visible cases at all, and it will earn its keep when we set two absolute values equal. For every real number ,
Squaring throws away the sign of , and the square root symbol, which always returns the nonnegative root, hands back the size without it.
Why #
The square root symbol is defined to return the nonnegative number whose square is its input. So is, by definition, the nonnegative number whose square is . The claim is that is exactly that number, and two facts settle it. First, squares to , since whether is positive or negative. Second, by the meaning of distance. There is only one nonnegative number whose square is , so must be it, that is .
The two cases of the definition confirm the same thing, and the second case is where intuition slips. When , we have , which agrees with . When , the number is positive and squares to , so , which agrees with . The two branches of the piecewise rule are precisely the two ways can resolve.
This is the source of a stubborn error. Writing is correct only when ; for a negative it reports the wrong sign, claiming a negative value for a root that is always nonnegative. With it would give , which is false, since . The honest identity carries the bars, , and those bars are the case split of this section wearing a different costume.
When the right side carries the unknown
Solving for a number was a one-glance affair: you check the sign of once. A positive splits into or , the value gives the single solution , and a negative gives none. Now let the right side be an expression that contains the unknown, as in . That single up-front check is gone, because the sign of depends on the very you are solving for. Splitting anyway is where solutions get manufactured.
Passing from to ” or ” looks like the same safe move, but it is not an equivalence. The left side can never be negative, so the original equation secretly demands as well, and nothing in the two split equations remembers that demand. Dropping it is exactly a non-reversible step of the kind the first lesson warned about. You can travel forward from to the pair of equations, but you cannot travel back. The return trip fails because a solution of at a place where is negative satisfies the split without satisfying the original. The step can add solutions the equation never had. The honest statement keeps the dropped condition in plain sight:
Why the condition cannot be dropped#
Read the equivalence in both directions at a value of , with and standing for the two sides evaluated there.
Forward. Suppose . The left side is an absolute value, so , which gives the condition for free. And with says is a number whose distance from zero is , and there are exactly two such numbers, and , so or . The right side holds.
Backward. Suppose and either or . If then , the last step because . If then again. Either way , the original.
The backward direction is where does its work, and dropping it breaks the argument. Suppose were negative and . Then , a positive number, while itself is negative, so is false. That is precisely a candidate the bare split accepts and the original rejects. So the split without its side condition is a one-way street. The way to make it safe is to solve as usual, and then keep only the candidates for which .
In practice this means the same discipline as clearing denominators in the first lesson. Run the convenient non-reversible step, then check each candidate in the original and discard the extraneous ones. Substituting into the original is the surest check, but testing is faster and catches exactly the same failures.
Worked example 1 Solve
Here and . Split into the two cases, treating each result as a candidate until the condition is checked.
Case :
Case :
Now test each against . At the right side is , which is nonnegative, and checks, so is a genuine solution. At the right side is , which is negative, so this candidate is extraneous. The original would read , an absolute value equal to a negative number, which is impossible.
The algebra offered two candidates and the check kept one. Skipping the check would have reported the false solution .
Worked example 2 Solve
Split with and .
Case :
Case :
Check each against . At the right side is , extraneous. At the right side is , also extraneous. Both candidates fail.
This one unsettles people. Both cases were solved correctly, each produced a clean number, and yet the equation has no solution at all. The reason is visible without any of the algebra: the right side must be nonnegative for the equation to stand. So only is even eligible, and neither candidate reached that far. When a required condition like looks hard to satisfy, expect an empty answer.
Check your understanding
Solving produces the two candidates and . Which is extraneous, and why?
An absolute value can equal an expression only where that expression is nonnegative, so test each candidate in , that is .
At the equation reads , which is true. At the right side is negative while the left side cannot be, so that candidate is extraneous and the solution set is .
Setting two absolute values equal
Now put an absolute value on the right as well, . After a chapter spent exposing splits that quietly fail, this is the one that does not. Here the case split is a true equivalence with no side condition attached, and so is the shortcut that replaces it:
The side condition disappears for one plain reason: both sides are absolute values, hence both nonnegative from the start, so there is no hidden demand like left to forget. The very step that was dangerous a moment ago, squaring, becomes exact.
Why is equivalent to #
Read the chain in two hops and confirm each hop is reversible.
First hop: is equivalent to . Both and are nonnegative, and on nonnegative numbers squaring is one-to-one, undone by the nonnegative square root, so for such numbers holds exactly when . Squaring both sides of gives , that is . Conversely, taking the nonnegative square root of gives , that is by the identity of the first section. Neither direction leaks.
Second hop: is equivalent to or . Move everything to one side and factor the difference of squares:
A product is zero exactly when one of its factors is zero, so this holds precisely when or , that is or . Every step is an equivalence, so the full chain is one.
Set this beside the first lesson. Squaring an ordinary equation is a textbook non-reversible step, the kind that breeds extraneous roots, because two numbers with equal squares need not be equal. What rescues it here is that the quantities being squared, and , are already known to be nonnegative. And on the nonnegative numbers, equal squares really do force equal values. The equivalence is not luck; it is bought by the nonnegativity the bars guarantee.
Worked example 3 Solve
Because both sides are absolute values, split with no check needed. Set the insides equal, then set one equal to the other’s opposite.
Case :
Case :
Both are genuine, so the solution set is . Nothing is discarded, because setting two absolute values equal carries no side condition.
The squaring route lands in the same place. From , square both sides:
Collect on one side and simplify:
so or , exactly the two solutions from the case split. Squaring was safe here for the reason just proved, not by accident.
Check your understanding
How many real solutions does have?
Two absolute values are equal exactly when the insides are equal or opposite, and no side condition is needed.
The first case has no solution, and the second gives , so there is exactly one solution. Geometrically, is the one point equidistant from and , their midpoint.
Inequalities, read as distance
The two absolute value inequalities are already familiar, and the distance meaning is what makes them memorable instead of memorized. The statement says lies within of zero, so it is trapped in a band. The statement , by contrast, says lies farther than from zero, so it splits into two rays:
Both equivalences hold for every real , not only for the positive values where the band is a genuine interval and the rays point outward. That is exactly why reciting them fails while reading them does not: you have to see what each one says once reaches zero and turns negative. Push each to its boundary and past it.
Take when . A distance cannot be less than a nonpositive number, because distances start at : if the demand is impossible, and for it is more impossible still. So has solution set whenever , with no band to draw. The template needs no special case: at it degenerates to , already empty, and for it reads with , ends crossed, empty again. The formula still tells the truth, but only if you read a crossed band as empty rather than as a slip of the pen.
Take when . Every distance is at least , which already exceeds any negative , so holds for every real number and the solution set is all of . Two boundary readings deserve their own names. The inequality holds for every except the single place where the distance is , so it describes all with . And excludes nothing at all, holding for every real number, since a distance is always at least zero. These are not trick questions; they are the honest values of the formula at and beyond its boundary. A solver who only remembers “band or two rays” will misreport every one of these honest values.
Worked example 4 Three inequalities at or past the boundary
Read each by distance rather than by a template.
The inequality asks an absolute value to fall below . It never can, so no works and the solution set is .
The inequality asks an absolute value to exceed . It always does, since it is at least , so every works and the solution set is all of .
The inequality asks the distance from to to be strictly positive. That holds for every except , where the distance is zero, so the solution set is every real number but :
None of these needed a case split or a band. Checking the sign of the right side, the same reflex from solving , settled all three at a glance.
Worked example 5 Read as a distance
The quantity is the distance from to , so says is within of . The numbers within of run from up to :
the interval , centered at with radius . Reading a band this way, as a center and a radius, is quicker than solving and it makes the answer easy to picture. In symbols, is the closed interval , every point no more than from . The strict version is the open interval , the same band without its two endpoints.
The capstone, a sum of two absolute values
Everything in this chapter has been preparing you for a problem with two absolute values added together, like
No single split unlocks it, because two independent bars fork independently. The method is to find the breakpoints, the values where each inside expression changes sign. You then use those breakpoints to cut the number line into intervals on which every bar resolves to one definite formula. Here changes sign at and changes sign at , so the breakpoints and split the line into three intervals. On each one, both absolute values become ordinary linear expressions, and the equation becomes an ordinary linear equation. The one catch is that a root counts only if it lands inside the interval that produced it.
Worked example 6 Solve by breakpoints
The breakpoints and give three intervals. On each, resolve the two bars with the piecewise definition, then solve the linear equation.
Interval . Here so , and so . The equation becomes
Since , the root lies in this interval, so keep it.
Interval . Here so , while so . The equation becomes
which is false. The variable cancelled and left a contradiction, so this interval contributes no solution.
Interval . Here both insides are positive, and , so
Since , the root lies in this interval, so keep it.
Collecting the survivors, the solution set is . The discarded middle interval was not a failure of the algebra; it was the method telling you the sum can never reach there.
That middle interval rewards a second look, because geometry explains it fully. Read as the distance from to and as the distance from to . The left side is then the total distance from to the two fixed anchors and . So the equation asks which points have distances to and to that add up to . The two anchors are apart. For any between them the two distances simply split that gap, so their sum is exactly wherever falls in the middle. That constant sum is why the middle interval produced the flat statement and no solution. To reach a sum of you must step outside the anchors. Each unit you travel beyond an endpoint adds to each of the two distances, and hence to the sum. Starting from , you need more, so you step exactly unit past an end. One unit left of lands on , and one unit right of lands on . The algebra and the picture agree, and the picture explains why the answer had to be symmetric about , the midpoint of the anchors.
Worked example 7 When the target equals the gap,
The breakpoints are and , and the two anchors are apart, the same as the number on the right. Walk the three intervals.
Interval . Both insides are negative, so gives , hence . But is not strictly less than , so it sits on the boundary rather than inside this interval; hold it for the next case.
Interval . Here and , so
true for every in the interval. The entire interval solves the equation.
Interval . Both insides are positive, so gives , hence , again a boundary point already contained in .
The solution set is the whole interval . Geometry says the same thing instantly: the anchors are apart, so between them the two distances always sum to , matching the target exactly. So every point between the two anchors is a solution of the equation. When the number on the right equals the gap between the anchors, the answer is not two points but the entire segment joining them.
These two examples map out every possibility for , with and the anchors and the gap between them. Between the anchors the sum is always , and it grows as you move outside, so three cases exhaust it. If the sum never dips low enough and there is no solution. If the sum equals across the whole middle segment, giving the interval between the anchors. If there are exactly two solutions, one step outside each anchor and symmetric about the midpoint. You can read off which case you are in before solving, just by comparing the target with the gap .
Check your understanding
For , the anchors are and . For which value of does the equation have infinitely many solutions?
Between the two anchors the two distances always add to the gap between them.
When the target equals the gap , every point of the segment has distance-sum exactly , so there are infinitely many solutions, the whole interval. A larger such as gives two isolated solutions, and a smaller such as gives none.