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 AA of a (P,)(P,\le) is an element P\ell\in P such that a\ell\le a for all aAa\in A. The subset AA is bounded below if it has at least one lower bound in PP.

Lower bounds complement and lead to greatest lower bounds (the in real analysis).

Examples:

  • In (Z,)(\mathbb{Z},\le), the integer 5-5 is a lower bound for the subset {2,0,3}\{-2,0,3\}.
  • In the poset (P(X),)(\mathcal P(X),\subseteq), the set ABA\cap B is a lower bound for {A,B}\{A,B\}, where ABA\cap B is the of AA and BB.