User:IssaRice/Extreme value theorem: Difference between revisions
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
* Since <math>c-\delta/2 < c</math>, there exists <math>x \in X</math> such that <math>c-\delta/2 < x</math> (otherwise <math>c-\delta/2</math> would be a smaller upper bound for <math>X</math>). So <math>\sup V_{c-\delta/2} \leq \sup V_x < M</math>. This means that <math>f(t) \leq \sup V_{c-\delta/2} < M</math> for all <math>t \in [a,c-\delta/2]</math>. | * Since <math>c-\delta/2 < c</math>, there exists <math>x \in X</math> such that <math>c-\delta/2 < x</math> (otherwise <math>c-\delta/2</math> would be a smaller upper bound for <math>X</math>). So <math>\sup V_{c-\delta/2} \leq \sup V_x < M</math>. This means that <math>f(t) \leq \sup V_{c-\delta/2} < M</math> for all <math>t \in [a,c-\delta/2]</math>. | ||
* But now if <math>c-\delta/2 \ | * But now if <math>t \in [c-\delta/2, c]</math>, then <math>|t-c|<\delta</math>, so <math>|f(t)-f(c)|<\epsilon</math>. This means <math>f(t) < f(c) + \epsilon < M</math>. | ||
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>. | ||
Revision as of 23:27, 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 .
Our goal now is to find some such that . If this is easy.
So 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 . To do this, we split the interval into two parts. Choose with .[note 1] By continuity at , there exists a such that implies . So now pick a point like , and split the interval into and .
- Since , there exists such that (otherwise would be a smaller upper bound for ). So . This means that for all .
- But now if , then , so . 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 .