Preorder

This article is about binary relations. For the graph vertex ordering, see depth-first search. For purchase orders for unreleased products, see pre-order. For other uses, see Preorder (disambiguation).

"Quasiorder" redirects here. For irreflexive transitive relations, see strict order.

Transitive binary relations
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Total, Semiconnex Anti- reflexive Equivalence relation Y ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Preorder (Quasiorder) ✗ ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Partial order ✗ Y ✗ ✗ ✗ ✗ Y ✗ ✗ Total preorder ✗ ✗ Y ✗ ✗ ✗ Y ✗ ✗ Total order ✗ Y Y ✗ ✗ ✗ Y ✗ ✗ Prewellordering ✗ ✗ Y Y ✗ ✗ Y ✗ ✗ Well-quasi-ordering ✗ ✗ ✗ Y ✗ ✗ Y ✗ ✗ Well-ordering ✗ Y Y Y ✗ ✗ Y ✗ ✗ Lattice ✗ Y ✗ ✗ Y Y Y ✗ ✗ Join-semilattice ✗ Y ✗ ✗ Y ✗ Y ✗ ✗ Meet-semilattice ✗ Y ✗ ✗ ✗ Y Y ✗ ✗ Strict partial order ✗ ✗ ✗ ✗ ✗ ✗ ✗ Y Y Strict weak order ✗ ✗ ✗ ✗ ✗ ✗ ✗ Y Y Strict total order ✗ ✗ Y ✗ ✗ ✗ ✗ Y Y Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Definitions, for all $a,b$ and $S\neq \varnothing :$ ${\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}$ ${\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}$ ${\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}$ ${\begin{aligned}\min S\\{\text{exists}}\end{aligned}}$ ${\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}$ ${\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}$ $aRa$ ${\text{not }}aRa$ ${\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}$
Y indicates that the column's property is required by the definition of the row's term (at the very left). For example, the definition of an equivalence relation requires it to be symmetric. ✗ indicates that the property may, or may not hold. All definitions tacitly require the homogeneous relation $R$ be transitive: for all $a,b,c,$ if $aRb$ and $bRc$ then $aRc,$ and there are additional properties that a homogeneous relation may satisfy.

Hasse diagram of the preorder x R y defined by x//4≤y//4 on the natural numbers. Due to the cycles, R is not anti-symmetric. If all numbers in a cycle are considered equivalent, a partial, even linear, order is obtained. See first example below.

In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. Preorders are more general than equivalence relations and (non-strict) partial orders, both of which are special cases of a preorder: an antisymmetric (or skeletal) preorder is a partial order, and a symmetric preorder is an equivalence relation.

The name preorder comes from the idea that preorders (that are not partial orders) are 'almost' (partial) orders, but not quite; they are neither necessarily antisymmetric nor asymmetric. Because a preorder is a binary relation, the symbol $\,\leq \,$ can be used as the notational device for the relation. However, because they are not necessarily antisymmetric, some of the ordinary intuition associated to the symbol $\,\leq \,$ may not apply. On the other hand, a preorder can be used, in a straightforward fashion, to define a partial order and an equivalence relation. Doing so, however, is not always useful or worthwhile, depending on the problem domain being studied.

In words, when $a\leq b,$ one may say that b covers a or that a precedes b, or that b reduces to a. Occasionally, the notation ← or → or $\,\lesssim \,$ is used instead of $\,\leq .$

To every preorder, there corresponds a directed graph, with elements of the set corresponding to vertices, and the order relation between pairs of elements corresponding to the directed edges between vertices. The converse is not true: most directed graphs are neither reflexive nor transitive. In general, the corresponding graphs may contain cycles. A preorder that is antisymmetric no longer has cycles; it is a partial order, and corresponds to a directed acyclic graph. A preorder that is symmetric is an equivalence relation; it can be thought of as having lost the direction markers on the edges of the graph. In general, a preorder's corresponding directed graph may have many disconnected components.

Formal definition

