Mind map : learning made simple Chapter - 1

The composition of functions f : A → B A relation R : A → A is empty

}
and g : B → C is denoted by gof, and is if a R b ∀ a, b∈ A. R = φ ⊂ A ×A.
defined as gof : A → C given by gof(x) = For eg : R = {(a,b) : a = b2}, A = {1,5,10}
Trivial
g(f(x)) ∀x∈A. e.g. let A = N and f, g :
A relation R : A → A is universal Relations
N → N such that f(x) = x2 and g(x) = x3
if a R b ∀, a,b ∈ A,R = A × A.
∀ x∈N. Then gof(2) = g(f(2)) = g(2 ) 2

3
if R = φ, then R is universal.
= 4 = 64.
A relation R : A → A is
A function f : x → y is invertible, if ∃ a function reflexive if aRa ∀ a∈A
g : y → x such that gof = Ix and fog = Iy. Then,
g is the inverse of f. If f is invertible, then it is both +
one-one and onto and vice-versa. For eg. If f(x) = A relation R : A → A is symmetric
x and f : N → N , then f is invertible. if aRb ⇒ bRa ∀ a, b∈A
Theorem 1 : If f : x → y, g : y → z and h : z → s +
are functions, then ho(got) = (hog)of. A relation R : A × A is transitive
Theorem 2 : Let f : x → y and g : y → z be two if aRb, bRc ⇒ aRc ∀ a,b,c ∈A.
invertible functions, then gof is invertible and
–1 –1 –1
Relations
(gof) = f o g . and Functions
Equivalence relation
(reflexive, symmetric, transitive e.g.,
Let T = the set of all triangles in a
plane and R : T → T defined by
R = {(T1, T2)} : T1 is congruent to T2}.
A binary operation '*' on a set A is a function Then, R is equivalence.
* : A × A → A denoted by a * b i.e. ∀
a,b,∈ A, a * b ∈ A. Commutative if a * b = b f : x → y is one-one if f : x → y is onto it for energy f : x → y is both one-one
* a ∀ a,b ∈ A. Associative if (a * b) * c = a f(x1) = f(x2) ⇒ x1 = x2 y ∈ Y, ∃ x∈X S.t. f(x) = y, f2 is onto. and onto, then f is bijective.
* (b * c) ∀a,b,∈A. e∈A is identity if a * e = a ∀ x1, x2 ∈ x. Other wise, f3 is bijective.
= e * a ∀a∈A. and b ∈ A is the inverse f is many- one, f1 is one-one.
of a ∈ A, if. a * b = e = b * a. Addition is a f1 f2 f3
1 a a 1 a
binary operation on the set of integers. b
1
2
2 2 b
cd 3 b 3 c
3
 Chapter 1 - Relations and Functions
Definitions:
Let A and B be two non-empty sets, then a function f from set A to set B is a rule which associates
each element of A to a unique element of B.
o Relation
If (a, b) ∈ R, we say that a is related to b under the relation R and we write as a R b
o Function
It is represented as f: A → B and function is also called mapping.
o Real Function
f: A → B is called a real function, if A and B are subsets of R.
o Domain and Codomain of a Real Function
Domain and codomain of a function f is a set of all real numbers x for which f(x) is a real
number. Here, set A is domain and set B is codomain.
o Range of a real function
f is a set of values f(x) which it attains on the points of its domain
Types of Relations
o A relation R in a set A is called Empty relation, if no element of A is related to any element of
A, i.e., R = φ ⊂ A × A.
o A relation R in a set A is called Universal relation, if each element of A is related to every
element of A, i.e., R = A × A.
o Both the empty relation and the universal relation are sometimes called Trivial Relations
o A relation R in a set A is called
▪ Reflexive
▪ if (a, a) ∈ R, for every a ∈ A,
▪ Symmetric
▪ If (a1, a2) ∈ R implies that (a2, a1) ∈ R, for all a1, a2∈ A.
▪ Transitive
▪ If (a1, a2) ∈ R and (a2, a3) ∈ R implies that (a1, a3) ∈ R, for all a1, a2, a3 ∈ A.

o A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and

transitive
o The set E of all even integers and the set O of all odd integers are subsets of Z satisfying following
conditions:
▪ All elements of E are related to each other and all elements of O are related to each other.
▪ No element of E is related to any element of O and vice-versa.
▪ E and O are disjoint and Z = E ∪ O.
▪ The subset E is called the equivalence class containing zero, Denoted by [0].
▪ O is the equivalence class containing 1 and is denoted by [1].
o Note
▪ [0] ≠ [1]
▪ [0] = [2r]
▪ [1] = [2r + 1], r ∈ Z.

o Given an arbitrary equivalence relation R in an arbitrary set X, R divides X into mutually disjoint
subsets Ai called partitions or subdivisions of X satisfying:
▪ All elements of Ai are related to each other, for all i.
▪ No element of Ai is related to any element of Aj, i ≠ j.
▪ ⋃ Aj = X and Ai ∩ Aj = φ, i ≠ j.
o The subsets Ai are called equivalence classes.
Note:
o Two ways of representing a relation
▪ Roaster method
▪ Set builder method
o If (a, b) ∈ R, we say that a is related to b and we denote it as a R b.

Types of Functions
Consider the functions f1, f2, f3 and f4 given

• A function f: X → Y is defined to be one-one (or injective), if the images of distinct elements

of X under f are distinct, i.e., for every x1, x2 ∈ X, f(x1) = f(x2) implies x1 = x2. Otherwise, f is called
many-one.
Example
o One- One Function

o Many-One Function

• A function f: X → Y is said to be onto (or surjective), if every element of Y is the image of some
element of X under f, i.e., for every y ∈ Y, there exists an element x in X such that f(x) = y.
 o f: X → Y is onto if and only if Range of f = Y.
o Eg:

• A function f: X → Y is said to be one-one and onto (or bijective), if f is both one-one and
onto.
o Eg:

Composition of Functions and Invertible Function

Composite Function
• Let f: A → B and g: B → C be two functions.
• Then the composition of f and g, denoted by g o f, is defined as the function g o f: A → C given by
g o f(x) = g (f(x)), ∀ x ∈ A.

