# GetWiki

*Comparability*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

Comparability

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

*x*â‰¤

*y*if

*x*dividesdividesIn mathematics, any two elements

*x*and

*y*of a set

*P*that is partially ordered by a binary relation â‰¤ are

**comparable**when either

*x*â‰¤

*y*or

*y*â‰¤

*x*. If it is not the case that

*x*and

*y*are comparable, then they are called

**incomparable**.A totally ordered set is exactly a partially ordered set in which every pair of elements is comparable.It follows immediately from the definitions of

*comparability*and

*incomparability*that both relations are symmetric, that is

*x*is comparable to

*y*if and only if

*y*is comparable to

*x*, and likewise for incomparability.

## Notation

Comparability is denoted by the symbol overset{}{=}}, and incomparability by the symbol cancel{overset{}{=}}}.{{citation|title=Combinatorics and Partially Ordered Sets:Dimension Theory|first=William T.|last=Trotter|publisher=Johns Hopkins Univ. Press|year=1992|pages=3}}Thus, for any pair of elements*x*and

*y*of a partially ordered set, exactly one of

- x overset{}{=}}y and
- x cancel{overset{}{=}}}y

## Comparability graphs

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 xoverset{}{=}}y .{{citation|title=A characterization of comparability graphs and of interval graphs|first1=P. C.|last1=Gilmore|first2=A. J.|last2=Hoffman|author2-link=Alan Hoffman (mathematician)|url=http://www.cms.math.ca/cjm/v16/p539|journal=Canadian Journal of Mathematics|volume=16|year=1964|pages=539â€“548|doi=10.4153/CJM-1964-055-5}}.

## Classification

When classifying mathematical objects (e.g., topological spaces), two*criteria*are said to be comparable when the objects that obey one criterion constitute a subset of the objects that obey the other, which is to say when they are comparable under the partial order âŠ‚. For example, the T1 and T2 criteria are comparable, while the T1 and sobriety criteria are not.

## See also

- Strict weak ordering, a partial ordering in which incomparability is a transitive relation

## References

WEB,weblink PlanetMath: partial order, 6 April 2010, {{reflist}}**- content above as imported from Wikipedia**

- "

- time: 12:48pm EDT - Mon, Jun 17 2019

- "

__Comparability__" does not exist on GetWiki (yet)- time: 12:48pm EDT - Mon, Jun 17 2019

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

GETWIKI 18 AUG 2014

© 2019 M.R.M. PARROTT | ALL RIGHTS RESERVED