Prove alpha=sup(S) is equivalent to alpha belongs to S closure

splash_lover
Messages
11
Reaction score
0
Given that alpha is an upper bound of a given set S of real numbers, prove that the following two conditions are equivalent:
a) We have alpha=sup(S)
b) We have alpha belongs to S closure

I'm trying to prove this using two steps.
Step one being: assume a is true, then prove b is true.
Step two being: assume b is true, then prove a is true.

Could anyone help me with step two?
Assuming alpha belongs to S closure...
 
Physics news on Phys.org
If I remember right, I think I gave you a useful condition for a point to be in the closure of a set. Do you see how you can use it here?
 
Of course, your "steps" are a correct way to prove equivalence of statements, from a logical point of view.
 
No I don't see how I can use it here in this problem.

How would I start my step two? I know I assume alpha belongs to S closure, but I am not sure where to go from there.
 
A point x is in the closure of a set A if any neighbourhood of x intersects A. Now, what is an important property of the supremum (involving "ε")?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top