Solution

RELATIONS AND FUNCTIONS

Class 12 - Mathematics

1.
(d) one one and into
Explanation: f: R → R: f(x) = x3
For One-One function
Let p, q be two arbitrary elements in R
then, f(p) = f(q)
⇒ P3 = q3
⇒ p = q

Thus, f(x) is one-one function.

For Onto function
Let v be an arbitrary element of R (co-domian)
Then, f(x) = v
x3 = v
⇒ x = √v
3

Since v ∈ N
If v = 2, √v = 1.260, which is not possible as x ∈ R
3

Thus, f(x) is not onto function. It is into function.

2.
(d) reflexive, transitive but not symmetric
Explanation: Reflexivity : aRa a ⩾ a, which is true.
Symmetry :aRb a ⩾ b , but, it doesn’t mean that b ⩾ a .
Transitivity: aRb i.e, a ⩾ b and bRc i.e, b ⩾ c . Therefore, a ⩾ c , which means aRc.
3. (a) an equivalence relation
Explanation: Given Relation R = {(1, 1), (2, 2), (3, 3)}
Reflexive: If a relation has {(a, b)} as its element, then it should also have {(a, a), (b, b)} as its elements too.
Symmetric: If a relation has (a, b) as its element, then it should also have {(b, a)} as its element too.
Transitive: If a relation has {(a, b), (b, c)} as its elements, then it should also have {(a,c)} as its element too.
Now, the given relation satisfies all these three properties.
Therefore, its an equivalence relation.
4.
(c) transitive
Explanation: R = {(1, 2), (2, 3), (1, 3)} satisfying only the property of transitive relation.
i.e Its transitive i.e (a,b) ∈ R and (b,c) ∈ R → (a,c) ∈ R ∀
a,b,c ∈ A
5.
(c) f (x) = x + 2
Explanation: Injectivity: Let x, y ∈ Z, then, f(x) = f(y) ⇒ x + 2 = y + 2 ⇒ x = y.⇒ f is one-one.
Surjectivity: Let f(x) = y , where y ∈ Z, .⇒ x + 2 = y .⇒ x = y – 2 ∈ Z, ⇒ f is onto.
Therefore, f is a bijective function.
6. We observe that 1 and -1 ∈ R such that f (-1) = f (1) i.e. there are two distinct elements in R which have the same image. So, f is
not one-one.
Since f (x) assumes only non-negative values. So, no negative real number in R (co-domain) has its pre-image in domain of f i.e.
R. Consequently f is not onto.

1/7
 These facts are evident from the graph of f (x) as shown in Fig.

7. To prove: function is neither one-one nor onto function.

Given: f : R → R : f (x) = x4
We have,
f(x) = x4
For, f(x1) = f(x2)

= x14 = x24

= (x14 - x24) = 0

=(x12 - x22) (x12 + x22) = 0

= (x1 - x2) (x1 + x2) (x12 + x22) = 0

= x1 = x2 or, x1 = -x2 or, x12 = -x22

We are getting more than one value of x1 (no unique image)
∴ f(x) is not one-one function.
f(x) = x4
Let f(x) = y such that y ∈ R
= y = x4
4
⇒ x = √y

If y = -2, as y ∈ R
Then x will be undefined as we can’t place the negative value under the square root
Hence f(x) is not onto function.
Hence Proved.
8. We have, R = {(a, b) : a = b2} relation defined on N.
Now,
We observe that, any element a ∈ N cannot be equal to its square except 1.
= (a,a) ∉ R ∀ a ∈ N
For e.g. (2,2) ∉ R ∵ 2 ≠ 22
= R is not reflexive.
Let (a,b) ∈ R ∀ a, b ∈ N
= a = b2
But b cannot be equal to square of a if a is equal to square of b.
⇒ (b,a) ∉ R

For e.g., we observe that (4,2) ∈ R i.e 4 = 22 but 2 ≠ 42

⇒ (2,4) ∉ R

= R is not symmetric
Let (a,b) ∈ R and (b,c) ∈ R ∀ a, b,c ∈ N
= a = b2 and b = c2

2/7
 = a ≠ c2
⇒ (a,c) ∉ R

