Weak ordering

In mathematics, especially order theory, a weak ordering is a mathematical formalization of the intuitive notion of a ranking of a set, some of whose members may be tied with each other. Weak orders are a generalization of totally ordered sets (rankings without ties) and are in turn generalized by partially ordered sets and preorders..

There are several common ways of formalizing weak orderings, that are different from each other but cryptomorphic (interconvertable with no loss of information): they may be axiomatized as strict weak orderings (partially ordered sets in which incomparability is a transitive relation), as total preorders (transitive binary relations in which at least one of the two possible relations exists between every pair of elements), or as ordered partitions ( partitions of the elements into disjoint subsets, together with a total order on the subsets). In many cases another representation called a preferential arrangement based on a utility function is also possible.

Weak orderings are counted by the ordered Bell numbers. They are used in computer science as part of partition refinement algorithms, and in the C++ Standard Library..

Examples

In horse racing, the use of photo finishes has eliminated some, but not all, ties or (as they are called in this context) dead heats, so the outcome of a horse race may be modeled by a weak ordering. In an example from the Maryland Hunt Cup steeplechase in 2007, The Bruce was the clear winner, but two horses Bug River and Lear Charm tied for second place, with the remaining horses farther back; three horses did not finish. In the weak ordering describing this outcome, The Bruce would be first, Bug River and Lear Charm would be ranked after The Bruce but before all the other horses that finished, and the three horses that did not finish would be placed last in the order but tied with each other.

The points of the Euclidean plane may be ordered by their distance from the origin, giving another example of a weak ordering with infinitely many elements, infinitely many subsets of tied elements (the sets of points that belong to a common circle centered at the origin), and infinitely many points within these subsets. Although this ordering has a smallest element (the origin itself), it does not have any second-smallest elements, nor any largest element.

Opinion polling in political elections provides an example of a type of ordering that resembles weak orderings, but is better modeled mathematically in other ways. In the results of a poll, one candidate may be clearly ahead of another, or the two candidates may be statistically tied, meaning not that their poll results are equal but rather that they are within the margin of error of each other. However, if candidate $x$ is statistically tied with $y,$ and $y$ is statistically tied with $z,$ it might still be possible for $x$ to be clearly better than $z,$ so being tied is not in this case a transitive relation. Because of this possibility, rankings of this type are better modeled as semiorders than as weak orderings.

Axiomatizations

Suppose throughout that $\,<\,$ is a homogeneous binary relation on a set $S$ (that is, $\,<\,$ is a subset of $S \times S$) and as usual, write $x < y$ and say that or if and only if $(x, y) \in \,<.\,$

Strict weak orderings

Preliminaries on incomparability and transitivity of incomparability

Two elements $x$ and $y$ of $S$ are said to be with respect to $\,<\,$ if neither $x < y \text y < x$ is true.
Incomparability with respect to $\,<\,$ is itself a homogeneous symmetric relation on $S$ that is reflexive if and only if $\,<\,$ is irreflexive (meaning that $x < x$ is always false), which may be assumed so that transitivity is the only property this "incomparability relation" needs in order to be an equivalence relation.
Define also an induced homogeneous relation $\,\lesssim\,$ on $S$ by declaring that
$x \lesssim y \text \quad \text \quad y < x \text$
where importantly, this definition is necessarily the same as: $x \lesssim y$ if and only if $x < y \text x = y.$
Two elements $x, y \in S$ are incomparable with respect to $\,<\,$ if and only if $x \text y$ are with respect to $\,\lesssim\,$ (or less verbosely, ), which by definition means that both $x \lesssim y \text y \lesssim x$ are true.
The relation "are incomparable with respect to $\,<$" is thus identical to (that is, equal to) the relation "are $\,\lesssim$-equivalent" (so in particular, the former is transitive if and only if the latter is).
When $\,<\,$ is irreflexive then the property known as " transitivity of incomparability" (defined below) is the condition necessary and sufficient to guarantee that the relation "are $\,\lesssim$-equivalent" does indeed form an equivalence relation on $S.$
When this is the case, it allows any two elements $x, y \in S$ satisfying $x \lesssim y \text y \lesssim x$ to be identified as a single object (specifically, they are identified together in their common equivalence class).

