Symmetric Relations
You'll learn: How to define and verify whether a relation treats both directions of a pairing equally.
What Is Symmetry in Relations?
A relation ( R ) on a set ( A ) is symmetric if whenever an element ( a ) is related to an element ( b ), then ( b ) must also be related to ( a ). In notation: if ((a, b) \in R), then ((b, a) \in R).
Think of symmetry as a two-way street. If you can travel from ( a ) to ( b ), you can also travel back from ( b ) to ( a ).
Testing for Symmetry
To verify whether a relation is symmetric, check every ordered pair in the relation:
- Pick any pair ((a, b)) in ( R )
- Check whether ((b, a)) is also in ( R )
- If all pairs satisfy this property, the relation is symmetric
- If even one pair fails, the relation is not symmetric
Examples
Example 1: Let ( A = {1, 2, 3} ) and ( R = {(1, 2), (2, 1), (3, 3)} ).
- ((1, 2) \in R) and ((2, 1) \in R) ✓
- ((3, 3) \in R) and ((3, 3) \in R) ✓
- Symmetric!
Example 2: Let ( R = {(1, 2), (2, 3)} ).
- ((1, 2) \in R) but ((2, 1) \notin R) ✗
- Not symmetric
Visual Check: Digraphs
In a directed graph (digraph) representation, a symmetric relation has either:
- A two-way arrow between distinct vertices, or
- A self-loop at a single vertex
Key Takeaway: A relation is symmetric if every directed edge has a matching reverse edge—symmetry means mutual relationships.