Duality (order theory) in the context of "Supremum"

In mathematics, specifically order theory, the join of a subset ${\displaystyle S}$ of a partially ordered set ${\displaystyle P}$ is the supremum (least upper bound) of ${\displaystyle S,}$ denoted ${\textstyle \bigvee S,}$ and similarly, the meet of ${\displaystyle S}$ is the infimum (greatest lower bound), denoted ${\textstyle \bigwedge S.}$ In general, the join and meet of a subset of a partially ordered set need not exist. Join and meet are dual to one another with respect to order inversion.

A partially ordered set in which all pairs have a join is a join-semilattice. Dually, a partially ordered set in which all pairs have a meet is a meet-semilattice. A partially ordered set that is both a join-semilattice and a meet-semilattice is a lattice. A lattice in which every subset, not just every pair, possesses a meet and a join is a complete lattice. It is also possible to define a partial lattice, in which not all pairs have a meet or join but the operations (when defined) satisfy certain axioms.

In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a meet (or greatest lower bound) for any nonempty finite subset. Every join-semilattice is a meet-semilattice in the inverse order and vice versa.

Semilattices can also be defined algebraically: join and meet are associative, commutative, idempotent binary operations, and any such operation induces a partial order (and the respective inverse order) such that the result of the operation for any two elements is the least upper bound (or greatest lower bound) of the elements with respect to this partial order.

In mathematics, especially in order theory, the greatest element of a subset ${\displaystyle S}$ of a partially ordered set (poset) is an element of ${\displaystyle S}$ that is greater than every other element of ${\displaystyle S}$. The term least element is defined dually, that is, it is an element of ${\displaystyle S}$ that is smaller than every other element of ${\displaystyle S.}$

In mathematics, especially in order theory, a maximal element of a subset ${\displaystyle S}$ of some preordered set is an element of ${\displaystyle S}$ that is not smaller than any other element in ${\displaystyle S}$. A minimal element of a subset ${\displaystyle S}$ of some preordered set is defined dually as an element of ${\displaystyle S}$ that is not greater than any other element in ${\displaystyle S}$.

The notions of maximal and minimal elements are weaker than those of greatest element and least element which are also known, respectively, as maximum and minimum. The maximum of a subset ${\displaystyle S}$ of a preordered set is an element of ${\displaystyle S}$ which is greater than or equal to any other element of ${\displaystyle S,}$ and the minimum of ${\displaystyle S}$ is again defined dually. In the particular case of a partially ordered set, while there can be at most one maximum and at most one minimum there may be multiple maximal or minimal elements. Specializing further to totally ordered sets, the notions of maximal element and maximum coincide, and the notions of minimal element and minimum coincide.

In mathematics, particularly in order theory, an upper bound or majorant of a subset S of some preordered set (K, ≤) is an element of K that is greater than or equal to every element of S. Dually, a lower bound or minorant of S is defined to be an element of K that is less than or equal to every element of S. A set with an upper (respectively, lower) bound is said to be bounded from above or majorized (respectively bounded from below or minorized) by that bound. The terms bounded above (bounded below) are also used in the mathematical literature for sets that have upper (respectively lower) bounds.