Lebl-Basic-Analysis-I · Problem 1.1.4

Real Numbers

Mathematics · ordered-sets-supremum-infimum

Problem

Let SS be an ordered set. Let B⊂SB \subset S be bounded (above and below). Let A⊂BA \subset B be a nonempty subset. Suppose all the infs and sups exist. Show that inf⁡B≤inf⁡A≤sup⁡A≤sup⁡B.\inf B \leq \inf A \leq \sup A \leq \sup B.
Intuitive explanation

The key insight is that AA is a "smaller" subset nested inside BB, so its bounds must be squeezed between BB's bounds. Since inf⁡B\inf B is the greatest lower bound of all elements in BB, and every element of AA is also in BB, the infimum of AA cannot go below BB's infimum. By the same logic, sup⁡A\sup A cannot exceed sup⁡B\sup B. 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 AA is a "smaller" subset nested inside BB, so its bounds must be squeezed between BB's bounds. Since inf⁡B\inf B is the greatest lower bound of all elements in BB, and every element of AA is also in BB, the infimum of AA cannot go below BB's infimum. By the same logic, sup⁡A\sup A cannot exceed sup⁡B\sup B. Finally, for any nonempty set, its infimum is always at most its supremum by definition. Chain these three inequalities together to get the result.

Related theory

Browse the problem library