Location of Roots: Find Where Polynomial Roots Lie

Locating a root means trapping it inside a small interval without solving the equation exactly. The key tool is the Intermediate Value Theorem: if a continuous function f takes values f(a) and f(b) of opposite signs, then f(x) = 0 has at least one root strictly between a and b.

This matters because most real-world equations have no neat formula for their roots, so scientists and engineers trap roots in intervals and then zoom in with numerical methods like bisection. Location is the first half of every root-finding algorithm.

Key Concepts

• Continuous function: a function with no jumps; every polynomial is continuous everywhere, which is why the theorem applies to them directly.
• Sign-change condition: f(a) × f(b) < 0 guarantees at least one root c with a < c < b.
• Bisection idea: test the midpoint m of (a, b) and keep the half where the sign change persists, halving the interval each step.
• Integer probing: for polynomials with integer coefficients, evaluating at integers …, −2, −1, 0, 1, 2, … quickly reveals sign changes.
• At least, not exactly: a sign change guarantees one root but there could be three or five hiding in the same interval.

Formulas

The Intermediate Value Theorem condition is f(a) × f(b) < 0 ⇒ there exists c in (a, b) with f(c) = 0, provided f is continuous on [a, b]. One bisection step: with m = (a + b)/2, replace (a, b) by (a, m) if f(a) × f(m) < 0, otherwise by (m, b). Each step halves the uncertainty.

• f(a) × f(b) < 0 ⇒ at least one root in (a, b)
• Bisection midpoint: m = (a + b)/2; keep the half containing the sign change
• After n bisections the interval width is (b − a)/2ⁿ

Worked Example

Locate a real root of f(x) = x³ − 2x − 5. Try integers: f(2) = 8 − 4 − 5 = −1 < 0 and f(3) = 27 − 6 − 5 = 16 > 0, so a root lies in (2, 3). Bisect: m = 2.5 gives f(2.5) = 15.625 − 5 − 5 = 5.625 > 0, so keep (2, 2.5). Next m = 2.25: f(2.25) = 11.390625 − 4.5 − 5 = 1.890625 > 0, so keep (2, 2.25). Next m = 2.125 is unnecessary; try m = 2.1: f(2.1) = 9.261 − 4.2 − 5 = 0.061 > 0, so the root lies in (2, 2.1). The root is trapped in an interval of width 0.1, approximately 2.09. Check: f(2.0946) ≈ 9.1889 − 4.1892 − 5 ≈ 0, confirming the location.

Common Misconceptions

• "f(a) × f(b) > 0 means no root in (a, b)." False — an even number of roots can hide there, like a parabola crossing twice inside the interval.
• "Polynomial roots are integers." Many are irrational; integer probing only locates the interval, and bisection refines it.
• "One sign change means exactly one root." It guarantees at least one; the interval could contain three, five, or any odd number.

Real-World Applications

• The bisection method in numerical analysis, the simplest guaranteed root-finder.
• Engineering simulations that solve for equilibrium points of nonlinear systems.
• Calibrating models: finding the parameter value that makes an error function zero.
• Exam questions asking to "show that the equation has a root between 2 and 3".

Locating roots rests on one idea: a continuous function that changes sign must cross zero. Find integers a and b with f(a) × f(b) < 0, then bisect the interval to trap the root as tightly as needed.