This article needs additional citations for verification. (July 2021)
|Transitive binary relations|
| indicates that the column's property is always true the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively. |
A symmetric relation is a type of binary relation. An example is the relation "is equal to", because if a = b is true then b = a is also true. Formally, a binary relation R over a set X is symmetric if:
where the notation aRb means that (a, b) ∈ R.
- "is equal to" (equality) (whereas "is less than" is not symmetric)
- "is comparable to", for elements of a partially ordered set
- "... and ... are odd":
- "is married to" (in most legal systems)
- "is a fully biological sibling of"
- "is a homophone of"
- "is co-worker of"
- "is teammate of"
Relationship to asymmetric and antisymmetric relations
By definition, a nonempty relation cannot be both symmetric and asymmetric (where if a is related to b, then b cannot be related to a (in the same way)). However, a relation can be neither symmetric nor asymmetric, which is the case for "is less than or equal to" and "preys on").
Symmetric and antisymmetric (where the only way a can be related to b and b be related to a is if a = b) are actually independent of each other, as these examples show.
|Antisymmetric||equality||divides, less than or equal to|
|Not antisymmetric||congruence in modular arithmetic||// (integer division), most nontrivial permutations|
|Antisymmetric||is the same person as, and is married||is the plural of|
|Not antisymmetric||is a full biological sibling of||preys on|
- A symmetric and transitive relation is always quasireflexive.[a]
- A symmetric, transitive, and reflexive relation is called an equivalence relation.
- One way to count the symmetric relations on n elements, that in their binary matrix representation the upper right triangle determines the relation fully, and it can be arbitrary given, thus there are as many symmetric relations as n × n binary upper triangle matrices, 2n(n+1)/2.
|Elements||Any||Transitive||Reflexive||Symmetric||Preorder||Partial order||Total preorder||Total order||Equivalence relation|
k=0 k!S(n, k)
k=0 S(n, k)
Note that S(n, k) refers to Stirling numbers of the second kind.
- If xRy, the yRx by symmetry, hence xRx by transitivity. The proof of xRy ⇒ yRy is similar.