• Eg:
o Let f : {2, 3, 4, 5} → {3, 4, 5, 9} and g : {3, 4, 5, 9} → {7, 11, 15} be functions
o Defined as f (2) = 3, f (3) = 4, f (4) = f (5) = 5 and g (3) = g (4) = 7 and g (5) = g (9) = 11.
o Find g o f.
o Solution
▪ g o f(2) = g (f(2)) = g (3) = 7,
▪ g o f (3) = g (f(3)) = g (4) = 7,
▪ g o f (4) = g (f(4)) = g (5) = 11 and
▪ g o f (5) = g (5) = 11

• It can be verified in general that gof is one-one implies that f is one-one. Similarly, gof is onto
implies that g is onto.
• While composing f and g, to get gof, first f and then g was applied, while in the reverse process of
the composite gof, first the reverse process of g is applied and then the reverse process of f.
• If f: X → Y is a function such that there exists a function g: Y → X such that gof = IX and fog =
IY, then f must be one-one and onto.
Invertible Function
• A function f: X → Y is defined to be invertible, if there exists a function g: Y → X such that gof =
IX and fog = IY. The function g is called the inverse of f
• Denoted by f–1.

• Thus, if f is invertible, then f must be one-one and onto and conversely, if f is one-one and onto,
then f must be invertible.

Theorem 1
• If f : X → Y, g : Y → Z and h : Z → S are functions, then
o h o (g o f) = (h o g) o f.
• Proof
We have
o h o (g o f) (x) = h(g o f (x)) = h(g(f(x))), ∀ x in X
o (h o g) o f (x) = h o g (f(x)) = h (g (f(x))), ∀ x in X.

Hence, h∘ (g∘f) = (h∘g) ∘ f

Theorem 2
• Let f: X → Y and g: Y → Z be two invertible functions.
o Then gof is also invertible with (g o f)-1 = f -1 o g-1
• Proof
o To show that gof is invertible with (g o f)-1 = f -1 o g-1, it is enough to show that
(f -1 o g-1) o (g o f) = IX and (g o f) o (f -1 o g-1) = IZ.
Now, (f–1 o g–1) o (g o f) = ((f–1 o g–1) o g) of, by Theorem 1
= (f -1 o (g -1 o g)) of, by Theorem 1
= (f-1 o IY) of, by definition of g–1
= IX
Similarly, it can be shown that (g o f) o (f-1 o g-1) = IZ
Binary Operations
Definitions:
• A binary operation ∗ on a set A is a function ∗ : A × A → A. We denote ∗ (a, b) by a ∗ b.
• A binary operation ∗ on the set X is called commutative, if a ∗ b = b ∗ a, for every a, b ∈ X
• A binary operation ∗ : A × A → A is said to be associative if (a ∗ b) ∗ c = a ∗ (b ∗ c), ∀ a, b, c, ∈ A.
• A binary operation ∗ : A × A → A, an element e ∈ A, if it exists, is called identity for the
operation ∗, if a ∗ e = a = e ∗ a, ∀ a ∈ A.
▪ Zero is identity for the addition operation on R but it is not identity for the addition
operation on N, as 0 ∉ N.
▪ Addition operation on N does not have any identity.
▪ For the addition operation + : R × R → R, given any a ∈ R, there exists – a in R such that
a + (– a) = 0 (identity for ‘+’) = (– a) + a.
1
▪ For the multiplication operation on R, given any a ≠ 0 in R, we can choose 𝑎 such that a
1 1
X 𝑎 = 1 (identity for ‘×’) = 1 = 𝑎 X a
• A binary operation ∗ : A × A → A with the identity element e in A, an element a ∈ A is said to be
invertible with respect to the operation ∗, if there exists an element b in A such that a ∗ b = e =
b ∗ a and b is called the inverse of a and is denoted by a-1
 Relations & Functions
Study Notes

EXERCISE

SHORT ANSWER TYPE QUESTIONS

Q1. Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}
Then, write minimum number of ordered pairs to be added in
R to make R reflexive and transitive.
Sol. Here, R = {(a, a), (b, c), (a, b)}
for reflexivity; (b, b), (c, c) and for transitivity; (a, c)
Hence, the required ordered pairs are (b, b), (c, c) and (a, c)
Q2. Let D be the domain of the real valued function f defined by
f(x) = 25 - x 2 . Then write D.
Sol. Here, f(x) = 25 - x 2
For real value of f(x), 25 – x2  0
 – x2  – 25  x2  25  – 5  x  5


Hence, D  – 5 ≤ x ≤ 5 or [– 5, 5]
Q3. Let f, g : R  R be defined by f(x) = 2x + 1 and g(x) = x2 – 2 
x R, respectively. Then find gof.
Sol. Here, f(x) = 2x + 1 and g(x) = x2 – 2
\ gof = g[f(x)]

= [2x + 1]2 – 2 = 4x2 + 4x + 1 – 2 = 4x2 + 4x – 1

Hence, gof = 4x2 + 4x – 1

Q4. Let f : R  R be the function defined by f(x) = 2x – 3  x R.
Write f – 1.
Sol. Here, f(x) = 2x – 3
Let f(x) = y = 2x – 3

y+3
 y + 3 = 2x  x =
2

y+3 x+3
\ f – 1(y) = or f – 1(x) =
2 2
Q5. If A = {a, b, c, d} and the function f = {(a, b), (b, d), (c, a), (d, c)},
write f– 1.
Sol. Let y = f(x) \ x = f – 1(y)
\ If f = {(a, b), (b, d), (c, a), (d, c)}

then f – 1 = {(b, a), (d, b), (a, c), (c, d)}

1
 Q6. If f : R  R is defined by f(x) = x2 – 3x + 2, write f [f(x)].
Sol. Here, f(x) = x2 – 3x + 2
\ f [f(x)] = [f(x)]2 – 3f(x) + 2

= (x2 – 3x + 2)2 – 3(x2 – 3x + 2) + 2

