Example 1
Question: Let R be the relation in the set \(\{1, 2, 3, 4, 5\}\) given by \[R = \{(1,1),(2,2),(3,3),(4,4),(5,5),(1,3),(3,1),(2,4),(4,2)\}\] Choose the correct answer. (A) R is reflexive and symmetric but not transitive. (B) R is reflexive and transitive but not symmetric. (C) R is symmetric and transitive but not reflexive. (D) R is an equivalence relation.
Solution: We check each property of R on the set \(A = \{1, 2, 3, 4, 5\}\). Reflexivity: We need \((a, a) \in R\) for every \(a \in A\). The pairs \((1,1), (2,2), (3,3), (4,4), (5,5)\) are all in R. So R is reflexive. Symmetry: We check every ordered pair: \((1,3) \in R\) and \((3,1) \in R\) — symmetric pair present. \((2,4) \in R\) and \((4,2) \in R\) — symmetric pair present. All other pairs are of the form \((a,a)\), which are trivially symmetric. So R is symmetric. Transitivity: We check all combinations where \((a,b) \in R\) and \((b,c) \in R\). Take \((1,3) \in R\) and \((3,1) \in R\): we need \((1,1) \in R\). Yes, it is. Take \((3,1) \in R\) and \((1,3) \in R\): we need \((3,3) \in R\). Yes, it is. Take \((2,4) \in R\) and \((4,2) \in R\): we need \((2,2) \in R\). Yes, it is. Take \((4,2) \in R\) and \((2,4) \in R\): we need \((4,4) \in R\). Yes, it is. Take \((1,3) \in R\) and \((3,3) \in R\): we need \((1,3) \in R\). Yes, it is. No transitivity violation is found. So R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation.
Answer: (D) R is an equivalence relation.
Example 2
Question: Let R be the relation in the set \(\{1, 2, 3, 4\}\) given by \[R = \{(1,1),(2,2),(3,3),(4,4),(1,2),(2,3),(1,3)\}\] Choose the correct answer. (A) R is reflexive and symmetric but not transitive. (B) R is reflexive and transitive but not symmetric. (C) R is symmetric and transitive but not reflexive. (D) R is an equivalence relation.
Solution: We check each property of R on the set \(A = \{1, 2, 3, 4\}\). Reflexivity: We need \((a, a) \in R\) for every \(a \in A\). The pairs \((1,1),(2,2),(3,3),(4,4)\) are all present in R. So R is reflexive. Symmetry: Check if for every \((a,b) \in R\), the pair \((b,a)\) is also in R. \((1,2) \in R\): Is \((2,1) \in R\)? Looking at the set — \((2,1)\) is NOT in R. So R is not symmetric. Transitivity: Check all combinations where \((a,b) \in R\) and \((b,c) \in R\). \((1,2) \in R\) and \((2,3) \in R\): Is \((1,3) \in R\)? Yes, it is. \((1,2) \in R\) and \((2,2) \in R\): Is \((1,2) \in R\)? Yes, it is. \((2,3) \in R\) and \((3,3) \in R\): Is \((2,3) \in R\)? Yes, it is. \((1,3) \in R\) and \((3,3) \in R\): Is \((1,3) \in R\)? Yes, it is. No transitivity violation is found. So R is transitive. Conclusion: R is reflexive and transitive but not symmetric.
Answer: (B) R is reflexive and transitive but not symmetric.