BetterGrades Precalculus · Unit 5 · Lesson

Turning points and local versus global behavior

Use degree bounds, graph evidence, and function values to analyze turning points and extrema.

Opening

Start with the situation

A turning point changes the graph from increasing to decreasing or the reverse.

Polynomial structure links symbolic factors to visible graph behavior. Reading that structure efficiently makes it possible to sketch, solve, and model without treating every problem as a blind numerical search.

Before you begin

Prerequisite check

Factor polynomial expressions.
Read zeros and graph behavior.
Distinguish exact and approximate forms.

Core explanation

Explanation

Use the degree-n maximum of $n-1$ turns and compare local extrema with end behavior to identify absolute extrema.

Odd-degree polynomials are unbounded above and below; positive even-degree polynomials have an absolute minimum.

A symbolic answer is not complete by itself. In this lesson, the same claim must also be readable through turning-point gallery, local versus absolute extrema, or another equivalent representation.

Conceptual reading

What the idea is really doing

Polynomial formulas contain structural information before a graph is drawn. Degree and leading coefficient control the ends, factors reveal zeros, multiplicity predicts crossing or touching, and selected values settle the remaining shape.

This lesson narrows that lens to one goal: use degree bounds, graph evidence, and function values to analyze turning points and extrema. The point is not to memorize an isolated trick; it is to know what evidence makes the conclusion valid and how a second representation can check it.

Reusable method

A reliable route through the problem

Use the degree-n maximum of $n-1$ turns.
Compare local extrema with end behavior to identify absolute extrema.
Which intervals are positive or negative?.

Verification: Compare the proposed graph with the factorization and leading term. Every real zero, sign interval, end direction, and y-intercept should agree with the same formula.

Foundation walkthrough

Plan before calculating

Problem

Can degree $4$ have five turns?

Plan: Start by identifying the mathematical structure in the prompt. Then use the lesson method rather than guessing from appearance: Use the degree-n maximum of $n-1$ turns and compare local extrema with end behavior to identify absolute extrema.
Conclusion: No; maximum $3$ .
Why the check works: Degree bounds graph complexity.

Worked examples

See the idea in three forms

foundation example

Can degree $4$ have five turns?

SolutionNo; maximum $3$ .

Degree bounds graph complexity.

representation example

Max turns degree $7$ .

Solution $6$

This example expresses turning points and local versus global behavior in a second form.

transfer example

Does every zero create a turn?

SolutionNo.

Odd-degree polynomials are unbounded above and below; positive even-degree polynomials have an absolute minimum.

Turning-point gallery. Follow the foundation example from its given information to the conclusion. The labels identify the mathematical feature that makes the result valid: Degree bounds graph complexity. — **Anchor figure · Turning-point gallery**
Follow the foundation example from its given information to the conclusion. The labels identify the mathematical feature that makes the result valid: Degree bounds graph complexity.

Local versus absolute extrema. Read the numbered reasoning path in order. Each stage preserves the quantities, restrictions, or structural conditions needed for turning points and local versus global behavior. — **Mechanism figure · Local versus absolute extrema**
Read the numbered reasoning path in order. Each stage preserves the quantities, restrictions, or structural conditions needed for turning points and local versus global behavior.

Turn versus intercept. Compare the valid path with the tempting shortcut. The figure shows why confusing an x-intercept with a turning point leads to a false conclusion. — **Comparison and error figure · Turn versus intercept**
Compare the valid path with the tempting shortcut. The figure shows why confusing an x-intercept with a turning point leads to a false conclusion.

Common mistake

Find the first invalid move

A frequent error is confusing an x-intercept with a turning point.

Check yourself

Max turns degree $2$ .

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice

Ten concrete questions

Practice 101

Max turns degree $2$ .

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 202

Max turns degree $7$ .

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 303

Does every zero create a turn?

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 404

Which behavior guarantees absolute maximum?

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 505

Explain why this conclusion is valid: No; maximum $3$ . Use the foundation problem as evidence: Can degree $4$ have five turns?

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 606

Solve the representation example, then name the feature of turning points and local versus global behavior that it illustrates: Max turns degree $7$

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 707

Correct this reasoning and identify the first unsafe assumption: A frequent error is confusing an x-intercept with a turning point.

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 808

Connect two representations for this example: Can degree $4$ have five turns? Describe what a graph, table, mapping, or algebraic form would have to show.

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 909

Create a nearby example by changing one number or condition in this prompt: Does every zero create a turn? Predict the effect, solve your new example, and compare it with the original.

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Practice 1010

Write a short verification checklist for turning points and local versus global behavior, then apply it to one worked example from this lesson.

Write a complete attempt before opening the exact answer.

Attempt once to unlock the answer

Complete a substantive attempt before revealing the server-held answer.

Lesson close

Connect forward

The next lesson, Intermediate Value reasoning and root bounds, uses this result as part of a larger structure.

Source record

Original BetterGrades manuscript, rights-separated references.

Lippman and Rasmussen, Precalculus Volume 1
Stitz and Zeager, Precalculus
Redden, Advanced Algebra

No long source passage is reproduced.

Can degree 444 have five turns?

Can degree 444 have five turns?

Max turns degree 777.

Does every zero create a turn?

Original BetterGrades manuscript, rights-separated references.

Can degree $4$ have five turns?

Can degree $4$ have five turns?

Max turns degree $7$ .