Let be an ordered set and , and bounded above. If there exists such that
- is an upper bound for
- . Then we say has the least upper bound property, and is called the least upper bound of . Or,
Here, we force the minimality of by supposing that any that exists would have some be greater than it. We are capturing the “best” upper bound.
Motivation
Can we find the best upper bound for the set
- Note that because .
- is bounded above. by definition.
- Can we find the best upper bound for in . such that:
- is the smallest rational number that is an upper bound for
- Answer: No.
Proof:
We show this by contradiction. That is, suppose that satisfies and . By the lemma, or by trichotomy. WLOG, assume, .
If , then since , cannot satisfy . If , then since is an upper bound, then is not the smallest upper bound satisfying .
Case 1: .
<-----|-----|-----|-->
y^2 z^2 2
We have some distance . If we can find some where then we have some contradiction. Let where is some “wiggle room”, i.e. and .
If this existed, then
From the fact that , we see that , and given that , then . Given these inequalities, we can show:
So, by finding some that satisfies this, we are done. Choose and to choose it to be smaller, than we can simply multiply by and get . As we need ,
So, exists only if . So, and proves the LHS of the inequality, and the assumption of the case is th RHS. As exists, exists, exists and there is no upper bound.
Case 2: .
2 z^2 y^2
<-----|-----|-----|-->
Again, let . The goal is to find some where the above inequality holds. So
- .
- So,
for some to exist, this inequality must hold. As before,
- Such that,
Then, let . So,
Where the LHS is true by the assumption and the RHS is true by the fact that . Therefore it is a contradiction.
Given a contradiction in Case 1 and Case 2, does that mean no for property and …