Partial Ordering Relation

In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order."

The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable.

Informal definition

A partial order defines a notion of comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x'' < ''y'', or ''x'' = ''y'', or ''x'' > ''y'', or ''x'' and ''y'' are ''incomparable''.

A set with a partial order is called a partially ordered set (also called a poset). The term ''ordered set'' is sometimes also used, as long as it is clear from the context that no other kind of order is meant. In particular, totally ordered sets can also be referred to as "ordered sets", especially in areas where these structures are more common than posets.

A poset can be visualized through its Hasse diagram, which depicts the ordering relation.

Partial order relation

A partial order relation is a homogeneous relation that is transitive and antisymmetric. There are two common sub-definitions for a partial order relation, for reflexive and irreflexive partial order relations, also called "non-strict" and "strict" respectively. The two definitions can be put into a one-to-one correspondence, so for every strict partial order there is a unique corresponding non-strict partial order, and vice versa. The term partial order typically refers to a non-strict partial order relation.

Non-strict partial order

A reflexive, weak, or is a homogeneous relation ≤ on a set $P$ that is reflexive, antisymmetric, and transitive. That is, for all $a, b, c \in P,$ it must satisfy:

# Reflexivity: $a \leq a$, i.e. every element is related to itself.
# Antisymmetry: if $a \leq b$ and $b \leq a$ then $a = b$, i.e. no two distinct elements precede each other.
# Transitivity: if $a \leq b$ and $b \leq c$ then $a \leq c$.

A non-strict partial order is also known as an antisymmetric preorder.

Strict partial order

An irreflexive, strong, or is a homogeneous relation < on a set $P$ that is irreflexive, asymmetric, and transitive; that is, it satisfies the following conditions for all $a, b, c \in P:$

#Irreflexivity: not $a < a$, i.e. no element is related to itself (also called anti-reflexive).
#Asymmetry: if $a < b$ then not $b < a$.
# Transitivity: if $a < b$ and $b < c$ then $a < c$.

Irreflexivity and transitivity together imply asymmetry. Also, asymmetry implies irreflexivity. In other words, a transitive relation is asymmetric if and only if it is irreflexive. Lemma 1.1 (iv). This source refers to asymmetric relations as "strictly antisymmetric". So the definition is the same if it omits either irreflexivity or asymmetry (but not both).

A strict partial order is also known as a strict preorder.

Correspondence of strict and non-strict partial order relations

Strict and non-strict partial orders on a set $P$ are closely related. A non-strict partial order $\leq$ may be converted to a strict partial order by removing all relationships of the form $a \leq a;$ that is, the strict partial order is the set $< \; := \ \leq\ \setminus \ \Delta_P$ where $\Delta_P := \$ is the identity relation on $P \times P$ and $\;\setminus\;$ denotes set subtraction. Conversely, a strict partial order < on $P$ may be converted to a non-strict partial order by adjoining all relationships of that form; that is, $\leq\; := \;\Delta_P\; \cup \;<\;$ is a non-strict partial order. Thus, if $\leq$ is a non-strict partial order, then the corresponding strict partial order < is the irreflexive kernel given by
$a < b \text a \leq b \text a \neq b.$
Conversely, if < is a strict partial order, then the corresponding non-strict partial order $\leq$ is the reflexive closure given by:
$a \leq b \text a < b \text a = b.$

Dual orders

The ''dual'' (or ''opposite'') $R^$ of a partial order relation $R$ is defined by letting $R^$ be the converse relation of $R$, i.e. $x R^ y$ if and only if $y R x$. The dual of a non-strict partial order is a non-strict partial order, and the dual of a strict partial order is a strict partial order. The dual of a dual of a relation is the original relation.

Notation

We can consider a poset as a 3-tuple $(P,\leq,<)$, where $\leq$ is a non-strict partial order relation on $P$, $<$ is the associated strict partial order relation on $P$ (the irreflexive kernel of $\leq$), $\geq$ is the dual of $\leq$, and $>$ is the dual of $<$.

Any one of the four partial order relations $\leq, <, \geq, \text >$ on a given set uniquely determines the other three. Hence, as a matter of notation, one may write $(P,\leq)$ or $(P,<)$, and assume that the other relations are defined appropriately. Defining via a non-strict partial order $\leq$ is most common. Some authors use different symbols than $\leq$ such as $\sqsubseteq$ or $\preceq$ to distinguish partial orders from total orders.

When referring to partial orders, $\leq$ should not be taken as the complement of $>$. The relation $>$ is the converse of the irreflexive kernel of $\leq$, which is always a subset of the complement of $\leq$, but $>$ is equal to the complement of $\leq$ if, and only if, $\leq$ is a total order.

