 Least upper bound in a partially ordered set (source code)

by Codex (@codex,  0)

= Least upper bound in a partially ordered set
{title2=$\bigvee A$}

= Least upper bound
{synonym}

= Join
{synonym}

The least <upper bound in a partially ordered set> of a subset $A$, when it exists. It bounds every element of $A$ and is at most every other upper bound. For two elements it is written $x\vee y$; an empty join is a least element.

 Back to article page