There was an interesting question last week on the AP Calculus Community Bulletin Board. A teacher was working with polynomial functions in her pre-calculus class and the class had learned how to find the roots, and how the roots and their multiplicities affected the graph. Her question was whether there is a way to determine the number of extreme values (maximums and minimums) without using calculus.
You might want to work this yourself before reading on.
Before we go into more detail recall two facts about polynomial functions with real coefficients:
- As a corollary to the Fundamental Theorem of Algebra, we know that a polynomial function of degree n has exactly n factors some of which may be the same. Therefore, the polynomial has exactly n roots, again not necessarily different. The multiplicity of a root is the number of times the corresponding factor appears in the factorization.
- Between any two consecutive roots there is exactly one turning point. (You may need some calculus to justify this. If there were more than one turning point between two consecutive roots, there must be at least three of them. Then the derivative would have more zeros than the original polynomial, which of course cannot happen.
One reader suggested a method for dealing with cubics which I think generalizes to any polynomial. The method is this: Subtract the constant term from the polynomial. This translates the graph so that it will contain the origin. The translated graph is congruent to the original and therefore will have the same number of extreme values.
Find the Real roots of the translated polynomial. Then the number of turning points for both polynomials can be found this way (assuming, for the moment, that all the roots are Real numbers):
- For each distinct root, count 1
- For each root of even multiplicity, count 1
- Each root of odd multiplicity greater than one, ( 3, 5, 7, …), count 0
The number of turning points will be one less than the total.
Example , the count is 4 + 2 + 0 = 6. Turning points = 5
The reasoning goes something like this (for a polynomial with Real coefficients and constant term of zero):
- A linear polynomial has one root and no turning points.
- Each time you multiply by a different linear factor you add one root and one turning point.
- Each time you multiply by several of the same factor you already used to end with an even power for that factor, you add no roots, but you add one turning point (on the x-axis at the root).
- Each time you multiply by several of the same factor you already used to end with an odd power for that factor, you add no roots, and no turning points, since the graph will cross the axis at such a value.
- Then the count scheme above will then give the number of turning points.
Another approach is this: consider a polynomial with n distinct roots and (n – 1) turning points spread out along the number line. Now move two adjacent roots together (resulting in a root of multiplicity 2). The turning point between them moves onto the x-axis. You have lost a root but not a turning point; thus, in the count item 1 decreases by one, so to compensate you increase item 2 by one to get the same total. Now move a third adjacent root to the place of the other two to get a root of multiplicity 3: this time you lose another root, and a turning point so decreasing item 1 will keep the number of turning points given by the count correct.
Did I miss anything? Yes. I did not consider translated polynomials with Complex roots. That’s because I have not (yet) figured that out. I’m pretty sure that a unfactorable quadratic factor (i.e. one with Complex conjugate roots) does not add any turning points to the graph, but I haven’t quite convinced myself. Any suggestions?