Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Real 15

Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

18.

100A: Complete Lecture Notes


Lecture 16:
The Min/Max Theorem and Bolzano’s Intermediate Value Theorem

As we will see in today’s lecture, continuous functions are well behaved on closed intervals of the form [a, b],
with f ([a, b]) = [e, f ] for some e, f ∈ R.

Definition 1 (Bounded Functions)


A function f : S → R is bounded if ∃B ≥ 0 such that for all x ∈ S,

|f (x)| ≤ B.

Theorem 2
If f : [a, b] → R is continuous then f is bounded.

Proof : Suppose for the sake of contradiction that f : [a, b] → R is continuous and f is unbounded. Then, ∀n ∈ N,
∃xn ∈ [a, b] such that |f (xn )| ≥ n. By the Bolzano-Weierstrass theorem, ∃ a subsequence {xnk }k of {xn }n and an
x ∈ R such that xnk → x. Since a ≤ xnk ≤ b for all k, a ≤ x ≤ b. Given f is continuous at x by assumption,

f (x) = lim f (xnk ) =⇒ |f (x)| = lim |f (xnk )|.


k→∞ k→∞

Therefore, {|f (xnk )|} is bounded, and thus {nk } is bounded since nk ≤ |f (xnk )|. But by the definition of a
subsequence, we must have k ≤ nk for all k, contradicting the boundedness of {nk }.

Definition 3 (Absolute Minimum/Maximum)


Let f : S → R. Then, f achieves an absolute minimum at c if ∀x ∈ S, f (x) ≥ f (c). Similarly, f achieves an
absolute maximum at d if ∀x ∈ S, f (x) ≤ f (d).

Theorem 4 (Min-Max Theorem)


Let f : [a, b] → R. If f is continuous, then f achieves an absolute maximum and absolute minimum.

1
Remark 5. Note that this is also called the Extreme Value Theorem or EVT for short, though to stay consistent
with the Lebl’s book I will be calling it the Min-Max theorem.

Proof : We will prove this for the absolute maximum. If f is continuous, then f is bounded by the previous
theorem. Thus, the set
E = {f (x) | x ∈ [a, b]}

is bounded above. Let L = sup E. Then,


1. L is an upper bound for E, i.e.
∀x ∈ [a, b], f (x) ≤ L.

2. There exists a sequence {f (xn )}n with xn ∈ [a, b] such that f (xn ) → L.
By the Bolzano-Weierstrass theorem, there exists a subsequence {xnk }k of {xn } and d ∈ [a, b] such that xnk → d
as k → ∞. Hence,
f (d) = lim f (xnk ) = lim f (xn ) = L
k→∞ n→∞

by the continuity of f . Thus, f achieves an absolute maximum at d.


We leave the absolute minimum proof to the reader.

Remark 6. As students of mathematics, we also care about the necessity of the hypotheses!

For example, what if f : [a, b] → R is not continuous? Does the Min-Max theorem apply? The answer is no.
Consider 
 1 x = 0, 1
f (x) = 2 .
x x ∈ (0, 1)

Here, f neither achieves an absolute maximum nor an absolute minimum on [0, 1].
What if f : S → R and S is not closed and bounded? Does the Min-Max theorem apply? Again, the answer
1
is no. Consider f (x) = x1 − 1−x on S = (0, 1). Even though f is continuous on S, f neither achieves an absolute
minimum nor an absolute maximum.
So far we have shown that if f : [a, b] → R is continuous, then f ([a, b]) ⊂ [f (c), f (d)] where f achieves an
absolute minimum at c and an absolute maximum at d.

Question 7. Does f achieve all values in f (c) and f (d)?

The answer is yes, by Bolzano’s Intermediate Value Theorem as we will show.

Theorem 8
Let f : [a, b] → R. If f (a) < 0 and f (b) > 0, then ∃c ∈ (a, b) such that f (c) = 0.

Proof : We prove this using a bisection method. Let a1 = a and b1 = b, and define a2 , b2 as follows: If f ((a1 +
b1 )/2) ≥ 0, define a2 = a1 , b2 = a1 +b
2 . If f ((a1 + b1 )/2) < 0, define a2 =
1 a1 +b1
2 and b2 = b1 . In general, if we
know an , bn , we choose an+1 and bn+1 as follows: If f ((an + bn )/2) ≥ 0, define an+1 = an , b2 n + 1 = an +b
2
n
. If
an +bn
f ((an + bn )/2) < 0, define an+1 = 2 and bn+1 = bn . Thus, we have:
1. ∀n ∈ N, a ≤ an ≤ an+1 ≤ bn+1 ≤ bn ≤ b.
bn −an
2. ∀n ∈ N, bn+1 − an+1 = 2 .

3. ∀n ∈ N, f (an ) < 0 and f (bn ) ≥ 0.

2
By 1., {an } and {bn } are monotone increasing and monotone decreasing respectively, both of which are bounded.
Thus, ∃c, d ∈ [a, b] such that an → c and bn → d. By 2.,

bn−1 − an−1 1 1
bn − an = = (bn−2 − an−2 ) = · · · = n−1 (b − a).
2 4 2
Thus,
1
d − c = lim (bn − an ) = lim (b − a) = 0 =⇒ d = c.
n→∞ n→∞ 2n−1

Therefore, limn→∞ an = limn→∞ bn = c. By 3., f (c) = limn→∞ f (an ) ≤ 0 and f (c) = limn→∞ f (bn ) ≥ 0.
Therefore, f (c) = 0.

Theorem 9 (Bolzano IVT)


Let f : [a, b] → R be continuous. If f (a) < f (b), and y ∈ (f (a), f (b)), ∃c ∈ (a, b) such that f (c) = y. If
f (b) < f (a) and y ∈ (f (b), f (a)), ∃c ∈ (a, b) such that f (c) = y.

Remark 10. This is known as the Intermediate Value Theorem or IVT for short.

Proof : Suppose f (a) < f (b). Let y ∈ (f (a), f (b)). Define g(x) = f (x) − y. Then, g : [a, b] → R is continuous,
g(a) = f (a) − y < 0 and g(b) = f (b) − y > 0. Therefore, by the previous theorem, ∃c ∈ (a, b) such that g(c) = 0.
Therefore, ∃c ∈ (a, b) such that g(c) = f (c) − y = 0 =⇒ f (c) = y.
The other direction is analogous.

Theorem 11
Let f : [a, b] → R be continuous. let c ∈ [a, b] be where f achieves an absolute minimum and d ∈ [a, b] be where
f achieves an absolute maximum. Then,

f ([a, b]) = [f (c), f (d)].

In other words, every value between the absolute minimum value and the absolute maximum value is achieved.

Proof : We know that f ([a, b]) ⊆ [f (c), f (d)]. Hence, we prove the other direction. By the IVT applied to
f : [c, d] → R,
[f (c), f (d)] ⊆ f ([c, d]) ⊆ f ([a, b]).

Therefore, f ([a, b]) = [f (c), f (d)].


Of course, Bolzano IVT is false if we assume f is not continuous (as can be seen by the following diagram):

Theorem 12
The polynomial f (x) = x2021 + x2020 + 9.03x + 1 has at least one real root.

3
Proof : Notice that f (0) = 1 > 0 and f (−1) = −1 + 1 − 9.03 + 1 = −8.03 < 0. Thus, by IVT, ∃c ∈ (−1, 0) such
that f (c) = 0.

4
MIT OpenCourseWare
https://ocw.mit.edu

18.100A / 18.1001 Real Analysis


Fall 2020

For information about citing these materials or our Terms of Use, visit: https://ocw.mit.edu/terms.

You might also like