Q1: Is one-one? Or: the number of reflexive relations on a 3-element set
(a) Check whether the function defined as is one-one or not.
OR
(b) How many reflexive relations are possible in a set A whose .
(a)
Let for some .
Why?
A function is one-one when equal outputs can only come from equal inputs:
So we start from two equal outputs and try to reach .
(a real number has only one real cube root)
Why?
Taking the cube root of both sides is safe, because cubing keeps the order: if , then . So two different real numbers never have the same cube. Even the sign survives: but .
Watch out: this fails for squares. , which is why is not one-one on R.
Hence is one-one.
(b)
A reflexive relation on A must contain the 3 pairs , . Each of the other pairs of may or may not be in it.
Why?
A relation on A is any subset of , which has ordered pairs.
Reflexive means for every . So the 3 pairs are forced in, and only the other 6 pairs are free to choose.
So the number of reflexive relations is
Why?
Each free pair has 2 choices: in the relation or out of it. The choices are independent, so they multiply (the multiplication principle).
reflexive relations are possible.
Chapter 1, Relations and Functions: One-one functions; counting reflexive relations.
Question type: (a) Prove one-one and onto; (b) Counting questions
How to spot it: click to see
(a) Type 5. Prove one-one and onto: the bijective function
Spot it: "show that is one-one and onto", or "is bijective?", with a formula like .
Here: Only one-one is asked: gives , since a real number has only one real cube root.
(b) Type 8. Counting questions: list the possibilities
Spot it: "the number of relations (or functions) …" on a small set like , usually an MCQ.
Here: The 3 pairs are forced in. Each of the other pairs of is in or out, which gives .
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Relations and Functions in past papers: question 15 of 18 · see them all