Examples

Standard examples of posets arising in mathematics include:

* The real numbers, or in general any totally ordered set, ordered by the standard ''less-than-or-equal'' relation ≤, is a non-strict partial order.
* On the real numbers $\mathbb$, the usual less than relation < is a strict partial order. The same is also true of the usual greater than relation > on $\R$.
* By definition, every strict weak order is a strict partial order.
* The set of subsets of a given set (its power set) ordered by inclusion (see Fig.1). Similarly, the set of sequences ordered by subsequence, and the set of strings ordered by substring.
* The set of natural numbers equipped with the relation of divisibility. (see Fig.3 and Fig.6)
* The vertex set of a directed acyclic graph ordered by reachability.
* The set of subspaces of a vector space ordered by inclusion.
* For a partially ordered set ''P'', the sequence space containing all sequences of elements from ''P'', where sequence ''a'' precedes sequence ''b'' if every item in ''a'' precedes the corresponding item in ''b''. Formally, $\left(a_n\right)_ \leq \left(b_n\right)_$ if and only if $a_n \leq b_n$ for all $n \in \N$; that is, a componentwise order.
* For a set ''X'' and a partially ordered set ''P'', the function space containing all functions from ''X'' to ''P'', where ''f'' ≤ ''g'' if and only if ''f''(''x'') ≤ ''g''(''x'') for all $x \in X.$
* A fence, a partially ordered set defined by an alternating sequence of order relations ''a'' < ''b'' > ''c'' < ''d'' ...
* The set of events in special relativity and, in most cases, general relativity, where for two events ''X'' and ''Y'', ''X'' ≤ ''Y'' if and only if ''Y'' is in the future light cone of ''X''. An event ''Y'' can only be causally affected by ''X'' if ''X'' ≤ ''Y''.

One familiar example of a partially ordered set is a collection of people ordered by genealogical descendancy. Some pairs of people bear the descendant-ancestor relationship, but other pairs of people are incomparable, with neither being a descendant of the other.

Orders on the Cartesian product of partially ordered sets

In order of increasing strength, i.e., decreasing sets of pairs, three of the possible partial orders on the Cartesian product of two partially ordered sets are (see Fig.4):
*the lexicographical order:   (''a'', ''b'') ≤ (''c'', ''d'') if ''a'' < ''c'' or (''a'' = ''c'' and ''b'' ≤ ''d'');
*the product order:   (''a'', ''b'') ≤ (''c'', ''d'') if ''a'' ≤ ''c'' and ''b'' ≤ ''d'';
*the reflexive closure of the direct product of the corresponding strict orders:   (''a'', ''b'') ≤ (''c'', ''d'') if (''a'' < ''c'' and ''b'' < ''d'') or (''a'' = ''c'' and ''b'' = ''d'').

All three can similarly be defined for the Cartesian product of more than two sets.

Applied to ordered vector spaces over the same field, the result is in each case also an ordered vector space.

See also orders on the Cartesian product of totally ordered sets.

Sums of partially ordered sets

Another way to combine two (disjoint) posets is the ordinal sum (or linear sum), ''Z'' = ''X'' ⊕ ''Y'', defined on the union of the underlying sets ''X'' and ''Y'' by the order ''a'' ≤_''Z'' ''b'' if and only if:
* ''a'', ''b'' ∈ ''X'' with ''a'' ≤_''X'' ''b'', or
* ''a'', ''b'' ∈ ''Y'' with ''a'' ≤_''Y'' ''b'', or
* ''a'' ∈ ''X'' and ''b'' ∈ ''Y''.

If two posets are well-ordered, then so is their ordinal sum.

Series-parallel partial orders are formed from the ordinal sum operation (in this context called series composition) and another operation called parallel composition. Parallel composition is the disjoint union of two partially ordered sets, with no order relation between elements of one set and elements of the other set.

Derived notions

The examples use the poset $(\mathcal(\),\subseteq)$ consisting of the set of all subsets of a three-element set $\,$ ordered by set inclusion (see Fig.1).

