In mathematics, especially in order theory, a lower bound of a subset S of some partially ordered set (K, ≤) is an element of K which is less than or equal to every element of S.