= x4 + 9x2 + 4 – 6x3 + 4x2 – 12x – 3x2 + 9x – 6 + 2

= x4 – 6x3 + 10x2 – 3x

Hence, f [f(x)] = x4 – 6x3 + 10x2 – 3x

Q7. Is g = {(1, 1), (2, 3), (3, 5), (4, 7)} a function? If g is described by
g(x) = ax + b, then what value should be assigned to a and b?
Sol. Yes, g = {(1, 1), (2, 3), (3, 5), (4, 7)} is a function.
Here, g(x) = ax + b

For (1, 1), g(1) = a.1 + b
1 = a+b ...(1)
For (2, 3), g(2) = a.2 + b
3 = 2a + b ...(2)
Solving eqs. (1) and (2) we get, a = 2, b = – 1

Q8. Are the following set of ordered pairs functions? If so, examine
whether the mapping is injective or surjective.
(i) {(x, y) : x is a person, y is the mother of x}
(ii) {(a, b) : a is a person, b is an ancestor of a}
Sol. (i) It represents a function. The image of distinct elements of
x under f are not distinct. So, it is not injective but it is
surjective.
(ii) It does not represent a function as every domain under
mapping does not have a unique image.
Q9. If the mapping f and g are given by
f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)} write fog.

Sol. fog = f [g(x)]

= f [g(2)] = f(3) = 5

= f [g(5)] = f(1) = 2

= f [g(1)] = f(3) = 5

Hence, fog = {(2, 5), (5, 2), (1, 5)}

Q10. Let C be the set of complex numbers. Prove that the mapping
f : C  R given by f(z) = |z|,  z C, is neither one-one nor onto.
Sol. Here, f(z) = |z|  z C
f(1) = |1| = 1
f(– 1) = |– 1| = 1
f(1) = f(– 1)
But 1  –1
Therefore, it is not one-one.

2
 Now, let f(z) = y = |z|. Here, there is no pre-image of negative
numbers. Hence, it is not onto.
Q11. Let the function f : R  R be defined by f(x) = cos x,  x R.
Show that f is neither one-one nor onto.
Sol. Here, f(x) = cos x  x R
È p p˘
Let Í - 2 , 2 ˙  f(x)
Î ˚

Ê pˆ Ê pˆ p
f Á - ˜ = cos Á - ˜ = cos = 0
Ë 2¯ Ë 2¯ 2
Ê pˆ p
cos Á ˜ = cos = 0
Ë 2¯ 2
Ê pˆ Ê pˆ
f Á- ˜ = f Á ˜ = 0
Ë 2¯ Ë 2¯
p p
But - 
2 2
Therefore, the given function is not one-one. Also it is not
onto function as no pre-image of any real number belongs to
the range of cos x i.e., [– 1, 1].
Q12. Let X = {1, 2, 3} and Y = {4, 5}. Find whether the following
subsets of X × Y are functions from X to Y or not.
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)}
(ii) g = {(1, 4), (2, 4), (3, 4)}
(iii) h = {(1, 4), (2, 5), (3, 5)}
(iv) k = {(1, 4), (2, 5)}
Sol. Here, given that X = {1, 2, 3}, Y = {4, 5}
\ X × Y = {(1, 4), (1, 5), (2, 4), (2, 5), (3, 4), (3, 5)}

(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)}
f is not a function because there is no unique image of

each element of domain under f.
(ii) g = {(1, 4), (2, 4), (3, 4)}
Yes, g is a function because each element of its domain
has a unique image.
(iii) h = {(1, 4), (2, 5), (3, 5)}
Yes, it is a function because each element of its domain has a
unique image.
(iv) k = {(1, 4), (2, 5)}
Clearly k is also a function.

3
 Q13. If function f : A  B and g : B  A satisfy gof = IA, then show
that f is one-one and g is onto.
Sol. Let x1, x2  gof
gof {f(x1)} = gof {f(x2)}
 g(x1) = g(x2) [ gof = IA]

\ x1 = x2

Hence, f is one-one. But g is not onto as there is no pre-image

of A in B under g.
1
Q14. Let f : R  R be the function defined by f(x) = ,
2 - cos x
 x R. Then, find the range of f.
1
Sol. Given function is f(x) = ,  x R.
2 - cos x
Range of cos x is [– 1, 1]
1
Let f(x) = y =
2 - cos x

 2y – y cos x = 1  y cos x = 2y – 1

2y - 1 1
 cos x = =2-
y y

Now – 1  cos x  1
 –1  2- 1 1  –1–2 - 1 1–2
y y

1 1 1
 –3  - –1  3 1  y1
y y 3

1 
Hence, the range of f =  , 1  .
3 
Q15. Let n be a fixed positive integer. Define a relation R in Z as
follows  a, b Z, a R b if and only if a – b is divisible by n.
Show that R is an equivalence relation.
Sol. Here,  a, b Z and a R b if and only if a – b is divisible by n.
The given relation is an equivalence relation if it is reflexive,
symmetric and transitive.
(i) Reflexive:
a R a  (a – a) = 0 divisible by n

So, R is reflexive.
(ii) Symmetric:
a R b = b R a  a, b Z

a – b is divisible by n (Given)

 – (b – a) is divisible by n

4
  b – a is divisible by n

bRa

Hence, R is symmetric.
(iii) Transitive:
a R b and b R c  a R c  a, b, c Z

a – b is divisible by n

b – c is also divisible by n

 (a – b) + (b – c) is divisible by n

 (a – c) is divisible by n

Hence, R is transitive.
So, R is an equivalence relation.

of being.
(a) reflexive, transitive but not symmetric.
(b) symmetric but neither reflexive nor transitive
(c) reflexive, symmetric and transitive.
Sol. Given that A = {1, 2, 3, 4}
\ ARA = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (1, 3), (1, 4), (2, 3),

(2, 4), (3, 4), (2, 1), (3, 1), (4, 1), (3, 2), (4, 2), (4, 3)}

