Definition
A partial order on a set is a relation that is:
A set equipped with a partial order is called a partially ordered set or poset.
The strict partial order associated to is defined by . The strict relation is irreflexive, transitive, and asymmetric.
Relationship to Preorders
Every partial order is a preorder; the additional condition is anti-symmetry. Conversely, every preorder induces a partial order on the quotient , where .
Examples
- The natural numbers with .
- The power set ordered by inclusion .
- The positive integers ordered by divisibility .
- The ordinals ordered by (membership).
Properties
- A poset may have maximal elements (nothing above them) without having a greatest element (above everything). Similarly for minimal vs. least elements.
- An upper bound for a subset is an element with for all . The supremum (least upper bound) is the smallest such , if it exists.
- A lower bound and infimum (greatest lower bound) are defined dually.
- A complete lattice is a poset in which every subset has a supremum and infimum.
Categorical Perspective
Every partial order is a skeletal thin category: the objects are elements of , and there is exactly one morphism iff . Skeletal here means no two distinct objects are isomorphic. Order-preserving maps (monotone maps) correspond to functors.
Related Concepts
- Preorder
- Total Ordering
- Well-Ordering
- Complete Lattice
- Reflexive Relation
- Transitive Relation
- Anti-Symmetric Relation
- Thin Category
- Predicate