In short
When you solve |f(x)| = g(x) and the right side g(x) depends on x (it is not a fixed positive number), the candidates you get from the two unfolded equations might lie about the original. Unfolding silently throws away the rule that absolute value can never be negative — so any candidate that makes g(x) < 0 is a phantom. The fix is one habit, ten seconds long: plug each candidate back into the original equation and watch both sides. If they agree, accept. If they don't, reject. One candidate, both candidates, sometimes neither — anything is possible. This is why CBSE Class 11 marking schemes treat verification as part of the answer, not a politeness.
You have solved |2x + 3| = 7 and got two clean answers, x = 2 and x = -5. Both work. You did not really need to check — the right side was 7, a fixed positive number, and both cases of the case-split land you on real solutions every time.
Now look at this equation:
It looks the same shape. Same V on the left, a number on the right. So you do the same dance.
Case 1. x + 1 = x - 5 \implies 0 = -6. No solution from this case.
Case 2. x + 1 = -(x - 5) \implies 2x = 4 \implies x = 2.
One candidate: x = 2. Now check it. Left side: |2 + 1| = 3. Right side: 2 - 5 = -3. So the equation is asking 3 = -3, which is false.
The candidate is a fraud. The original equation has no solution, but the algebra cheerfully handed you x = 2 anyway. If you had skipped the check, you would have written the wrong answer with full confidence.
This page is about why that happens, and the verification habit that catches it.
Where extraneous solutions come from
The general absolute value equation with a variable right side is
Unfolding gives two equations:
That move feels innocent, but look at what disappeared. The left side, |f(x)|, is never negative — that is the defining property of absolute value. So whatever the right side equals, it must satisfy
When you write the two unfolded equations, you stop enforcing this. The unfolded equations do not know that the right side used to be wearing absolute-value bars. They will happily produce candidates that make g(x) negative — and any such candidate is extraneous, because the original equation could never have been true there.
Why: the equation |f(x)| = g(x) secretly carries two requirements at once — the algebraic one (f(x) = \pm g(x)) and the sign one (g(x) \ge 0). Unfolding keeps the first and discards the second. So the unfolded system has more solutions than the original, and the extras are the extraneous ones.
You can avoid the verification step only when the right side cannot possibly be negative — which usually means it is a fixed positive constant, or itself an absolute value. The moment the right side carries an x that can drive it negative, verification becomes mandatory.
The verification step
The procedure is one line: take each candidate, substitute it into the original equation (not into the unfolded versions — those have already lost information), and check whether the two sides agree.
For a candidate x_0 in |f(x)| = g(x):
- Compute |f(x_0)|. This is always \ge 0.
- Compute g(x_0). This might be positive, zero, or negative.
- If they are equal, accept x_0. If they are not equal, reject x_0 as extraneous.
The two ways verification fails:
- Sign mismatch. |f(x_0)| = 3 but g(x_0) = -3. The magnitudes match, but the right side went negative. Extraneous.
- Value mismatch. |f(x_0)| = 4 but g(x_0) = 7. The unfolding gave a candidate that satisfied a related equation but not this one. Rare with linear f, g, common with quadratics.
The widget below makes this concrete. Pick an equation, see its two candidates, and click Verify to plug each one back in.
The widget shows the same shape every time: two candidate slots, two verification panels, two verdicts. The first equation (|x − 3| = 2x − 6) gives one good candidate. The second (|x + 1| = x − 5) gives one extraneous candidate and no solution at all. The third (|2x − 1| = x + 4) gives two genuine candidates.
That range — zero, one, or two valid solutions, despite always doing the same case-split — is the whole reason verification is non-negotiable.
Three worked examples
Example 1: One genuine candidate (the duplicate case)
Solve |x - 3| = 2x - 6.
Case 1. x - 3 = 2x - 6 \implies -3 + 6 = 2x - x \implies x = 3.
Case 2. x - 3 = -(2x - 6) \implies x - 3 = -2x + 6 \implies 3x = 9 \implies x = 3.
Why: both cases produced the same candidate. That happens when the unfolded equations are linearly dependent — here, the right side 2x - 6 is twice the left interior x - 3, so the structure forces a coincidence at the root.
Verify x = 3. Left: |3 - 3| = |0| = 0. Right: 2(3) - 6 = 0. Equal. ✓
Result. x = 3.
The duplicate is no accident — at x = 3, both f(x) = x - 3 and g(x) = 2x - 6 are exactly zero, so the absolute-value bars do not even need to flip anything. One root, one solution.
Example 2: All candidates are extraneous (no solution)
Solve |x + 1| = x - 5.
Case 1. x + 1 = x - 5 \implies 0 = -6. Contradiction. No candidate from this case.
Case 2. x + 1 = -(x - 5) \implies x + 1 = -x + 5 \implies 2x = 4 \implies x = 2.
Why: case 1 collapsed because x + 1 and x - 5 have the same slope — they are parallel lines that never meet. Case 2 produced a candidate, but you have not yet asked whether it satisfies the original equation.
Verify x = 2. Left: |2 + 1| = |3| = 3. Right: 2 - 5 = -3. So the original equation reads 3 = -3. ✗ extraneous.
Result. No solution.
The right side, x - 5, is negative for every x < 5. So any candidate below 5 was doomed before you computed it — the absolute value on the left can never come down to meet a negative number. Verification catches the trap; algebra alone walks straight into it.
Example 3: Both candidates are genuine
Solve |2x - 1| = x + 4.
Case 1. 2x - 1 = x + 4 \implies x = 5.
Case 2. 2x - 1 = -(x + 4) \implies 2x - 1 = -x - 4 \implies 3x = -3 \implies x = -1.
Why: both cases produce distinct candidates. You must verify each — even though it feels redundant when the equation looks "nice", the constraint x + 4 \ge 0 (that is, x \ge -4) could rule one out.
Verify x = 5. Left: |2(5) - 1| = |9| = 9. Right: 5 + 4 = 9. ✓
Verify x = -1. Left: |2(-1) - 1| = |-3| = 3. Right: -1 + 4 = 3. ✓
Result. x = -1 or x = 5.
Both candidates land in the region where x + 4 \ge 0 (since -1 \ge -4 and 5 \ge -4), so both survive. This is the "best case" — but you still had to check. The next problem on the page might look identical and have only one survivor.
Build a verification habit
Three rules, internalised:
-
Solve, then verify. Treat the candidates from the case-split as suspects, not solutions. The case-split is generous — it sometimes hands you more answers than the equation actually has. Verification trims them down.
-
Plug into the original equation. Not into the unfolded version, not into a "simpler" rearrangement. The original equation is the only one that still carries the absolute-value bars and the sign constraint.
-
Ten seconds, every time. A verification step on a linear absolute-value equation is rarely more than basic arithmetic. The cost is negligible. The benefit — never reporting an extraneous solution — is enormous, especially in CBSE Class 11 boards and in JEE Main, where marking schemes count "no solution" as a valid answer worth full marks but penalise reporting an extraneous candidate.
The same habit transfers to other places where extraneous solutions appear — squaring both sides of a linear equation, solving radical equations, or rationalising denominators in rational expressions. Each of those operations is non-invertible in some way, and each can manufacture phantom roots. The cure is always the same: substitute back into the original.
Once the habit is in your hands, you will never write "no solution" with hesitation again. You will write it with the calm certainty of someone who checked.
References
- NCERT Mathematics, Class 11 — Sets, Relations and Functions — modulus function and verification conventions used in CBSE marking.
- Stewart, Redlin, Watson — Precalculus: Mathematics for Calculus — chapter on absolute-value equations and the role of extraneous solutions.
- Paul's Online Math Notes — Absolute Value Equations — clean worked examples with explicit verification steps.
- Khan Academy — Extraneous solutions — interactive practice on absolute-value cases that produce phantom roots.