Show that the relation in the set given by is symmetric but neither reflexive nor transitive.
Exercise 1.1 · Question 6 of 16
Show that the relation R in the set 1, 2, 3 given by R = (1, 2), (2, 1) is symmetric but neither reflexive nor…
Let and . Here is given directly as a list of two pairs, so every property can be checked by inspection.
Symmetric
Symmetry asks: for each pair in , is the reversed pair also in ?
- and its reverse . Good.
- and its reverse . Good.
Both of the two pairs pass, so is symmetric.
Not reflexive
Reflexivity needs for every , i.e. all three of , , must be in .
But contains only and , so
Therefore is not reflexive. (Note also that appears in no pair of at all.)
Not transitive
Transitivity asks: whenever and , is ?
Here two pairs do link up, with middle element :
so transitivity demands . But .
Therefore is not transitive. (The other link, followed by , demands , which also fails.)
Conclusion. is symmetric but neither reflexive nor transitive.
This is a useful example to remember: a symmetric relation with no self-loops can never be transitive as soon as it holds even one pair, because and immediately demand .

