Prove that a nonempty finite contains its Supremum

[inverse]

Prove that a nonempty finite [itex]S\,\subseteq\,\mathbb{R}[/itex] contains its Supremum.

If S is a finite subset of ℝ less than or equal to ℝ, then ∃ a value "t" belonging to S such that t ≥ s where s ∈ S.

This is the only way I see to prove it, I hope your help

Regards

 

[SteveL27]

Prove that a nonempty finite [itex]S\,\subseteq\,\mathbb{R}[/itex] contains its Supremum.

If S is a finite subset of R less than or equal to IR, then ∃ a value "t" belonging to S such that t ≥ s where s ∈ S.

What does it mean for a subset S to be less than or equal to ℝ? [Markup note: to the right there's a box full of handy symbols. You can just click on ℝ and you don't need LaTeX]

And why doesn't your proof work is S is infinite? Why doesn't t exist in that case? What is is about the finite case that makes this work?

 

[mathman]

If S is finite, the largest member can be found in a finite number of steps using pairwise comparisons.

When S is infinite, this may not be possible.

 

[SteveL27]

If S is finite, the largest member can be found in a finite number of steps using pairwise comparisons.

When S is infinite, this may not be possible.

That's true, but hardly on point for the OP's question. By your reasoning, we'd be hard-pressed to show that [0,1] contains its sup, since computationally we'd have to do uncountably many comparisons.

OP is asking a real analysis question, not a computability theory question.

 

[inverse]

this is an exercise in a book of mathematical analysis, as there are no solutions wondered to know what is the correct ration.

 

[SteveL27]

this is an exercise in a book of mathematical analysis, as there are no solutions wondered to know what is the correct ration.

The answer is that a finite set of reals always contains its max. If you need to prove that from the real number axioms you can note that for any two distinct reals a and b, either a < b or b < a. In either case the max exists.

[Oh! LOL now I understand mathman's remark. It went over my head the first time. My apologies!]

So you can prove that the max of two numbers exists; and by induction you can prove that the max of n numbers exists. That was mathman's point.

Just look at examples. Any finite set of real numbers has a largest element.

 

[inverse]

thank you very much to everyone who have helped me :)