Definition

A strict weak ordering on a set $S$ is a strict partial order $\,<\,$ on $S$ for which the induced on $S$ by $\,<\,$ is a transitive relation.
Explicitly, a strict weak order on $S$ is a homogeneous relation $\,<\,$ on $S$ that has all four of the following properties:

1. : For all $x \in S,$ it is not true that $x < x.$
   * This condition holds if and only if the induced relation $\,\lesssim\,$ on $S$ is reflexive, where $\,\lesssim\,$ is defined by declaring that $x \lesssim y$ is true if and only if $y < x$ is .


2. : For all $x, y, z \in S,$ if $x < y \text y < z$ then $x < z.$


3. : For all $x, y \in S,$ if $x < y$ is true then $y < x$ is false.


4. : For all $x, y, z \in S,$ if $x$ is incomparable with $y$ (meaning that neither $x < y$ nor $y < x$ is true) and if $y$ is incomparable with $z,$ then $x$ is incomparable with $z.$
   * Two elements $x \text y$ are incomparable with respect to $\,<\,$ if and only if they are equivalent with respect to the induced relation $\,\lesssim\,$ (which by definition means that $x \lesssim y \text y \lesssim x$ are both true), where as before, $x \lesssim y$ is declared to be true if and only if $y < x$ is false. Thus this condition holds if and only if the symmetric relation on $S$ defined by "$x \text y$ are equivalent with respect to $\,\lesssim\,$" is a transitive relation, meaning that whenever $x \text y$ are $\,\lesssim$-equivalent and also $y \text z$ are $\,\lesssim$-equivalent then necessarily $x \text z$ are $\,\lesssim$-equivalent. This can also be restated as: whenever $x \lesssim y \text y \lesssim x$ and also $y \lesssim z \text z \lesssim y$ then necessarily $x \lesssim z \text z \lesssim x.$

Properties (1), (2), and (3) are the defining properties of a strict partial order, although there is some redundancy in this list as asymmetry (3) implies irreflexivity (1), and also because irreflexivity (1) and transitivity (2) together imply asymmetry (3). The incomparability relation is always symmetric and it will be reflexive if and only if $\,<\,$ is an irreflexive relation (which is assumed by the above definition).
Consequently, a strict partial order $\,<\,$ is a strict weak order if and only if its induced incomparability relation is an equivalence relation.
In this case, its equivalence classes partition $S$ and moreover, the set $\mathcal$ of these equivalence classes can be strictly totally ordered by a binary relation, also denoted by $\,<,$ that is defined for all $A, B \in \mathcal$ by:

:$A < B \text a < b$ for some (or equivalently, for all) representatives $a \in A \text b \in B.$

Conversely, any strict total order on a partition $\mathcal$ of $S$ gives rise to a strict weak ordering $\,<\,$ on $S$ defined by $a < b$ if and only if there exists sets $A, B \in \mathcal$ in this partition such that $a \in A, b \in B, \text A < B.$

Not every partial order obeys the transitive law for incomparability. For instance, consider the partial order in the set $\$ defined by the relationship $b < c.$ The pairs $a, b \text a, c$ are incomparable but $b$ and $c$ are related, so incomparability does not form an equivalence relation and this example is not a strict weak ordering.

Transitivity of incomparability (together with transitivity) can also be stated in the following forms:
* If $x < y$ then for all $z,$ either $x < z \text z < y$ or both.
Or:
* If $x$ is incomparable with $y$ then for all $z \neq x$ satisfying $z \neq y,$ either ($x < z \text y < z$) or ($z < x \text z < y$) or ($z$ is incomparable with $x$ and $z$ is incomparable with $y$).

Total preorders

Strict weak orders are very closely related to total preorders or (non-strict) weak orders, and the same mathematical concepts that can be modeled with strict weak orderings can be modeled equally well with total preorders. A total preorder or weak order is a preorder in which any two elements are comparable. A total preorder $\,\lesssim\,$ satisfies the following properties:

* : For all $x, y, \text z,$ if $x \lesssim y \text y \lesssim z$ then $x \lesssim z.$
* : For all $x \text y,$ $x \lesssim y \text y \lesssim x.$
** Which implies : for all $x,$ $x \lesssim x.$

A total order is a total preorder which is antisymmetric, in other words, which is also a partial order. Total preorders are sometimes also called preference relations.

The complement of a strict weak order is a total preorder, and vice versa, but it seems more natural to relate strict weak orders and total preorders in a way that preserves rather than reverses the order of the elements. Thus we take the converse of the complement: for a strict weak ordering $\,<,$ define a total preorder $\,\lesssim\,$ by setting $x \lesssim y$ whenever it is not the case that $y < x.$ In the other direction, to define a strict weak ordering < from a total preorder $\,\lesssim,$ set $x < y$ whenever it is not the case that $y \lesssim x.$

In any preorder there is a corresponding equivalence relation where two elements $x$ and $y$ are defined as equivalent if $x \lesssim y \text y \lesssim x.$ In the case of a preorder the corresponding partial order on the set of equivalence classes is a total order. Two elements are equivalent in a total preorder if and only if they are incomparable in the corresponding strict weak ordering.

Ordered partitions

A partition of a set $S$ is a family of non-empty disjoint subsets of $S$ that have $S$ as their union. A partition, together with a total order on the sets of the partition, gives a structure called by Richard P. Stanley an ordered partition and by Theodore Motzkin a list of sets. An ordered partition of a finite set may be written as a finite sequence of the sets in the partition: for instance, the three ordered partitions of the set $\$ are
$\, \,$
$\, \, \; \text$
$\.$

In a strict weak ordering, the equivalence classes of incomparability give a set partition, in which the sets inherit a total ordering from their elements, giving rise to an ordered partition. In the other direction, any ordered partition gives rise to a strict weak ordering in which two elements are incomparable when they belong to the same set in the partition, and otherwise inherit the order of the sets that contain them.

Representation by functions

For sets of sufficiently small cardinality, a third axiomatization is possible, based on real-valued functions. If $X$ is any set then a real-valued function $f : X \to \R$ on $X$ induces a strict weak order on $X$ by setting
$a < b \text f(a) < f(b).$
The associated total preorder is given by setting
$a \lesssim b \text f(a) \leq f(b)$
and the associated equivalence by setting
$a \sim b \text f(a) = f(b).$

The relations do not change when $f$ is replaced by $g \circ f$ ( composite function), where $g$ is a strictly increasing real-valued function defined on at least the range of $f.$ Thus for example, a utility function defines a preference relation. In this context, weak orderings are also known as preferential arrangements.

If $X$ is finite or countable, every weak order on $X$ can be represented by a function in this way.. However, there exist strict weak orders that have no corresponding real function. For example, there is no such function for the lexicographic order on $\R^n.$ Thus, while in most preference relation models the relation defines a utility function up to order-preserving transformations, there is no such function for lexicographic preferences.

More generally, if $X$ is a set, $Y$ is a set with a strict weak ordering $\,<,\,$ and $f : X \to Y$ is a function, then $f$ induces a strict weak ordering on $X$ by setting
$a < b \text f(a) < f(b).$
As before, the associated total preorder is given by setting
$a \lesssim b \text f(a) \lesssim f(b),$
and the associated equivalence by setting
$a \sim b \text f(a) \sim f(b).$
It is not assumed here that $f$ is an injective function, so a class of two equivalent elements on $Y$ may induce a larger class of equivalent elements on $X.$ Also, $f$ is not assumed to be a surjective function, so a class of equivalent elements on $Y$ may induce a smaller or empty class on $X.$ However, the function $f$ induces an injective function that maps the partition on $X$ to that on $Y.$ Thus, in the case of finite partitions, the number of classes in $X$ is less than or equal to the number of classes on $Y.$

Related types of ordering

Semiorders generalize strict weak orderings, but do not assume transitivity of incomparability. A strict weak order that is trichotomous is called a strict total order.. The total preorder which is the inverse of its complement is in this case a total order.

For a strict weak order $\,<\,$ another associated reflexive relation is its reflexive closure, a (non-strict) partial order $\,\leq.$ The two associated reflexive relations differ with regard to different $a$ and $b$ for which neither $a < b$ nor $b < a$: in the total preorder corresponding to a strict weak order we get $a \lesssim b$ and $b \lesssim a,$ while in the partial order given by the reflexive closure we get neither $a \leq b$ nor $b \leq a.$ For strict total orders these two associated reflexive relations are the same: the corresponding (non-strict) total order. The reflexive closure of a strict weak ordering is a type of series-parallel partial order.

All weak orders on a finite set

Combinatorial enumeration

The number of distinct weak orders (represented either as strict weak orders or as total preorders) on an $n$-element set is given by the following sequence :

These numbers are also called the Fubini numbers or ordered Bell numbers.

For example, for a set of three labeled items, there is one weak order in which all three items are tied. There are three ways of partitioning the items into one singleton set and one group of two tied items, and each of these partitions gives two weak orders (one in which the singleton is smaller than the group of two, and one in which this ordering is reversed), giving six weak orders of this type. And there is a single way of partitioning the set into three singletons, which can be totally ordered in six different ways. Thus, altogether, there are 13 different weak orders on three items.

Adjacency structure

Unlike for partial orders, the family of weak orderings on a given finite set is not in general connected by moves that add or remove a single order relation to or from a given ordering. For instance, for three elements, the ordering in which all three elements are tied differs by at least two pairs from any other weak ordering on the same set, in either the strict weak ordering or total preorder axiomatizations. However, a different kind of move is possible, in which the weak orderings on a set are more highly connected. Define a to be a weak ordering with two equivalence classes, and define a dichotomy to be with a given weak ordering if every two elements that are related in the ordering are either related in the same way or tied in the dichotomy. Alternatively, a dichotomy may be defined as a Dedekind cut for a weak ordering. Then a weak ordering may be characterized by its set of compatible dichotomies. For a finite set of labeled items, every pair of weak orderings may be connected to each other by a sequence of moves that add or remove one dichotomy at a time to or from this set of dichotomies. Moreover, the undirected graph that has the weak orderings as its vertices, and these moves as its edges, forms a partial cube.

Geometrically, the total orderings of a given finite set may be represented as the vertices of a permutohedron, and the dichotomies on this same set as the facets of the permutohedron. In this geometric representation, the weak orderings on the set correspond to the faces of all different dimensions of the permutohedron (including the permutohedron itself, but not the empty set, as a face). The codimension of a face gives the number of equivalence classes in the corresponding weak ordering. In this geometric representation the partial cube of moves on weak orderings is the graph describing the covering relation of the face lattice of the permutohedron.

For instance, for $n = 3,$ the permutohedron on three elements is just a regular hexagon. The face lattice of the hexagon (again, including the hexagon itself as a face, but not including the empty set) has thirteen elements: one hexagon, six edges, and six vertices, corresponding to the one completely tied weak ordering, six weak orderings with one tie, and six total orderings. The graph of moves on these 13 weak orderings is shown in the figure.

Applications

As mentioned above, weak orders have applications in utility theory. In linear programming and other types of combinatorial optimization problem, the prioritization of solutions or of bases is often given by a weak order, determined by a real-valued objective function; the phenomenon of ties in these orderings is called "degeneracy", and several types of tie-breaking rule have been used to refine this weak ordering into a total ordering in order to prevent problems caused by degeneracy.

Weak orders have also been used in computer science, in partition refinement based algorithms for lexicographic breadth-first search and lexicographic topological ordering. In these algorithms, a weak ordering on the vertices of a graph (represented as a family of sets that partition the vertices, together with a doubly linked list providing a total order on the sets) is gradually refined over the course of the algorithm, eventually producing a total ordering that is the output of the algorithm..

In the Standard Library for the C++ programming language, the set and multiset data types sort their input by a comparison function that is specified at the time of template instantiation, and that is assumed to implement a strict weak ordering.

See also

*
*
* − the equivalent subsets in the finest weak ordering consistent with a given relation

References

{{Order theory

Binary relations
Integer sequences
Order theory