Lebl-Basic-Analysis-I · Problem 1.1.4
Real Numbers
Mathematics · ordered-sets-supremum-infimum
Problem
Let be an ordered set. Let be bounded (above and below). Let be a nonempty subset. Suppose all the infs and sups exist. Show thatIntuitive explanation
The key insight is that is a "smaller" subset nested inside , so its bounds must be squeezed between 's bounds. Since is the greatest lower bound of all elements in , and every element of is also in , the infimum of cannot go below 's infimum. By the same logic, cannot exceed . Finally, for any nonempty set, its infimum is always at most its supremum by definition. Chain these three inequalities together to get the result.
Intuitive explanation
The key insight is that is a "smaller" subset nested inside , so its bounds must be squeezed between 's bounds. Since is the greatest lower bound of all elements in , and every element of is also in , the infimum of cannot go below 's infimum. By the same logic, cannot exceed . Finally, for any nonempty set, its infimum is always at most its supremum by definition. Chain these three inequalities together to get the result.