Canonical: https://knowlpedia.com/shared-foundations/lower-bound/

# Lower bound

An element that is less than or equal to every element of a subset in an ordered set.

A **lower bound** of a subset \(A\) of a [partially ordered set](https://knowlpedia.com/shared-foundations/partial-order/) \((P,\le)\) is an element \(\ell\in P\) such that \(\ell\le a\) for all \(a\in A\). The subset \(A\) is **bounded below** if it has at least one lower bound in \(P\).

## Remarks

Lower bounds complement [upper bounds](https://knowlpedia.com/shared-foundations/upper-bound/) and lead to greatest lower bounds (the [infimum](https://knowlpedia.com/real-analysis/infimum/) in real analysis).

## Examples

- In \((\mathbb{Z},\le)\), the integer \(-5\) is a lower bound for the subset \(\{-2,0,3\}\).
- In the poset \((\mathcal P(X),\subseteq)\), the set \(A\cap B\) is a lower bound for \(\{A,B\}\), where \(A\cap B\) is the [intersection](https://knowlpedia.com/shared-foundations/intersection/) of \(A\) and \(B\).