(a) Let R1 = {(1, 1), (2, 2), (1, 2), (2, 3), (1, 3)}
So, R1 is reflexive and transitive but not symmetric.
(b) Let R2 = {(2, 3), (3, 2)}
So, R2 is only symmetric.
(c) Let R3 = {(1, 1), (1, 2), (2, 1), (2, 4), (1, 4)}
So, R3 is reflexive, symmetric and transitive.

Q17. Let R be relation defined on the set of natural number N as
follows:
R = {(x, y) : x  N, y  N, 2x + y = 41}. Find the domain and
range of the relation R. Also verify whether R is reflexive,
symmetric and transitive.
Sol. Given that x  N, y  N and 2x + y = 41
\ Domain of R = {1, 2, 3, 4, 5, ..., 20}

and Range = {39, 37, 35, 33, 31, ..., 1}
Here, (3, 3)  R
as 2 × 3 + 3  41
So, R is not reflexive.
R is not symmetric as (2, 37)  R but (37, 2)  R
R is not transitive as (11, 19)  R and (19, 3)  R
but (11, 3)  R.
Hence, R is neither reflexive, nor symmetric and nor transitive.

5
 Q18. Given A = {2, 3, 4}, B = {2, 5, 6, 7}, construct an example of each
of the following:
(i) an injective mapping from A to B.
(ii) a mapping from A to B which is not injective
(iii) a mapping from B to A.
Sol. Here, A = {2, 3, 4} and B = {2, 5, 6, 7}
(i) Let f : A  B be the mapping from A to B
f = {(x, y) : y = x + 3}

\ f = {(2, 5), (3, 6), (4, 7)} which is an injective mapping.

(ii) Let g : A  B be the mapping from A  B such that
g = {(2, 5), (3, 5), (4, 2)} which is not an injective mapping.

(iii) Let h : B  A be the mapping from B to A
h = {(y, x) : x = y – 2}

h = {(5, 3), (6, 4), (7, 3)} which is the mapping from B to A.

Q19. Give an example of a map
(i) which is one-one but not onto.
(ii) which is not one-one but onto.
(iii) which is neither one-one nor onto.
Sol. (i) Let f : N  N given by f(x) = x2
2 2
Let x1, x2  N then f(x1) = x1 and f(x2) = x2


Now, f(x1) = f(x2)  x12 = x22  x12 - x22 = 0
 (x1 + x2) (x1 – x2) = 0
Since x1, x2  N, so x1 + x2 = 0 is not possible.


\ x1 – x2 = 0  x1 = x2

\ f(x1) = f(x2)  x1 = x2

So, f(x) is one to one function.

Now, Let f(x) = 5  N
then x2 = 5  x = ± 5 œ N

So, f is not onto.

Hence, f(x) = x2 is one-one but not onto.

Ïn + 1
Ô 2 if n is odd
(ii) Let f : N × N, defined by f(n) = Ì n
Ô if n is even
Ó 2
Since f(1) = f(2) but 1  2,

So, f is not one-one.

Now, let y  N be any element.
Then f(n) = y

n+1 ¸
if n is odd Ô
 n 2 ˝ =y
if n is even Ô

2 ˛

6
  n = 2y – 1 if y is even

n = 2y if y is odd or even



