Geometrical meaning of zeroes of a polynomial
Plot on graph paper and something neat happens: every value of that makes turns into a point where the curve actually touches or crosses the -axis. Algebra and picture become the same fact. A linear polynomial's graph is a straight line, so it meets the axis exactly once. A quadratic polynomial's graph is a parabola, which can cross the axis twice, graze it once, or miss it altogether. A cubic polynomial's S-shaped curve can meet the axis up to three times. Underneath these three cases sits one general rule tying the degree of a polynomial to the largest number of zeroes its graph can ever show — and knowing why that ceiling exists, not just what it is, is what turns this from a memorised fact into something you can reason with on any graph you are handed.
The zeroes of are exactly the -coordinates of the points where the graph meets the -axis, and a polynomial of degree can meet the axis at most times.
The core idea
A zero of a polynomial is a number for which . Geometrically, if you draw in the Cartesian plane, a zero is nothing but the -coordinate of a point where the curve sits on the -axis — because on the -axis, .
where: is the polynomial being graphed, is the curve drawn on graph paper, and "meets" covers both crossing straight through the axis and merely touching it. This single idea plays out differently depending on the shape of the graph, which in turn depends on the degree:
- Linear, with : the graph is a straight line that is neither the -axis itself nor parallel to it, so it crosses the axis at exactly one point. One zero, always.
- Quadratic, with : the graph is a parabola, opening upward if and downward if . It can cross the axis at two distinct points, just touch it at one point (grazing the axis exactly at the curve's turning point), or miss it entirely. So a quadratic has at most two zeroes.
- Cubic, with : the graph is an S-shaped curve that can meet the axis at one, two, or three points. So a cubic has at most three zeroes.
Stacking these up gives the general rule for any polynomial you meet in school:
where: is the degree of — the highest power of appearing in it. Degree fixes a ceiling; the graph tells you how many of those possible zeroes are actually real, by counting how many times the curve genuinely touches or crosses the axis.
Why the degree bounds the number of zeroes
The goal is to reason out, from the shape of a polynomial's graph rather than from any formula, why a polynomial of degree can never meet the -axis more than times — so that the "at most zeroes" rule feels earned rather than merely stated for the linear, quadratic, and cubic cases already seen.
Step 1. Look at how many times the graph changes direction. A straight line () never turns — it climbs or falls the whole way, so it is monotonic everywhere. A parabola () turns exactly once, at its single peak or trough. The cubic curves you meet in school turn at most twice — up then down then up again, or the mirror image. In general, a polynomial of degree turns at most times; this is a fact about polynomial graphs that you can verify by looking at every example you graph.
Step 2. Each turn splits the graph into one more monotonic piece — a stretch where the curve only rises or only falls, never both. A graph with turns is cut into exactly monotonic pieces. Since is at most , the number of monotonic pieces is at most .
Step 3. On any single monotonic piece, the curve can cross the -axis at most once — a curve that is steadily rising (or steadily falling) cannot come back down to cross the same level twice without turning, and a turn would mean leaving that piece. So each of the at most monotonic pieces contributes at most one zero.
Step 4. Add it up. With at most monotonic pieces and at most one zero per piece, the whole graph meets the -axis at most times. This matches every case already seen: a line () has turns, piece, at most zero; a parabola () has at most turn, at most pieces, at most zeroes; a cubic () has at most turns, at most pieces, at most zeroes.
Worked example
A parabola opening upwards touches the -axis at exactly one point, , and does not cross it anywhere else. State the number and value(s) of the zeroes of the corresponding quadratic polynomial, and check this against the turning-point reasoning above.
Step 1. Read the graph. The curve only touches the axis at — it does not cross to the other side. So the polynomial has exactly one distinct zero, , counted as a repeated (or equal) zero: both zeroes of the quadratic coincide there.
Step 2. Connect this to crossing versus touching in general. If the parabola had crossed the axis at two separate points, the quadratic would have two distinct real zeroes; touching at one point (as here) gives two equal real zeroes; missing the axis entirely gives no real zeroes. All three outcomes still respect "at most two zeroes."
Step 3. Check against the turning-point count. A parabola has exactly turning point — its vertex — which lies exactly at here, since that is where the curve grazes the axis. With turn there are monotonic pieces, so at most zeroes are possible; the graph realises equal zeroes rather than distinct ones, which is consistent with the bound, not a violation of it. The polynomial has one repeated zero, , occurring twice.
Competitive stretch
A cubic's graph crosses the -axis at , , and , and nowhere else. How many turning points must this graph have, and is that consistent with the degree?
Step 1. Three distinct crossings mean three monotonic pieces are needed — one to rise (or fall) into each crossing and out again — which needs turning points.
Step 2. A cubic can turn at most times, so turning points is exactly the maximum allowed, and zeroes is exactly the maximum for a degree- polynomial. This graph uses up its full quota: 3 zeroes, 2 turning points, both at their ceiling for a cubic.
Common traps
- Confusing "crosses" with "touches." Crossing the axis gives two genuinely separate zeroes on a parabola; touching (grazing) it at the turning point gives one zero counted twice — the graphs look different and must be read carefully.
- Assuming degree always means exactly real zeroes. Degree gives only the maximum possible count; a quadratic may show , , or real zeroes depending on where (or whether) its graph meets the axis.
- Reading the -intercept instead of the zeroes. A zero is an -coordinate where the graph meets the -axis (), not the point where the curve crosses the -axis.
- Forgetting turning points can be fewer than the maximum. A cubic can turn zero or two times, not necessarily two — so it can show , , or zeroes, not only .
Ask the tutor: If you have a sketch of a polynomial graph and want help counting its turning points and zeroes, or want to see how the shape changes from a line to a parabola to an S-curve as the degree rises, ask the AI tutor to walk through some example graphs with you.
If a cubic has degree 3, does that guarantee its graph crosses the x-axis three times?
No. Degree only fixes the maximum number of zeroes, not the actual count. A cubic's graph can cross the -axis once, twice, or three times depending on its exact shape and how many times it turns — a cubic that turns zero times (a steadily rising or falling S with barely any wiggle) meets the axis just once. Always read the actual graph to count the real zeroes; use the degree only as the ceiling.
Why does touching the x-axis count as two equal zeroes instead of just one?
Because algebraically that touching point is a repeated root of the polynomial equation — the factor corresponding to that zero appears twice, as in . Geometrically the curve approaches the axis, grazes it, and turns back without crossing, which is exactly the graph-shape signature of a repeated root. Counting it twice keeps the "at most zeroes for degree " rule consistent, since the total number of roots (with repetition) of a degree- polynomial is always at most .
Can I use the turning-point argument to figure out the zeroes of any graph I am given, even without an equation?
Yes — that is exactly its use. Count how many times the curve changes direction (turns); that count plus one is the number of monotonic pieces, and each piece can contribute at most one zero. So even without ever writing down , counting turns on a sketched graph tells you the maximum number of zeroes it could show, and then you simply read off how many of the axis-meetings actually happen.