Show that the relation R\mathrm{R} in the set {1,2,3}\{1{,}2{,}3\} given by R={(1,1),(2,2)\mathrm{R}=\{(1{,}1),(2{,}2), (3,3),(1,2),(2,3)}(3{,}3),(1{,}2),(2{,}3)\} is reflexive but neither symmetric nor transitive.

Answer: The relation RR is reflexive but neither symmetric nor transitive.

Step-by-step solution

Step 1: Check for Reflexivity

A relation RR on a set AA is reflexive if every element in AA is related to itself. This means that for every element aa in the set AA, the ordered pair (a,a)(a,a) must be present in the relation RR. The given set is A={1,2,3}A = \{1{,}2{,}3\}. We need to check if (1,1)(1{,}1), (2,2)(2{,}2), and (3,3)(3{,}3) are in RR.

Step 2: Check for Symmetry

A relation RR is symmetric if, whenever an element aa is related to an element bb, then bb is also related to aa. In other words, if (a,b)(a,b) is in RR, then (b,a)(b,a) must also be in RR. We will check the pairs in RR to see if their reverse pairs are also present.

Step 3: Check for Transitivity

A relation RR is transitive if, whenever aa is related to bb and bb is related to cc, then aa is also related to cc. This means if (a,b)(a,b) and (b,c)(b,c) are in RR, then (a,c)(a,c) must also be in RR. We will examine the pairs in RR to verify this condition.

More from this chapter

All Relations and Functions solutions →

Solve your own maths question free →