{
n = 2 y - 1 if y is even
2 y if y is odd or even
NyN

\ Every y  N has pre-image

{

n = 2 y - 1 if y is even N
2 y if y is odd or even
\ f is onto.

Hence, f is not one-one but onto.

(iii) Let f : R  R be defined as f(x) = x2
Let x1 = 2 and x2 = – 2
2 2
f(x1) = x1 = (2) = 4
2 2
f(x2) = x2 = ( - 2) = 4
f(2) = f(– 2) but 2  – 2
So, it is not one-one function.
Let f(x) = – 2  x2 = – 2 \ x = ± - 2 œ R

Which is not possible, so f is not onto.
Hence, f is neither one-one nor onto.

Q20. Let A = R – {3}, B = R – {1}. Let f : A  B be defined by
f(x) = x - 2 ,  x  A. Then, show that f is bijective.
x-3
Sol. Here, A  R – {3}, B = R – {1}
x-2
Given that f : A  B defined by f(x) =  x  A.
x-3
Let x1, x2  f(x)

\ f(x1) = f(x2)

x1 - 2 x2 - 2
 =
x1 - 3 x2 - 3

 (x1 – 2) (x2 – 3) = (x2 – 2) (x1 – 3)

 x1x2 – 3x1 – 2x2 + 6 = x1x2 – 3x2 – 2x1 + 6

 – x1 = – x2  x1 = x2

So, it is injective function.
x-2
Now, Let y=
x-3
 xy – 3y = x – 2  xy – x = 3y – 2

3y - 2
 x(y – 1) = 3y – 2 x=
y -1

7
 3y - 2
-2
x-2 y -1 3y - 2 - 2 y + 2
f(x) = =   y
x-3 3y - 2 3 y - 2 - 3 y + 3
-3
y -1
 f(x) = y  B.

So, f(x) is surjective function.
Hence, f(x) is a bijective function.

Q21. Let A = [– 1, 1], then discuss whether the following functions
defined on A are one-one, onto or bijective.
x
(i) f(x) = (ii) g(x) = |x| (iii) h(x) = x |x| (iv) k(x) = x2
2
Sol. (i) Given that – 1  x  1
Let x1, x2  f(x) 1 1
f(x1) = and f(x2) =
x1 x

1 1 2
f(x1) = f(x2)  =  x1 = x2
x1 x2

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

x
Let f(x) = y =  x = 2y
2

For y = 1, x = 2  [– 1, 1]

So, f(x) is not onto. Hence, f(x) is not bijective function.

(ii) Here, g(x) = |x|
g(x1) = g(x2)  |x1| = |x2|  x1 = ± x2
So, g(x) is not one-one function.

Let g(x) = y = |x|  x = ± y  A y  A

"
So, g(x) is not onto function.

Hence, g(x) is not bijective function.

(iii) Here, h(x) = x|x|
h(x1) = h f(x2)
 x1|x1| = x2|x2|  x1 = x2

So, h(x) is one-one function.

Now, let h(x) = y = x|x| = x2 or – x2
 x = ± - y œA " y ŒA

\ h(x) is not onto function.

Hence, h(x) is not bijective function.

(iv) Here, k(x) = x2
­
k(x1) = k(x2)
2
 x12 = x2  x1 = ± x2


So, k(x) is not one-one function.

Now, let k(x) = y = x2  x = ± y

8
 If y = – 1  x = ± - 1 œ A " y Œ A
\ k(x) is not onto function.

Hence, k(x) is not a bijective function.

Q22. Each of the following defines a relation of N
(i) x is greater than y, x, y  N
(ii) x + y = 10, x, y  N
(iii) xy is square of an integer x, y  N
(iv) x + 4y = 10, x, y  N.
Determine which of the above relations are reflexive, symmetric
and transitive.
Sol. (i) x is greater than y, x, y  N
For reflexivity x > x  x  N which is not true
So, it is not reflexive relation.
Now, x > y but y >/ x  x, y  N
 x R y but y R x

So, it is not symmetric relation.
For transitivity, x R y, y R z  x R z  x, y, z  N

 x > y, y > z  x > z
So, it is transitive relation.
(ii) Here, R = {(x, y) : x + y = 10  x, y  N}
R = {(1, 9), (2, 8), (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)}
For reflexive: 5 + 5 = 10, 5 R 5  (x, x)  R
So, R is reflexive.
For symmetric: (1, 9)  R and (9, 1)  R
So, R is symmetric.
For transitive: (3, 7)  R, (7, 3)  R but (3, 3)  R
So, R is not transitive.
(iii) Here, R = {(x, y) : xy is a square of an integer, x, y  N}
For reflexive: x R x = x . x = x2 is an integer
[ Square of an integer is also an integer]

So, R is reflexive.
For symmetric: x R y = y R x  x, y  N
\ xy = yx (integer)

So, it is symmetric.
For transitive: x R y and y R z  x R z
Let xy = k2 and yz = m2

k2 m2
x= and z =
y y
k 2 m2
\ xz = which is again a square of an integer.
y2

So, R is transitive.

9
 (iv) Here, R = {(x, y) : x + 4y = 10, x, y  N}
R = {(2, 2), (6, 1)}
For reflexivity: (2, 2)  R
So, R is reflexive.
For symmetric: (x, y)  R but (y, x)  R
(6, 1)  R but (1, 6)  R
So, R is not symmetric.
For transitive: (x, y)  R but (y, z)  R and (x, z)  R
So, R is not transitive.
Q23. Let A = {1, 2, 3, ..., 9} and R be 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 and also obtain equivalent class [(2, 5)].
Sol. Here, A = {1, 2, 3, ..., 9}
and R  A × A defined by (a, b) R (c, d)  a + d = b + c
 (a, b), (c, d)  A × A

For reflexive: (a, b) R (a, b) = a + b = b + a  a, b  A which is
true. So, R is reflexive.
For symmetric: (a, b) R (c, d) = (c, d) R (a, b)
L.H.S. a+d = b+c
R.H.S. c+b = d+a
L.H.S. = R.H.S. So, R is symmetric.
For transitive: (a, b) R (c, d) and (c, d) R (e, f)  (a, b) R (e, f)
 a + d = b + c and c + f = d + e

 a + d = b + c and d + e = c + f

 (a + d) – (d + e) = (b + c) – (c + f)

 a–e = b–f

 a+f = b+e

 (a, b) R (e, f)

So, R is transitive.
Hence, R is an equivalence relation.
Equivalent class of {(2, 5)} is {(1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9)}
Q24. Using the definition, prove that the function f : A  B is
invertible if and only if f is both one-one and onto.
Sol. A function f : X  Y is said to be invertible if there exists a
function g : Y  X such that gof = IX and fog = IY and then the
inverse of f is denoted by f –1.
A function f : X  Y is said to be invertible iff f is a bijective
function.
Q25. Function f, g : R  R are defined, respectively, by f(x) = x2 + 3x + 1,
g(x) = 2x – 3, find
(i) fog (ii) gof (iii) fof (iv) gog
Sol. (i) fog  f[g(x)] = [g(x)]2 + 3[g(x)] + 1

10
 = (2x – 3)2 + 3(2x – 3) + 1

= 4x2 + 9 – 12x + 6x – 9 + 1 = 4x2 – 6x + 1

(ii) gof  g[f(x)] = 2[x2 + 3x + 1] – 3
= 2x2 + 6x + 2 – 3 = 2x2 + 6x – 1

(iii) 2
fof  f[f(x)] = [f(x)] + 3[f(x)] + 1
= (x2 + 3x + 1)2 + 3(x2 + 3x + 1) + 1

= x4 + 9x2 + 1 + 6x3 + 6x + 2x2 + 3x2 + 9x + 3 + 1

= x4 + 6x3 + 14x2 + 15x + 5

(iv) gog  g[g(x)] = 2[g(x)] – 3 = 2(2x – 3) – 3 = 4x – 6 – 3 = 4x – 9

Q26. Let * be the binary operation defined on Q. Find which of the
following binary operations are commutative.
(i) a * b = a – b  a, b  Q (ii) a * b = a2 + b2  a, b  Q
(iii) a * b = a + ab  a, b  Q (iv) a * b = (a – b)2  a, b  Q
Sol. (i) a * b = a – b  Q  a, b  Q.
So, * is binary operation.

a * b = a – b and b * a = b – a  a, b  Q

a–b  b–a
So, * is not commutative.

(ii) a * b = a2 + b2  Q, so * is a binary operation.
a*b = b*a
 a2 + b2 = b2 + a2  a, b  Q

Which is true. So, * is commutative.
(iii) a * b = a + ab  Q, so * is a binary operation.
a * b = a + ab and b * a = b + ba
a + ab  b + ba  a * b  b * a  a, b  Q.

So, * is not commutative.

(iv) a * b = (a – b)2  Q, so * is binary operation.
a * b = (a – b)2 and b * a = (b – a)2

a * b = b * a  (a – b)2 = (b – a)2  a, b  Q.

So, * is commutative.
Q27. If * be binary operation defined on R by a * b = 1 + ab  a, b  R.
Then, the operation * is
(i) commutative but not associative
(ii) associative but not commutative
(iii) neither commutative nor associative
(iv) both commutative and associative
Sol. (i): Given that
a * b = 1 + ab  a, b  R
and b * a = 1 + ba  a, b  R

a * b = b * a = 1 + ab
So, * is commutative.

Now a * (b * c) = (a * b) * c  a, b, c  R

11
 L.H.S. a * (b * c) = a * (1 + bc) = 1 + a(1 + bc) = 1 + a + abc
R.H.S. (a * b) * c = (1 + ab) * c = 1 + (1 + ab) . c = 1 + c + abc
L.H.S.  R.H.S.
So, * is not associative.

Hence, * is commutative but not associative.

OBJECTIVE TYPE QUESTIONS
Choose the correct answer out of the given four options in each of
the Exercises from 28 to 47 (M.C.Q.)
Q28. Let T be the set of all triangles in the Euclidean plane and let
a relation R on T be defined as a R b, if a is congruent to b,  a,
b  T. Then R is
(a) Reflexive but not transitive
(b) Transitive but not symmetric
(c) Equivalence
(d) None of these
Sol. If a @ b  a, b  T
then a R a  a @ a which is true for all a T

So, R is reflexive.
Now, a R b and b R a.

i.e., a @ b and b @ a which is true for all a, b  T
So, R is symmetric.
Let a R b and b R c.
 a @ b and b @ a  a @ c  a, b, c  T

So, R is transitive.
Hence, R is equivalence relation.
So, the correct answer is (c).
Q29. Consider the non-empty set consisting of children in a family
and a relation R defined as a R b, if a is brother of b. Then R is
(a) symmetric but not transitive
(b) transitive but not symmetric
(c) neither symmetric nor transitive
(d) both symmetric and transitive
Sol. Here, a R b  a is a brother of b.
a R a  a is a brother of a which is not true.

So, R is not reflexive.
a R b  a is a brother of b.

b R a  which is not true because b may be sister of a.

 aRbbRa

So, R is not symmetric.
Now, a R b, b R c  a R c

 a is the brother of b and b is the brother of c.

\ a is also the brother of c.

12
 So, R is transitive.
Hence, correct answer is (b).

Q30. The maximum number of equivalence relations on the set
A = {1, 2, 3} are
(a) 1 (b) 2 (c) 3 (d) 5
Sol. Here, A = {1, 2, 3}
The number of equivalence relations are as follows:
R1 = {(1, 1), (1, 2), (2, 1), (2, 3), (1, 3)}

R2 = {(2, 2), (1, 3), (3, 1), (3, 2), (1, 2)}

R3 = {(3, 3), (1, 2), (2, 3), (1, 3), (3, 2)}

Hence, correct answer is (d)

Q31. If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then
R is
(a) reflexive (b) transitive
(c) symmetric (d) None of these
Sol. Given that: R = {(1, 2)}
a R a , so it is not reflexive.

a R b but b R a , so it is not symmetric.

a R b and b R c  a R c which is true.

So, R is transitive.
Hence, correct answer is (b).
Q32. Let us define a relation R in R as a R b if a  b. Then R is
(a) an equivalence relation
(b) reflexive, transitive but not symmetric
(c) symmetric, transitive but not reflexive
(d) neither transitive nor reflexive but symmetric.
Sol. Here, a R b if a  b
 a R a  a  a which is true, so it is reflexive.

Let a R b  a  b, but b ≥ a , so b R a

R is not symmetric.
Now, a  b, b  c  a  c which is true.
So, R is transitive.
Hence, correct answer is (b).
Q33. 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) reflexive but not symmetric
(b) reflexive but not transitive
(c) symmetric and transitive
(d) neither symmetric nor transitive.
Sol. Given that: R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}

