Tutorials › AP Calculus › What the Extreme Value Theorem Guarantees

Mean and Extreme Value Theorems · Tutorial 320 of 999

What the Extreme Value Theorem Guarantees

Understand the guarantee of the Extreme Value Theorem, why its hypotheses ensure attained extrema, and why existence alone does not identify their locations.

Intermediate 9 min read

What You'll Learn

  • State the Extreme Value Theorem for a continuous function on a closed interval
  • Distinguish an absolute maximum or minimum from a value that is only approached
  • Follow a proof of the theorem using convergent subsequences
  • Identify what the theorem guarantees about existence and attainment
  • Avoid assuming that an absolute extremum must occur at an endpoint
  • Verify absolute extrema directly in simple examples

Why an Existence Guarantee Matters

A function may have values that get closer and closer to a highest level without ever reaching it. The Extreme Value Theorem rules out that possibility when the function is continuous on a closed interval: the function must actually attain both a greatest value and a least value there.

This guarantee is useful even before we know how to find the extrema. It tells us that the search has a definite answer: under the theorem’s conditions, there is at least one input where the highest value occurs and at least one where the lowest value occurs. The theorem does not, by itself, tell us which inputs they are.

Definition: A function \(f\) has an absolute maximum on a set \(D\) at \(c\in D\) if \(f(c)\ge f(x)\) for every \(x\in D\). The value \(f(c)\) is the absolute maximum value. An absolute minimum at \(c\in D\) means \(f(c)\le f(x)\) for every \(x\in D\); \(f(c)\) is the absolute minimum value.

The word attains is important. An absolute maximum is a function value \(f(c)\) at an input \(c\) in the domain, not merely a number that the function’s values approach. More than one input can attain the same absolute maximum or minimum.

The Extreme Value Theorem

Theorem: If \(f\) is continuous on the closed interval \([a,b]\), where \(a\le b\), then there are points \(c_{\min},c_{\max}\in[a,b]\) such that $$ f(c_{\min})\le f(x)\le f(c_{\max}) \quad\text{for every }x\in[a,b]. $$ Thus \(f(c_{\min})\) is an absolute minimum value and \(f(c_{\max})\) is an absolute maximum value on the interval.

For a nondegenerate interval, the hypotheses have two parts: \(f\) must be continuous at every point of the interval, and the domain under consideration must be a closed, bounded interval \([a,b]\). The endpoints are included. If \(a=b\), the interval contains just one point, and both the minimum and maximum are simply \(f(a)\).

The theorem makes an existence claim, not a location claim. It does not say that the extrema occur at the endpoints, that each occurs at only one input, or that a particular method has already identified where they occur.

Worked Example: A Maximum and Minimum from a Square

Worked Example: A Maximum and Minimum from a Square

Consider \(f(x)=5-(x-2)^2\) on \([0,4]\). Since \(0\le x\le4\), subtracting \(2\) gives \(-2\le x-2\le2\). Therefore, \(0\le(x-2)^2\le4\), and so

$$ 1=5-4\le 5-(x-2)^2\le5. $$

This proves that no function value on the interval is below \(1\) or above \(5\). At \(x=2\),

$$ f(2)=5-(2-2)^2=5-0=5. $$

At the endpoints,

$$ f(0)=5-(0-2)^2=5-4=1, \qquad f(4)=5-(4-2)^2=5-4=1. $$

Thus the absolute maximum value is \(5\), attained at \(x=2\), and the absolute minimum value is \(1\), attained at both endpoints. The bounds and substitutions verify both claims.

Why Continuity and the Closed Interval Guarantee Attainment

The key idea in the proof is that any sequence of inputs in a closed, bounded interval has a subsequence that converges to a point still in that interval. Continuity then carries the limiting behavior of the inputs over to the function values. Here is the argument in detail.

1
Sequences in \([a,b]\) have convergent subsequences.
Bisect \([a,b]\). At least one of the two closed halves contains infinitely many terms of a given sequence in \([a,b]\). Keep such a half and bisect it again. Repeating this produces nested closed intervals, each containing infinitely many terms, whose lengths are \((b-a)/2^k\) after \(k\) bisections. Choose terms with increasing indices, taking the \(k\)th chosen term from the \(k\)th interval. The intervals have a single common point \(c\in[a,b]\), and their lengths approach \(0\). The chosen subsequence therefore converges to \(c\).
2
Continuity forces \(f\) to be bounded on \([a,b]\).
Suppose, to the contrary, that the function values were unbounded in absolute value. We could choose \(x_n\in[a,b]\) with \(|f(x_n)|>n\) for each positive integer \(n\). By Step 1, some subsequence \(x_{n_k}\) converges to \(c\in[a,b]\). Since \(f\) is continuous at \(c\), \(f(x_{n_k})\) converges to the finite value \(f(c)\), so those function values must be bounded. This contradicts \(|f(x_{n_k})|>n_k\). Thus the function values are bounded.
3
Construct a sequence of function values approaching the supremum.
Because the function values are bounded and the interval is nonempty, their set has a supremum \(M\), meaning the least upper bound. For each positive integer \(n\), the definition of supremum gives an input \(x_n\in[a,b]\) with \(M-\frac{1}{n}<f(x_n)\le M\). Otherwise \(M-\frac{1}{n}\) would be an upper bound smaller than \(M\).
4
Show that the supremum is attained.
By Step 1, a subsequence \(x_{n_k}\) converges to some \(c\in[a,b]\). The inequalities \(M-\frac{1}{n_k}<f(x_{n_k})\le M\), together with \(n_k\to\infty\), imply that \(f(x_{n_k})\to M\). Continuity at \(c\) also implies \(f(x_{n_k})\to f(c)\). Limits are unique, so \(f(c)=M\). The supremum is therefore an actual function value: \(f\) attains its absolute maximum.
5
Apply the same reasoning to the minimum.
The function \(-f\) is continuous on \([a,b]\), so the argument above shows that \(-f\) attains an absolute maximum there. If that maximum occurs at \(d\), then \(-f(d)\ge -f(x)\) for every \(x\in[a,b]\). Reversing signs gives \(f(d)\le f(x)\) for every \(x\in[a,b]\). Thus \(f\) attains an absolute minimum as well.