For e.g., we observe that

(16,4) ∈ R ⇒ 16 = 42 and (4,2) ∈ R ⇒ 4 = 22
But 16 ≠ 22
= (16,2) ≠ R
⇒ R is not transitive.

thus, R is neither reflexive nor symmetric nor transitive

9. To prove: function is one-one and into
Given: f : N → N : f (x) = x2
Solution: We have,
f(x) = x2
For, f(x1) = f(x2)

= x12 = x22
= x1 = x2
Here we can’t consider x1 = -x2 as x ∈ N we can’t have negative values
∴ f(x) is one-one function
f(x) = x2
Let f(x) = y such that y ∈ N
⇒ y = x2
⇒ x = √y

If y = 2, as y ∈ N
Then we will get the irrational value of x, but x ∈ N
Hence f(x) is into function.
Thus, f is one one and into function.
10. one-one: Let x1, x2 be two arbitrary elements of A such that,
f(x ) = f(x )
1 2

x1 −2 x2 −2
⇒ =
x1 −3 x2 −3

⇒ (x1 − 2)(x2 − 3) = (x1 − 3)(x2 − 2)

⇒ x1 x2 − 3x1 − 2x2 + 6 = x1 x2 − 2x1 − 3x2 + 6

⇒ −3x1 − 2x2 = −2x1 − 3x2

⇒ x1 = x2

⇒ x1 x2 − 3x1 − 2x2 + 6 = x1 x2 − 2x1 − 3x2 + 6

⇒ −3x1 − 2x2 = −2x1 − 3x2

⇒ x1 = x2

Hence, f is one-one.
onto: Let y be an arbitrary element of B such that
f(x)=y
x−2
⇒ = y
x−3

⇒ x − 2 = y(x − 3)
2−3y
⇒ x =
1−y

2−3y
Clearly, x = 1−y
is a real number for all y ≠ 1 .
2−3y 2−3y
Also, 1−y
≠ 3 , for if 1−y
= 3 , then we get 2 = 3, which is wrong.
Thus,every element in B has it's pre-image x in A given by
1−2y
x= 1−y

So, f is onto.
11. 1. (a, a) ∉ R as a<a is false,therefore R is not reflexive.
2. a < b and b < a Which is false,therefore R is not symmetric.
2 2

3/7
 3. a < b , b < c , then a < c Which is false. Therefore R is not transitive.
2 2 2

∴ f is neither reflexive nor symmetric nor transitive.

12. Given a relation R in A × A where A = {1, 2, 3, . . . , 9 }, defined as (a, b) R (c, d), if a + d = b + c.

Reflexive: Let (a, b) be any arbitrary element of A × A,
i.e. (a, b) ∈ A × A, where a, b ∈ A.
Now, as a + b = b + a [addition is commutative]
∴(a, b)R(a, b)

So, R is reflexive.
Symmetric:
Let (a, b), (c, d) ∈ A × A such that (a, b) R (c, d)
Then, a + d = b + c​​​​​​​
⇒ b + c = a+ d ⇒ c + b = d + a [addition is commutative]
⇒ (c, d)R(a, b)

Transitive: Let (a, b), (c, d), (e, f ) ∈ A × A such that (a, b) R (c, d) and (c, d) R (e,f).
Then, a + d = b + c and c + f = d + e
On adding the above equations, we get
a+ d + c + f = b + c + d + e

⇒ a + f = b + e ⇒ (a, b)R(e, f )

So, R is transitive.
Thus, R is reflexive, symmetric and transitive.
Hence, R is an equivalence relation.
Now, for [(2, 5)], we will find (c, d) ∈ A × A such that 2 + d = 5 + c or d - c = 3
Clearly, (2, 5) R (1, 4) as 4 - 1 = 3
(2, 5)R(2, 5) as 5 − 2 = 3

(2, 5)R(3, 6) as 6 − 3 = 3

(2, 5)R(4, 7) as 7 − 4 = 3

