User:IssaRice/Partial order summary table: Difference between revisions
No edit summary |
No edit summary |
||
Line 11: | Line 11: | ||
| Maximum element || <math>y_0 \in Y</math> such that <math>y_0 \geq y</math> for every <math>y \in Y</math> (i.e. an upper bound which happens to be in the set) || Yes | | Maximum element || <math>y_0 \in Y</math> such that <math>y_0 \geq y</math> for every <math>y \in Y</math> (i.e. an upper bound which happens to be in the set) || Yes | ||
|- | |- | ||
| | | Least upper bound || an upper bound <math>M</math> such that if <math>K</math> is another upper bound for <math>Y</math>, then <math>M\leq K</math> || 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 | ||
|} | |} |
Latest revision as of 19:48, 2 October 2021
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 |