Partially Ordered Set - Extrema

Extrema

There are several notions of "greatest" and "least" element in a poset P, notably:

  • Greatest element and least element: An element g in P is a greatest element if for every element a in P, ag. An element m in P is a least element if for every element a in P, am. A poset can only have one greatest or least element.
  • Maximal elements and minimal elements: An element g in P is a maximal element if there is no element a in P such that a > g. Similarly, an element m in P is a minimal element if there is no element a in P such that a < m. If a poset has a greatest element, it must be the unique maximal element, but otherwise there can be more than one maximal element, and similarly for least elements and minimal elements.
  • Upper and lower bounds: For a subset A of P, an element x in P is an upper bound of A if ax, for each element a in A. In particular, x need not be in A to be an upper bound of A. Similarly, an element x in P is a lower bound of A if ax, for each element a in A. A greatest element of P is an upper bound of P itself, and a least element is a lower bound of P.

For example, consider the positive integers, ordered by divisibility: 1 is a least element, as it divides all other elements; on the other hand this poset does not have a greatest element (although if one would include 0 in the poset, which is a multiple of any integer, that would be a greatest element). This partially ordered set does not even have any maximal elements, since any g divides for instance 2g, which is distinct from it, so g is not maximal. If we exclude the number 1, while keeping divisibility as ordering on the elements greater than 1, then the resulting poset does not have a least element, but any prime number is a minimal element for it. In this poset, 60 is an upper bound (though not a least upper bound) of the subset {2,3,5,10}, which subset does not have any lower bound (since 1 is not in the poset); on the other hand 2 is a lower bound of the subset of powers of 2, which subset does not have any upper bound.

Read more about this topic:  Partially Ordered Set