(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

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.

2. Relevant equations

3. 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 Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Least upper bound problem

**Physics Forums | Science Articles, Homework Help, Discussion**