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 R={(a,b):a≤b}R = \{(a, b) : a \leq b\} in R\mathbb{R} is reflexive and transitive but not symmetric.

Step 1 — reflexive: a≤aa \leq a holds for every real aa.

Step 2 — transitive: a≤ba \leq b and b≤cb \leq c give a≤ca \leq c.

Step 3 — not symmetric: 2≤32 \leq 3 but 3≰23 \not\leq 2 — one counterexample suffices.

Answer: reflexive and transitive, not symmetric.

Question 2 — Doubling on the naturals

Show that f:N→Nf : \mathbb{N} \to \mathbb{N} given by f(x)=2xf(x) = 2x is one-one but not onto.

Step 1 — one-one: f(x1)=f(x2)⇒2x1=2x2⇒x1=x2f(x_1) = f(x_2) \Rightarrow 2x_1 = 2x_2 \Rightarrow x_1 = x_2.

Step 2 — not onto: 11 in the co-domain would require 2x=12x = 1, i.e. x=12∉Nx = \frac{1}{2} \notin \mathbb{N}.

Answer: one-one, not onto — the range is only the even naturals.

Question 3 — Two quick compositions

If f(x)=∣x∣f(x) = \vert x \vert and g(x)=5x−2g(x) = 5x - 2 on R\mathbb{R}, find g∘fg \circ f and f∘gf \circ g.

Step 1 — g∘fg \circ f:  (g∘f)(x)=g(∣x∣)=5∣x∣−2\ (g \circ f)(x) = g(\vert x \vert) = 5\vert x \vert - 2.

Step 2 — f∘gf \circ g:  (f∘g)(x)=∣5x−2∣\ (f \circ g)(x) = \vert 5x - 2 \vert.

Answer: 5∣x∣−25\vert x \vert - 2 and ∣5x−2∣\vert 5x - 2 \vert — different functions (at x=0x = 0: values −2-2 and 22), so the order of composition matters.

Question 4 — Symmetric only

Show that the relation R={(1,2),(2,1)}R = \{(1, 2), (2, 1)\} in the set {1,2,3}\{1, 2, 3\} is symmetric but neither reflexive nor transitive.

Step 1 — symmetric: the reverse of each pair present — (2,1)(2,1) for (1,2)(1,2) and vice versa — is present ✓.

Step 2 — not reflexive: (1,1)∉R(1, 1) \notin R.

Step 3 — not transitive: (1,2)∈R(1,2) \in R and (2,1)∈R(2,1) \in R, but (1,1)∉R(1,1) \notin R.

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 R={(a,b):a≤b2}R = \{(a, b) : a \leq b^2\} in R\mathbb{R} is neither reflexive nor symmetric nor transitive.

Step 1 — not reflexive: for a=12a = \frac{1}{2},  12≤14\ \frac{1}{2} \leq \frac{1}{4} is false.

Step 2 — not symmetric: (1,2)∈R(1, 2) \in R since 1≤41 \leq 4, but (2,1)∉R(2, 1) \notin R since 2≰12 \not\leq 1.

Step 3 — not transitive: (3,2)∈R(3, 2) \in R (3≤43 \leq 4) and (2,1.5)∈R(2, 1.5) \in R (2≤2.252 \leq 2.25), but (3,1.5)∉R(3, 1.5) \notin R (3≰2.253 \not\leq 2.25).

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 f:R→Rf : \mathbb{R} \to \mathbb{R}, given by f(x)=[x]f(x) = [x], is neither one-one nor onto.

Step 1 — not one-one: f(1.2)=1=f(1.9)f(1.2) = 1 = f(1.9) while 1.2≠1.91.2 \neq 1.9.

Step 2 — not onto: [x][x] is always an integer, so the co-domain element 12\frac{1}{2} satisfies f(x)=12f(x) = \frac{1}{2} for no xx.

Step 3 — conclude: with a collision exhibited and a missed target exhibited, ff is neither injective nor surjective.

Answer: neither one-one nor onto.

Question 7 — A shifted parabola

Discuss whether f:R→Rf : \mathbb{R} \to \mathbb{R}, f(x)=1+x2f(x) = 1 + x^2, is one-one and whether it is onto.

Step 1 — not one-one: f(−1)=2=f(1)f(-1) = 2 = f(1), and −1≠1-1 \neq 1.

Step 2 — not onto: 1+x2≥11 + x^2 \geq 1 for every real xx, so no y<1y < 1 — for instance y=0y = 0 — is attained.

Step 3 — conclude: the range is [1,∞)[1, \infty), a proper subset of the co-domain.

Answer: neither one-one nor onto.

Question 8 — Compositions in both orders

If f(x)=x2f(x) = x^2 and g(x)=2x+1g(x) = 2x + 1 on R\mathbb{R}, find g∘fg \circ f and f∘gf \circ g, and show they are not equal.

Step 1 — g∘fg \circ f:  g(x2)=2x2+1\ g(x^2) = 2x^2 + 1.

Step 2 — f∘gf \circ g:  f(2x+1)=(2x+1)2=4x2+4x+1\ f(2x + 1) = (2x + 1)^2 = 4x^2 + 4x + 1.

Step 3 — compare at x=1x = 1:  (g∘f)(1)=3\ (g \circ f)(1) = 3 but (f∘g)(1)=9(f \circ g)(1) = 9.

Answer: g∘f≠f∘gg \circ f \neq f \circ g — one point of disagreement completes the proof.

5-Mark Questions

