User:IssaRice/Partial order summary table: Difference between revisions
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
Let <math>(X, \leq)</math> be a partially ordered set, and let <math>Y \ | Let <math>(X, \leq)</math> be a partially ordered set, and let <math>Y \subseteq X</math> be a subset of <math>X</math>. | ||
{| class="wikitable" | {| class="wikitable" |
Revision as of 19:43, 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 | Yes |
Supremum | No | |
Least upper bound | No |