Class 12 Maths, Worked in Full Past papersGet updates
CBSE Sample Paper 2020-21 · Part A: Section I · 1 mark

Q1: Is f(x)=x3f(x) = x^3 one-one? Or: the number of reflexive relations on a 3-element set

The question

(a) Check whether the function f:R→Rf : R \to R defined as f(x)=x3f(x) = x^3 is one-one or not.

OR

(b) How many reflexive relations are possible in a set A whose n(A)=3n(A) = 3⁠.

Exam answer

(a)

Let f(x1)=f(x2)f(x_1) = f(x_2) for some x1,x2∈Rx_1, x_2 \in R⁠.

Why?

A function is one-one when equal outputs can only come from equal inputs:

f(x1)=f(x2)⇒x1=x2f(x_1) = f(x_2) \Rightarrow x_1 = x_2

So we start from two equal outputs and try to reach x1=x2x_1 = x_2⁠.

⇒(x1)3=(x2)3⇒x1=x2\begin{aligned} &\Rightarrow (x_1)^3 = (x_2)^3 \\ &\Rightarrow x_1 = x_2 \end{aligned}

(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 x1<x2x_1 < x_2⁠, then x13<x23x_1^3 < x_2^3⁠. So two different real numbers never have the same cube. Even the sign survives: 23=82^3 = 8 but (−2)3=−8(-2)^3 = -8⁠.

Watch out: this fails for squares. 22=(−2)2=42^2 = (-2)^2 = 4⁠, which is why x2x^2 is not one-one on R.

Hence f(x)f(x) is one-one.

(b)

A reflexive relation on A must contain the 3 pairs (a,a)(a, a)⁠, a∈Aa \in A⁠. Each of the other 32−3=63^2 - 3 = 6 pairs of A×AA \times A may or may not be in it.

Why?

A relation on A is any subset of A×AA \times A⁠, which has 3×3=93 \times 3 = 9 ordered pairs.

Reflexive means (a,a)∈R(a, a) \in R for every a∈Aa \in A⁠. So the 3 pairs (a,a)(a, a) are forced in, and only the other 6 pairs are free to choose.

So the number of reflexive relations is

2×2×⋯×2 (6 times)=262 \times 2 \times \cdots \times 2\ (6 \text{ times}) = 2^6
Why?

Each free pair has 2 choices: in the relation or out of it. The choices are independent, so they multiply (the multiplication principle).

26=642^6 = 64

∴\therefore 26=642^6 = 64 reflexive relations are possible.

Where this comes from

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 ff is one-one and onto", or "is ff bijective?", with a formula like f(x)=3−4xf(x) = 3 - 4x⁠.

Here: Only one-one is asked: x13=x23x_1^3 = x_2^3 gives x1=x2x_1 = x_2⁠, 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 {1,2,3}\{1, 2, 3\}⁠, usually an MCQ.

Here: The 3 pairs (a,a)(a, a) are forced in. Each of the other 9−3=69 - 3 = 6 pairs of A×AA \times A is in or out, which gives 26=642^6 = 64⁠.

Found an error?

Tell us if something on this page is wrong or unclear. Send feedback on this question →