(2, 5) R (5, 8) as 8- 5 = 3
and (2, 5) R (6, 9) as 9 - 6 = 3
Hence, equivalence class [(2, 5)] = { (1, 4), (2, 5),(3, 6), (4, 7),(5, 8),(6, 9)}.
13. Given function is f: N → N such that
x + 1, if x is odd
f (x) = {
x − 1, if x is even

One-One function
Case I: When x1 and x2 are odd.
Then, f (x1) = f (x2)
⇒ x1 − 1 = x2 − 1

⇒ x1 = x2

Case II: When x1 and x2 are even.

Then, f (x 1) = f (x2 )

⇒ x1 + 1 = x2 + 1

⇒ x1 = x2

Thus, in both cases,

f (x1 ) = f (x2 ) ⇒ x1 = x2

Case III: When x1 is odd and x2 is even.

Then, x1 ≠ x2
Also, f(x1) is even and f(x2) is odd.
So, f(x1) ≠ f(x2)
Thus, x ≠ x ⇒ f (x ) ≠ f (x )
1 2 1 2

Case IV: When x1 is even and x2 is odd.

Then, x1 ≠ x2
Also, f(x1) is odd and f(x2) is even.

4/7
 So, f(x1) ≠ f(x2)
Thus, x1 ≠ x2 ⇒ f(x1) ≠ f(x2)
Hence, from cases I, II, III and IV we can obsere that, f(x) is a one-one function.
Onto function
Let y∈N ( co-domain) be any arbitrary number.
If y is odd, then there exists an even number y + 1 ∈ N (domain) such that f (y + 1) = (y + 1) − 1 = y.
If y is even, then there exists an odd number y − 1 ∈ N (domain) such that f (y − 1) = (y − 1) + 1 = y
Thus, every element in N ( codomain) has a pre-image in N (domain).
Therefore, f(x) is an onto function. Hence, the function f(x) is bijective.
14. f (x) = 1

x
, f : R∗ → R∗
1 1
Part I: f (x 1) =
x1
and f (x 2) =
x2

If f(x1) = f(x2) then 1

x1
=
1

x2

⇒ x1 = x2
∴ f is one-one.
1
f (x) =
x
1
⇒ y =
x
1
⇒ x =
y

⇒ f (
1

y
) = y ∴ f is onto.
Part II: When domain R is replaced by N, co-domain remaining the same, then, f : N→ R ∗

If f(x1) = f(x2)
1 1
⇒ =
n1 n2

⇒ n1 = n2 where n1, n2 ∈ N
∴ f is one-one.
But, every real number belonging to co-domain may not have a pre-image in N.
e.g. 2 in codomain R* does not have pre-image in N as if
x in N be pre-image of 2,then f(x) = 2 ⇒ 1

x
=2⇒x= 1

2
∉ N .
∴ f is not onto.
15. We have, R = {(a, b) : a > b} relation defined on N.
Now,
We observe that, any element a ∈ N cannot be greater than itself.
= (a,a) ∉ R ∀ a ∈ N
= R is not reflexive.
Let (a,b) ∈ R ∀ a, b ∈ N
= a is greater than b
But b cannot be greater than a if a is greater than b.
= (b,a) ∉ R
For e.g., we observe that (5,2) ∈ R i.e 5 > 2 but 2 ≯ 5 ⇒ (2, 5) ∉ R
= R is not symmetric
Let (a,b) ∈ R and (b,c) ∈ R ∀ a, b,c ∈ N
=a > b and b > c
=a>c
= (a,c) ∈ R
For e.g, we observe that
(5,4) ∈ R ⇒ 5 > 4 and (4,3) ∈ R ⇒ 4 > 3
And we know that 5 > 3 ∴ (5,3) ∈ R
= R is transitive.
Thus, R is transitive but not reflexive not symmetric
16. A = {1, 2, 3, 4, 5} and R = {(a, b) : |a - b| is even}, then R = {(1, 3), (1, 5), (3, 5), (2, 4)}
1. For (a, a), |a - a| = 0 which is even. ∴ R is reflexive.
If |a - b| is even, then |b - a| is also even. ∴ R is symmetric.
Now, if |a - b| and |b - c| is even then |a - b + b - c| is even

5/7
 ⇒ |a - c| is also even. ∴ R is transitive.
Therefore, R is an equivalence relation.
2. Elements of {1, 3, 5} are related to each other.
Since |1 - 3| = 2, |3 - 5| = 2, |1 - 5| = 4 all are even numbers
⇒ Elements of {1, 3, 5} are related to each other.

Similarly elements of (2, 4) are related to each other.

Since |2 - 4| = 2 an even number, then no element of the set {1, 3, 5} is related to any element of (2, 4).
Hence no element of {1, 3, 5} is related to any element of {2, 4}.
17. Here R is a relation on N × N , defined by (a, b) R (c, d) ⇔ a + d = b + c for all (a, b), (c, d) ∈ N × N

We shall show that R satisfies the following properties

i. Reflexivity:
We know that a + b = b + a for all a, b ∈ N.
∴ (a, b) R (a, b) for all (a, b) ∈ (N × N )

So, R is reflexive.
ii. Symmetry:
Let (a, b) R (c, d). Then,
(a, b) R (c, d) ⇒ a + d = b + c
⇒ c + b = d + a

⇒ (c, d) R (a, b).

∴ (a, b) R (c, d) ⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ N × N

This shows that R is symmetric.

iii. Transitivity:
Let (a, b) R (c, d) and (c, d) R (e, f). Then,
(a, b) R (c, d) and (c, d) R (e, f)
⇒ a + d = b + c and c + f = d + e

⇒ a + d + c + f = b + c + d + e

⇒ a + f = b + e

⇒ (a, b ) R (e, f).

Thus, (a, b) R (c, d) and (c, d) R (e, f) ⇒ (a, b) R (e, f)

This shows that R is transitive.
∴ R is reflexive, symmetric and transitive

Hence, R is an equivalence relation on N × N

18. A = R - {3}, B = R - {1}
x−2
f : A → B is defined as f (x) = ( x−3
).

Let x, y ∈ A such that f(x) = f(y).

x−2 y−2
⇒ =
x−3 y−3

⇒ (x - 2) (y - 3) = (y - 2) (x - 3)
⇒ xy - 3x - 2y + 6 = xy - 3y - 2x + 6

⇒ -3x - 2y = -3y - 2x
⇒ 3x - 2x = 3y - 2y

⇒ x = y

Therefore, f is one-one.
Let y ∈ B = R - {1}
Then, y ≠ 1.
The function f is onto if there exists x ∈ A such that f(x) = y.
Now, f (x) = y
x−2
⇒ = y
x−3

⇒ x - 2 = xy - 3y
⇒ x(1 - y) = -3y + 2
2−3y
⇒ x = ∈ A [y ≠ 1]
1−y

2−3y
Thus, for any y ∈ B, there exists 1−y
∈ A such that

6/7
 2−3y
( )−2
2−3y 1−y 2−3y−2+2y −y
f ( ) = = = = y
1−y 2−3y 2−3y−3+3y −1
( )−3
1−y

∴ f is onto.
Hence, function f is one-one and onto.
n − 1, if n is odd
19. Given: f : W → W defined as f (n) = {
n + 1, if n is even

Injectivity: Let n, m be any two odd real numbers, then f(n) = f(m)
⇒ n - 1 = m - 1

⇒ n = m

Again, let n, m be any two even whole numbers, then f(n) = f(m)
⇒ n + 1 = m + 1

⇒ n=m
If n is even and m is odd, then n ≠ m.
Now n is even implies f(n) = n+1 and f(m) = m-1.
Therefore, f(n) ≠ f(m)
Similarly n is odd and m is even gives f (n) ≠ f (m)
Therefore in all cases f is one-one.
Surjectivity: Let n be an arbitrary whole number.
If n is an odd number, then there exists an even whole number (n + 1) such that
f(n + 1) = n + 1 - 1 = n
If n is an even number, then there exists an odd whole number (n - 1) such that
f(n - 1) = n - 1 + 1 = n
Therefore, every n ∈ W has its pre-image in W.
So, f : W → W is a surjective. Thus f is invertible and f-1 exists.
For f-1 : y = n - 1
⇒ n = y + 1 and y = n + 1 ⇒ n = y - 1

n − 1, if n is odd
−1
∴ f (n) = {
n + 1, if n is even

Hence, f-1(y) =y

7/7