Preorder

Transitive binary relations v t e
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 Y Strict weak order ✗ Y ✗ ✗ ✗ ✗ ✗ Y Y Strict total order ✗ Y Y ✗ ✗ ✗ ✗ Y Y Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Definitions, for all a , b {\displaystyle a,b} and S ≠ ∅ : {\displaystyle S\neq \varnothing :} a R b ⇒ b R a {\displaystyle {\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}} a R b  and  b R a ⇒ a = b {\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}} a ≠ b ⇒ a R b  or  b R a {\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}} min S exists {\displaystyle {\begin{aligned}\min S\\{\text{exists}}\end{aligned}}} a ∨ b exists {\displaystyle {\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}} a ∧ b exists {\displaystyle {\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}} a R a {\displaystyle aRa} not  a R a {\displaystyle {\text{not }}aRa} a R b ⇒ not  b R a {\displaystyle {\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}}
Y indicates that the column's property is always true for the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by Y in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively. All definitions tacitly require the homogeneous relation R {\displaystyle R} be transitive: for all a , b , c , {\displaystyle a,b,c,} if a R b {\displaystyle aRb} and b R c {\displaystyle bRc} then a R c . {\displaystyle aRc.} A term's definition may require additional properties that are not listed in this table.

In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. The name preorder is meant to suggest that preorders are almost partial orders, but not quite, as they are not necessarily antisymmetric.

A natural example of a preorder is the divides relation "x divides y" between integers. This relation is reflexive as every integer divides itself. It is also transitive. But it is not antisymmetric, because e.g. 1 {\displaystyle 1} divides − 1 {\displaystyle -1} and − 1 {\displaystyle -1} divides 1 {\displaystyle 1} , but − 1 {\displaystyle -1} is not equal to 1 {\displaystyle 1} . It is to this preorder that "least" refers in the phrase "least common multiple" (in contrast, using the natural order on integers, e.g. 4 {\displaystyle 4} and 6 {\displaystyle 6} have the common multiples 24 {\displaystyle 24} , 12 {\displaystyle 12} , 0 {\displaystyle 0} , − 12 {\displaystyle -12} , − 24 {\displaystyle -24} , ..., but no least one).

Preorders are closely related to equivalence relations and (non-strict) partial orders. Both of these are special cases of a preorder: an antisymmetric preorder is a partial order, and a symmetric preorder is an equivalence relation. Moreover, a preorder on a set X {\displaystyle X} can equivalently be defined as an equivalence relation on X {\displaystyle X} , together with a partial order on the set of equivalence class, cf. picture. Like partial orders and equivalence relations, preorders (on a nonempty set) are never asymmetric.

A preorder can be visualized as 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. 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.

A preorder is often denoted ≲ {\displaystyle \,\lesssim \,} or ≤ {\displaystyle \,\leq \,} .

A binary relation ≲ {\displaystyle \,\lesssim \,} on a set X {\displaystyle X} is called a preorder or quasiorder if it is reflexive and transitive; that is, if it satisfies:

1. Reflexivity: a ≲ a {\displaystyle a\lesssim a} for all a ∈ X , {\displaystyle a\in X,} and
2. Transitivity: if a ≲ b  and  b ≲ c  then  a ≲ c {\displaystyle a\lesssim b{\text{ and }}b\lesssim c{\text{ then }}a\lesssim c} for all a , b , c ∈ X . {\displaystyle a,b,c\in X.}

A set that is equipped with a preorder is called a preordered set (or proset).^[1]

Given a preorder ≲ {\displaystyle \,\lesssim \,} on X {\displaystyle X} one may define an equivalence relation ∼ {\displaystyle \,\sim \,} on X {\displaystyle X} by a ∼ b  if  a ≲ b  and  b ≲ a . {\displaystyle a\sim b\quad {\text{ if }}\quad a\lesssim b\;{\text{ and }}\;b\lesssim a.} The resulting relation ∼ {\displaystyle \,\sim \,} is reflexive since the preorder ≲ {\displaystyle \,\lesssim \,} is reflexive; transitive by applying the transitivity of ≲ {\displaystyle \,\lesssim \,} twice; and symmetric by definition.

