User:IssaRice/Extreme value theorem: Difference between revisions
(Created page with "Working through the proof in Pugh's book by filling in the parts he doesn't talk about. Let <math>M = \sup\{f(x) : x \in [a,b]\}</math> and <math>X = \{x \in [a,b] : \sup V_x...") |
No edit summary |
||
| Line 5: | Line 5: | ||
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. | ||
So suppose <math>f(c) < M</math>. We can choose <math>\epsilon > 0</math> with <math>\epsilon < M - f(c)</math>. (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>.) 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>. This means <math>f(t) < f(c) + \epsilon < M</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. | So suppose <math>f(c) < M</math>. We can choose <math>\epsilon > 0</math> with <math>\epsilon < M - f(c)</math>. (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>.) 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>. This means <math>f(t) < f(c) + \epsilon < M</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. | ||
<math>\sup V_{c-\delta/2} < M</math> so let <math>M' = (M+\sup V_{c-\delta/2})/2</math>. Then <math>\sup V_{c-\delta/2} < M' < M</math> and if <math>v \in V_{c-\delta/2}</math> we have <math>v \leq \sup V_{c-\delta/2} < M'</math>. | <math>\sup V_{c-\delta/2} < M</math> so let <math>M' = (M+\sup V_{c-\delta/2})/2</math>. Then <math>\sup V_{c-\delta/2} < M' < M</math> and if <math>v \in V_{c-\delta/2}</math> we have <math>v \leq \sup V_{c-\delta/2} < M'</math>. | ||
Therefore, <math>c=b</math>, which implies that <math>M = \sup V_b = \sup V_c < M</math>, a contradiction. | Therefore, <math>c=b</math>, which implies that <math>M = \sup V_b = \sup V_c < M</math>, a contradiction. | ||
Revision as of 22:20, 1 June 2019
Working through the proof in Pugh's book by filling in the parts he doesn't talk about.
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: 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 .) 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.