13
 Here, 1 R 1, 2 R 2 and 3 R 3, so R is reflexive.
1 R 2 but 2 R 1 or 2 R 3 but 3 R 2 , so, R is not symmetric.
1 R 1 and 1 R 2  1 R 3, so, R is transitive.
Hence, the correct answer is (a).
Q34. The identity element for the binary operation * defined on
ab
Q ~ {0} as a * b =  a, b  Q ~ {0} is
2
(a) 1 (b) 0 (c) 2 (d) None of these
ab
Sol. Given that: a * b =  a, b  Q – {0}
2
Let e be the identity element

ae
\ a*e = =ae=2
2

Hence, the correct answer is (c).

Q35. If the set A contains 5 elements and set B contains 6 elements,
then the number of one-one and onto mapping from A to B is
(a) 720 (b) 120 (c) 0 (d) None of these
Sol. If A and B sets have m and n elements respectively, then the
number of one-one and onto mapping from A to B is
n! if m = n
and 0 if m  n
Here, m = 5 and n = 6
56
So, number of mapping = 0
Hence, the correct answer is (c).

Q36. Let A = {1, 2, 3, ..., n} and B = {a, b}. Then the number of
surjections from A to B is
(a) nP2 (b) 2n – 2 (c) 2n – 1 (d) None of these
Sol. Here, A = {1, 2, 3, ..., n} and B = {a, b}
Let m be the number of elements of set A

and n be the number of elements of set B

\ Number of surjections from A to B is

nC × m! as n  m
m

Here, m = 2 (given)

\ Number of surjections from A to B = nC2 × 2!

n! n(n - 1)(n - 2)!
= ¥ 2! = ¥ 2 = n(n – 1) = n2 – n
2!(n - 2)! 2!( n - 2)!

Hence, the correct answer is (d).
1
Q37. Let f : R  R be defined by f(x) = ,  x  R then f is
x
(a) one-one (b) onto

14
 (c) bijective (d) f is not defined

Sol. Given that f(x) =