Consider a homogeneous relation $\,\leq \,$ on some given set $P,$ so that by definition, $\,\leq \,$ is some subset of $P\times P$ and the notation $a\leq b$ is used in place of $(a,b)\in \,\leq .$ Then $\,\leq \,$ is called a preorder or quasiorder if it is reflexive and transitive; that is, if it satisfies:

1. Reflexivity: $a\leq a$ for all $a\in P,$ and
2. Transitivity: if $a\leq b{\text{ and }}b\leq c{\text{ then }}a\leq c$ for all $a,b,c\in P.$

A set that is equipped with a preorder is called a preordered set (or proset). For emphasis or contrast to strict preorders, a preorder may also be referred to as a non-strict preorder.

If reflexivity is replaced with irreflexivity (while keeping transitivity) then the result is called a strict preorder; explicitly, a strict preorder on $P$ is a homogeneous binary relation $\,<\,$ on $P$ that satisfies the following conditions:

1. Irreflexivity or Anti-reflexivity: not $a<a$ for all $a\in P;$ that is, $\,a<a$ is false for all $a\in P,$ and
2. Transitivity: if $a<b{\text{ and }}b<c{\text{ then }}a<c$ for all $a,b,c\in P.$

A binary relation is a strict preorder if and only if it is a strict partial order. By definition, a strict partial order is an asymmetric strict preorder, where $\,<\,$ is called asymmetric if $a<b{\text{ implies }}{\textit {not}}\ b<a$ for all $a,b.$ Conversely, every strict preorder is a strict partial order because every transitive irreflexive relation is necessarily asymmetric. Although they are equivalent, the term "strict partial order" is typically preferred over "strict preorder" and readers are referred to the article on strict partial orders for details about such relations. In contrast to strict preorders, there are many (non-strict) preorders that are not (non-strict) partial orders.

Related definitions

If a preorder is also antisymmetric, that is, $a\leq b$ and $b\leq a$ implies $a=b,$ then it is a partial order.

On the other hand, if it is symmetric, that is, if $a\leq b$ implies $b\leq a,$ then it is an equivalence relation.

A preorder is total if $a\leq b$ or $b\leq a$ for all $a,b\in P.$

The notion of a preordered set $P$ can be formulated in a categorical framework as a thin category; that is, as a category with at most one morphism from an object to another. Here the objects correspond to the elements of $P,$ and there is one morphism for objects which are related, zero otherwise. Alternately, a preordered set can be understood as an enriched category, enriched over the category $2=(0\to 1).$

A preordered class is a class equipped with a preorder. Every set is a class and so every preordered set is a preordered class.

Examples

Graph theory

• (see figure above) By x//4 is meant the greatest integer that is less than or equal to x divided by 4, thus 1//4 is 0, which is certainly less than or equal to 0, which is itself the same as 0//4.

