User:IssaRice/Extreme value theorem: Difference between revisions

Revision as of 22:23, 1 June 2019

Working through the proof in Pugh's book by filling in the parts he doesn't talk about.

Let $M = sup {f (x) : x \in [a, b]}$ and $X = {x \in [a, b] : sup V_{x} < M}$ .

Now suppose $f (a) < M$ . Then $a \in X$ . We already know that $X$ is bounded above, for instance by the number $b$ . We can thus take the least upper bound of $X$ , say $c = sup X$ . We already know $f (c) \leq M$ , so if we can just eliminate the possibility that $f (c) < M$ , we will be done.

So suppose $f (c) < M$ . We can choose $ϵ > 0$ with $ϵ < M - f (c)$ .^{[note 1]} By continuity at $c$ , there exists a $δ > 0$ such that $| t - c | < δ$ implies $| f (t) - f (c) | < ϵ$ . This means $f (t) < f (c) + ϵ < M$ . If $t \leq c - δ / 2$ then there exists some $x \in X$ such that $t < x$ . This means $sup V_{t} \leq sup V_{x} < M$ so $t \in X$ . Otherwise if $c - δ / 2 \leq t \leq c$ then $| t - c | < δ$ so $f (t) < f (c) + ϵ < M$ . So now what can we say about $sup V_{c}$ ? We want to say $sup V_{c} < M$ . We can do this by showing that there exists a number $M^{'} < M$ such that $f (t) < M^{'}$ for all $t \in [a, c]$ . That way, $sup V_{c} \leq M^{'} < M$ . But $M^{'} = sup V_{c}$ works.

$sup V_{c - δ / 2} < M$ so let $M^{'} = (M + sup V_{c - δ / 2}) / 2$ . Then $sup V_{c - δ / 2} < M^{'} < M$ and if $v \in V_{c - δ / 2}$ we have $v \leq sup V_{c - δ / 2} < M^{'}$ .

Therefore, $c = b$ , which implies that $M = sup V_{b} = sup V_{c} < M$ , a contradiction.

Notes

↑ it is important here that $ϵ$ does not equal $M - f (c)$ ; choosing this $ϵ$ would be too weak and we would not be able to conclude $sup V_{c} < M$ , rather only that $sup V_{c} \leq M$ .

[1] t is important here that $ϵ$ does not equal $M - f (c)$ ; choosing this $ϵ$ would be too weak and we would not be able to conclude $sup V_{c} < M$ , rather only that $sup V_{c} \leq M$ .

[note 1]

@@ 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.
-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.
+So suppose <math>f(c) < M</math>. We can 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>. 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>.
 Therefore, <math>c=b</math>, which implies that <math>M = \sup V_b = \sup V_c < M</math>, a contradiction.
+==Notes==
+<references group="note" />