---
title: Comparability
slug: comparability
qid: 
snapshot: enwiki-001360404613
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1360404613
tags: [107142567, 20351862, 22902718, 23118434, 23603337, 24043274, 26863021, 29264832, 81199107]
---

# Comparability

> [!note] Provenance
> Snapshot `enwiki-001360404613` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1360404613> · Licensed CC BY-SA 4.0

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==
