Difference between unsymmetric and anti-symmetric relations?

Question

I am finding difficulty in understanding the difference between asymmetric (non-symmetric) and anti-symmetric relations. Though I didn't quite find any mention of the word asymmetric in the reference book, our teacher had mentioned it while explaining the concepts.

So my question, are non-symmetric and anti-symmetric relations, both the same thing or different? It would be appreciated if someone could explain using a couple of examples. (I did not understand the definition, so I did not approach the sums, hence this is a general question.)

Answer 1

A symmetric relation is one where the order can be flipped. Equality is symmetric because if $x=y,$ then $y=x$ also. Weak inequality $\leq$ is also symmetric. Strict inequality $<$ is not symmetric.

An antisymmetric relation is one where distinct elements cannot be reversed. Weak inequality is antisymmetric.

An asymmetric relation is one where the equation never holds. Asymmetric means antisymmetric and irreflexive. Strict inequality is asymmetric.

Answer 2

Denote $R$ the relation.

Non-symmetric is just $\:\lnot(aRb\implies bRa)$, whereas anti-symmetric is $(aRb)\wedge(bRa)\implies a=b$.

Answer 3

The definitions are as follows:

• A relation $R$ on a set $X$ is symmetric if for all $a, b \in X$, $aRb$ implies $bRa$.
• A relation $R$ on a set $X$ is non-symmetric if it is not symmetric; i.e. there exist $a, b \in X$ such that $aRb$ does not imply $bRa$.
• A relation $R$ on a set $X$ is called antisymmetric if for all $a, b \in X$, $aRb$ and $bRa$ implies $a = b$.

One can see that non-symmetric and antisymmetric relations are quite different through easy examples. One stock of examples for antisymmetric relations is given by directed graphs; take $X = \{1,2,3,4\}$ to be the set of vertices of graph and define the relation $R_1$ on $X$ as follows: $$a R_1 b \iff \text{there is a directed edge from } a \text{ to }b.$$ A concrete example witnessing non-symmetricity for $R_1$ would be the following graph: $$\require{AMScd}\begin{CD} 1 @>>> 2\\ @VVV @VVV\\ 3 @>>> 4 \end{CD}$$ Then $R_1$ is non-symmetric, since $2 \to 4$ (i.e. $2R_14$) but $4 \not\to 2$ (i.e. it is not the case that $4 R_1 2$).

Finally, for antisymmetric relations you can take any partial order on a set, such that the standard $\leq$ relation on the integers or the reals, say.