Lower Bound¶
Definition¶
Let be a subset of and let be a real number. We say that is a lower bound for if we have for every element in
Interpretation¶
A lower bound of a set is a value that does not exceed any element of the set: it marks a level that the set never goes below. Lower bounds describe constraints from below without requiring attainability.
Here consists of the point and the numbers in . The marked , and are lower bounds, and so is every ; the greatest one is . The number is not a lower bound, because the single element lies below it.
The set specifies which elements must be compared. The inequality must hold for every ; need not be an element of . Lower bounds are never unique: if is one, so is every smaller number. The useful question is therefore which lower bound is the largest, and that is the infimum.
A common slip is to negate the definition incorrectly. fails to be a lower bound as soon as one element satisfies . So has no lower bound, every nonempty finite set has its smallest element as one, and for the empty set every real number is a lower bound, since there is nothing to compare.
Key Results¶
- If is a lower bound for , then so is every hence lower bounds are never unique.
- Lower bounds need not belong to the set.
Examples¶
- Both sets and share the same lower bound
- Any number less than is also a lower bound of
Prerequisites¶
Related Concepts¶
Sources¶
- Math I: Calculus · Lecture 3
Aliases: minorant Symbols: element of, integers, real numbers
Last updated: 20 October 2026 03:02
Lower BoundBounded FunctionInfimumSetInequalityUpper BoundBounded SetMinimum of a SetBounded Sequence