Lably
Skip to content

Asymmetric relation

Binary relation which never occurs in both directions

  • 2 min read
  • 3 chapters

Related on Lably

Through Mathematics, Inequality (mathematics) and Real number

Formal definition

Preliminaries

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

Definition

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

for all a,b∈X, at least one of aRb and bRa is false,

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

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Discrete mathematics