Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am currently reviewing some of the proofs in Spivak's Calculus, and I have come across this statement as a part of the proof for Extreme value theorem.

if $f(x)$ is continuous on $[a, b]$ then for every $\epsilon > 0$ there is $x$ in $[a, b]$ with $L - f(x) < \epsilon$ where $L$ is the least upper bound.

Now this basically mean that its a one sided limit where $f(x)$ approaches $L$ but I wonder why there were no justifications for this step in the book, usually nothing is taken for granted in Spivak's proofs but this seems to be something non-trivial by first year analysis standard that is stated as true. So is this some how "obvious" or is Spivak asking the reader to justify this step instead?

Edit: There were no mentioning of any real number properties what-so-ever. This proof is on page 136 of the third edition.

share|improve this question

1 Answer 1

up vote 5 down vote accepted

For any set of real numbers $S$, if $L=\sup S$ is the least upper bound of $S$, then for every $\epsilon>0$ there is an $s\in S$ such that $L-s<\epsilon$. (This is one of the first theorems in baby Rudin if I remember correctly.) In this case, $S=\{f(x)\mid x\in[a,b]\}$.

The proof is simple: if for some $\epsilon>0$ we had $L-s\geq\epsilon$ for all $s\in S$, then for every $s\in S$ we have that $s\leq L-\epsilon$, contradicting the assumption that $L$ is the least upper bound.

The assumption that $f$ is continuous on $[a,b]$ is to ensure that the least upper bound of $S=\{f(x)\mid x\in[a,b]\}$ exists; this is because the continuous image (which here is $S=f([a,b])$) of a compact set (which here is $[a,b]$) is compact, and because $S$ is compact it must be bounded, and therefore have an upper bound, and hence a least upper bound.

share|improve this answer
    
So, this is a theorem? I wonder why Spivak used it without proving it first. –  Mark May 10 '11 at 2:27
1  
@Mark, this is really the definition of $\sup$: anything less that the $\sup$ is not an upper bound. –  lhf May 10 '11 at 2:29
    
On second thought I think Spivak might of used it in his other proof without explicitly mentioning the theorem. –  Mark May 10 '11 at 2:30
    
@Mark: yes, this fact, which follows directly from the definition of the least upper bound is mentioned in Spivak's proof of the Intermediate Value Theorem (Theorem 7-1 in the 3rd Edition). –  cch May 10 '11 at 20:20

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.