Doubt regarding least upper bound?

Click For Summary

Discussion Overview

The discussion revolves around the definition and properties of the least upper bound (lub) of sets of real numbers, as presented in Spivak Calculus. Participants explore logical implications, contradictions, and interpretations related to upper bounds and least upper bounds.

Discussion Character

  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant asserts that if M is an upper bound of set A and M is less than the least upper bound S, then M cannot exist, leading to a contradiction.
  • Another participant claims that identifying a number incorrectly as the least upper bound does not contradict the definition, using the example of the set A = {x ∈ ℝ | 0 ≤ x ≤ 1} and claiming 1.5 as the lub.
  • A different participant emphasizes that the definition of least upper bound requires that if M is an upper bound, then S must be less than or equal to M, challenging the existence of M as defined.
  • One participant corrects a previous statement about the definition of least upper bound, clarifying that a number less than the least upper bound cannot be a least upper bound.
  • Another participant expresses confusion over the wording of a statement regarding the least upper bound, indicating a misunderstanding.

Areas of Agreement / Disagreement

Participants express differing interpretations of the least upper bound and its properties, with no consensus reached on the validity of the assertions made. The discussion remains unresolved, with competing views on the implications of the definitions involved.

Contextual Notes

Some statements made by participants rely on specific interpretations of logical operators and definitions, which may not be universally agreed upon. The discussion includes assumptions about the properties of upper bounds that are not fully articulated.

Alpharup
Messages
226
Reaction score
17
I am using Spivak Calculus. I have a general doubt regarding the definition of least upper bound of sets.
Let A be any set of real numbers and A is not a null set. Let S be the least upper bound of A.
Then by definition "For every x belongs to A, x is lesser than or equal to S"

Let M be an upper bound such that M is less than S and M does not belong to A(Assertion 1)

Then, it leads to contradiction because A is bounded above by M and M is less than least upper bound S, which means an upper bound is less than least upper bound.
So, we have either M=S or M>S. So, Assertion 1 is false.

Then by converse of Assertion 1, if N is less than S, it may belong to A but can't be an upper bound or

if N is less than S, it may not belong to A. (Assertion 2)

Is my logic right?
 
Physics news on Phys.org
As long as your "or" and "and" are taken as logical operators and not English conjunctions, your loigic seems OK.
 
Alpharup said:
I am using Spivak Calculus. I have a general doubt regarding the definition of least upper bound of sets.
Let A be any set of real numbers and A is not a null set. Let S be the least upper bound of A.
Then by definition "For every x belongs to A, x is lesser than or equal to S"

Let M be an upper bound such that M is less than S and M does not belong to A(Assertion 1)

Then, it leads to contradiction because A is bounded above by M and M is less than least upper bound S, which means an upper bound is less than least upper bound.
So, we have either M=S or M>S. So, Assertion 1 is false.
My take on this is that S really wasn't the least upper bound.

Consider the set ##A = \{x \in \mathbb{R} | 0 \le x \le 1\}##; i.e., the open interval (0, 1).
I claim that 1.5 is the lub for A. I later notice that 1 is not an element of A, and 1 < 1.5. This doesn't contradict anything, as all I have really done here is to mistakenly identify 1.5 as the lub.
 
Alpharup said:
I am using Spivak Calculus. I have a general doubt regarding the definition of least upper bound of sets.
Let A be any set of real numbers and A is not a null set. Let S be the least upper bound of A.
Then by definition "For every x belongs to A, x is lesser than or equal to S"
That's a property that every upper bound has, not just the least upper bound. To uniquely refer to the "least upper bound you must add "if M is an upper bound on A then S\le M

Let M be an upper bound such that M is less than S and M does not belong to A(Assertion 1)
This is not an "assertion" because it is not a complete statement. You have defined M to have certain properties but have not said anything about it.
And "let M be an upper bound such that M is less than S" violates the definition of least upper bound. Such an M does not exist.

Then, it leads to contradiction because A is bounded above by M and M is less than least upper bound S, which means an upper bound is less than least upper bound.
So, we have either M=S or M>S. So, Assertion 1 is false.

Then by converse of Assertion 1, if N is less than S, it may belong to A but can't be an upper bound or
if N is less than S, it may not belong to A. (Assertion 2)

Is my logic right?
A number that is less than the least upper bound is cannot be an upper bound by definition of "least"!
 
HallsofIvy said:
A number that is less than the least upper bound is cannot be an upper bound by definition of "least"!
That seems to have omited one word and should have read:

A number that is less than the least upper bound is cannot be a least upper bound by definition of "least"!

Edit: Doh, I misunderstood.
 
Last edited:
No, it should be exactly what I said! Please read it again!
 
  • Like
Likes   Reactions: jbriggs444

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K