1
x
1
Put x = 0 \ f(x) = =
0
So, f(x) is not defined.
Hence, the correct answer is (d).
Q38. Let f : R  R be defined by f(x) = 3x2 – 5 and g : R → R by
x
g(x) = 2 , then gof is
x +1
3x2 - 5 3x2 - 5
(a) (b)
9 x 4 - 30 x 2 + 26 9 x 4 - 6 x 2 + 26
3x 2 3x2
(c) 4 (d)
x + 2x2 - 4 9 x 4 + 30 x 2 - 2
Sol. Here, f(x) = 3x2 – 5 and g(x) =
x
2
x +1
\ gof = gof (x) = g[3x2 – 5]

3x2 - 5 3x2 - 5
= =
(3x 2 - 5)2 + 1 9 x 4 + 25 - 30 x 2 + 1

3x2 - 5
\ gof =
9 x 4 - 30 x 2 + 26

Hence, the correct answer is (a).
Q39. Which of the following functions from Z to Z are bijections?
(a) f(x) = x3 (b) f(x) = x + 2
(c) f(x) = 2x + 1 (d) f(x) = x2 + 1
Sol. Given that f : Z → Z
Let x1, x2  f(x)  f(x1) = x1 + 2, f(x2) = x2 + 2
f(x1) = f(x2)  x1 + 2 = x2 + 2  x1 = x2

So, f(x) is one-one function.
Now, let y = x + 2 \ x = y – 2  Z  y  Z

So, f(x) is onto function.
\ f(x) is bijective function.

Hence, the correct answer is (b).
Q40. Let f : R  R be the functions defined by f(x) = x3 + 5. Then
f – 1(x) is
(a) (x + 5)1/3 (b) (x – 5)1/3 (c) (5 – x)1/3 (d) 5 – x
Sol. Given that f(x) = x3 + 5
Let y = x3 + 5  x3 = y – 5
\ x = (y – 5) 1/3  f – 1(x) = (x – 5)1/3

Hence, the correct answer is (b).

15
 Q41. Let f : A  B and g : B  C be the bijective functions. Then
(gof)– 1 is
(a) f – 1og– 1 (b) f og (c) g – 1of– 1 (d) gof
Sol. Here, f : A  B and g : B  C
\ (gof)– 1 = f – 1og– 1

Hence, the correct answer is (a).
Ï3¸ 3x + 2
Q42. Let f : R - Ì ˝ Æ R be defined by f(x) = , then
Ó5˛ 5x - 3
(a) f – 1(x) = f(x) (b) f – 1(x) = – f(x)

(c) (fof)x = – x (d) f - 1( x) = 1 f ( x)

19
3x + 2 3
Sol. Given that f(x) = "xπ
5x - 3 5
3x + 2
Let y=
5x - 3

 y(5x – 3) = 3x + 2

 5xy – 3y = 3x + 2

 5xy – 3x = 3y + 2

 x(5y – 3) = 3y + 2

3y + 2
 x=
5y - 3

3 x+2
 f – 1(x) =
5x − 3

 f – 1(x) = f (x)

Hence, the correct answer is (a).

{

Q43. Let f : [0, 1]  [0, 1] be defined by f(x) = x , if x is rational .
1 - x , if x is irrational
Then (fof)x is
(a) constant (b) 1 + x
(c) x (d) None of these
Sol. Given that f : [0, 1]  [0, 1]
\ f = f –1

So, (fof)x = x (identity element)

Hence, correct answer is (c).

Q44. Let f : [2, )  R be the function defined by f(x) = x2 – 4x + 5,
then the range of f is
(a) R (b) [1, ) (c) [4, ) (d) [5, )
Sol. Given that f(x) = x2 – 4x + 5

16
 Let y = x2 – 4x + 5

2
 x – 4x + 5 – y = 0

- ( - 4) ± ( - 4)2 - 4 ¥ 1 ¥ (5 - y )
 x=
2¥1

4 ± 16 - 20 + 4 y
=
2

4 ± 4y - 4 4±2 y -1
= = = 2± y -1
2 2
\ For real value of x, y – 1  0  y  1.

So, the range is [1, ).
Hence, the correct answer is (b).
2x - 1
Q45. Let f : N  R be the function defined by f(x) = and
2
g : Q  R be another function defined by g(x) = x + 2 then,
Ê 3ˆ
gof Á ˜ is
Ë 2¯
(a) 1 (b) – 1 (c) 7 (d) None of these
2x - 1 2
Sol. Here, f(x) = and g(x) = x + 2
2
\ gof(x) = g[(f(x)]

= f(x) + 2

2x - 1 2x + 3
= +2 =
2 2
3
2¥ +3
Ê 3ˆ 2 =3
gof Á ˜ =
Ë 2¯ 2
Hence, the correct answer is (d).
ÏÔ2 x : x > 3
Q46. Let f : R  R be defined by f(x) = Ì x 2 : 1 < x £ 3
ÔÓ 3 x : x £ 1
then f(– 1) + f(2) + f(4) is

(a) 9 (b) 14 (c) 5 (d) None of these
Sol. Given that:
ÏÔ2 x : x > 3
f(x) = Ì x 2 : 1 < x £ 3
ÔÓ 3 x : x £ 1
\ f(– 1) + f(2) + f(4) = 3(– 1) + (2)2 + 2(4) = – 3 + 4 + 8 = 9

Hence, the correct answer is (a).

17
 Q47. If f : R  R be given by f(x) = tan x, then f – 1(1) is
p Ï p ¸
(a) (b) Ìnp + : n Œ Z ˝
4 Ó 4 ˛
(c) does not exist (d) None of these
Sol. Given that f(x) = tan x
Let f(x) = y = tan x  x = tan– 1 y

 f – 1(x) = tan– 1 (x)

 f – 1(1) = tan– 1 (1)

È Ê pˆ˘ p
 f – 1(1) = tan - 1 Í tan Á ˜ ˙ =
Î Ë 4¯˚ 4

Hence, the correct answer is (a).

Fill in the Blanks in Each of the Exercises 48 to 52.
Q48. Let the relation R be defined in N by a R b if 2a + 3b = 30. Then
R = ............
Sol. Given that a R b : 2a + 3b = 30
 3b = 30 – 2a

30 - 2 a
 b=
3

for a = 3, b = 8
a = 6, b = 6
a = 9, b = 4
a = 12, b = 2
Hence, R = {(3, 8), (6, 6), (9, 4), (12, 2)}

Q49. Let the relation R be defined on the set
A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8}. Then R is given by
............
Sol. Given that A = {1, 2, 3, 4, 5} and R = {(a, b) : |a2 – b2| < 8}
So, clearly, R = {(1, 1), (1, 2), (2, 1), (2, 2), (2, 3), (3, 2), (4, 3)
(3, 4), (4, 4), (5, 5)}
Q50. Let f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}. Then
gof = ................ and fog = ...................
Sol. Here, f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}
gof(1) = g[f(1)] = g(2) = 3
gof(3) = g[f(3)] = g(5) = 1
gof(4) = g[f(4)] = g(1) = 3
\ gof = {(1, 3), (3, 1), (4, 3)}

