Antisymmetric relation
From Wikipedia, the free encyclopedia
In mathematics, a binary relation R on a set X is antisymmetric if, for all a and b in X, if a is related to b and b is related to a, then a = b.
In mathematical notation, this is:
Inequalities are antisymmetric, since for numbers a and b, a ≤ b and b ≤ a if and only if a = b.
Note that 'antisymmetric' is not the logical negative of 'symmetric' (whereby aRb implies bRa). (N.B.: Both are properties of relations expressed as universal statements about their members; their logical negations must be existential statements.) Thus, there are relations which are both symmetric and antisymmetric (e.g., the equality relation) and there are relations which are neither symmetric nor antisymmetric (e.g., divisibility on the integers).
Antisymmetry is different from asymmetry. According to one definition of asymmetric, anything that fails to be symmetric is asymmetric; the definition of antisymmetry is more specific than this. Another definition of asymmetric makes asymmetry equivalent to antisymmetry plus irreflexivity.
[edit] Examples
- Equality
- "... is even, ... is odd"
[edit] Properties containing antisymmetry
- Partial order - An antisymmetric relation that is also transitive and reflexive.
- total order - An antisymmetric relation that is also transitive and total.
[edit] See also
- Symmetry in mathematics
- Symmetric relation
- antisymmetry in linguistics
