Symmetric relation
From Wikipedia, the free encyclopedia
In mathematics, a binary relation R over a set X is symmetric if it holds for all a and b in X that if a is related to b then b is related to a.
In mathematical notation, this is:
Note: symmetry is not the exact opposite of antisymmetry (aRb and bRa implies b = a). There are relations which are both symmetric and antisymmetric (for example, equality), there are relations which are neither symmetric nor antisymmetric (divisibility), there are relations which are symmetric and not antisymmetric (congruence modulo n), and there are relations which are not symmetric but are anti-symmetric ("is less than or equal to"). Also, the empty relation is, vacuously, both symmetric and asymmetric.
[edit] Properties containing the symmetric relation
equivalence relation - A symmetric relation that is also transitive and reflexive.
[edit] Examples
- "is married to" is a symmetric relation, while "is less than" is not.
- "is equal to" (equality)
- "... is odd and ... is odd too":
