Proving SUP without a Formula: An Abstract Approach

  • Thread starter Thread starter transgalactic
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving the supremum (sup) of a set without relying on a specific formula. Participants are exploring the concept of least upper bounds and the implications of sequences converging to a supremum.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants are questioning the definitions of supremum and least upper bound, and discussing the necessity of specific definitions for the proof. Some express confusion about the clarity of the question and the assumptions involved.

Discussion Status

There is an ongoing exploration of definitions and the requirements for proving that a certain value is the least upper bound. Some participants have provided insights into the definitions they are using, while others are seeking clarification on the proof structure and assumptions.

Contextual Notes

Some participants mention the lack of a formula for the series in question, and there are references to specific definitions from an article that may be relevant to the proof. The clarity of the original question and the notation used is also under scrutiny.

transgalactic
Messages
1,386
Reaction score
0
i added the question in the link:

http://img388.imageshack.us/img388/2220/57946210jf5.gif

this is a total abstract thing

i don't know how to prove SUP whithout a formula to the series

??
 
Last edited by a moderator:
Physics news on Phys.org
What is the definition of supremum?

Also, you put a question mark with "least upper bound", do you know what it means?
 
i know the definition of supremum and least upper bound

i don't know what to do here because i don't have a formula for this series
??
 
transgalactic said:
i know the definition of supremum and least upper bound

i don't know what to do here because i don't have a formula for this series
??

It is NOT a question whether you know "the" definition of the supremum and least upper bound. I'm sure you do!

But:
After all, there are numerous definitions floating about, provably logically equivalent.

Thus, if we are to be able to help you, we need to know what particular definition YOU are to utilize in order to prove the statement; it is no good for us to prove it from a definition you are not entitled to use.

Therefore, please post the definitions you are allowed to use for this exercise.
 
They define sup as the least upper bound. But if I read your question correctly, they ask you to prove that "if S is the least upper bound of A and there is a sequence of elements in A converging to S, then S = sup(A)". So I must be missing something here, because that is trivial, isn't it?
 
sup is defined as a least upper bound in the question
if S exists in A then its defined as max(A)
 
Half of the question seems unnecessary going by the definition of sup in the article. If S is the least upper bound for A, then S is synonymous with sup(A).

Definition 1. Let S be a set of real numbers. An upper bound for S is a number B such that x ≤ B for all x ∈ The supremum, if it exists, (“sup”, “LUB,” “least upper bound”) of S is the smallest upper bound for S.

Now if the question asks, assume there is a bounded set A, and you can find a sequence of numbers that converge to some value S, and S is in A and just an "upper bound", then it you can show it is the least upper bound.
 
sup=least upper bound

how to solve it?
 
  • #10
transgalactic said:
sup=least upper bound

how to solve it?
Done. Sup = least upper bound. Are you trying to prove a definition?

If M = sup S, the for every epsilon >0 there is an x in S, such that

M - epsilon < x <= M.

In other words, let x be as close to M as you want while still being in S, x will be less or equal to M.

To take this from another view, there are 12 axioms of a complete ordered field like R. One of them (#12 in my book) says that every non-empty set of real numbers S that is bounded from above has a least upper bound, called the sup S. I don't know what there is to solve/prove.
 
  • #11
To be shown: If S is the least upper bound of A and there is a sequence of elements in A converging to S, then S = sup(A)

Proof: Let S be the least upper bound of A and assume there is a sequence of elements in A converging to S. Then in particular, S is the least upper bound of A. By definition 1, S is the supremum of A. QED.
 
  • #12
i need to prove that S is the least upper bound
i don't know how to do that. i can say that
there is a cetain "e"
that if we subtract it from S we will get a member from A which is larger then S.

but is it a proof??

and what the -> thing means in the end ??
 
  • #13
666 posts transgalactic... evil!

Anyway, I think the question is not entirely clear.
What do you want to prove and what are the assumptions?
Where did the link in your first post come from, did you scan it from a textbook or did you type it yourself? Why are some parts "pencil"-drawn? (Like [itex]A \subseteq \mathbb{R}[/itex], the question mark, ...)

Did you maybe mean: "Prove that S = sup(A) if S is an upper bound of A (not necessarily the least) and there is a sequence converging to S"?
 
  • #14
i scan the questions from a textbook i am learning from

what is this arrow thing means?
 
  • #15
It means that
[tex]\lim_{n \to \infty} a_n = S[/tex].
 

Similar threads

Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
3
Views
1K
  • · Replies 28 ·
Replies
28
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 47 ·
2
Replies
47
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K