- #1
tronter
- 185
- 1
Let [itex] E [/itex] be a nonempty subset of an ordered set; suppose [itex] \alpha [/itex] is a lower bound of [itex] E [/itex] and [itex] \beta [/itex] is an upper bound of [itex] E [/itex]. Prove that [itex] \alpha \leq \beta [/itex].
So do I just use the following definition: Suppse [itex] S [/itex] is an ordered set, and [itex] E \subset S [/itex]. If there exists a [itex] \beta \in S [/itex] such that [itex] x \leq \beta [/itex] for every [itex] x \in E [/itex], then [itex] \beta [/itex] is an upper bound for [itex] E [/itex], and similarly for lower bound?
So do I just use the following definition: Suppse [itex] S [/itex] is an ordered set, and [itex] E \subset S [/itex]. If there exists a [itex] \beta \in S [/itex] such that [itex] x \leq \beta [/itex] for every [itex] x \in E [/itex], then [itex] \beta [/itex] is an upper bound for [itex] E [/itex], and similarly for lower bound?