Lebl-Basic-Analysis-I · Problem 1.1.5

Real Numbers

Mathematics · ordered-sets-supremum-infimum

Problem

Let SS be an ordered set. Let A⊂SA \subset S and suppose bb is an upper bound for AA. Suppose b∈Ab \in A. Show that b=sup⁡Ab = \sup A.

Related theory

Browse the problem library