* ''a'' is ''related to'' ''b'' when ''a'' ≤ ''b''. This does not imply that ''b'' is also related to ''a'', because the relation need not be symmetric. For example, $\$ is related to $\,$ but not the reverse.
* ''a'' and ''b'' are '' comparable'' if ''a'' ≤ ''b'' or ''b'' ≤ ''a''. Otherwise they are ''incomparable''. For example, $\$ and $\$ are comparable, while $\$ and $\$ are not.
* A '' total order'' or ''linear order'' is a partial order under which every pair of elements is comparable, i.e. trichotomy holds. For example, the natural numbers with their standard order.
* A ''chain'' is a subset of a poset that is a totally ordered set. For example, $\$ is a chain.
* An ''antichain'' is a subset of a poset in which no two distinct elements are comparable. For example, the set of singletons $\.$
* An element ''a'' is said to be ''strictly less than'' an element ''b'', if ''a'' ≤ ''b'' and $a \neq b.$ For example, $\$ is strictly less than $\.$
* An element ''a'' is said to be ''covered'' by another element ''b'', written ''a'' ⋖ ''b'' (or ''a'' <: ''b''), if ''a'' is strictly less than ''b'' and no third element ''c'' fits between them; formally: if both ''a'' ≤ ''b'' and $a \neq b$ are true, and ''a'' ≤ ''c'' ≤ ''b'' is false for each ''c'' with $a \neq c \neq b.$ Using the strict order <, the relation ''a'' ⋖ ''b'' can be equivalently rephrased as "''a'' < ''b'' but not ''a'' < ''c'' < ''b'' for any ''c''". For example, $\$ is covered by$\,$ but is not covered by $\.$

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 if for every element $a \in P, a \leq g.$ An element $m \in P$ is a if for every element $a \in P, m \leq a.$ A poset can only have one greatest or least element. In our running example, the set $\$ is the greatest element, and $\$ is the least.
* 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. In our running example, $\$ and $\$ are the maximal and minimal elements. Removing these, there are 3 maximal elements and 3 minimal elements (see Fig.5).
* Upper and lower bounds: For a subset ''A'' of ''P'', an element ''x'' in ''P'' is an upper bound of ''A'' if ''a'' ≤ ''x'', 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 ''a'' ≥ ''x'', 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''. In our example, the set $\$ is an for the collection of elements $\.$

As another 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; see Fig.6). This partially ordered set does not even have any maximal elements, since any ''g'' divides for instance 2''g'', which is distinct from it, so ''g'' is not maximal. If the number 1 is excluded, 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 $\,$ which 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 does not have any upper bound.

Mappings between partially ordered sets

Given two partially ordered sets (''S'', ≤) and (''T'', ≼), a function $f : S \to T$ is called order-preserving, or monotone, or isotone, if for all $x, y \in S,$ $x \leq y$ implies ''f''(''x'') ≼ ''f''(''y'').
If (''U'', ≲) is also a partially ordered set, and both $f : S \to T$ and $g : T \to U$ are order-preserving, their composition $g \circ f : S \to U$ is order-preserving, too.
A function $f : S \to T$ is called order-reflecting if for all $x, y \in S,$ ''f''(''x'') ≼ ''f''(''y'') implies $x \leq y.$
If $f$ is both order-preserving and order-reflecting, then it is called an order-embedding of (''S'', ≤) into (''T'', ≼).
In the latter case, $f$ is necessarily injective, since $f(x) = f(y)$ implies $x \leq y \text y \leq x$ and in turn $x = y$ according to the antisymmetry of $\leq.$ If an order-embedding between two posets ''S'' and ''T'' exists, one says that ''S'' can be embedded into ''T''. If an order-embedding $f : S \to T$ is bijective, it is called an order isomorphism, and the partial orders (''S'', ≤) and (''T'', ≼) are said to be isomorphic. Isomorphic orders have structurally similar Hasse diagrams (see Fig.7a). It can be shown that if order-preserving maps $f : S \to T$ and $g : T \to U$ exist such that $g \circ f$ and $f \circ g$ yields the identity function on ''S'' and ''T'', respectively, then ''S'' and ''T'' are order-isomorphic.

For example, a mapping $f : \N \to \mathbb(\N)$ from the set of natural numbers (ordered by divisibility) to the power set of natural numbers (ordered by set inclusion) can be defined by taking each number to the set of its prime divisors. It is order-preserving: if $x$ divides $y,$ then each prime divisor of $x$ is also a prime divisor of $y.$ However, it is neither injective (since it maps both 12 and 6 to $\$) nor order-reflecting (since 12 does not divide 6). Taking instead each number to the set of its prime power divisors defines a map $g : \N \to \mathbb(\N)$ that is order-preserving, order-reflecting, and hence an order-embedding. It is not an order-isomorphism (since it, for instance, does not map any number to the set $\$), but it can be made one by restricting its codomain to $g(\N).$ Fig.7b shows a subset of $\N$ and its isomorphic image under $g.$ The construction of such an order-isomorphism into a power set can be generalized to a wide class of partial orders, called distributive lattices, see "Birkhoff's representation theorem".

Number of partial orders

