# proofs of least upper bounds

Not what you're looking for? Search our solutions OR ask your own Custom question.

1. If supS=a and X={s-k l s element of S}. Prove that supX = a-k

2. If A and B have least upper bounds, prove sup(AUB) = max(supA, supB)

3. Prove for all x<supS there exists y that is an element of S such that x<y< or = supS.

Â© BrainMass Inc. brainmass.com November 24, 2022, 12:00 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/proofs-of-least-upper-bounds-35828

#### Solution Summary

This solution is comprised of a detailed explanation to prove least upper bounds.

$2.49