Q26: Is on reflexive, symmetric, transitive? or one-one and onto
(a) A relation R on set A = is defined as R = . Check whether the relation R is reflexive, symmetric and transitive.
OR
(b) A function f is defined from as , such that and . Find function . Hence, check whether function is one-one and onto or not.
(a)
Reflexive: For every , , so . Thus R is reflexive.
Why?
Reflexive means every element of A is related to itself: for every in A.
For a pair the difference of squares is , and is true for all five elements.
Symmetric: Let for some . Then . As , we get , so . Thus R is symmetric.
Why?
Symmetric means: whenever , the reversed pair is in R too.
The key fact is . Since , both orders give the same modulus, so the condition holds either way round.
Transitive: as , and as . But , which is not less than 8, so . Thus R is not transitive.
Why?
Transitive means: and always give . To show that it fails, one counterexample is enough.
To find one, take two elements whose squares are far apart, joined through a middle element: 1 and 3 give , while the steps 1 to 2 and 2 to 3 are each less than 8.
The three checks in full:
Watch out: the condition is a strict inequality, and is false.
Hence R is reflexive and symmetric, but not transitive.
(b)
, and .
Why?
Put and into : and . This gives two equations for the two unknowns.
Subtracting, ; then .
Why?
removes b and leaves . Then the first equation gives .
Thus and . So .
One-one: Let for some .
Why?
One-one means equal outputs can come only from equal inputs. So we assume the outputs are equal and show the inputs must be equal: add 1 to both sides, then divide by 2.
Hence f is one-one.
Onto: Let (codomain) and . Then (domain), and
Why?
Onto means every element of the codomain is the image of some element of the domain. So we take any and solve for .
Watch out: we must check that this is in the domain. Here is a real number for every real , so it is.
Why?
Put into . The 2 on top cancels the 2 below:
So every in the codomain is an image. Hence f is onto.
, and f is one-one and onto.
Chapter 1, Relations and Functions: Relation properties; one-one and onto function.
Question type: (a) A relation given by a rule; (b) Prove one-one and onto
How to spot it: click to see
(a) Type 2. A relation given by a rule: letters to prove, numbers to disprove
Spot it: is given by a condition, such as on , and the set is too big to list every pair.
Here: is given by a rule on . Prove reflexive and symmetric with letters (, and ). Disprove transitive with numbers: , but is not less than 8.
(b) 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: First find from and . Then gives , and is real for every .
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Relations and Functions in past papers: question 5 of 18 · see them all