Question 9 — Equivalence relation with classes exhibited

Show that the relation R={(a,b):∣a−b∣R = \{(a, b) : \vert a - b \vert is even}\} in A={1,2,3,4,5}A = \{1, 2, 3, 4, 5\} is an equivalence relation, and show that all elements of {1,3,5}\{1, 3, 5\} are related to each other, all elements of {2,4}\{2, 4\} are related to each other, but no element of {1,3,5}\{1, 3, 5\} is related to any element of {2,4}\{2, 4\}.

Step 1 — reflexive: ∣a−a∣=0\vert a - a \vert = 0, which is even.

Step 2 — symmetric: ∣a−b∣=∣b−a∣\vert a - b \vert = \vert b - a \vert, so evenness transfers.

Step 3 — transitive: if a−ba - b and b−cb - c are even, then a−c=(a−b)+(b−c)a - c = (a - b) + (b - c) is a sum of even numbers, hence even.

Step 4 — the classes: two odds differ by an even number, so 1,3,51, 3, 5 are mutually related; two evens likewise for 2,42, 4; an odd and an even differ by an odd number, so no cross-pair lies in RR.

Answer: RR is an equivalence relation partitioning AA into {1,3,5}\{1, 3, 5\} and {2,4}\{2, 4\}.

Question 10 — Similarity of triangles

Show that the relation R={(T1,T2):T1R = \{(T_1, T_2) : T_1 is similar to T2}T_2\} on the set of all triangles is an equivalence relation. Consider the right triangles T1T_1 with sides 3, 4, 5;  T2\ T_2 with sides 5, 12, 13; and T3T_3 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 T1∼T2T_1 \sim T_2 with ratio kk, then T2∼T1T_2 \sim T_1 with ratio 1k\frac{1}{k}.

Step 3 — transitive: ratios compose — similarity with ratios k1k_1 then k2k_2 gives similarity with ratio k1k2k_1 k_2.

Step 4 — test the triples: 63=84=105=2\frac{6}{3} = \frac{8}{4} = \frac{10}{5} = 2, so T1∼T3T_1 \sim T_3; but 53≠124\frac{5}{3} \neq \frac{12}{4}, so T2T_2 is similar to neither.

Answer: equivalence relation; only T1T_1 and T3T_3 are related.

Question 11 — The rational bijection

Let A=R−{3}A = \mathbb{R} - \{3\} and B=R−{1}B = \mathbb{R} - \{1\}. Show that the function f:A→Bf : A \to B defined by f(x)=x−2x−3f(x) = \dfrac{x - 2}{x - 3} is one-one and onto.

Step 1 — one-one: assume x1−2x1−3=x2−2x2−3\dfrac{x_1 - 2}{x_1 - 3} = \dfrac{x_2 - 2}{x_2 - 3}. Cross-multiplying: (x1−2)(x2−3)=(x2−2)(x1−3)(x_1 - 2)(x_2 - 3) = (x_2 - 2)(x_1 - 3).

Step 2 — expand and cancel: x1x2−3x1−2x2+6=x1x2−3x2−2x1+6x_1 x_2 - 3x_1 - 2x_2 + 6 = x_1 x_2 - 3x_2 - 2x_1 + 6, so −3x1−2x2=−3x2−2x1-3x_1 - 2x_2 = -3x_2 - 2x_1, giving x1=x2x_1 = x_2.

Step 3 — onto: for y∈By \in B solve y=x−2x−3y = \dfrac{x - 2}{x - 3}:  x(y−1)=3y−2\ x(y - 1) = 3y - 2, so x=3y−2y−1x = \dfrac{3y - 2}{y - 1}, defined since y≠1y \neq 1.

Step 4 — the preimage is legal: 3y−2y−1=3\dfrac{3y - 2}{y - 1} = 3 would need 3y−2=3y−33y - 2 = 3y - 3, impossible — so x∈Ax \in A, and substituting back gives f(x)=yf(x) = y.

Answer: ff is one-one and onto (hence invertible, with f−1(y)=3y−2y−1f^{-1}(y) = \frac{3y - 2}{y - 1}).

Question 12 — Invertibility with the inverse computed

Let f:[0,∞)→[4,∞)f : [0, \infty) \to [4, \infty) be given by f(x)=x2+4f(x) = x^2 + 4. Show that ff is invertible and find f−1f^{-1}.

Step 1 — one-one: x12+4=x22+4⇒x12=x22⇒x1=x2x_1^2 + 4 = x_2^2 + 4 \Rightarrow x_1^2 = x_2^2 \Rightarrow x_1 = x_2, since both are nonnegative.

Step 2 — onto: given y≥4y \geq 4, set x=y−4x = \sqrt{y - 4}, which is a legal input (y−4≥0y - 4 \geq 0), and f(x)=(y−4)+4=yf(x) = (y - 4) + 4 = y.

Step 3 — conclude invertibility by the theorem (bijective   ⟺  \iff invertible), with candidate g(y)=y−4g(y) = \sqrt{y - 4}.

Step 4 — verify both compositions: g(f(x))=x2+4−4=x2=x (x≥0),f(g(y))=(y−4)2+4=yg(f(x)) = \sqrt{x^2 + 4 - 4} = \sqrt{x^2} = x \ (x \geq 0), \qquad f(g(y)) = (\sqrt{y - 4})^2 + 4 = y

Answer: ff is invertible with f−1(y)=y−4f^{-1}(y) = \sqrt{y - 4}. The restricted domain [0,∞)[0, \infty) 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.