Question
Let $E$ be a nonempty subset of an ordered set; suppose $\alpha$ is a lower bound of $E$ and $\beta$ is an upper bound of $E$. Prove that $\alpha \leq \beta$.
Step 1
Since $E$ is a nonempty subset, there exists at least one element $x \in E$. Show more…
Show all steps
Your feedback will help us improve your experience
Prathan Jarupoonphol and 87 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Suppose E is a totally ordered set, and let A ⊆ E be a nonempty subset. Prove that there is at most one β ∈ E satisfying the following conditions (i) for all a ∈ A, β ≤ a, and (ii) if y is any lower bound for A, then y ≤ β.
a) Show that the least upper bound of a set in a poset is unique if it exists. b) Show that the greatest lower bound of a set in a poset is unique if it exists.
Relations
Partial Orderings
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD