Comparability
In mathematics, two elements x and y of a set P are said to be comparable with respect to a binary relation ≤ if at least one of x ≤ y or y ≤ x is true. They are called incomparable if they are not comparable.
Rigorous definition
A binary relation on a set is by definition any subset of Given is written if and only if in which case is said to be ' to byAn element is said to be ', or ', to an element if or
Often, a symbol indicating comparison, such as is used instead of in which case is written in place of which is why the term "comparable" is used.
Comparability with respect to induces a canonical binary relation on ; specifically, the ' induced by is defined to be the set of all pairs such that is comparable to ; that is, such that at least one of and is true.
Similarly, the on induced by is defined to be the set of all pairs such that is incomparable to that is, such that neither nor is true.
If the symbol is used in place of then comparability with respect to is sometimes denoted by the symbol, and incomparability by the symbol.
Thus, for any two elements and of a partially ordered set, exactly one of and is true.