Using this relation, it is possible to construct a partial order on the quotient set X / ∼ {\displaystyle X/\sim } of the equivalence, by defining [ x ] ≤ [ y ] {\displaystyle [x]\leq [y]} if x ≲ y . {\displaystyle x\lesssim y.} That this is well-defined, meaning that it does not depend on the particular choice of representatives x {\displaystyle x} and y {\displaystyle y} , follows from the definition of ∼ {\displaystyle \,\sim \,} .

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

Example: Let X {\displaystyle X} be the set of all (valid or invalid) sentences in some subfield of mathematics, like geometry. Define p ⇐ q {\displaystyle p\Leftarrow q} if p {\displaystyle p} is a logical consequence of q {\displaystyle q} . Then ⇐ {\displaystyle \Leftarrow } is a preorder on X {\displaystyle X} : every sentence p {\displaystyle p} can be proven from itself (reflexivity), and if p {\displaystyle p} can be proven from q {\displaystyle q} , and q {\displaystyle q} from r {\displaystyle r} , then p {\displaystyle p} can also be proven from r {\displaystyle r} (transitivity). The corresponding equivalence relation is usually denoted p ⇔ q {\displaystyle p\Leftrightarrow q} , and defined as p ⇐ q {\displaystyle p\Leftarrow q} and q ⇐ p {\displaystyle q\Leftarrow p} ; in this case p {\displaystyle p} and q {\displaystyle q} are called "logically equivalent". The equivalence class of a sentence p {\displaystyle p} is the set of all sentences q ∈ X {\displaystyle q\in X} that are logically equivalent to p {\displaystyle p} ; formally: [ p ] = { q ∣ p ⇔ q } {\displaystyle [p]=\{q\mid p\Leftrightarrow q\}} . The preordered set ( X , ⇐ ) {\displaystyle (X,\Leftarrow )} is a directed set: given two sentences p , q ∈ X {\displaystyle p,q\in X} , their logical conjunction p ∧ q {\displaystyle p\wedge q} , pronounced "both p {\displaystyle p} and q {\displaystyle q} ", is a common upper bound of them, since p {\displaystyle p} is a consequence of p ∧ q {\displaystyle p\wedge q} , and so is q {\displaystyle q} . The partially ordered set ( X / ⇔ , ⇐ ) {\displaystyle \left(X/\Leftrightarrow ,\Leftarrow \right)} is hence also a directed set. See Lindenbaum–Tarski algebra for a related example.

If reflexivity is replaced with irreflexivity (while keeping transitivity) then we get the definition of a strict partial order on X {\displaystyle X} . For this reason, the term strict preorder is sometimes used for a strict partial order. That is, this is a binary relation < {\displaystyle \,<\,} on X {\displaystyle X} that satisfies:

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

