Talk:Comparability

This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics High‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics High This article has been rated as High-priority on the project's priority scale.

I have restricted the definition to partial orders. In the previous version there was inconsistency about the question whether an element is comparable to itself. According to [1] it is. Can the definition be extended? In a preorder, are p and q with pRq and qRp called comparable?--Patrick 13:45, 15 May 2007 (UTC)Reply

Since a partial order P is, a fortiori, a relation (mathematics), elements x and y are comparable with respect to P if and only if ${\displaystyle \{(x,y),(y,x)\}\cap P}$ is nonempty. And the difference between non-strict and strict versions of a partial order is precisely that one is the reflexive closure (resp. reflexive reduction) of the other. So any element x is comparable to itself with respect to P if and only if P is reflexive (non-strict).—PaulTanenbaum 01:20, 6 July 2007 (UTC)Reply

1. Comparability is that which recurs. Human thorugh comparison recognize them as the similarity among the objects which are compared. —Preceding unsigned comment added by 210.212.249.50 (talk) 06:07, 24 December 2010 (UTC)Reply

Is there a somewhat authoritative source or tradition for the notation ${\displaystyle \perp }$ and ${\displaystyle \parallel }$ for comparable and incomparable? It would be good to have a reference or else to say that the notation is not standard. It seems that almost always people just use the words and do not introduce symbols for the two concepts. Bjbraams (talk) 21:11, 7 January 2012 (UTC)Reply

In fact, the notation ${\displaystyle \parallel }$ for incomparable seems well established; I find it used by both Blyth and Roman in their textbooks on lattices and order, and also by Graetzer. Birkhoff just uses the word. For comparable I find that Blyth uses ${\displaystyle \not \parallel }$ while Roman and Graetzer only use the word. Bjbraams (talk) 22:27, 7 January 2012 (UTC)Reply

Prev version labeled ⊥ as "perpendicular" and || as "parallel." I don't see that those labels provided any clarity or aided anyone's understanding, but I do imagine that they might have confused novice readers. That's why I undid the addition of those labels. If somebody thinks that there's a good reason to restore the labels, please let us know here what that reason is.—PaulTanenbaum (talk) 23:59, 12 September 2013 (UTC)Reply