Completeness axiom/theorem and supremum

  • Thread starter Thread starter Treadstone 71
  • Start date Start date
  • Tags Tags
    Supremum
Click For Summary
The discussion revolves around proving that for bounded non-empty sets A and B of real numbers, the supremum of the set C, defined as C={ab: a in A, b in B}, equals the product of their suprema, sup(C) = sup(A) * sup(B). Participants emphasize the need to first establish that the product of the suprema, zy, serves as an upper bound for C. They suggest demonstrating that for any small positive epsilon, there exist elements a in A and b in B that approach the suprema, allowing for the multiplication of these elements to show they are less than any arbitrary upper bound. The conversation also touches on the importance of clarifying whether the sets A and B consist of strictly positive numbers, as this impacts the validity of the proposition. The discussion highlights the complexity involved in proving the least upper bound property and the necessity of careful consideration of the conditions of the sets involved.
Treadstone 71
Messages
275
Reaction score
0
"Let A and B be bounded nontempty sets of real numbers. Let C={ab:a in A, b in B}. Prove that sup(C)=sup(A)sup(B)."

Here's what I've done so far:

By the completeness axiom/theorem A and B have suprema. Let sup(A)=z and sup(B)=y. For all e>0, there exists a in A and b in B such that z-e<a and y-e<b. Multiplying the two inequalities and we have

zy-ze-ye+e^2 < ab

I'm stuck here.
 
Physics news on Phys.org
Treadstone 71 said:
"Let A and B be bounded nontempty sets of real numbers. Let C={ab:a in A, b in B}. Prove that sup(C)=sup(A)sup(B)."
Here's what I've done so far:
By the completeness axiom/theorem A and B have suprema. Let sup(A)=z and sup(B)=y. For all e>0, there exists a in A and b in B such that z-e<a and y-e<b. Multiplying the two inequalities and we have
zy-ze-ye+e^2 < ab
I'm stuck here.

It would be a good idea to show first that zy is an upper bound on C!
You are using the fact that since z is the least upper bound on A there must be an a between z-e and z and since y is the least upper bound on B there must be a b between z-e and z. What does that tell you about there being an ab between zy- e and z?
 
step 1 show it's an upper bound,

step 2 show it is a least upper bound which can be messy.

it's easier to use the definition of sup as the maximum of the accumulation points.

You need to show that give d>0 you can find e greater than zero such that 0<ey+ez-e^2<d, so do that.
 
I don't know, but I want to arrive at the conclusion that zy-x<ab for all x>0. If I could prove that zy-(?)<ab where (?) is positive, then I'm done, since I can let x=(?).
 
we may suppose e<z and e<y, can you see how that might help?
 
e>0. z and y could be negative.
 
How can the supremum of a set of positive numbers be negative?
 
A and B aren't sets of strictly positive numbers.
 
Then the proposition is trivially false.
 
  • #10
You're right. This is odd considering it's an archived analysis final exam.
 
  • #11
The odd thing is that at one point i even checked back to make sure that these were sets of positive numbers just so i didn't make a mistake and i am convinced that i remember reading that you wrote they were positive real numbers. Odd.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
8K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 38 ·
2
Replies
38
Views
10K