• The reachability relationship in any directed graph (possibly containing cycles) gives rise to a preorder, where $x\leq y$ in the preorder if and only if there is a path from x to y in the directed graph. Conversely, every preorder is the reachability relationship of a directed graph (for instance, the graph that has an edge from x to y for every pair (x, y) with $x\leq y.$ However, many different graphs may have the same reachability preorder as each other. In the same way, reachability of directed acyclic graphs, directed graphs with no cycles, gives rise to partially ordered sets (preorders satisfying an additional antisymmetry property).
• The graph-minor relation in graph theory.

Computer science

In computer science, one can find examples of the following preorders.

• Asymptotic order causes a preorder over functions $f:\mathbb {N} \to \mathbb {N}$. The corresponding equivalence relation is called asymptotic equivalence.
• Polynomial-time, many-one (mapping) and Turing reductions are preorders on complexity classes.
• Subtyping relations are usually preorders.
• Simulation preorders are preorders (hence the name).
• Reduction relations in abstract rewriting systems.
• The encompassment preorder on the set of terms, defined by $s\leq t$ if a subterm of t is a substitution instance of s.
• Theta-subsumption, which is when the literals in a disjunctive first-order formula are contained by another, after applying a substitution to the former.

Other

Further examples:

• Every finite topological space gives rise to a preorder on its points by defining $x\leq y$ if and only if x belongs to every neighborhood of y. Every finite preorder can be formed as the specialization preorder of a topological space in this way. That is, there is a one-to-one correspondence between finite topologies and finite preorders. However, the relation between infinite topological spaces and their specialization preorders is not one-to-one.

• A net is a directed preorder, that is, each pair of elements has an upper bound. The definition of convergence via nets is important in topology, where preorders cannot be replaced by partially ordered sets without losing important features.

• The relation defined by $x\leq y$ if $f(x)\leq f(y),$ where f is a function into some preorder.
• The relation defined by $x\leq y$ if there exists some injection from x to y. Injection may be replaced by surjection, or any type of structure-preserving function, such as ring homomorphism, or permutation.
• The embedding relation for countable total orderings.
• A category with at most one morphism from any object x to any other object y is a preorder. Such categories are called thin. In this sense, categories "generalize" preorders by allowing more than one relation between objects: each morphism is a distinct (named) preorder relation.

Example of a total preorder:

• Preference, according to common models.

Uses

Preorders play a pivotal role in several situations:

• Every preorder can be given a topology, the Alexandrov topology; and indeed, every preorder on a set is in one-to-one correspondence with an Alexandrov topology on that set.
• Preorders may be used to define interior algebras.
• Preorders provide the Kripke semantics for certain types of modal logic.
• Preorders are used in forcing in set theory to prove consistency and independence results.

Constructions

Every binary relation $R$ on a set $S$ can be extended to a preorder on $S$ by taking the transitive closure and reflexive closure, $R^{+=}.$ The transitive closure indicates path connection in $R:xR^{+}y$ if and only if there is an $R$-path from $x$ to $y.$

Left residual preorder induced by a binary relation

Given a binary relation $R,$ the complemented composition $R\backslash R={\overline {R^{\textsf {T}}\circ {\overline {R}}}}$ forms a preorder called the left residual, where $R^{\textsf {T}}$ denotes the converse relation of $R,$ and ${\overline {R}}$ denotes the complement relation of $R,$ while $\circ$ denotes relation composition.

Preorders and partial orders on partitions

Given a preorder $\,\lesssim \,$ on $S$ one may define an equivalence relation $\,\sim \,$ on $S$ such that

$$a\sim b\quad {\text{ if and only if }}\quad a\lesssim b\;{\text{ and }}\;b\lesssim a.$$

The resulting relation $\,\sim \,$ is reflexive since the preorder $\,\lesssim \,$ is reflexive; transitive by applying the transitivity of $\,\lesssim \,$ twice; and symmetric by definition.

Using this relation, it is possible to construct a partial order on the quotient set of the equivalence, $S/\sim ,$ which is the set of all equivalence classes of $\,\sim .$ If the preorder is denoted by $R^{+=},$ then $S/\sim$ is the set of $R$-cycle equivalence classes: $x\in [y]$ if and only if $x=y$ or $x$ is in an $R$-cycle with $y$ In any case, on $S/\sim$ it is possible to define $[x]\leq [y]$ if and only if $x\lesssim y.$ That this is well-defined, meaning that its defining condition does not depend on which representatives of $[x]$ and $[y]$ are chosen, follows from the definition of $\,\sim .\,$ It is readily verified that this yields a partially ordered set.

Conversely, from any partial order on a partition of a set $S,$ it is possible to construct a preorder on $S$ itself. There is a one-to-one correspondence between preorders and pairs (partition, partial order).

Example: Let $S$ be a formal theory, which is a set of sentences with certain properties (details of which can be found in the article on the subject). For instance, $S$ could be a first-order theory (like Zermelo–Fraenkel set theory) or a simpler zeroth-order theory. One of the many properties of $S$ is that it is closed under logical consequences so that, for instance, if a sentence $A\in S$ logically implies some sentence $B,$ which will be written as $A\Rightarrow B$ and also as $B\Leftarrow A,$ then necessarily $B\in S$ (by modus ponens). The relation $\,\Leftarrow \,$ is a preorder on $S$ because $A\Leftarrow A$ always holds and whenever $A\Leftarrow B$ and $B\Leftarrow C$ both hold then so does $A\Leftarrow C.$ Furthermore, for any $A,B\in S,$ $A\sim B$ if and only if $A\Leftarrow B{\text{ and }}B\Leftarrow A$; that is, two sentences are equivalent with respect to $\,\Leftarrow \,$ if and only if they are logically equivalent. This particular equivalence relation $A\sim B$ is commonly denoted with its own special symbol $A\iff B,$ and so this symbol $\,\iff \,$ may be used instead of $\,\sim .$ The equivalence class of a sentence $A,$ denoted by $[A],$ consists of all sentences $B\in S$ that are logically equivalent to $A$ (that is, all $B\in S$ such that $A\iff B$). The partial order on $S/\sim$ induced by $\,\Leftarrow ,\,$ which will also be denoted by the same symbol $\,\Leftarrow ,\,$ is characterized by $[A]\Leftarrow [B]$ if and only if $A\Leftarrow B,$ where the right hand side condition is independent of the choice of representatives $A\in [A]$ and $B\in [B]$ of the equivalence classes. All that has been said of $\,\Leftarrow \,$ so far can also be said of its converse relation $\,\Rightarrow .\,$ The preordered set $(S,\Leftarrow )$ is a directed set because if $A,B\in S$ and if $C:=A\wedge B$ denotes the sentence formed by logical conjunction $\,\wedge ,\,$ then $A\Leftarrow C$ and $B\Leftarrow C$ where $C\in S.$ The partially ordered set $\left(S/\sim ,\Leftarrow \right)$ is consequently also a directed set. See Lindenbaum–Tarski algebra for a related example.

Preorders and strict preorders

Strict preorder induced by a preorder

Given a preorder $\,\lesssim ,$ a new relation $\,<\,$ can be defined by declaring that $a<b$ if and only if $a\lesssim b{\text{ and not }}b\lesssim a.$ Using the equivalence relation $\,\sim \,$ introduced above, $a<b$ if and only if $a\lesssim b{\text{ and not }}a\sim b;$ and so the following holds

$$a\lesssim b\quad {\text{ if and only if }}\quad a<b\;{\text{ or }}\;a\sim b.$$

The relation $\,<\,$ is a strict partial order and every strict partial order can be constructed this way. If the preorder $\,\lesssim \,$ is antisymmetric (and thus a partial order) then the equivalence $\,\sim \,$ is equality (that is, $a\sim b$ if and only if $a=b$) and so in this case, the definition of $\,<\,$ can be restated as:

$$a<b\quad {\text{ if and only if }}\quad a\leq b\;{\text{ and }}\;a\neq b\quad \quad ({\text{assuming }}\lesssim {\text{ is antisymmetric}}).$$

But importantly, this new condition is not used as (nor is it equivalent to) the general definition of the relation $\,<\,$ (that is, $\,<\,$ is not defined as: $a<b$ if and only if $a\lesssim b{\text{ and }}a\neq b$) because if the preorder $\,\lesssim \,$ is not antisymmetric then the resulting relation $\,<\,$ would not be transitive (consider how equivalent non-equal elements relate). This is the reason for using the symbol "$\lesssim$" instead of the "less than or equal to" symbol "$\leq$", which might cause confusion for a preorder that is not antisymmetric since it might misleadingly suggest that $a\leq b$ implies $a<b{\text{ or }}a=b.$

Preorders induced by a strict preorder

Using the construction above, multiple non-strict preorders can produce the same strict preorder $\,<,\,$ so without more information about how $\,<\,$ was constructed (such knowledge of the equivalence relation $\,\sim \,$ for instance), it might not be possible to reconstruct the original non-strict preorder from $\,<.\,$ Possible (non-strict) preorders that induce the given strict preorder $\,<\,$ include the following:

• Define $a\leq b$ as $a<b{\text{ or }}a=b$ (that is, take the reflexive closure of the relation). This gives the partial order associated with the strict partial order "$<$" through reflexive closure; in this case the equivalence is equality $\,=,$ so the symbols $\,\lesssim \,$ and $\,\sim \,$ are not needed.
• Define $a\lesssim b$ as "${\text{ not }}b<a$" (that is, take the inverse complement of the relation), which corresponds to defining $a\sim b$ as "neither $a<b{\text{ nor }}b<a$"; these relations $\,\lesssim \,$ and $\,\sim \,$ are in general not transitive; however, if they are then $\,\sim \,$ is an equivalence; in that case "$<$" is a strict weak order. The resulting preorder is connected (formerly called total); that is, a total preorder.

If $a\leq b$ then $a\lesssim b.$ The converse holds (that is, $\,\lesssim \;\;=\;\;\leq \,$) if and only if whenever $a\neq b$ then $a<b$ or $b<a.$

Number of preorders

Number of n-element binary relations of different types

Elem­ents	Any	Transitive	Reflexive	Symmetric	Preorder	Partial order	Total preorder	Total order	Equivalence relation
0	1	1	1	1	1	1	1	1	1
1	2	2	1	2	1	1	1	1	1
2	16	13	4	8	4	3	3	2	2
3	512	171	64	64	29	19	13	6	5
4	65,536	3,994	4,096	1,024	355	219	75	24	15
n	2n2		2n2−n	2n(n+1)/2			${\textstyle \sum _{k=0}^{n}k!S(n,k)}$	n!	${\textstyle \sum _{k=0}^{n}S(n,k)}$
OEIS	A002416	A006905	A053763	A006125	A000798	A001035	A000670	A000142	A000110

Note that S(n, k) refers to Stirling numbers of the second kind.

As explained above, there is a 1-to-1 correspondence between preorders and pairs (partition, partial order). Thus the number of preorders is the sum of the number of partial orders on every partition. For example:

• for $n=3:$
  • 1 partition of 3, giving 1 preorder
  • 3 partitions of 2 + 1, giving $3\times 3=9$ preorders
  • 1 partition of 1 + 1 + 1, giving 19 preorders
  I.e., together, 29 preorders.
• for $n=4:$
  • 1 partition of 4, giving 1 preorder
  • 7 partitions with two classes (4 of 3 + 1 and 3 of 2 + 2), giving $7\times 3=21$ preorders
  • 6 partitions of 2 + 1 + 1, giving $6\times 19=114$ preorders
  • 1 partition of 1 + 1 + 1 + 1, giving 219 preorders
  I.e., together, 355 preorders.

Interval

For $a\lesssim b,$ the interval $[a,b]$ is the set of points x satisfying $a\lesssim x$ and $x\lesssim b,$ also written $a\lesssim x\lesssim b.$ It contains at least the points a and b. One may choose to extend the definition to all pairs $(a,b)$ The extra intervals are all empty.

Using the corresponding strict relation "$<$", one can also define the interval $(a,b)$ as the set of points x satisfying $a<x$ and $x<b,$ also written $a<x<b.$ An open interval may be empty even if $a<b.$

Also $[a,b)$ and $(a,b]$ can be defined similarly.

See also

• Partial order – preorder that is antisymmetric
• Equivalence relation – preorder that is symmetric
• Total preorder – preorder that is total
• Total order – preorder that is antisymmetric and total
• Directed set
• Category of preordered sets
• Prewellordering
• Well-quasi-ordering

References

• Schmidt, Gunther, "Relational Mathematics", Encyclopedia of Mathematics and its Applications, vol. 132, Cambridge University Press, 2011, ISBN 978-0-521-76268-7
• Schröder, Bernd S. W. (2002), Ordered Sets: An Introduction, Boston: Birkhäuser, ISBN 0-8176-4128-9