Upper bound

An element that is greater than or equal to every element of a given subset in an ordered set.
Upper bound

An upper bound of a subset SS of an ordered set (X,)(X,\le) is an element uXu\in X such that

sS, su.\forall s\in S,\ s\le u.

Upper bounds formalize the idea that a set lies entirely to the “left” of some point. The existence and structure of upper bounds is central to completeness and to definitions such as supremum.

Examples:

  • In (R,)(\mathbb{R},\le), the set S=(0,1)S=(0,1) has upper bounds u=1u=1, u=2u=2, and in fact every u1u\ge 1.
  • In (R,)(\mathbb{R},\le), the set S={xR:x<0}S=\{x\in\mathbb{R}: x<0\} has upper bounds u=0u=0 and every u0u\ge 0.
  • In (Z,)(\mathbb{Z},\le), the set S={nZ:n5}S=\{n\in\mathbb{Z}: n\le 5\} has upper bound u=5u=5 (and any u5u\ge 5).