User:IssaRice/Extreme value theorem: Difference between revisions
No edit summary |
No edit summary |
||
Line 9: | Line 9: | ||
So 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. | So 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. | ||
So suppose <math>f(c) < M</math>. We want to find <math>M' < M</math> such that <math>f(t) < M'</math> for all <math>t \in [a,c]</math>. That would mean that <math>\sup V_c \leq M' < M</math>. To do this, we split the interval into two parts. | So suppose <math>f(c) < M</math>. We want to find <math>M' < M</math> such that <math>f(t) < M'</math> for all <math>t \in [a,c]</math>. That would mean that <math>\sup V_c \leq M' < M</math>. To do this, we split the interval into two parts. Choose <math>\epsilon > 0</math> with <math>\epsilon < M - f(c)</math>.<ref group="note">It is important here that <math>\epsilon</math> does not equal <math>M - f(c)</math>; choosing this <math>\epsilon</math> would be too weak and we would not be able to conclude <math>\sup V_c < M</math>, rather only that <math>\sup V_c \leq M</math>.</ref> By continuity at <math>c</math>, there exists a <math>\delta > 0</math> such that <math>|t-c|<\delta</math> implies <math>|f(t)-f(c)|<\epsilon</math>. So now pick a point like <math>c - \delta/2</math>, and split the interval into <math>[a,c-\delta/2]</math> and <math>[c-\delta/2,c]</math>. | ||
* Consider <math>t = c - \delta/2</math>. Then since <math>t < c</math>, there exists <math>x \in X</math> such that <math>t < x</math>. So <math>\sup V_t \leq \sup V_c < M</math> so <math>f(t) \leq \sup V_t < M</math>. This also means that for all <math>x \in [a,c-\delta/2]</math> we have <math>f(x) \leq \sup V_t < M</math>. | * Consider <math>t = c - \delta/2</math>. Then since <math>t < c</math>, there exists <math>x \in X</math> such that <math>t < x</math>. So <math>\sup V_t \leq \sup V_c < M</math> so <math>f(t) \leq \sup V_t < M</math>. This also means that for all <math>x \in [a,c-\delta/2]</math> we have <math>f(x) \leq \sup V_t < M</math>. | ||
* But now if <math>c-\delta/2 \leq t \leq c</math>, then | * But now if <math>c-\delta/2 \leq t \leq c</math>, then 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:20, 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 .
- Consider . Then since , there exists such that . So so . This also means that for all we have .
- But now if , then 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 .