Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary
least upper bound
Jump to user comments
theory (lub or "join", "supremum") The least upper bound of
two elements a and b is an upper bound c such that a #@= c and
b #@= c and if there is any other upper bound c' then c #@= c'.
The least upper bound of a set S is the smallest b such that
for all s in S, s #@= b. The lub of mutually comparable
elements is their maximum but in the presence of incomparable
elements, if the lub exists, it will be some other element
greater than all of them.