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
Supremum No
Least upper bound No