Upper bound in a partially ordered set (source code)

= Upper bound in a partially ordered set

= Upper bound
{synonym}

An upper bound of a subset $A$ of a <partially ordered set> is an element $u$ satisfying $a\leq u$ for every $a\in A$.