What is the Least Upper Bound Problem in Subset Inclusion?

  • Thread starter Thread starter boombaby
  • Start date Start date
  • Tags Tags
    Bound Upper bound
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
2 replies · 3K views
boombaby
Messages
129
Reaction score
0

Homework Statement



Find subsets E[tex]\subset[/tex]S1[tex]\subset[/tex]S2[tex]\subset[/tex]S3[tex]\subset[/tex]Q such that E has a least upper bound in S1, but does not have any least upper bound in S2, yet does have a least upper bound in S3.

Homework Equations





The Attempt at a Solution



I got totally stuck with it. If a[tex]\in[/tex]S1 is the least upper bound of E, does that mean a is also in S2 and hence a least upper bound of E in S2?
On the other hand, if E has a least upper bound b in Q, is b unique? So in any subset S of Q, just check if b is in S to see if E has a least upper bound in S?
Thanks a lot
 
Physics news on Phys.org
O I got it now...So S2=union(S1,{x[tex]\in[/tex]Q|x^2>2, 0<=x<=2}) would work. And S3=union(S2,{1.1})
Thanks very much:smile: