Transitive binary relations vte
SymmetricAntisymmetricConnectedWell-foundedHas joinsHas meetsReflexiveIrreflexiveAsymmetricTotal, SemiconnexAnti- reflexiveEquivalence relationY✗✗✗✗✗Y✗✗Preorder (Quasiorder)✗✗✗✗✗✗Y✗✗Partial order✗Y✗✗✗✗Y✗✗Total preorder✗✗Y✗✗✗Y✗✗Total order✗YY✗✗✗Y✗✗Prewellordering✗✗YY✗✗Y✗✗Well-quasi-ordering✗✗✗Y✗✗Y✗✗Well-ordering✗YYY✗✗Y✗✗Lattice✗Y✗✗YYY✗✗Join-semilattice✗Y✗✗Y✗Y✗✗Meet-semilattice✗Y✗✗✗YY✗✗Strict partial order✗Y✗✗✗✗✗YYStrict weak order✗Y✗✗✗✗✗YYStrict total order✗YY✗✗✗✗YYSymmetricAntisymmetricConnectedWell-foundedHas joinsHas meetsReflexiveIrreflexiveAsymmetricDefinitions, for all a , b {\displaystyle a,b} and S ≠ ∅ : {\displaystyle S\neq \varnothing :}a R b ⇒ b R a {\displaystyle {\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}}a R b and b R a ⇒ a = b {\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}}a ≠ b ⇒ a R b or b R a {\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}}min S exists {\displaystyle {\begin{aligned}\min S\\{\text{exists}}\end{aligned}}}a ∨ b exists {\displaystyle {\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}}a ∧ b exists {\displaystyle {\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}}a R a {\displaystyle aRa}not a R a {\displaystyle {\text{not }}aRa}a R b ⇒ not b R a {\displaystyle {\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}}
SymmetricAntisymmetricConnectedWell-foundedHas joinsHas meetsReflexiveIrreflexiveAsymmetric
Total, SemiconnexAnti- reflexive
Equivalence relationY✗✗✗✗✗Y✗✗
Preorder (Quasiorder)✗✗✗✗✗✗Y✗✗
Partial order✗Y✗✗✗✗Y✗✗
Total preorder✗✗Y✗✗✗Y✗✗
Total order✗YY✗✗✗Y✗✗
Prewellordering✗✗YY✗✗Y✗✗
Well-quasi-ordering✗✗✗Y✗✗Y✗✗
Well-ordering✗YYY✗✗Y✗✗
Lattice✗Y✗✗YYY✗✗
Join-semilattice✗Y✗✗Y✗Y✗✗
Meet-semilattice✗Y✗✗✗YY✗✗
Strict partial order✗Y✗✗✗✗✗YY
Strict weak order✗Y✗✗✗✗✗YY
Strict total order✗YY✗✗✗✗YY
SymmetricAntisymmetricConnectedWell-foundedHas joinsHas meetsReflexiveIrreflexiveAsymmetric
Definitions, for all a , b {\displaystyle a,b} and S ≠ ∅ : {\displaystyle S\neq \varnothing :}a R b ⇒ b R a {\displaystyle {\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}}a R b and b R a ⇒ a = b {\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}}a ≠ b ⇒ a R b or b R a {\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}}min S exists {\displaystyle {\begin{aligned}\min S\\{\text{exists}}\end{aligned}}}a ∨ b exists {\displaystyle {\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}}a ∧ b exists {\displaystyle {\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}}a R a {\displaystyle aRa}not a R a {\displaystyle {\text{not }}aRa}a R b ⇒ not b R a {\displaystyle {\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}}
Y indicates that the column's property is always true for the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by Y in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively. All definitions tacitly require the homogeneous relation R {\displaystyle R} be transitive: for all a , b , c , {\displaystyle a,b,c,} if a R b {\displaystyle aRb} and b R c {\displaystyle bRc} then a R c . {\displaystyle aRc.} A term's definition may require additional properties that are not listed in this table.

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

Formal definition

Preliminaries

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

Definition

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

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

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

Examples

An example of an asymmetric relation is the "less than" relation < {\displaystyle \,<\,} between real numbers: if x < y {\displaystyle x<y} then necessarily y {\displaystyle y} is not less than 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 X {\displaystyle X} beats Y , {\displaystyle Y,} then Y {\displaystyle Y} does not beat X ; {\displaystyle X;} and if X {\displaystyle X} beats Y {\displaystyle Y} and Y {\displaystyle Y} beats Z , {\displaystyle Z,} then X {\displaystyle X} does not beat Z . {\displaystyle Z.}

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

An asymmetric relation need not have the connex property. For example, the strict subset relation ⊊ {\displaystyle \,\subsetneq \,} is asymmetric, and neither of the sets { 1 , 2 } {\displaystyle \{1,2\}} and { 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 }. This is not asymmetric, because reversing for example, x ≤ x {\displaystyle x\leq x} produces x ≤ 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.

Properties

The following conditions are sufficient for a relation R {\displaystyle R} to be asymmetric:

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

See also