Sequence A001035in OEIS gives the number of partial orders on a set of ''n'' labeled elements:

The number of strict partial orders is the same as that of partial orders.

If the count is made only up to isomorphism, the sequence 1, 1, 2, 5, 16, 63, 318, ... is obtained.

Linear extension

A partial order $\leq^*$ on a set $X$ is an extension of another partial order $\leq$ on $X$ provided that for all elements $x, y \in X,$ whenever $x \leq y,$ it is also the case that $x \leq^* y.$ A linear extension is an extension that is also a linear (that is, total) order. As a classic example, the lexicographic order of totally ordered sets is a linear extension of their product order. Every partial order can be extended to a total order ( order-extension principle).

In computer science, algorithms for finding linear extensions of partial orders (represented as the reachability orders of directed acyclic graphs) are called topological sorting.

Directed acyclic graphs

Strict partial orders correspond directly to directed acyclic graphs (DAGs). If a graph is constructed by taking each element of $P$ to be a node and each element of $\leq$ to be an edge, then every strict partial order is a DAG, and the transitive closure of a DAG is both a strict partial order and also a DAG itself. In contrast a non-strict partial order would have self loops at every node and therefore not be a DAG.

In category theory

Every poset (and every preordered set) may be considered as a category where, for objects $x$ and $y,$ there is at most one morphism from $x$ to $y.$ More explicitly, let hom(''x'', ''y'') = if ''x'' ≤ ''y'' (and otherwise the empty set) and $(y, z) \circ (x, y) = (x, z).$ Such categories are sometimes called '' posetal''.

Posets are equivalent to one another if and only if they are isomorphic. In a poset, the smallest element, if it exists, is an initial object, and the largest element, if it exists, is a terminal object. Also, every preordered set is equivalent to a poset. Finally, every subcategory of a poset is isomorphism-closed.

Partial orders in topological spaces

If $P$ is a partially ordered set that has also been given the structure of a topological space, then it is customary to assume that $\$ is a closed subset of the topological product space $P \times P.$ Under this assumption partial order relations are well behaved at limits in the sense that if $\lim_ a_i = a,$ and $\lim_ b_i = b,$ and for all $i,$ $a_i \leq b_i,$ then $a \leq b.$

Intervals

An ''interval'' in a poset ''P'' is a subset of ''P'' with the property that, for any ''x'' and ''y'' in and any ''z'' in ''P'', if ''x'' ≤ ''z'' ≤ ''y'', then ''z'' is also in . (This definition generalizes the '' interval'' definition for real numbers.)

For ''a'' ≤ ''b'', the ''closed interval'' is the set of elements ''x'' satisfying ''a'' ≤ ''x'' ≤ ''b'' (that is, ''a'' ≤ ''x'' and ''x'' ≤ ''b''). It contains at least the elements ''a'' and ''b''.

Using the corresponding strict relation "<", the ''open interval'' is the set of elements ''x'' satisfying ''a'' < ''x'' < ''b'' (i.e. ''a'' < ''x'' and ''x'' < ''b''). An open interval may be empty even if ''a'' < ''b''. For example, the open interval on the integers is empty since there are no integers such that .

The ''half-open intervals'' and are defined similarly.

Sometimes the definitions are extended to allow ''a'' > ''b'', in which case the interval is empty.

An interval is bounded if there exist elements $a, b \in P$ such that . Every interval that can be represented in interval notation is obviously bounded, but the converse is not true. For example, let as a subposet of the real numbers. The subset is a bounded interval, but it has no infimum or supremum in ''P'', so it cannot be written in interval notation using elements of ''P''.

A poset is called locally finite if every bounded interval is finite. For example, the integers are locally finite under their natural ordering. The lexicographical order on the cartesian product $\N \times \N$ is not locally finite, since .
Using the interval notation, the property "''a'' is covered by ''b''" can be rephrased equivalently as $$, b= \.

This concept of an interval in a partial order should not be confused with the particular class of partial orders known as the interval orders.

See also

* Antimatroid, a formalization of orderings on a set that allows more general families of orderings than posets
* Causal set, a poset-based approach to quantum gravity
*
*
*
*
*
*
*
*
* Nested Set Collection
*
*
*
*
* Poset topology, a kind of topological space that can be defined from any poset
* Scott continuity – continuity of a function between two partial orders.
*
*
*
* Strict weak ordering – strict partial order "<" in which the relation is transitive.
*
* Tree – Data structure of set inclusion
*

Notes

Citations

References

*
*
*
*
*

External links

*
*

{{Authority control

Order theory
Binary relations

de:Ordnungsrelation#Halbordnung