fog(2) = f[g(2)] = f(3) = 5

18
 fog(5) = f[g(5)] = f(1) = 2
fog(1) = f[g(1)] = f(3) = 5
\ fog = {(2, 5), (5, 2), (1, 5)}

Q51. Let f : R → R be defined by f(x) = x
, then
1 + x2
(fofof)(x) = .................

x
Sol. Here, f(x) = " x ŒR
1 + x2
fofof(x) = fof[f(x)] = f[ f{ f( x)}]

È x ˘
Í ˙
È Ê x ˆ˘ 1 + x2
= fÍf ˙ = fÍ ˙
Á ˜ Í ˙
ÍÎ Ë 1 + x 2 ¯ ˙˚

2
Í 1+ x ˙
Í 1 + x2 ˙
Î ˚
È x ˘
Í ˙
Í 1 + x2 ˙ È x ˘
= fÍ ˙ = fÍ ˙
2 2 2

Í 1+ x + x ˙ ÍÎ 1 + 2 x ˙˚
Í ˙
Î 1 + x2 ˚

È x ˘ È x ˘
Í ˙ Í ˙
Í 1 + 2x2 ˙ Í 1 + 2x2 ˙ x
= Í =
˙ Í 2 2 ˙=
Í 1+ x
2
˙ Í 1 + 2x + x 1 + 3x2

˙
Í 1 + 2x2 ˙ Í 1 + 2x2
˙
Î ˚ Î ˚

x
Hence, fofof(x) =
3x2 + 1
Q52. If f(x) = [4 – (x – 7)3], then f – 1(x) = .............
Sol. Given that, f(x) = [4 – (x – 7)3]
Let y = [4 – (x – 7)3]

 (x – 7)3 = 4 – y

 x – 7 = (4 – y)1/3  x = 7 + (4 – y)1/3

Hence, f 1(x) = 7 + (4 – x)1/3
–

State True or False for the Statements in each of the Exercises

53 to 62.

19
Q53. Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set
A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
Sol. Here, R = {(3, 1), (1, 3), (3, 3)}
(3, 3)  R, so R is reflexive.
(3, 1)  R and (1, 3)  R, so R is symmetric.
Now, (3, 1)  R and (1, 3)  R but (1, 1)  R
So, R is not transitive.
Hence, the statement is ‘False’.
Q54. Let f : R → R be the function defined by
f(x) = sin (3x + 2)  x  R, then f is invertible.

Sol. Given that: f(x) = sin (3x + 2)  x  R,
f(x) is not one-one.

Hence, the statement is ‘False’.

Q55. Every relation which is symmetric and transitive is also
reflexive.
Sol. Let R be any relation defined on A = {1, 2, 3}
R = {(1, 2), (2, 1), (2, 3), (1, 3)}
Here, (1, 2)  R and (2, 1)  R, so R is symmetric.
(1, 2)  R, (2, 3)  R  (1, 3)  R, so R is transitive.
But (1, 1)  R, (2, 2)  R and (3, 3)  R.
Hence, the statement is ‘False’.
Q56. An integer m is said to be related to another integer n if m
is an integral multiple of n. This relation in Z is reflexive,
symmetric and transitive.
Sol. Here, m = kn (where k is an integer)
If k = 1 m = n, so z is reflexive.
Clearly z is not symmetric but z is transitive.
Hence, the statement is ‘False’.
Q57. Let A = {0, 1} and N be the set of natural numbers then the
mapping f : N  A defined by f(2n – 1) = 0, f(2n) = 1,  n  N
is onto.
Sol. Given that A = [0, 1]
f(2n – 1) = 0 and f(2n) = 1  n  N

So, f : N  A is a onto function.

Hence, the statement is ‘True’.
Q58. The relation R on the set A = {1, 2, 3} defined as
R = {(1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and
transitive.
Sol. Here, R = {(1, 1), (1, 2), (2, 1), (3, 3)}
Here, (1, 1)  R, so R is Reflexive.
(1, 2)  R and (2, 1)  R, so R is Symmetric.

20
 (1, 2)  R but (2, 3)  R
So, R is not transitive.
Hence, the statement is ‘False’.
Q59. The composition of functions is commutative.
Sol. Let f(x) = x2 and g(x) = 2x + 3
fog(x) = f[g(x)] = (2x + 3)2 = 4x2 + 9 + 12x
gof(x) = g[f(x)] = 2x2 + 3
So, fog(x)  gof(x)

Hence, the statement is ‘False’.

Q60. The composition of functions is associative.
Sol. Let f(x) = 2x, g(x) = x – 1 and h(x) = 2x + 3
fo{goh(x)} = fo{g(2x + 3)}
= f(2x + 3 – 1) = f(2x + 2) = 2(2x + 2) = 4x + 4.

and (fog)oh(x) = (fog) {h(x)}

= fog(2x + 3)

= f(2x + 3 – 1) = f(2x + 2) = 2(2x + 2) = 4x + 4

So, fo{goh(x)} = {(fog)oh(x)} = 4x + 4

Hence, the statement is ‘True’.

Q61. Every function is invertible.
Sol. Only bijective functions are invertible.
Hence, the statement is ‘False’.

Q62. A binary operation on a set has always the identity element.
Sol. ‘+’ is a binary operation on the set N but it has no identity
element.
Hence, the statement is ‘False’.

21