MHB Antisymmetry & Partial Orderings - H&J Ch.2 Section 5 | Peter's Help

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading "Introduction to Set Theory" (Third Edition, Revised and Expanded) by Karel Hrbacek and Thomas Jech (H&J) ... ...

I am currently focused on Chapter 2: Relations, Functions and Orderings; and, in particular on Section 5: Orderings

I need some help with H&J's depiction of antisymmetric relations and partial orderings ...The introduction to H&J's section on antisymmetric relations and partial orderings reads as follows:View attachment 7599In the above text from H&J we read the following:

" ... ... A binary relation $$R$$ in $$A$$ is antisymmetric if for all $$a, b \in A$$, $$aRb$$ and $$bRa$$ imply $$a = b$$ ... "Now since $$a = b$$ in the above instance $$aRb$$ and $$bRa$$ can be expressed as $$aRa$$ (or $$bRb$$ ...) ... so isn't antisymmetry essentially reflexivity ...

Can someone explain to me exactly what the essential difference between antisymmetry and reflexivity ... and, indeed why we don't define partial orderings simply as relations that are reflexive and transitive ... Help will be appreciated ...

Peter
 
Physics news on Phys.org
Peter said:
In the above text from H&J we read the following:

" ... ... A binary relation $$R$$ in $$A$$ is antisymmetric if for all $$a, b \in A$$, $$aRb$$ and $$bRa$$ imply $$a = b$$ ... "Now since $$a = b$$ in the above instance $$aRb$$ and $$bRa$$ can be expressed as $$aRa$$ (or $$bRb$$ ...) ... so isn't antisymmetry essentially reflexivity
I think you should think about this more rigorously. The definition of antisymmetry does not say $a=b$ (and for which $a$ and $b$?). If you think there is an equivalent, simpler statement of antisymmetry, try to write it precisely and then prove that it is equivalent to the original definition. Considering examples of relations that are and are not antisymmetric also helps.
 
Evgeny.Makarov said:
I think you should think about this more rigorously. The definition of antisymmetry does not say $a=b$ (and for which $a$ and $b$?). If you think there is an equivalent, simpler statement of antisymmetry, try to write it precisely and then prove that it is equivalent to the original definition. Considering examples of relations that are and are not antisymmetric also helps.
Hi Evgeny,

Yes I was being somewhat informal ...

I should have said ... since aRb and bRa imply a = b ... then we can essentially write aRa or bRb ... that is the condition aRb and bRa gives us reflexivity ... hmm ... yes ... see your point ... what exactly am i saying ...

Have to rethink my question ...

By the way ... can you think of a good example of an antisymmetric relation ...?

Peter
 
Last edited:
Peter said:
can you think of a good example of an antisymmetric relation ...?
Both non-strict and strict inequalities on numbers are antisymmetric, as are the divisibility relation on integers and the empty relation. Another one is $$\begin{cases}x<y,&x\ge0,y\ge0\\x\le y,&\text{otherwise}\end{cases}$$ on real numbers.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top