Opening subject page...
Loading your content
A systematic method for finding the highest and lowest values a function attains on a closed interval.
The search for maximum and minimum values of functions is one of the oldest motivations in all of calculus. Long before formal derivative notation existed, mathematicians grappled with optimization problems—finding the shortest path, the largest enclosed area, or the most efficient design. The Candidates Test (sometimes called the Closed Interval Method) represents the elegant culmination of centuries of mathematical development, providing a guaranteed procedure for locating absolute (global) extrema on a closed interval. Its theoretical foundation rests on two cornerstones: the Extreme Value Theorem and Fermat's Theorem on interior extrema.
These developments converge in a single practical question: given that we know a continuous function on [a, b] must achieve its absolute maximum and minimum somewhere, how do we actually find them? The Candidates Test answers this question by reducing an infinite search—checking every point in an interval—to a finite list of candidate points where those extreme values can occur.
Before applying the Candidates Test, you must clearly understand the distinction between local and global extrema, the role of critical numbers, and the prerequisites that make the method valid. The test applies exclusively to functions that are continuous on a closed interval [a, b]. If either condition fails—if the function has a discontinuity or the interval is open—the Extreme Value Theorem no longer guarantees that absolute extrema exist, and the Candidates Test may not yield correct results.
The following diagram illustrates the Candidates Test applied to a continuous function on the closed interval [a, b]. Notice how the absolute maximum and minimum occur either at endpoints or at interior critical numbers. The function may have several local extrema, but only the largest and smallest function values among all candidates qualify as the global extrema.
In the diagram above, observe that the absolute maximum does not occur at an endpoint—it happens at the interior critical number c₃. This illustrates a crucial lesson: you cannot assume endpoints are always the answer, nor can you assume the largest local maximum is automatically the global maximum without also checking endpoints. The Candidates Test eliminates guesswork by requiring you to evaluate f at every candidate and then compare.
The Candidates Test rests on two theorems working in concert. The Extreme Value Theorem guarantees existence, and Fermat's Theorem constrains location. Together they reduce an infinite problem to a finite one. Below is the formal statement of each theorem and the algorithm that results from their combination.
A systematic flowchart can help you determine the correct approach when asked to find absolute extrema. The decision depends on two factors: whether the domain is a closed interval and whether the function is continuous on that interval. When both conditions are satisfied, the Candidates Test is the appropriate tool. When either fails, alternative methods—such as limit analysis or the First/Second Derivative Tests on open intervals—are required.
| Type of Critical Number | Condition | Example |
|---|---|---|
| Stationary Point | f′(c) = 0 | f(x) = x² − 4x: f′(x) = 2x − 4 = 0 at x = 2 |
| Corner / Cusp | f′(c) does not exist (DNE) | f(x) = |x − 3|: f′(3) DNE (corner at x = 3) |
| Vertical Tangent | f′(c) DNE (infinite slope) | f(x) = x^(1/3): f′(0) DNE (vertical tangent) |
Let us apply the Candidates Test to find the absolute maximum and absolute minimum of f(x) = 2x³ − 3x² − 12x + 5 on the closed interval [−2, 4]. This polynomial is continuous everywhere, so the Extreme Value Theorem guarantees that absolute extrema exist on this interval.
The Candidates Test is one of several methods for analyzing extrema. Understanding when to use each method is essential for the AP exam. The key differentiator is the type of domain and whether you need to identify local or global extrema. The Candidates Test is uniquely designed for global extrema on closed intervals, whereas the First and Second Derivative Tests classify local extrema.
| Method | Domain Requirement | What It Finds | Limitations |
|---|---|---|---|
| Candidates Test | Closed interval [a, b]; f continuous | Absolute (global) max and min | Cannot be used on open intervals or for functions with discontinuities |
| First Derivative Test | Any interval; f continuous near c | Local max or min at a single critical number | Does not directly determine global extrema; requires sign analysis |
| Second Derivative Test | Any interval; f″(c) must exist | Local max or min at a single critical number | Inconclusive when f″(c) = 0; does not find global extrema |
The Candidates Test is your gateway to the broader topic of optimization, which appears in both free-response and multiple-choice sections of the AP Calculus AB exam. In applied optimization problems, you typically model a real-world quantity as a function, identify the feasible domain (which is often a closed interval determined by physical constraints), and then apply the Candidates Test to find the optimal value. The method also connects to more advanced topics in multivariable calculus, where the analogous procedure involves Lagrange multipliers and boundary analysis on compact sets.
| AP Calculus AB (This Course) | AP Calculus BC / Multivariable |
|---|---|
| Candidates Test on closed interval [a, b] | Evaluate f on boundary of a region + interior critical points |
| Critical numbers where f′(c) = 0 or f′(c) DNE | Critical points where ∇f = 0 or ∇f DNE |
| Extreme Value Theorem (continuous, closed interval) | Extreme Value Theorem generalized (continuous, compact set) |
| Applied optimization with single-variable models | Lagrange multipliers for constrained optimization |
On the AP Calculus AB exam, you should expect to encounter the Candidates Test both directly ("find the absolute maximum of f on [a, b]") and embedded within applied optimization problems where you first construct the function and determine its domain. The most common free-response optimization questions ask you to maximize or minimize a quantity such as area, volume, cost, or distance, and the final step almost always involves comparing candidate values. Mastering this procedure now provides a strong foundation for constrained optimization in higher mathematics.
The Candidates Test provides a guaranteed method for finding absolute (global) extrema of a continuous function on a closed interval [a, b]. The procedure has four steps: verify continuity on [a, b], find all critical numbers in (a, b) where f′(c) = 0 or f′(c) does not exist, evaluate f at each critical number and at both endpoints, and compare all values. The largest is the absolute maximum; the smallest is the absolute minimum.
This method is grounded in the Extreme Value Theorem (which guarantees existence) and Fermat's Theorem (which constrains location). Unlike the First and Second Derivative Tests, which classify local extrema, the Candidates Test directly identifies global extrema—making it the preferred approach whenever the AP exam asks for absolute maximum or minimum values on a closed interval. Remember: always check endpoints, always check every type of critical number (stationary points, corners, cusps), and always state your conclusion clearly.