# Preorder: Wikis

Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.

# Encyclopedia

In mathematics, especially in order theory, preorders are binary relations that satisfy certain conditions. For example, all partial orders and equivalence relations are preorders. The name quasiorder is also common for preorders. Other names are pre-order, quasi-order, and quasi order. Many order theoretical definitions for partially ordered sets can be generalized to preorders, but the extra effort of generalization is rarely needed.

## Formal definition

Consider some set P and a binary relation ≤ on P. Then ≤ is a preorder, or quasiorder, if it is reflexive and transitive, i.e., for all a, b and c in P, we have that:

aa (reflexivity)
if ab and bc then ac (transitivity)

Note that an alternate definition of preorder requires the relation to be irreflexive. However, as this article is examining preorders as a logical extension of partial orders, the current definition is more intuitive.

A set that is equipped with a preorder is called a preordered set.

If a preorder is also antisymmetric, that is, ab and ba implies a = b, then it is a partial order.

On the other hand, if it is symmetric, that is, if ab implies ba, then it is an equivalence relation.

A preorder which is preserved in all contexts (i.e. respected by all functions on P) is called a precongruence. A precongruence which is also symmetric (i.e. is an equivalence relation) is a congruence relation.

Equivalently, a preorder on the set P can be defined as a category with object set P where every homset has at most one element (one for objects which are related, zero otherwise).

## Examples of preorders

• Any collection of sets is preordered by their comparative sizes. Thus {3, 7} ≤ {April, June, July}. This applies equally to infinite sets; as one example, Cantor's famous diagonalization result that the real numbers are uncountable (i.e, more numerous than the integers) may be expressed in terms of this preorder as Z < R.
• Logical implication over sentences.
• Every finite topological space gives rise to a preorder on its points, in which xy if and only if x belongs to every neighborhood of y, and every finite preorder can be formed as the specialization preorder of a topological space in this way. That is, there is a 1-to-1 correspondence between finite topologies and finite preorders. However, the relation between infinite topological spaces and their specialization preorders is not 1-to-1.
• 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 \le y$ iff $f(x) \le f(y)$, where f is a function into some preorder.
• The relation defined by $x \le y$ iff 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.
• The graph-minor relation in graph theory.
• In computer science, subtyping relations are usually preorders.

Example of a total preorder:

## 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: x R+ y if and only if there is an R- path from x to y.

Given a preorder $\lesssim$ on S one may define an equivalence relation ~ on S such that a ~ b if and only if a $\lesssim$ b and b $\lesssim$ a. (The resulting relation is reflexive since a preorder is reflexive, transitive by applying transitivity of the preorder twice, and symmetric by definition.)

Using this relation, it is possible to construct a partial order on the quotient set of the equivalence, S / ~, the set of all equivalence classes of ~. Note that if the preorder is R+=, S / ~ is the set of R- cycle equivalence classes: x ∈ [y] if and only if x = y or x is in an R-cycle with y. In any case, on S / ~ we can define [x] ≤ [y] if and only if x $\lesssim$ y. By the construction of ~ , this definition is independent of the chosen representatives and the corresponding relation is indeed well-defined. It is readily verified that this yields a partially ordered set.

Conversely, from a partial order on a partition of a set S one can construct a preorder on S. There is a 1-to-1 correspondence between preorders and pairs (partition, partial order).

For a preorder "$\lesssim$", a relation "<" can be defined as a < b if and only if (a $\lesssim$ b and not b $\lesssim$ a), or equivalently, using the equivalence relation introduced above, (a $\lesssim$ b and not a ~ b). It is a strict partial order; every strict partial order can be the result of such a construction. If the preorder is anti-symmetric, hence a partial order "≤", the equivalence is equality, so the relation "<" can also be defined as a < b if and only if (ab and ab).

(Alternatively, for a preorder "$\lesssim$", a relation "<" can be defined as a < b if and only if (a $\lesssim$ b and ab). The result is the reflexive reduction of the preorder. However, if the preorder is not anti-symmetric the result is not transitive, and if it is, as we have seen, it is the same as before.)

Conversely we have a $\lesssim$ b if and only if a < b or a ~ b. This is the reason for using the notation "$\lesssim$"; "≤" can be confusing for a preorder that is not anti-symmetric, it may suggest that ab implies that a < b or a = b.

Note that with this construction multiple preorders "$\lesssim$" can give the same relation "<", so without more information, such as the equivalence relation, "$\lesssim$" cannot be reconstructed from "<". Possible preorders include the following:

• Define ab as a < b or a = b (i.e., 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 we don't need the notations $\lesssim$ and ~.
• Define a $\lesssim$ b as "not b < a" (i.e., take the inverse complement of the relation), which corresponds to defining a ~ b as "neither a < b nor b < a"; these relations $\lesssim$ and ~ are in general not transitive; however, if they are, ~ is an equivalence; in that case "<" is a strict weak order. The resulting preorder is total.

## Number of preorders

Number of n-element binary relations of different types
n all transitive reflexive preorder partial order total preorder total order equivalence relation
0 1 1 1 1 1 1 1 1
1 2 2 1 1 1 1 1 1
2 16 13 4 4 3 3 2 2
3 512 171 64 29 19 13 6 5
4 65536 3994 4096 355 219 75 24 15
OEIS A002416 A006905 A053763 A000798 A001035 A000670 A000142 A000110

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 × 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 × 3 = 21 preorders
• 6 partitions of 2+1+1, giving 6 × 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.