Q32: Is an equivalence relation; or is injective, surjective
(a) Let , where is the set of natural numbers and a relation is defined on such that if and only if . Check whether is an equivalence relation or not?
OR
(b) A relation is defined as
Draw its graph and check whether it is a function or not.
If the given relation is a function, then examine whether the function is injective, and whether it is surjective or not.
For Visually Impaired:
A relation is defined as .
Check whether it is a function or not. If the given relation is a function, then examine whether the function is injective, surjective, or both, and conclude whether it is bijective or not.
(a)
Reflexive: Let .
Then , so for all .
Why?
Reflexive means every element is related to itself. Read the rule with and : we need
That is true for all , because addition can be done in any order.
is a reflexive relation.
Symmetric: Let with .
Why?
Symmetric means: if , then .
The rule for is . For , put , , , :
This is the given equation with its two sides swapped and each side reordered.
Thus, is a symmetric relation.
Transitive: Let with and .
Why?
Transitive means: if the first pair is related to the second, and the second to the third, then the first is related to the third.
Write out both given relations from the rule. The target is , that is .
Adding (i) and (ii),
Why?
The middle pair's terms and appear on both sides after adding. Subtract from both sides, and only the target equation is left.
Thus, is a transitive relation.
So, is reflexive, symmetric and transitive. Hence is an equivalence relation.
Why?
An equivalence relation is one that is reflexive, symmetric and transitive, all three. Always write the conclusion line in words.
Another way to see it: the rule is the same as . So R relates and exactly when and are equal.
(b)
Graph of : a parabola opening upwards with vertex .
Why?
is the parabola moved up by 5. To draw it, plot a few points:
( and have the same square, for example .)
Yes, is a function, as the graph shows that every element of has a unique image in .
Why?
A relation is a function when every element of the domain has exactly one image in the co-domain.
On the graph: every vertical line meets the curve exactly once. Each image is at least 5, so it lies in .
Let , .
Injective: and .
So with . Thus is many-one, so not injective.
Why?
Injective (one-one) means different inputs always give different outputs. To show a function is not injective, one counterexample is enough: two different inputs with the same output.
On the graph, the horizontal line meets the curve twice.
Surjective: Range of co-domain .
Why?
Surjective (onto) means the range is the whole co-domain.
Since , . So a number such as 2 in the co-domain is never an output: needs , which has no real solution.
A square is never negative, so there is no such real .
So, is not surjective.
For Visually Impaired
For every element of , , so . Hence every element of has a unique image in .
Why?
Each real gives one value , and that value is at least 7, so it is in the co-domain . That is what "function" requires.
So , is a function.
Injective: and .
So with . Thus is many-one, so not injective.
Why?
As before, and have the same square, so one pair such as and shows two inputs with the same output.
Surjective: Range of co-domain . So, it is not surjective.
Why?
Since , the numbers from 0 up to (but not including) 7 are never outputs.
For example, take 0 in the co-domain:
No real square is negative, so 0 has no pre-image.
Bijective means injective and surjective both. Failing either one is enough to be not bijective.
is neither injective nor surjective, and hence not bijective.
Chapter 1, Relations and Functions: Equivalence relation; injective and surjective.
Question type: (a) Show that a relation is an equivalence relation; (b) Not one-one or not onto
How to spot it: click to see
(a) Type 3. Show that a relation is an equivalence relation
Spot it: the words "is an equivalence relation", often with "2 divides " or " is even".
Here: The rule is on pairs. For transitive, add the two given equations: and cancel, leaving .
(b) Type 6. Not one-one or not onto: one example is enough
Spot it: functions such as , or on , where two inputs share an output, or some numbers are never reached.
Here: on all reals: , so it is not one-one. And , so 2 is never reached, and it is not onto.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Relations and Functions in past papers: question 8 of 18 · see them all