User:IssaRice/Extreme value theorem: Difference between revisions

From Machinelearning
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) : a \leq t \leq x\}</math> to be the image of <math>f</math> up to and including <math>x</math>.
For <math>x \in [a,b]</math>, define <math>V_x = f([a,x]) = \{f(t) : a \leq t \leq x\}</math> to be the values that <math>f</math> takes on as the input ranges from <math>a</math> to <math>x</math> (inclusive).


Let <math>M = \sup\{f(x) : a \leq x \leq b\} = \sup V_b</math> and <math>X = \{x \in [a,b] : \sup V_x < M\}</math>.
Let <math>M = \sup\{f(x) : a \leq x \leq b\} = \sup V_b</math> and <math>X = \{x \in [a,b] : \sup V_x < M\}</math>.

Revision as of 23:35, 1 June 2019

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

For x[a,b], define Vx=f([a,x])={f(t):atx} to be the values that f takes on as the input ranges from a to x (inclusive).

Let M=sup{f(x):axb}=supVb and X={x[a,b]:supVx<M}.

Our goal now is to find some x such that f(x)=M. If f(a)=M this is easy.

So now suppose f(a)<M. Then aX. 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=supX. We already know f(c)M, so if we can just eliminate the possibility that f(c)<M, we will be done.

So suppose f(c)<M. We want to find M<M such that f(t)<M for all t[a,c]. That would mean that supVcM<M. To do this, we split the interval into two parts. Choose ϵ>0 with ϵ<Mf(c).[note 1] By continuity at c, there exists a δ>0 such that |tc|<δ implies |f(t)f(c)|<ϵ. So now pick a point like cδ/2, and split the interval into [a,cδ/2] and [cδ/2,c].

  • Since cδ/2<c, there exists xX such that cδ/2<x (otherwise cδ/2 would be a smaller upper bound for X). So supVcδ/2supVx<M. This means that f(t)supVcδ/2<M for all t[a,cδ/2].
  • But now if t[cδ/2,c], then |tc|<δ, so |f(t)f(c)|<ϵ. This means f(t)<f(c)+ϵ<M.

Now we can choose M=max{supVcδ/2,f(c)+ϵ}. Then whatever t[a,c] happens to be, we can say f(t)M.

If c<b then by continuity we can find points t to the right of c where supVt<M, which contradicts the fact that c is an upper bound of such points.

Therefore, c=b, which implies that M=supVb=supVc<M, a contradiction. So the assumption that f(c)<M was false, and we conclude f(c)=M.

Notes

  1. It is important here that ϵ does not equal Mf(c); choosing this ϵ would be too weak and we would not be able to conclude supVc<M, rather only that supVcM.