Relations and Functions
1. If f: R → R is defined by f{x) = 3x + 2, then define f[f(x)].
2. Show that the relation R on IR defined as R = {(a, b): (a ≤ b)}, is reflexive and
transitive but not symmetric.
3. Check whether the relation R defined on the set A = {1, 2, 3, 4, 5, 6} as R =
{(a, b): b = a + 1} is reflexive, symmetric or transitive.
4. If A = {1, 2, 3}, S = {4, 5,6, 7} and f = {(1, 4), (2, 5), (3, 6)} is a function
from A to B. State whether f is one-one or not.
5. Let R is the equivalence relation in the set A = {0,1, 2, 3, 4, 5} given by R =
{(a, b): 2 divides (a – b)}. Write the equivalence class [0].
6. If f: {1,3, 4} → {1, 2, 5} and g: {1,2, 5} → {1, 3} given by f = {(1,2), (3, 5),
(4,1)} and g = {(1,3), (2, 3), (5,1)}. Write down gof.
7. Prove that the function, f: N → N is defined by f(x) = x2 + x + 1 is one-one but
not onto. Find inverse of f: N → S, where S is range of f.
8. If R is a relation defined on the set of natural numbers N as follows:
R = {(x, y) : x ∈ N, y ∈ N and 2x + y = 24}, then find the domain and range of
the relation R . Also, find whether R is an equivalence relation or not.
9. If A = R – {3} and B = R – {1}. Consider the function f: A → B defined by f(x)
= (x−2) / (x−3) for all x ∈ A. Then, show that f is bijective. Find f-1(x).
10.If A = {1, 2, 3, ... ,9} and R is the relation in A × A defined by (a, b) R (c, d), if
a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation.
Also, obtain the equivalence class [(2, 5)].
Answer:
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)e Ax 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)
So, R is symmetric.
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
(1/2)
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)}.
11.If A = R- {2}, B = R- {1} and f: A → B is a function defined by f(x) = (x−1) /
(x−2), then show that f is one-one and onto. Hence, find f-1.
12.Show that the function f in A = R – {23} defined as f(x) = 4x+36x−4 is one-one
and onto.
13.Show that f: N → N, given by
is bijective (both one-one and onto).
14.If f: R → R is the function defined by f(x) = 4x3 + 7, then show that f is a
bijection.
15.If Z is the set of all integers and R is the relation on Z defined as R = {(a, b):a,b
∈ Z and a – b is divisible by 5}. Prove that R is an equivalence relation.
16.Show that the relation S in the set R of real numbers defined as S – {(a, b): a,b
∈ R and a ≤ b3} is neither reflexive nor symmetric nor transitive.
17.Show that the relation S in set A = {x ∈ Z: 0 ≤ x ≤ 12} given by S = {(a, b): a,
b ∈ |a – b| is divisible by 4} is an equivalence relation. Find the set of all
elements related to 1.
18.Show that a function f: R → R given by f(x) = ax + b, a, b ∈ R, a ≠ 0 is a
bijective.
Answer:
Given function f: R → R is such that f(x) = ax + b, a, b ∈ R, a ≠ 0
One-one function:
Let x1, x2 ∈ S such that
f(x1) = f(x2)
Then, ax1 + b = ax2 + b
⇒ ax1 = ax2
x1 = x2 [∵ a ≠ 0]
Thus, f(x1) = f(x2) ⇒ x1 = x2, ∀ x1, x2 ∈ R
Therefore, f(x) is a one-one function.
Onto function:
Let y ∈ R (codomain) be any arbitrary element.
Then, f(x) = y ⇒ ax + b = y
⇒ x = (y−b) / a
Clearly, x is a real number. [∵ y ∈ R]
Thus, for each y ∈ R (codomain), there exists x = (y−b) / a ∈ R (domain) such that
f(x) = f(y−b)/a = a(y−b)/a) + b = y – b + b = y
Therefore, f(x) is an onto function.
As f(x) is both one-one and onto, so it is a bijective function.
19.Show that the function f: R → R defined by f(x) = x/(x2+1), ∀ x ∈ R is neither
one-one nor onto. Also, if g: R → R is defined as g(x) = 2x – 1, find fog (x).
20.If N denotes the set of all natural numbers and R be the relation on N × N
defined by (a, b) R (c, d), if ad (b + c) = bc (a + d). Show that R is an
equivalence relation.
