Antisymmetric relation

In mathematics, a binary relation R on a set X is antisymmetric if there is no pair of distinct elements of X each of which is related by R to the other. More formally, R is antisymmetric precisely if for all a and b in X if R(a, b) with a ≠ b, then R(b, a) must not hold, or, equivalently, if R(a, b) and R(b, a), then a = b. (The definition of antisymmetry says nothing about whether R(a, a) actually holds or not for any a.) 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 ∧ B ⊆ A ⇒ A = B {\displaystyle A\subseteq B\land B\subseteq A\Rightarrow A=B} Partial and total orders are antisymmetric by definition. A relation can be both symmetric and antisymmetric (e.g., the equality relation), and there are relations which are neither symmetric nor antisymmetric (e.g., the "preys on" relation on biological species). Antisymmetry is different from asymmetry, which requires both antisymmetry and irreflexivity. Thus, every asymmetric relation is antisymmetric, but the reverse is false.


This table shows the example usage of word lists for keywords extraction from the text above.

WordWord FrequencyNumber of ArticlesRelevance

This website uses cookies to ensure you get the best experience on our website. Learn more. Got it.