User:IssaRice/Partial order summary table

From Machinelearning
Revision as of 19:48, 2 October 2021 by IssaRice (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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
Least upper bound an upper bound M such that if K is another upper bound for Y, then MK 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