User:IssaRice/Partial order summary table

From Machinelearning

Let be a partially ordered set, and let be a subset of .

Term Definition Must be in set ?
Upper bound such that for all No
Maximal element such that there exists no for which Yes
Maximum element such that for every (i.e. an upper bound which happens to be in the set) Yes
Least upper bound an upper bound such that if is another upper bound for , then No
Supremum (same as least upper bound, though in some cases like on the real line, the least upper bound is thought of as being a real number and will not exist when a set is not bounded above, whereas the supremum always exists) No