User:IssaRice/Extreme value theorem: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
Working through the proof in Pugh's book by filling in the parts he doesn't talk about. | Working through the proof in Pugh's book by filling in the parts he doesn't talk about. | ||
For <math>x \in [a,b]</math>, define <math>V_x = f([a,x]) = \{f(t) : t \in [a,x]\}</math> to be the image of <math>f</math> up to and including <math>x</math>. | |||
Let <math>M = \sup\{f(x) : x \in [a,b]\}</math> and <math>X = \{x \in [a,b] : \sup V_x < M\}</math>. | Let <math>M = \sup\{f(x) : x \in [a,b]\}</math> and <math>X = \{x \in [a,b] : \sup V_x < M\}</math>. | ||
Revision as of 22:25, 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 can choose with .[note 1] By continuity at , there exists a such that implies . This means . 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.
so let . Then and if we have .
Therefore, , which implies that , 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 .