User:Paul August/Subpage 18
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:
For example, "is married to" is a symmetric relation, while "is less than" is not.
A symmetric relation that is also transitive and reflexive is an equivalence relation.
[edit] Examples
- Realtions which are symmetric:
- Relations which are not symmetric:
- [[
[edit] Relationship to antisymmetry
Symmetry is not the opposite of antisymmetry (aRb and bRa implies b = a). There are relations which are both symmetric and antisymmetric (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 antisymmetric ("is less than or equal to").
See also Symmetry in mathematics.
