If and , then every element of is an upper bound for the set .
So which is a compact set, and so closed and bounded. Consequently there exists a least upper bound, and and so is a set of upper bounds for .
Is this correct?
the proof is ok, but i don't think compactness is needed here, it's a bit of an overkill. the completeness axiom which can be applied to any half-bounded set of real numbers could be used to draw the same conclusion.
Oh ok, thanks. I just thought it would sort of nifty and neat.
yes, it is nifty. i just learnt about compactness the other day myself, cool stuff. but sometimes we want to be simple and economical. using compactness is fine, your proof will stand out from the rest of the pack. but it depends on what type of professor you have that will determine if that is good or bad