Relations and 1

Functions

1. Relation: If A and B are two non-empty sets, then any subset R of A × B is called relation from set A
to set B.
i.e., R:A B R A×B
For example: Let A = {1, 2}, B = {3, 4}
Then A × B = {(1, 3), (1, 4), (2, 3), (2, 4)}
A subset R1 = {(1, 3), (2, 4)} A × B is called relation from A to B.
Similarly, other subsets of A × B are also relation from A to B.
If (x, y) R, then we write x R y (read as x is R related to y) and if (x, y) R, then we write x R y (read
as x is not R related to y).
2. Domain and Range of a Relation: If R is any relation from set A to set B then,
(a) Domain of R R and it is denoted by Dom (R).
(b) Range of R is the set of all second coordinates of R and it is denoted by Range (R).
A relation R on set A means, the relation from A to A i.e., R A × A.
3. Some Standard Types of Relations:
Let A be a non-empty set. Then, a relation R on set A is said to be
(a If (x, x) R for each element x A, i.e., if xRx for each element x A.
(b) Symmetric: If (x, y) R (y, x) R for all x, y A, i.e., if xRy yRx for all x, y A.
(c If (x, y) R and (y, z) R (x, z) R for all x, y, z A, i.e., if xRy and yRz xRz.
Any relation R on a set A is said to be an equivalence relation if R
symmetric and transitive.
5. Antisymmetric Relation: A relation R in a set A is antisymmetric
if (a, b) R, (b, a) R a=b a, b R, or aRb and bRa a = b, a, b R.
For example, the relation “greater than or equal to, “ ” is antisymmetric relation as
a b, b a a=b a, b
[Note: “Antisymmetric” is completely different from not symmetric.]
Let R be an equivalence relation on a non-empty set A. For all a A, the
equivalence class of ‘a A which are related to ‘a’ under
R. It is denoted by [a].
i.e., [a] = equivalence class of ‘a’ = {x A : (x, a) R}
 For example, Let A = {1, 2, 3} and R be the equivalence relation on A given by
R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
The equivalence classes are
[1] = equivalence class of 1 = {x A : (x, 1) R} = {1, 2}
Similarly, [2] = {2, 1} and [3] = {3}
7. Function: Let X and Y be two non-empty sets. Then, a rule f which associates to each element x X, a
unique element, denoted by f(x) of Y, is called a function from X to Y and written as f : X Y where,
f(x) is called image of x and x is called the pre-image of f(x) and the set Y is called the co-domain of
f and f(X) = {f(x): x X} is called the range of f.
8. Types of Function:
(i A function f : X Y
image of distinct element of X under rule f are distinct, i.e., for every x1, x2 X, f(x1) = f(x2)
implies that x1 = x2.
(ii A function f : X Y is said to be onto function if each
element of Y is the image of some element of x i.e., for every y Y x X, such
that y = f(x). Thus f is onto if range of f = co-domain of f.
(iii A function f : X Y is said to be one-one onto, if
f is both one-one and onto.
(iv) Many-one function: A function f : X Y is said to be a many-one function if two or more
elements of set X have the same image in Y. i.e.,
f:X Y a, b X such that a b but f(a) = f(b).
Let f : A B and g : B C be two functions. Then, the composition of
f and g, denoted by gof
f:A!B g:B!C
A B C

x f (x) g(f (x))

gof : A ! C

gof : A C given by
gof(x) = g(f(x)), x A
Clearly, dom(gof ) = dom(f)
Also, gof f) dom(g)
10. Identity Function: Let R be the set of real numbers. A function I : R R such that
I (x) = x x R is called identity function.
Obviously, identity function associates each real number to itself.
For f : A B, g:B A such that gof = IA and fog = IB,
where IA and IB are identity functions, then f is called an invertible function, and g is called the
inverse of f and it is written as f –1 = g.
If X and Y m and n elements respectively then the
number of functions from X to Y is nm.
13. Vertical Line Test: It is used to check whether a relation is a function or not. Under this test, graph of
given relation is drawn assuming elements of domain along x
 ( y – 6) – 3
Let g: S " N is defined by g (y) =
2
(2 x + 3 ) 2 – 3
` gof (x) = g (4x 2 + 12x + 15) = g ((2x + 3) 2 + 6) = =x
2
2

fog (y) = f d n=< + 3F + 6 = y

( y – 6) – 3 2 [( y – 6 ) – 3]
and
2 2

Hence, fog (y) = IS and gof (x) = IN

y – 6 –3
f is invertible and its inverse is given by f –1 (y) = g (y) =
2
9. Let f : R – ' – 1 " R f : R – '– 1 "
4 4x 4
f (x) =
3 3x + 4 3
R – '– 1
4
Range of f f f –1: Range f CBSE 2017(C)]
3
4
Sol. Let x1, x2 R – '– 1
3
4x1 4x2
Now f (x1) = f (x2) & =
3x1 4 3x2 + 4
+
12 x1 x2 + 16 x1 = 12 x1 x2 + 16 x2 16 x1 = 16 x2 x1 = x2
Hence f is one-one function.
Since, co-domain f is range of f
4
So, f : R – ( – 2 R is one-one onto function.
3
For inverse
Let f (x) = y
4x
=y 3xy + 4y = 4x
3x + 4
4y
4x – 3xy = 4y x(4 – 3y) = 4y x=
4 – 3y
4y
Therefore, f –1 : Range of f R – {– 4/3} is f –1 (y) = .
4 – 3y

PROFICIENCY EXERCISE

1.
(i) Let R be a relation on the set N nRm if n divides m. Then R is
(a b) transitive and symmetric
(c) equivalence (d
(ii) Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is
(a (b
(c) symmetric and transitive (d) neither symmetric nor transitive
(iii) If a relation R R = {(1, 2)}, then R is
(a b) transitive (c) symmetric (d) none of these
 (iv) Let f : R f(x) = sin x and g : R g(x) = x2, then fog is
sin x
(a) x2 sin x (b) (sin x)2 (c) sin x2 (d)
x2
(v) Let f : R f(x) = 3x – 4. Then f –1(x) is given by [NCERT Exemplar]
x+4 x
(a) (b) –4 (c) 3x + 4 (d) none of these
3 3
1
(vi) Let f : R f (x) = 6 x d R. Then f is
x
(a) one-one (b) onto (c) bijective (d) f
(vii) Let f : R R be given by f(x) = tan x. Then f –1(1) is

(b) ( nr + : n d Z 2 (c
r r
(a) d) none of these
4 4
(viii) If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B x is greater than y
Then range of R is
(a) {1, 4, 6, 9} (b) {4, 6, 9} (c) {1} (d) none of these
2.
(i) A relation R in a set A is called _____________ relation, if (a1, a2) R implies that (a2, a1) R,
a1, a2 A.
(ii) A relation R on set N R = {(x, y) : x + 2y = 8}. The domain of R is _____________ .
(iii) Let A
and symmetric but not transitive, is _____________ .
x
(iv) Let f : R R f(x) = . Then (fofof) (x) = _____________ .
1 + x2
[NCERT Exemplar]

3. If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation from A to B given by “is less than”, then write R
as a set of ordered pairs.
4. Check whether the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is transitive.
5. If f(x) = x + 7 and g(x) = x – 7, x R fog (7). [CBSE Delhi 2008]
3x – 2
6. If f(x f (x) = . [CBSE (AI) 2008]
5
7. If f(x) = 27x3 and g(x) = x1/3 gof(x). [CBSE (F) 2010]
8. For the set A R in the set A as follows R = {(1, 1), (2, 2), (3, 3), (1, 3)}.
Write the ordered pair to be added to R to make it the smallest equivalence relation.
9. If f : R R f(x) = 3x f [f(x)]. [CBSE (F) 2011]
2 –1
10. If f(x) = x f (x).

11. Let the relation R A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8}. Then write
the set R.
12. Let A R on A as follows:
R {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R
13. For real numbers x and y, a relation R xRy if x – y + 2 is an irrational number. Write
whether R
14. Let the function f : R R f(x) = 4x – 1, x R. Then show that f is one – one.
2x − 1
15. If the function f : R R f ( x) = x R
3
inverse of f.

16. Show that the relation R in the set N × N a, b)R(c, d) iff a2 + d2 = b2 + c2 a, b, c, d N,

is an equivalence relation. [CBSE Sample Paper 2016]
17. Show that the relation S in the set R S = {(a, b): a, b R and a b3} is
[CBSE Delhi 2010]
18. Prove that the relation R in the set A = {1, 2, 3, ..., 12} given by R = {(a, b) : |a – b| is divisible by 3},
is an equivalence relation. Find all elements related to the element 1. [CBSE (F) 2013]
19. Prove that the relation R on the set A = {1, 2, 3, 4, 5, 6, 7} given by R = {(a, b) : |a – b| is even }, is
an equivalence relation. [CBSE 2019 (65/4/2)]
4x + 3 2 2
20. If f (x) = ,x ! then show that fof (x) = x, 6 x ! . What is the inverse of f
6x – 4 3 3
[CBSE (F) 2012]
x
21. If the function f : R R be given by f(x) = x2 + 2 and g : R R be given by g (x) = ,x!1
x–1
fog and gof fog(2) and gof(–3). [CBSE (AI) 2014]
22. Show that the relation R on R = (a, b) : a b
symmetric. [CBSE 2019, (65/1/1)]
23. Let Z be the set of all integers and R be relation on Z R = {(a, b) : a, b Z and (a – b) is
divisible by 5}. Prove that R is an equivalence relation. [CBSE Delhi 2010]
2 4x + 3
24. Show that the function f in A = R −   f ( x) = is one-one and onto. Hence,
3 6x − 4
f –1.
25. Prove that the function f : N N f (x) = x2 + x + 1 is one-one but not onto. Find inverse
of f : N S, where S is range of f. [CBSE 2019, (65/1/1)]

26. Let A = {x Z : 0 x 12}. Show that R = {(a, b) : a, b A, |a – b|is divisible by 4} is an equivalence

relation. Find the set of all elements related to 1. Also write the equivalence class [2].
[CBSE 2018]
27. Let f : N N f(x) = 9x2 + 6x – 5. Show that f : N S, where S is the range
of f f –1 (43) and f –1 (163). [CBSE Delhi 2016]
x
28. Show that the function f : R f (x) = 2 , 6 x d R is neither one-one nor onto.
x +1
Also, if g : R R g(x) = 2x fog(x). [CBSE 2018]
29. Let f : N R f(x) = 4x2 + 12x + 15. Show that f : N S, where S is the
range of f f. [CBSE (F) 2015]
30. Show that the relation R a, b) R (c, d) a + d = b + c on the A × A, where A = {1, 2, 3, ...,
10} is an equivalence relation. Hence write the equivalence class of [(3, 4)]; a, b, c, d A.
[CBSE (East) 2016]
31. Let f : N N f(x) = 4x2 + 12x +15. Show that f : N S is invertible (where
S is range of f). Find the inverse of f f –1(31) and f –1(87). [CBSE (South) 2016]
 32. Let f : W W

f (n) = *
n – 1, if n is odd
n + 1, if n is even
Show that f f. Here, W is the set of all whole numbers.
[CBSE (Panchkula) 2015]
33. If the function f : R f(x) = 2x – 3 and g : R R by g(x) = x3 fog and
fog)–1 fog)–1 (9). [CBSE Sample Paper 2018]

Answers
1. (i) (d) (ii) (a) (iii) (b) (iv) (c) (v) (a) (vi) (d)
(vii) (b) (viii) (c)
x
2. (i) symmetric (ii) {2, 4, 6} (iii) 1 (iv)
3x 2 + 1
5x + 2
3. R = {(3, 4), (3, 9), (5, 9), (7, 9)} 4. No, it is not transitive. 5. 7 6.
3
7. 3x 8. (3, 1) 9. 9x + 8 10. f –1 (x) = x – 4
11. {(1, 1), (1, 2), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3), (3, 4), (4, 3), (4, 4), (5, 5)}
12. 13.
3y + 1 4x + 3
15. f –1 (y) = 18. 1, 4, 7, 10 20. f –1 (x) =
2 6x – 4

3x 2 – 4x + 2 x2 + 2 11 4x + 3 –1 + 4y – 3
21. , x ! 1; 2 ; 6, 24. f –1 (x) = 25. f –1 (y) =
(x–1) 2
x +1 10 6x – 4 2
–1 + x + 6 –1
26. {1, 5, 9}, {2, 6, 10} 27. f –1 (x) = , f (43) = 2, f –1 (163) = 4
3
2x – 1 x–6 –3
28. 29. f –1 (x) =
4x 2 – 4x + 2 2
30. {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 7), (7, 8), (8, 9), (9, 10)}

32. f –1 (x) = )
y – 6 – 3 –1 x + 1, if x is odd
31. f –1 (y) = , f (31) = 1, f –1 (87) = 3
2 x – 1, if x is even
1

33. fog (x) = 2x 3 + 7, (fog) –1 (x) = c m , (fog) –1 (9) = 1

x–7 3
2