Lably
Skip to content

Antisymmetric relation

Type of binary relation

  • 2 min read
  • 2 chapters

Related on Lably

Through Mathematics, Divisor and Natural number

if aRb with a≠b then bRa must not hold,

or equivalently,

if aRb and bRa then a=b.

The definition of antisymmetry says nothing about whether aRa actually holds or not for any a. An antisymmetric relation R on a set X may be reflexive (that is, aRa for all a∈X), irreflexive (that is, aRa for no a∈X), or neither reflexive nor irreflexive. A relation is asymmetric if and only if it is both antisymmetric and irreflexive.

Examples

The divisibility relation on the natural numbers is an important example of an antisymmetric relation. In this context, antisymmetry means that the only way each of two numbers can be divisible by the other is if the two are, in fact, the same number; equivalently, if n and m are distinct and n is a factor of m, then m cannot be a factor of n. For example, 12 is divisible by 4, but 4 is not divisible by 12.

The usual order relation ≤ on the real numbers is antisymmetric: if for two real numbers x and y both inequalities x≤y and y≤x hold, then x and y must be equal. Similarly, the subset order ⊆ on the subsets of any given set is antisymmetric: given two sets A and B, if every element in A also is in B and every element in B is also in A, then A and B must contain all the same elements and therefore be equal:

A⊆B and B⊆A implies A=B.

A real-life example of a relation that is typically antisymmetric is "paid the restaurant bill of" (understood as restricted to a given occasion). Typically, some people pay their own bills, while others pay for their spouses or friends. As long as no two people pay each other's bills, the relation is antisymmetric.

Sign in to keep reading

One more chapter is free with a Lably account.

More in Discrete mathematics