This proof explains the roles of the hypotheses. Boundedness ensures that there are finite upper and lower bounds to consider. The closed interval ensures that a limit point reached by a subsequence remains in the domain. Continuity ensures that function values along inputs approaching that point converge to the value at the point. Together, these facts turn a limiting bound into an attained value.

Worked Example: Absolute Extrema of an Absolute-Value Function

Worked Example: Absolute Extrema of an Absolute-Value Function

Let \(g(x)=|x-1|\) on \([0,3]\). For \(x\in[0,3]\), we have \(-1\le x-1\le2\). Hence \(0\le|x-1|\le2\). The lower bound is attained at \(x=1\):

$$ g(1)=|1-1|=0. $$

The upper bound is attained at \(x=3\):

$$ g(3)=|3-1|=|2|=2. $$

Therefore, the absolute minimum value is \(0\), and the absolute maximum value is \(2\). For an additional check at the other endpoint, \(g(0)=|0-1|=1\), which lies between \(0\) and \(2\). The theorem guarantees that extrema exist because \(g\) is continuous on \([0,3]\); the bounds and substitutions identify and verify them in this example.

Worked Example: Extrema of a Cubic on an Interval

Worked Example: Extrema of a Cubic on an Interval

Consider \(h(x)=x^3\) on \([-2,1]\). To bound its values directly, first note that \(x+2\ge0\) on this interval and

$$ x^2-2x+4=(x-1)^2+3>0. $$

Thus \((x+2)(x^2-2x+4)\ge0\). Since this product equals \(x^3+8\), it follows that \(x^3\ge-8\). For the upper bound, \(1-x\ge0\), and

$$ x^2+x+1=\left(x+\frac12\right)^2+\frac34>0. $$

Therefore, \((1-x)(x^2+x+1)\ge0\). This product equals \(1-x^3\), so \(x^3\le1\). We have proved \(-8\le h(x)\le1\) throughout the interval. At the endpoints,

$$ h(-2)=(-2)^3=-8, \qquad h(1)=1^3=1. $$

The bounds are both attained: the absolute minimum is \(-8\) at \(x=-2\), and the absolute maximum is \(1\) at \(x=1\). Substitution into the function confirms each value.

What the Theorem Does Not Tell You

A common mistake is to treat the existence guarantee as a rule about where an extremum must occur. For example, consider \(p(x)=4-(x-1)^2\) on \([0,2]\). A mistaken conclusion might be, “The interval has endpoints \(0\) and \(2\), so the maximum must be at one of them.” But direct substitution gives

$$ p(0)=4-(0-1)^2=3, \qquad p(2)=4-(2-1)^2=3. $$

At the interior input \(x=1\), however,

$$ p(1)=4-(1-1)^2=4. $$

Indeed, \((x-1)^2\ge0\) implies \(p(x)\le4\), with equality at \(x=1\). The absolute maximum is \(4\), not the endpoint value \(3\). The correction is simple: the Extreme Value Theorem guarantees that a maximum and minimum are attained somewhere in the interval. It does not say they occur at the endpoints.

The distinction matters in applications. If a continuous quantity, such as a modeled height or cost, is considered over a fixed closed interval of inputs, the theorem guarantees that its highest and lowest values are reached. To identify those values or the inputs where they occur, additional reasoning is needed.

Takeaway: Continuity on a closed interval guarantees an attained absolute maximum and an attained absolute minimum. It guarantees existence, not uniqueness, location, or a method for finding the extrema.

Check Your Understanding

Use the theorem’s hypotheses and the meaning of “attains” to answer these questions.

  1. State the Extreme Value Theorem in your own words, including its hypotheses.
  2. What does it mean for \(f\) to attain an absolute maximum at \(c\)?
  3. Why does continuity matter in the proof when a sequence of inputs converges to a point in the interval?
  4. Does the theorem guarantee that an absolute maximum is unique? Explain.
  5. Does the theorem guarantee that an absolute maximum occurs at an endpoint? Explain.

Test yourself: AP Calculus practice exams

Ready to check what you know? Work an AP-style practice exam, then open the full solutions.

Want all 1,114 practice problems?

This tutorial covers one topic. Calc Pass covers all of AP Calculus AB & BC: full review, every practice question, and step-by-step solutions to each one.

QR code to download the Calc Pass app

Get the Calc Pass App

Scan to download and practice on the go, with instant scoring.

Calc Pass Volume 1: 1,114 Practice Questions book cover

Vol. 1: 1,114 Questions

The complete practice question bank, organized by AB & BC topic.

View on Amazon
Calc Pass Volume 2: Solutions Manual book cover

Vol. 2: Solutions Manual

Fully worked solutions to every question in Volume 1.

View on Amazon