Lebl-Basic-Analysis-I · Problem 1.1.9

Real Numbers

Mathematics · ordered-sets-supremum-infimum

Problem

Let SS be an ordered set and AA is a nonempty subset such that sup⁡A\sup A exists. Suppose there is a B⊂AB \subset A such that whenever x∈Ax \in A there is a y∈By \in B such that x≤yx \leq y. Show that sup⁡B\sup B exists and sup⁡B=sup⁡A\sup B = \sup A.

Related theory

Browse the problem library