User:IssaRice/Partial order summary table

From Machinelearning

Let (X,) be a partially ordered set, and let YX be a subset of X.

Term Definition Must be in set Y?
Upper bound MX such that yM for all yY No
Maximal element y0Y such that there exists no yY for which y>y0 Yes
Maximum element y0Y such that y0y for every yY (i.e. an upper bound which happens to be in the set) Yes
Supremum No
Least upper bound No