Lower bound
An element that is less than or equal to every element of a subset in an ordered set.
Lower bound
A lower bound of a subset of a partially ordered set is an element such that for all . The subset is bounded below if it has at least one lower bound in .
Lower bounds complement upper bounds and lead to greatest lower bounds (the infimum in real analysis).
Examples:
- In , the integer is a lower bound for the subset .
- In the poset , the set is a lower bound for , where is the intersection of and .