Comparability

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

of the natural numbers, partially ordered by "x≤y if x divides y". The numbers 4 and 6 are incomparable, since neither divides the other. 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.

of the natural numbers, partially ordered by "x≤y if x divides y". The numbers 4 and 6 are incomparable, since neither divides the other.]] 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. If the symbol is used in place of \leq then comparability with respect to is sometimes denoted by the symbol \overset{ }{=}} , and incomparability by the symbol \cancel{\overset{ }{=}}}\! . Thus, for any two elements x and y of a partially ordered set, exactly one of x\ \overset{ }{=}}\ y and x \cancel{\overset{ }{=}}}y is true. The comparability graph of a partially ordered set P has as vertices the elements of P and has as edges precisely those pairs \{ x, y \} of elements for which x\ \overset{ }{=}}\ y .

References

External links

Text derived from https://en.wikipedia.org/w/index.php?oldid=1360404613 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.