Asymmetric relation

In mathematics, an asymmetric relation is a binary relation ${\displaystyle R}${\displaystyle R} on a set ${\displaystyle X}${\displaystyle X} where for all ${\displaystyle a,b\in X,}${\displaystyle a,b\in X,} if ${\displaystyle a}${\displaystyle a} is related to ${\displaystyle b}${\displaystyle b} then ${\displaystyle b}${\displaystyle b} is not related to ${\displaystyle a.}${\displaystyle a.}^[1]

A binary relation on ${\displaystyle X}${\displaystyle X} is any subset ${\displaystyle R}${\displaystyle R} of ${\displaystyle X\times X.}${\displaystyle X\times X.} Given ${\displaystyle a,b\in X,}${\displaystyle a,b\in X,} write ${\displaystyle aRb}${\displaystyle aRb} if and only if ${\displaystyle (a,b)\in R,}${\displaystyle (a,b)\in R,} which means that ${\displaystyle aRb}${\displaystyle aRb} is shorthand for ${\displaystyle (a,b)\in R.}${\displaystyle (a,b)\in R.} The expression ${\displaystyle aRb}${\displaystyle aRb} is read as "${\displaystyle a}${\displaystyle a} is related to ${\displaystyle b}${\displaystyle b} by ${\displaystyle R.}${\displaystyle R.}"

The binary relation ${\displaystyle R}${\displaystyle R} is called asymmetric if for all ${\displaystyle a,b\in X,}${\displaystyle a,b\in X,} if ${\displaystyle aRb}${\displaystyle aRb} is true then ${\displaystyle bRa}${\displaystyle bRa} is false; that is, if ${\displaystyle (a,b)\in R}${\displaystyle (a,b)\in R} then ${\displaystyle (b,a)\not \in R.}${\displaystyle (b,a)\not \in R.} This can be written in the notation of first-order logic as $${\displaystyle \forall a,b\in X:aRb\implies \lnot (bRa).}$${\displaystyle \forall a,b\in X:aRb\implies \lnot (bRa).} A logically equivalent definition is:

for all ${\displaystyle a,b\in X,}${\displaystyle a,b\in X,} at least one of ${\displaystyle aRb}${\displaystyle aRb} and ${\displaystyle bRa}${\displaystyle bRa} is false,

which in first-order logic can be written as: $${\displaystyle \forall a,b\in X:\lnot (aRb\wedge bRa).}$${\displaystyle \forall a,b\in X:\lnot (aRb\wedge bRa).} A relation is asymmetric if and only if it is both antisymmetric and irreflexive,^[2] so this may also be taken as a definition.

An example of an asymmetric relation is the "less than" relation ${\displaystyle ,円<,円}${\displaystyle ,円<,円} between real numbers: if ${\displaystyle x<y}${\displaystyle x<y} then necessarily ${\displaystyle y}${\displaystyle y} is not less than ${\displaystyle x.}${\displaystyle x.} More generally, any strict partial order is an asymmetric relation. Not all asymmetric relations are strict partial orders. An example of an asymmetric non-transitive, even antitransitive relation is the rock paper scissors relation: if ${\displaystyle X}${\displaystyle X} beats ${\displaystyle Y,}${\displaystyle Y,} then ${\displaystyle Y}${\displaystyle Y} does not beat ${\displaystyle X;}${\displaystyle X;} and if ${\displaystyle X}${\displaystyle X} beats ${\displaystyle Y}${\displaystyle Y} and ${\displaystyle Y}${\displaystyle Y} beats ${\displaystyle Z,}${\displaystyle Z,} then ${\displaystyle X}${\displaystyle X} does not beat ${\displaystyle Z.}${\displaystyle Z.}

Restrictions and converses of asymmetric relations are also asymmetric. For example, the restriction of ${\displaystyle ,円<,円}${\displaystyle ,円<,円} from the reals to the integers is still asymmetric, and the converse or dual ${\displaystyle ,円>,円}${\displaystyle ,円>,円} of ${\displaystyle ,円<,円}${\displaystyle ,円<,円} is also asymmetric.

An asymmetric relation need not have the connex property. For example, the strict subset relation ${\displaystyle ,円\subsetneq ,円}${\displaystyle ,円\subsetneq ,円} is asymmetric, and neither of the sets ${\displaystyle \{1,2\}}${\displaystyle \{1,2\}} and ${\displaystyle \{3,4\}}${\displaystyle \{3,4\}} is a strict subset of the other. A relation is connex if and only if its complement is asymmetric.

A non-example is the "less than or equal" relation ${\displaystyle \leq }${\displaystyle \leq }. This is not asymmetric, because reversing for example, ${\displaystyle x\leq x}${\displaystyle x\leq x} produces ${\displaystyle x\leq x}${\displaystyle x\leq x} and both are true. The less-than-or-equal relation is an example of a relation that is neither symmetric nor asymmetric, showing that asymmetry is not the same thing as "not symmetric".

The empty relation is the only relation that is (vacuously) both symmetric and asymmetric.

The following conditions are sufficient for a relation ${\displaystyle R}${\displaystyle R} to be asymmetric:^[3]

• ${\displaystyle R}${\displaystyle R} is irreflexive and anti-symmetric (this is also necessary)
• ${\displaystyle R}${\displaystyle R} is irreflexive and transitive. A transitive relation is asymmetric if and only if it is irreflexive:^[4] if ${\displaystyle aRb}${\displaystyle aRb} and ${\displaystyle bRa,}${\displaystyle bRa,} transitivity gives ${\displaystyle aRa,}${\displaystyle aRa,} contradicting irreflexivity. Such a relation is a strict partial order.
• ${\displaystyle R}${\displaystyle R} is irreflexive and satisfies semiorder property 1 (there do not exist two mutually incomparable two-point linear orders)
• ${\displaystyle R}${\displaystyle R} is anti-transitive and anti-symmetric
• ${\displaystyle R}${\displaystyle R} is anti-transitive and transitive
• ${\displaystyle R}${\displaystyle R} is anti-transitive and satisfies semi-order property 1

• Tarski's axiomatization of the reals – part of this is the requirement that ${\displaystyle ,円<,円}${\displaystyle ,円<,円} over the real numbers be asymmetric.

• Properties of binary relations
• Asymmetry

• Articles with short description
• Short description is different from Wikidata