Any preorder ≲ {\displaystyle \,\lesssim \,} gives rise to a strict partial order defined by a < b {\displaystyle a<b} if and only if a ≲ b {\displaystyle a\lesssim b} and not b ≲ a {\displaystyle b\lesssim a} . Using the equivalence relation ∼ {\displaystyle \,\sim \,} introduced above, a < b {\displaystyle a<b} if and only if a ≲ b  and not  a ∼ b ; {\displaystyle a\lesssim b{\text{ and not }}a\sim b;} and so the following holds a ≲ b  if and only if  a < b  or  a ∼ b . {\displaystyle a\lesssim b\quad {\text{ if and only if }}\quad a<b\;{\text{ or }}\;a\sim b.} The relation < {\displaystyle \,<\,} is a strict partial order and every strict partial order can be constructed this way. If the preorder ≲ {\displaystyle \,\lesssim \,} is antisymmetric (and thus a partial order) then the equivalence ∼ {\displaystyle \,\sim \,} is equality (that is, a ∼ b {\displaystyle a\sim b} if and only if a = b {\displaystyle a=b} ) and so in this case, the definition of < {\displaystyle \,<\,} can be restated as: a < b  if and only if  a ≲ b  and  a ≠ b ( assuming  ≲  is antisymmetric ) . {\displaystyle a<b\quad {\text{ if and only if }}\quad a\lesssim 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 < {\displaystyle \,<\,} (that is, < {\displaystyle \,<\,} is not defined as: a < b {\displaystyle a<b} if and only if a ≲ b  and  a ≠ b {\displaystyle a\lesssim b{\text{ and }}a\neq b} ) because if the preorder ≲ {\displaystyle \,\lesssim \,} is not antisymmetric then the resulting relation < {\displaystyle \,<\,} would not be transitive (consider how equivalent non-equal elements relate). This is the reason for using the symbol " ≲ {\displaystyle \lesssim } " instead of the "less than or equal to" symbol " ≤ {\displaystyle \leq } ", which might cause confusion for a preorder that is not antisymmetric since it might misleadingly suggest that a ≤ b {\displaystyle a\leq b} implies a < b  or  a = b . {\displaystyle a<b{\text{ or }}a=b.}

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

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

If a ≤ b {\displaystyle a\leq b} then a ≲ b . {\displaystyle a\lesssim b.} The converse holds (that is, ≲ = ≤ {\displaystyle \,\lesssim \;\;=\;\;\leq \,} ) if and only if whenever a ≠ b {\displaystyle a\neq b} then a < b {\displaystyle a<b} or b < a . {\displaystyle b<a.}

• The reachability relationship in any directed graph (possibly containing cycles) gives rise to a preorder, where x ≲ y {\displaystyle x\lesssim 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 ≲ y {\displaystyle x\lesssim 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 is also a preorder.

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

• Asymptotic order causes a preorder over functions f : N → N {\displaystyle 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.^[2]
• Simulation preorders are preorders (hence the name).
• Reduction relations in abstract rewriting systems.
• The encompassment preorder on the set of terms, defined by s ≲ t {\displaystyle s\lesssim t} if a subterm of t is a substitution instance of s.
• Theta-subsumption,^[3] which is when the literals in a disjunctive first-order formula are contained by another, after applying a substitution to the former.

• A category with at most one morphism from any object x to any other object y is a preorder. Such categories are called thin. Here the objects correspond to the elements of X , {\displaystyle X,} and there is one morphism for objects which are related, zero otherwise. In this sense, categories "generalize" preorders by allowing more than one relation between objects: each morphism is a distinct (named) preorder relation.
• Alternately, a preordered set can be understood as an enriched category, enriched over the category 2 = ( 0 → 1 ) . {\displaystyle 2=(0\to 1).}

Further examples:

• Every finite topological space gives rise to a preorder on its points by defining x ≲ y {\displaystyle x\lesssim 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 ≲ y {\displaystyle x\lesssim y} if f ( x ) ≲ f ( y ) , {\displaystyle f(x)\lesssim f(y),} where f is a function into some preorder.
• The relation defined by x ≲ y {\displaystyle x\lesssim 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.

Example of a total preorder:

• Preference, according to common models.^[4]

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

Left residual preorder induced by a binary relation

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

If a preorder is also antisymmetric, that is, a ≲ b {\displaystyle a\lesssim b} and b ≲ a {\displaystyle b\lesssim a} implies a = b , {\displaystyle a=b,} then it is a partial order.

On the other hand, if it is symmetric, that is, if a ≲ b {\displaystyle a\lesssim b} implies b ≲ a , {\displaystyle b\lesssim a,} then it is an equivalence relation.

A preorder is total if a ≲ b {\displaystyle a\lesssim b} or b ≲ a {\displaystyle b\lesssim a} for all a , b ∈ X . {\displaystyle a,b\in X.}

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

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.^[6]

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 a ≲ b , {\displaystyle a\lesssim b,} the interval [ a , b ] {\displaystyle [a,b]} is the set of points x satisfying a ≲ x {\displaystyle a\lesssim x} and x ≲ b , {\displaystyle x\lesssim b,} also written a ≲ x ≲ b . {\displaystyle 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 ) {\displaystyle (a,b)} . The extra intervals are all empty.

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

Also [ a , b ) {\displaystyle [a,b)} and ( a , b ] {\displaystyle (a,b]} can be defined similarly.

• 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

• 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