Let and be the relation defined by . The correct statement is :
First, we need to check if the relation is a function. A relation from set to set is a function if every element in the domain is mapped to exactly one element in the codomain . Here, and .
Examine each element of :
For element 1, the pair maps it to 1, so .
For element 2, the pair maps it to 3, so .
For element 3, the pair maps it to 4, so .
For element 4, the pair maps it to 2, so .
Since every element in has exactly one image in , is a function. Therefore, option D, which states "R is not a function," is incorrect.
Next, we check if is one-to-one (injective). A function is one-to-one if different inputs produce different outputs, meaning if , then .
List the outputs:
, , , .
The outputs are 1, 3, 4, and 2, all distinct. Since no two different inputs share the same output, is one-to-one. Therefore, option B, which states "R is not a one to one function," is incorrect.
Now, check if is onto (surjective). A function is onto if every element in the codomain is mapped to by some element in the domain. The codomain is .
Check each element:
Is 1 mapped to? Yes, because , so 1 is the image of 1.
Is 2 mapped to? Yes, because , so 2 is the image of 4.
Is 3 mapped to? Yes, because , so 3 is the image of 2.
Is 4 mapped to? Yes, because , so 4 is the image of 3.
Since every element in the codomain is an image of some element in the domain, is onto. Therefore, option C, which states "R is an onto function," is correct.
To address option A, since is both one-to-one and onto, it is bijective. A bijective function has an inverse. The inverse function can be found by swapping the pairs: , which is equivalent to , , , . This is a valid function, so has an inverse. Therefore, option A, which states "R does not have an inverse," is incorrect.
Hence, the correct answer is Option C.
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.