How Relations and Functions Appears in the Board Exam
This chapter opens the paper's syllabus and shows up every year, in a very stable pattern:
| Question type | Marks | What is asked |
|---|---|---|
| MCQ / very short | 1 | property identification, counting small relations, reading a conditional definition |
| Short answer | 2 | one or two property checks with justification, quick one-one/onto verdicts |
| Short answer | 3 | full three-property analysis, one-one and onto with proofs, compositions |
| Long answer | 5 | equivalence-relation proof with equivalence classes, or bijectivity/invertibility with the inverse computed |
The marking scheme rewards structure: name the property, take arbitrary elements, run the algebra (or exhibit the counterexample), conclude. Each property proved or disproved cleanly earns its own credit.
Below are 12 board-style written questions with complete solutions, organised by marks, followed by a 15-question MCQ quiz.
2-Mark Questions
Question 1 — Ordering of the reals
Show that the relation in is reflexive and transitive but not symmetric.
Step 1 — reflexive: holds for every real .
Step 2 — transitive: and give .
Step 3 — not symmetric: but — one counterexample suffices.
Answer: reflexive and transitive, not symmetric.
Question 2 — Doubling on the naturals
Show that given by is one-one but not onto.
Step 1 — one-one: .
Step 2 — not onto: in the co-domain would require , i.e. .
Answer: one-one, not onto — the range is only the even naturals.
Question 3 — Two quick compositions
If and on , find and .
Step 1 — : .
Step 2 — : .
Answer: and — different functions (at : values and ), so the order of composition matters.
Question 4 — Symmetric only
Show that the relation in the set is symmetric but neither reflexive nor transitive.
Step 1 — symmetric: the reverse of each pair present — for and vice versa — is present ✓.
Step 2 — not reflexive: .
Step 3 — not transitive: and , but .
Answer: symmetric only. Note the transitivity failure uses a chain that returns to its start — a pattern worth remembering.
3-Mark Questions
Question 5 — All three properties fail
Show that the relation in is neither reflexive nor symmetric nor transitive.
Step 1 — not reflexive: for , is false.
Step 2 — not symmetric: since , but since .
Step 3 — not transitive: () and (), but ().
Answer: none of the three properties holds. Each disproof is one concrete counterexample — the fastest full-marks route.
Question 6 — The greatest integer function
Prove that , given by , is neither one-one nor onto.
Step 1 — not one-one: while .
Step 2 — not onto: is always an integer, so the co-domain element satisfies for no .
Step 3 — conclude: with a collision exhibited and a missed target exhibited, is neither injective nor surjective.
Answer: neither one-one nor onto.
Question 7 — A shifted parabola
Discuss whether , , is one-one and whether it is onto.
Step 1 — not one-one: , and .
Step 2 — not onto: for every real , so no — for instance — is attained.
Step 3 — conclude: the range is , a proper subset of the co-domain.
Answer: neither one-one nor onto.
Question 8 — Compositions in both orders
If and on , find and , and show they are not equal.
Step 1 — : .
Step 2 — : .
Step 3 — compare at : but .
Answer: — one point of disagreement completes the proof.
5-Mark Questions
Question 9 — Equivalence relation with classes exhibited
Show that the relation is even in is an equivalence relation, and show that all elements of are related to each other, all elements of are related to each other, but no element of is related to any element of .
Step 1 — reflexive: , which is even.
Step 2 — symmetric: , so evenness transfers.
Step 3 — transitive: if and are even, then is a sum of even numbers, hence even.
Step 4 — the classes: two odds differ by an even number, so are mutually related; two evens likewise for ; an odd and an even differ by an odd number, so no cross-pair lies in .
Answer: is an equivalence relation partitioning into and .
Question 10 — Similarity of triangles
Show that the relation is similar to on the set of all triangles is an equivalence relation. Consider the right triangles with sides 3, 4, 5; with sides 5, 12, 13; and with sides 6, 8, 10. Which among them are related?
Step 1 — reflexive: every triangle is similar to itself (ratio 1).
Step 2 — symmetric: if with ratio , then with ratio .
Step 3 — transitive: ratios compose — similarity with ratios then gives similarity with ratio .
Step 4 — test the triples: , so ; but , so is similar to neither.
Answer: equivalence relation; only and are related.
Question 11 — The rational bijection
Let and . Show that the function defined by is one-one and onto.
Step 1 — one-one: assume . Cross-multiplying: .
Step 2 — expand and cancel: , so , giving .
Step 3 — onto: for solve : , so , defined since .
Step 4 — the preimage is legal: would need , impossible — so , and substituting back gives .
Answer: is one-one and onto (hence invertible, with ).
Question 12 — Invertibility with the inverse computed
Let be given by . Show that is invertible and find .
Step 1 — one-one: , since both are nonnegative.
Step 2 — onto: given , set , which is a legal input (), and .
Step 3 — conclude invertibility by the theorem (bijective invertible), with candidate .
Step 4 — verify both compositions:
Answer: is invertible with . The restricted domain is what rescues one-one-ness from the parabola.
Presentation tip: every 5-mark solution above follows the same skeleton — properties one at a time, arbitrary elements, a clean counterexample where needed, and the final answer in words. Board examiners award each block separately.