Extreme value theorem
From Wikipedia, the free encyclopedia
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:
A related 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:
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:
- Prove the boundedness theorem.
- Find a sequence so that its image converges to the supremum of f.
- Show that there exists a subsequence that converges to a point in the domain.
- 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 {
} 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(
)} converges to the real number f(x). But f(xnk) > nk ≥ k for every k, which implies that {f(xnk)} 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 {
}, 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(
)} converges to f(d). But {f(dnk)} is a subsequence of {f(dn)} that converges to M, so M = f(d). Therefore, f attains its supremum M at d. ∎
[edit] Proof using Non-standard Analysis
In the setting of non-standard calculus, let N be an infinite hyperinteger. The interval [0, 1] has a natural hyperreal extension. Consider its partition into N subintervals of equal length 1/N, with partition points xi = i / N as i runs from 0 to N. The function f is also extended to hyperreals between 0 and 1. Note that in the standard setting (when N is finite), a point with the maximal value of f can always be chosen among the N+1 points xi, by induction. Hence, by the transfer principle, there is an hyperinteger i0 such that
and
for all i = 0,...,N. Consider the real point
where st is the standard part function. An arbitrary real point x lies in a suitable sub-interval of the partition, namely
, so that st(xi) = x. Applying st to the inequality
, we obtain by continuity of f that
, for all x, proving c to be a maximum of f. See Keisler (1986, p. 164).
[edit] Examples
The following examples show why the function domain needs to be closed and bounded.
- f(x) = x defined over [0,∞) is not bounded from above.
- f(x) = x/(1 + x) defined over [0,∞) is bounded but does not attain its least upper bound 1.
- f(x) = 1/x defined over (0,1] is not bounded from above.
- 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
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(xnk)} 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(dnk)} 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
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] References
- Keisler, H. Jerome (1986). Elementary calculus. An infinitesimal approach. Boston, Massachusetts: Prindle, Weber & Schmidt. ISBN 0-87150-911-3.
[edit] External links
- A Proof for extreme value theorem at cut-the-knot
- Boundedness Theorem on PlanetMath
- Extreme Value Theorem on PlanetMath
- Extreme Value Theorem by Jacqueline Wandzura with additional contributions by Stephen Wandzura, the Wolfram Demonstrations Project.
- Eric W. Weisstein, Extreme Value Theorem at MathWorld.
| Rozmowy przedstawicieli Gazpromu i Naftohazu |
|
W nocy ze środy na czwartek doszło w Moskwie do spotkania szefów rosyjskiego Gazpromu i ukraińskiej firmy Naftohaz - ujawniła rano agencja ITAR-TASS.
|
| Zablokowany wjazd na obwodnicę Torunia |
|
Zablokowana jest droga krajowa nr 10 przy wjeździe na obwodnicę Torunia w Lubiczu, gdzie w czwartek rano zderzyły się cztery samochody. Jedna osoba została ranna.
|
| TIR wpadł w poślizg - zginęła jedna osoba |
|
Do wypadku dwóch TIR-ów doszło w środę wieczorem na drodze krajowej nr 2 siedem kilometrów od Świecka (Lubuskie). Na miejscu zginął pasażer jednego z pojazdów - poinformował oficer dyżurny lubuskiej policji.
|
| Odciążą Augustów kosztem innej miejscowości? |
|
Generalna Dyrekcja Dróg Krajowych i Autostrad w Białymstoku chciałaby odciążyć Augustów i skierować część ruchu tirów na drogę biegnącą przez miejscowość Raczki, czytamy w "Naszym Dzienniku".
|
| USA: Powodzie na północnym zachodzie |
|
Groźne powodzie wystąpiły w środę w położonym na północnym zachodzie USA stanie Waszyngton. W rezultacie szybkiego przyboru wód w rzekach zalane zostały znaczne obszary. Władze wezwały tysiące osób do opuszczenia ich domów.
|
![f(c) \ge f(x) \ge f(d)\quad\text{for all }x\in [a,b].\,](http://upload.wikimedia.org/math/f/d/f/fdf3c4f486313d3b0661682e1d4e8eb5.png)
![m \le f(x) \le M\quad\text{for all }x \in [a,b].\,](http://upload.wikimedia.org/math/8/7/f/87f8a51aab222214a0472ef36b8631e3.png)


