User:IssaRice/Extreme value theorem: Difference between revisions
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
For <math>x \in [a,b]</math>, define <math>V_x = f([a,x]) = \{f(t) : a \leq t \leq x\}</math> to be the image of <math>f</math> up to and including <math>x</math>. | For <math>x \in [a,b]</math>, define <math>V_x = f([a,x]) = \{f(t) : a \leq t \leq x\}</math> to be the image of <math>f</math> up to and including <math>x</math>. | ||
Let <math>M = \sup\{f(x) : x \ | Let <math>M = \sup\{f(x) : a \leq x \leq b\} = \sup V_b</math> and <math>X = \{x \in [a,b] : \sup V_x < M\}</math>. | ||
Now suppose <math>f(a) < M</math>. Then <math>a \in X</math>. We already know that <math>X</math> is bounded above, for instance by the number <math>b</math>. We can thus take the least upper bound of <math>X</math>, say <math>c = \sup X</math>. We already know <math>f(c) \leq M</math>, so if we can just eliminate the possibility that <math>f(c) < M</math>, we will be done. | Now suppose <math>f(a) < M</math>. Then <math>a \in X</math>. We already know that <math>X</math> is bounded above, for instance by the number <math>b</math>. We can thus take the least upper bound of <math>X</math>, say <math>c = \sup X</math>. We already know <math>f(c) \leq M</math>, so if we can just eliminate the possibility that <math>f(c) < M</math>, we will be done. | ||
| Line 14: | Line 14: | ||
Now we can choose <math>M' = \max\{\sup V_{c-\delta/2}, f(c) + \epsilon\}</math>. | Now we can choose <math>M' = \max\{\sup V_{c-\delta/2}, f(c) + \epsilon\}</math>. | ||
If <math>c < b</math> then | |||
<math>\ | If <math>t \leq c-\delta/2</math> then there exists some <math>x \in X</math> such that <math>t < x</math>. This means <math>\sup V_t \leq \sup V_x < M</math> so <math>t \in X</math>. Otherwise if <math>c-\delta/2 \leq t \leq c</math> then <math>|t-c|<\delta</math> so <math>f(t) < f(c) + \epsilon < M</math>. So now what can we say about <math>\sup V_c</math>? We want to say <math>\sup V_c < M</math>. We can do this by showing that there exists a number <math>M' < M</math> such that <math>f(t) < M'</math> for all <math>t \in [a,c]</math>. That way, <math>\sup V_c \leq M' < M</math>. But <math>M' = \sup V_c</math> works. | ||
Therefore, <math>c=b</math>, which implies that | |||
Therefore, <math>c=b</math>, which implies that . So the assumption that <math>f(c) < M</math> was false, and we conclude <math>f(c) = M</math>. | |||
If <math>c=b</math> then <math>M = \sup V_b = \sup V_c < M</math>, a contradiction. | |||
==Notes== | ==Notes== | ||
<references group="note" /> | <references group="note" /> | ||
Revision as of 23:04, 1 June 2019
Working through the proof in Pugh's book by filling in the parts he doesn't talk about.
For , define to be the image of up to and including .
Let and .
Now suppose . Then . We already know that is bounded above, for instance by the number . We can thus take the least upper bound of , say . We already know , so if we can just eliminate the possibility that , we will be done.
So suppose . We want to find such that for all . That would mean that .
- Consider . Then since , there exists such that . So so . This also means that for all we have .
- But now if , then by continuity at , We can choose with .[note 1] By continuity at , there exists a such that implies . This means .
Now we can choose .
If then
If then there exists some such that . This means so . Otherwise if then so . So now what can we say about ? We want to say . We can do this by showing that there exists a number such that for all . That way, . But works.
Therefore, , which implies that . So the assumption that was false, and we conclude .
If then , a contradiction.
Notes
- ↑ it is important here that does not equal ; choosing this would be too weak and we would not be able to conclude , rather only that .