Extreme value theorem

From Wikipedia, the free encyclopedia

A continuous function ƒ(x) on the closed interval [a,b] showing the absolute max (red) and the absolute min (blue).
A continuous function ƒ(x) on the closed interval [a,b] showing the absolute max (red) and the absolute min (blue).

In calculus, the extreme value theorem states that if a real-valued function f is continuous in the closed interval [a,b], then f must attain its maximum and minimum value, each at least once. That is, there exist numbers c and d in [a,b] such that:

f(c) \ge f(x) \ge f(d)\quad\text{for all }x\in [a,b].

A weaker version of this theorem is the boundedness theorem which states that a continuous function f in the closed interval [a,b] is bounded on that interval. That is, there exist real numbers m and M such that:

m \le f(x) \le M\quad\text{for all }x \in [a,b].

The extreme value theorem enriches the boundedness theorem by saying that not only is the function bounded, but it also attains its least upper bound as its maximum and its greatest lower bound as its minimum.

The extreme value theorem is used to prove Rolle's theorem. In a formulation due to Karl Weierstrass, this theorem states that a continuous function from a compact space to a subset of the real numbers attains its maximum and minimum.

Contents

[edit] Proving the theorems

We look at the proof for the upper bound and the maximum of f. By applying these results to the function –f, the existence of the lower bound and the result for the minimum of f follows. Also note that everything in the proof is done within the context of the real numbers.

We first prove the boundedness theorem, which is a step in the proof of the extreme value theorem. The basic steps involved in the proof of the extreme value theorem are:

  1. Prove the boundedness theorem.
  2. Find a sequence so that its image converges to the supremum of f.
  3. Show that there exists a subsequence that converges to a point in the domain.
  4. Use continuity to show that the image of the subsequence converges to the supremum.

[edit] Proof of the boundedness theorem

Suppose the function f is not bounded above on the interval [a,b]. Then, by the Archimedean property of the real numbers, for every natural number n, there exists an xn in [a,b] such that f(xn) > n. This defines a sequence {xn}. Because [a,b] is bounded, the Bolzano-Weierstrass theorem implies that there exists a convergent subsequence {x_{n_k}} of {xn}. Denote its limit by x. As [a,b] is closed, it contains x. Because f is continuous at x, we know that {f(x_{n_k})} converges to the real number f(x). But f(x_{n_k}) > nkk for every k, which implies that {f(x_{n_k})} diverges to infinity. Contradiction. Therefore, f is bounded above on [a,b]. 

[edit] Proof of the extreme value theorem

We will now show that the function f has a maximum in the interval [a,b]. By the boundedness theorem, f is bounded from above, hence, by the Dedekind-completeness of the real numbers, the least upper bound (supremum) M of f exists. It is necessary to find a d in [a,b] such that M = f(d). Let n be a natural number. As M is the least upper bound, M – 1/n is not an upper bound for f. Therefore, there exists dn in [a,b] so that M – 1/n < f(dn). This defines a sequence {dn}. Since M is an upper bound for f, we have M – 1/n < f(dn) ≤ M for all n. Therefore, the sequence {f(dn)} converges to M.

The Bolzano-Weierstrass theorem tells us that there exists a subsequence {d_{n_k}}, which converges to some d and, as [a,b] is closed, d is in [a,b]. Since f is continuous at d, the sequence {f(d_{n_k})} converges to f(d). But {f(d_{n_k})} is a subsequence of {f(dn)} that converges to M, so M = f(d). Therefore, f attains its supremum M at d

[edit] Examples

The following examples show why the function domain needs to be closed and bounded.

  1. f(x) = x defined over [0,∞) is not bounded from above.
  2. f(x) = x/(1 + x) defined over [0,∞) is bounded but does not attain its least upper bound 1.
  3. f(x) = 1/x defined over (0,1] is not bounded from above.
  4. f(x) = 1 – x defined over (0,1] is bounded but never attains its least upper bound 1.

Defining f(0) = 0 in the last two examples shows that both theorems require continuity on [a,b].

[edit] Extension to semi-continuous functions

If the continuity of the function f is weakened to semi-continuity, then the corresponding half of the boundedness theorem and the extreme value theorem hold and the values –∞ or +∞, respectively, from the extended real number line can be allowed as possible values. More precisely:

Theorem: If a function f : [a,b] → [–∞,∞) is upper semi-continuous, meaning that

\limsup_{y\to x} f(y)\le f(x)

for all x in [a,b], then f is bounded above and attains its supremum.

Proof: If f(x) = –∞ for all x in [a,b], then the supremum is also –∞ and the theorem is true. In all other cases, the proof is a slight modification of the proofs given above. In the proof of the boundedness theorem, the upper semi-continuity of f at x only implies that the limit superior of the subsequence {f(x_{n_k})} is bounded above by f(x) < ∞, but that is enough to obtain the contradiction. In the proof of the extreme value theorem, upper semi-continuity of f at d implies that the limit superior of the subsequence {f(d_{n_k})} is bounded above by f(d), but this suffices to conclude that f(d) = M

Applying this result to −f proves:

Theorem: If a function f : [a,b] → (–∞,∞] is lower semi-continuous, meaning that

\liminf_{y\to x} f(y)\ge f(x)

for all x in [a,b], then f is bounded below and attains its infimum.

A real-valued function is upper as well as lower semi-continuous, if and only if it is continuous in the usual sense. Hence these two theorems imply the boundedness theorem and the extreme value theorem.

[edit] Topological formulation

In general topology, the extreme value theorem follows from the general fact that compactness is preserved under continuity, and the fact that a subset of the real line is compact if and only if it is both closed and bounded.

[edit] External links