Sets Relations Function

Chapter Objectives
1. Representation of sets
2. Types of sets
3. Subsets and proper subsets
4. Euler-Venn diagram
5. Algebra of sets (i.e. union, intersection, difference, complement of set etc.)
6. Laws of algebra of sets
7. Cardinal number of union, intersection, difference and symmetric difference
of sets
8. Cartesian product of sets
9. Relations from A to B
10. Types of relations on a set A
11. Composition of relations
12. Function definition, domain, co-domain and range
13. Standard real functions
14. Types of functions
15. Number of various types of functions
16. Composition of functions
17. Inverse of element
18. Inverse of function
Concept Notes
Introduction
The word 'set' in mathematics was first of all used by a German mathematician
George Cantor.
The word 'set' is synonymous with the words 'collection', 'aggregate', 'class'
and is comprised of elements. Therefore, 'a set is any collection of distinct and
distinguishable objects of our intuition or thought'.
By the term 'distinct' we mean that no object is repeated. By the term
'distinguishable' we mean that given an object, we can decide whether that
object is 0 in our collection or not.
More often, the objects of a set have a common property which is not
possessed by other object which is outside the set.
The objects belonging to a set are called elements or members of that set.
Sets are denoted by capital letters of English alphabets while elements in
general are denoted by small letters. If x is an element of a set A, we write
1.
x ∈ A (read as x belongs to A). If x is not an element of set A, we write x ∉ A
(read as x does not belong to A).
Following are the some examples of sets:
The collection of vowels in English alphabets, i.e. A = {a, e, i, o,u} .
The collection of all states in the Indian Union.
The collection of all past presidents of the Indian Union etc.
The collection of good cricket player of India is not a set, since the term 'good
players' is not well defined. The following sets, we will use frequently in this
session and following sessions:
N : For the set of natural numbers
Z or I: For the set of integers
Z+ or I+: For the set of all positive integers
Q : For the set of all rational numbers
Q+ : For the set of all positive rational numbers
R : For the set of all real numbers
R+ : For the set of all positive real numbers
C : For the set of all complex numbers
Representation of a Set
A set is often represented in the following two ways:
(i) Roster method (Tabular form)
In this method a set is described by listing elements separated by commas,
within braces { }.
For example, the set of even natural numbers can be described as {2, 4, 6, 8,
…}.
Remarks:
The order in which the elements are written makes no difference. Thus
{a, e, i, 0,u} and {e, a, i, o,u} denote the same set.
Repetition of an element has no effect. Thus {1, 2, 3, 2} is the same set as
{1, 2, 3} .
(ii) Set builder method
In this method, a set is described by a characterizing property P(x) of its
element x. In such a case the set is described by {x : P(x) holds } or {x / P(x)
holds }
The symbol 'l' or '.' is read as 'such that'.
In this representation the set of all even natural numbers can be written as :
{x / x = 2n for n ∈ N} or {x=
/ x 2n,n ∈ N} .
IIT_JEE 2.
Types of Sets
Empty sets:
A set having no element is called an empty set. It is also known as null set or
void set. It is denoted by φ .
For example:
(a) A =∈ {
x R / x2 =
−10 =
φ }
(b) B = set of immortal man = φ
Singleton set:
A set having single element is called singleton set. For example, {2}, {0}, {5} are
singleton set.
Finite set:
A set is called a finite set if it is called either void set or its elements can be
counted by natural numbers and process of listing terminates at a certain
natural numbers.
For example, {1, 2, 4, 6} is a finite set because it has four elements.
Infinite set:
A set which is not a finite set, i.e. the counting up of whose elements is
impossible, is called an infinite set.
For example:
(i) The set of all straight line in a given plane.
(ii) The set of all natural numbers.
(iii) The set of real numbers between ' 1 ' and ' 2 '.
Cardinal number or order of a finite set
The total number of elements in a finite set is called cardinal number or order
of a finite set. It is denoted by n(A) .
For example, = n(A) 5 or O(A) = 5 .

if A {1, 2, 3, 4, 5} ⇒ =
Set of sets:
A set S having all its elements as sets is called set of sets.
For example:
S = {{1, 2}, {2, 4}, {3, 5, 7}} is a set of sets having three elements {1, 2}, {2, 4}, {3, 5, 7}
which are themselves sets.
But S = {{1, 2}, 4, {3, 5, 7}} is not a set of sets as 3 ∈ S is not a set.
Equivalent sets:
Two finite sets A and B are equivalent if their cardinal number is same, i.e.
n(A) = n(B) .
IIT_JEE 3.
Equal sets:
Two sets A and B are said to be equal if every element of A is a member of B,
and every element of B is a member of A.
If sets A and B are equal, we write A = B and A ≠ B when and are not equal.
It is clear from the above definitions that equal sets are equivalent but
equivalent sets need not be equal.
For example:
A = {4, 5, 6} and B = {a,b, c} are equivalent but
A = {4, 5, 6} and C = {6, 5, 4} are equal, i.e. A = C.
Subsets and Proper Subsets

Subsets:
A set A is said to be a subset of a set B if each element of A is also an element
of B.
If A is subset of B, we write A ⊆ B which is read as ‘A is a subset of B’.
Thus A ⊆ B if a ∈ A ⇒ a ∈ B .
For example:
(i) Let A {2,
= = 4, 6, 8},B {2, 4, 6, 8, 10, 12} , then A ⊆ B .
(ii) Again let A = {2, 4, 6} and B = {6, 4, 2} , then A ⊆ B . Also B ⊆ A .

If A is not a subset of B, then we write A  B .
Super set:
If A is a subset of B, we say that B contains A or B is a superset of A and we
write B ⊇ A .
Proper subset:
A set A is said to be a proper subset of a set B if every element of A is an
element of B and B has at least one element which is not an element of A.
This fact is expressed by writing A ⊂ B .
If A is not a proper subset of B, then we write A ⊂/ B .
For example:
Let A {1,
= = 2, 3},B {2, 3, 4, 1, 5} , then A ⊂ B .
Thus if A is a proper subset of B, then there exists an element x ∈ B such that
x∉A.
For example, {1} ⊂ {1, 2, 3} but {1, 4} ⊂/ {1, 2, 3} .
Procedure for Proving Equality of Sets
IIT_JEE 4.
As we have discussed earlier that two sets A and B are said to be equal if
every element of set A is an element of set B and every element of B is an
element of A .
It is clear that A = B ⇔ A ⊆ B and B ⊆ A .
i.e. A = B ⇔ [x ∈ A ⇔ x ∈ B] .
Some Results on Subsets
(i) Every set is a subset of itself.
Proof: Let A be any set, then each element of A is clearly in A itself. Hence
A ⊆ A.
(ii) The empty set φ is a subset of every set.
Proof: Suppose if possible φ is not a subset of a given set A. Then there
exists an element x in φ which is not in A. But φ cannot have any
element. So φ has no element which is not in A, i.e. every element of φ (if
exists) is an element of A . So φ ⊆ A .
Thus φ is a subset of every set.
(iii) The total number of subsets of a finite set containing n elements is 2n.
We know that n Cr denotes the number of ways for choosing r things from
n different things. Therefore each selection of r things gives a subset of

the set A containing r elements.
∴ The number of subsets of A having no element =n C0
The number of subsets of A having one element =n C1
The number of subsets of A having two elements =n C2
…………………………………………………………………………..
…………………………………………………………………………..
…………………………………………………………………………..
The number of subsets of A having n elements =n Cn .
Hence, the total number of subsets of A

n
= C0 +n C1 +n C2 + … +n =
Cn 2n
n n
 We know that (1 + x)
= C0 +n C1x +n C2 x2 + … +n Cnxn . Putting x = 1 , we get
2n
= n
C0 +n C1 +n C2 + … +n Cn .

Power set:
IIT_JEE 5.
The set of all the subsets of a given set A is said to be the power set of A
and is denoted by P(A) .
i.e. P(A)
= {S ∣S ⊆ A} ⇒ S ∈ P(A) ⇔ S ⊆ A
Also, φ ∈ P(A) and A ∈ P(A) for all sets A.

Power set:
The set of all the subsets of a given set A is said to be the power set of A and
is denoted by P(A).
i.e. P(A)
= {S ∣S ⊆ A} ⇒ S ∈ P(A) ⇔ S ⊆ A
Also, φ ∈ P(A) and A ∈ P(A) for all sets A .

For example:
if A = {a,b, c} , then
P(A) = {φ, {a}, {b}, {c}, {a,b}, {a, c}, {b, c}, {a,b, c}}.
Ask Yourself
What is the cardinal number of P(A) of set A containing n elements?
Universal Set
Any set which is super set of all the sets under consideration is called the
universal set and is denoted by Ω or U .
For example:
(i) When we are using sets containing natural numbers then N is the universal
set.
(ii) A universal set can be chosen arbitrarily for any discussion of few given
sets, but once chosen, it is fixed for that discussion of the set.
Euler-Venn Diagram
Any statement regarding sets can be easily understood with pictorial
representation of the sets involved. First of all a Swiss mathematician Euler
gave an idea to represent a set by the points in a closed curve. Later on British
mathematician Venn brought this idea to practice. That is why the diagrams
drawn to represent sets are called Euler-Venn Diagram or simply Venn
diagram.
A set is represented by a closed geometrical figure (usually circles) inside the
universal set.
The universal set S is represented by a rectangular region. Any element of a
set A is represented by a point within the circle which represent A.
For example:
Drawn Venn diagram of A ⊂ B .
IIT_JEE 6.
Algebra of Sets
Union of sets:
The union of two sets A and B is the set of all those elements which are either
in A or in B or in both. We shall use the notation A ∪ B (read as 'A union B') to
denote the union of A and B.
B {x : x ∈ A or x ∈ B} .
∴ A ∪=
Clearly, if x ∈ A ∪ B ⇔ x ∈ A or x ∈ B
and x ∉ A ∪ B ⇔ x ∉ A and x ∉ B
In the above figures, the shaded parts represents A ∪ B .

For example, if A = {1, 2, 3, 4} ,
B = {4, 5, 6, 7, 8} then A ∪ B ={1, 2, 3, 4, 5, 6, 7, 8}

Generalised definition
If A 1 , A2 , … An is a finite family of sets, then their union is A 1 ∪ A2 ∪ A3 ∪ … ∪ An
n
or A
i= 1
n
.
Intersection of sets
The intersection of two sets A and B is the set of all elements which are
common in A and B.
The intersection of A and B is denoted by A ∩ B (read as 'A intersection B').
B {x : x ∈ A and x ∈ B} .
Thus A ∩=
Clearly, x ∈ A ∩ B ⇒ x ∈ A and x ∈ B
and x ∉ A ∩ B ⇔ x ∉ A or x ∉ B .
IIT_JEE 7.
In the above figures shaded region represents A ∩ B.
For example,
= let A {=
1, 2, 3, 4} , B {2, 1, 5, 6}
Then A ∩ B ={1, 2}.

Generalised definition
The intersection of sets A 1 , A2 , … An is the set of all the elements which are
common to all the sets A 1 , A2 , … An .

n
It is denoted by A 1 ∩ A2 ∩ A3 … ∩ An or A
i= 1
i
Disjoint sets
Two sets A and B are said to be disjoint sets if they have no common element,
i.e. A ∩ B =φ .
In the above figure A and B are disjoint sets.

For example:
Let A = {a,b, c, d, e} and B = {1, 2, 3, 4, 5} , then A ∩ B = φ ⇒ set A and set B are
disjoint sets.
Difference of sets
The difference of two sets A and B is the set of all those elements of A which
are not elements of B. It is denoted
by A − B . Therefore, A −=
B {x : x ∈ A and x ∉ B}
Thus, x ∈ A − B ⇔ x ∈ A and x ∉ B
Similarly, difference of B and A is B − A
= {x : x ∈ B and x ∉ A}
In the following figures, shaded area represent the set A–B.
IIT_JEE 8.
For example:
Let A {1,
= = 3, 5, 6, 7},B {2, 3, 4, 5} , then A − B ={1, 6, 7} and B − A =
{2, 4} .
⇒ A −B ≠ B− A
Symmetric differences of sets
The symmetric difference of two sets A and B is the set of all those elements
which are in A but not in B and which are in B but not in A. It is denoted by
A∆B .
Therefore, A∆B = (A − B) ∪ (B − A) .
Thus, x ∈ A∆B ⇒ x ∉ A ∩ B .
In the following figures, the shaded region represent A∆B :
For example:
Let A = {1, 2, 3, 4, 5} and B = {3, 5, 6, 7} , then A − B ={1, 2, 4} and B − A =
{6, 7}
∴ A∆B = (A − B) ∪ (B − A)
= {1, 2, 4} ∪ {6, 7} = {1, 2, 4, 6, 7} and B∆A = (B − A) ∪ (A − B)
={6, 7} ∪ {1, 2, 4} ⇒ {1, 2, 4, 6, 7}

Clearly, A∆B = B∆A .
Complement of set
The complement of set A is the set of all those elements of the universal set
U which are not elements of set A .
It is denoted by Ac or A′ .
Clearly, Ac or A=
′
U−A
∴ Ac or
= A′ {x : x ∈ U and x ∉ A}
IIT_JEE 9.
Thus, x ∈ A′ ⇔ x ∉ A .
In figure, shaded region represents the complement of set A.
For example:
Let the set of natural numbers
= N {1, 2, 3, …} be the universal set and
=A {2, 4, 6, 8, …} , then
= A′ {1, 3, 5, 7, …} .
Do You know?
(i) =
U′ {x : x ∈ ∪ and x ∉ U} =φ.
φ′ {x : x ∈ ∪ and x ∉ φ} =
(ii)= ∪
( ) {x : x ∈ ∪ and x ∉=
A}
′
A′
(iii) = ′
{x : x ∈ ∪ and x ∈ A} =
A
(iv) A ∪
= ∪
A′ {x : x ∈ ∪ and x ∈ A} ∪ {x : x ∈ ∪ and x ∉ A} =
(v) A ∩ A=
′
{x : x ∈ U and x ∈ A} ∩ {x : x ∈ U and x ∉ A} =
φ
Note: Please check the above result by taking suitable examples.

Law of Algebra of Sets
1. Indempotent laws
For any set A, we have
(i) A∪A =
A
(ii) A ∩ A =
A
Proof:
(i) A {x : x ∈ A or x ∈ A}= {x : x ∈ A}
A∪=
(ii) A ∩ =
A {x : x ∈ A and x ∈ A}= {x : x ∈ A}= A
2. Identity laws
For any set A, we have
(i) A ∪ φ =A
(ii) A ∩ U =A
i.e. φ and U are identity elements for union and intersection respectively.
Proof:
(i) ∪ φ {x : x ∈ A or x ∈
A= = φ} {x : x ∈=
A} A
(ii) A ∩ =
U {x : x ∈ A and x ∈ U}= {x : x ∈ A}= A
IIT_JEE 10.
3. Commutative laws
For any two sets A and B, we have
(i) A ∪B = B ∪ A
(ii) A ∩ B = B ∩ A
i.e. union and intersection are commutative.
Proof: As we know that two sets X and Y are equal if X ⊆ Y and Y ⊆ X .
(i) Let x be any arbitrary element of A ∪ B .
⇒ x ∈ A ∪ B ⇒ x ∈ A or x ∈ B
⇒ x ∈ B or x ∈ A
⇒ x ∈B ∪ A
∴ A ∪B ⊆ B ∪ A ……… (i)
Similarly, let y be any arbitrary element of B ∪ A
⇒ y ∈ B ∪ A ⇒ y ∈ B or y ∈ A
⇒ y ∈ A or y ∈ B
⇒ y ∈ A ∪B
∴ B ∪ A ⊆ A ∪B ……… (ii)
From (i) and (ii)
A ∪B = B ∪ A &
(ii) Let x be any arbitrary element of A ∩ B
⇒ x ∈ A ∩ B ⇒ x ∈ A and x ∈ B
⇒ x ∈ B and x ∈ A
⇒ x ∈B ∩ A
∴ A ∩B ⊆ B ∩ A ……… (iii)
Similarly, y be any arbitrary element of B ∩ A .
⇒ y ∈ B ∩ A ⇒ y ∈ B and y ∈ A
⇒ y ∈ A and y ∈ B
⇒ y ∈ A ∩B
∴ B ∩ A ⊆ A ∩B ……… (iv)
From (iii) and (iv)
A ∩B = B ∩ A
4. Associative laws
If A, B and C are any three sets, then
(i) (A ∪ B) ∪ C = A ∪ (B ∪ C)
(ii) (A ∩ B) ∩ C = A ∩ (B ∩ C)
i.e. union and intersection are associative.
IIT_JEE 11.
Proof:
(i) Let x be any arbitrary element of (A ∪ B) ∪ C .
∴ x ∈ (A ∪ B) ∪ C
⇒ x ∈ (A ∪ B) or x ∈ C
⇒ (x ∈ A or x ∈ B) or x ∈ C
⇒ x ∈ A or (x ∈ B or x ∈ C)
⇒ x ∈ A or (x ∈ B ∪ C)
⇒ x ∈ A ∪ (B ∪ C)
∴ (A ∪ B) ∪ C ⊆ A ∪ (B ∪ C) ……… (i)
Similarly, let y be any arbitrary element of A ∪ (B ∪ C) .
∴ y ∈ A ∪ (B ∪ C)
⇒ y ∈ A or y ∈ (B ∪ C)
⇒ y ∈ A or (y ∈ B or y ∈ C)
⇒ (y ∈ A or y ∈ B) or y ∈ C
⇒ (y ∈ A ∪ B) or y ∈ C
⇒ y ∈ (A ∪ B) ∪ C
∴ A ∪ (B ∪ C) ⊆ (A ∪ B) ∪ C ……… (ii)
From (i) and (ii)
(A ∪ B) ∪ C = A ∪ (B ∪ C) Proved.
(ii) Let x be any arbitrary element of (A ∩ B) ∩ C .

∴ x ∈ (A ∩ B) ∩ C
⇒ x ∈ (A ∩ B) and x ∈ C
⇒ (x ∈ A and x ∈ B) and x ∈ C
⇒ x ∈ A and (x ∈ B and x ∈ C)
⇒ x ∈ A and (x ∈ B ∩ C) ⇒ x ∈ A ∩ (B ∩ C)
∴ (A ∩ B) ∩ C ⊆ A ∩ (B ∩ C) ……… (iii)
Similarly, let y be any arbitrary element of A ∩ (B ∩ C) .
∴ y ∈ A ∩ (B ∩ C)
⇒ y ∈ A and (y ∈ B ∩ C)
⇒ y ∈ A and (y ∈ B and y ∈ C)
⇒ (y ∈ A and y ∈ B) and y ∈ C
⇒ (y ∈ A ∩ B) and y ∈ C
⇒ y ∈ (A ∩ B) ∩ C
IIT_JEE 12.
∴ A ∩ (B ∩ C) ⊆ (A ∩ B) ∩ C ……… (iv)
From (iii) and (iv),
(A ∩ B) ∩ C = A ∩ (B ∩ C) Proved.
5. Distributive laws
If A, B and C are any three sets, then
(i) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
(ii) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
In other words, union and intersection are distributive over intersection and
union respectively. Proof:
(i) Let x be any arbitrary element of A ∪ (B ∩ C) .
∴ x ∈ A ∪ (B ∩ C)
⇒ x ∈ A or x ∈ (B ∩ C)
⇒ x ∈ A or (x ∈ B and x ∈ C)
⇒ (x ∈ A or x ∈ B) and (x ∈ A or x ∈ C)
[  'or' is distributive over 'and']
⇒ x ∈ (A ∪ B) and x ∈ (A ∪ C)
⇒ x ∈ (A ∪ B) ∩ (A ∪ C)
∴ A ∪ (B ∩ C) ⊆ (A ∪ B) ∩ (A ∪ C) ...(i)
Similarly, let y be any arbitrary element of (A ∪ B) ∩ (A ∪ C) .
∴ y ∈ (A ∪ B) ∩ (A ∪ C)
⇒ y ∈ (A ∪ B) and y ∈ (A ∪ C)
⇒ (y ∈ A or y ∈ B) and (y ∈ A or y ∈ C)
⇒ y ∈ A or (y ∈ B and y ∈ C)
⇒ y ∈ A or (y ∈ B ∩ C)
∴ (A ∪ B) ∩ (A ∪ C) ⊆ A ∪ (B ∩ C) ...(ii)
From (i) and (ii)
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) Proved.
Let x be any arbitrary element of the set A ∩ (B ∪ C) .

∴ x ∈ A ∩ (B ∪ C)
⇒ x ∈ A and (x ∈ B ∪ C)
⇒ x ∈ A and (x ∈ B or x ∈ C)
⇒ (x ∈ A and x ∈ B) or (x ∈ A and x ∈ C)
⇒ (x ∈ A ∩ B) or (x ∈ A ∩ C)
⇒ x ∈ (A ∩ B) ∪ (A ∩ C)
IIT_JEE 13.
∴ A ∩ (B ∪ C) ⊆ (A ∩ B) ∪ (A ∩ C) ...(iii)
Similarly, let y be any arbitrary element of the set (A ∩ B) ∪ (A ∩ C) .
∴ y ∈ (A ∩ B) ∪ (A ∩ C)
⇒ y ∈ (A ∩ B) or y ∈ (A ∩ C)
⇒ (y ∈ A and y ∈ B) or (y ∈ A and y ∈ C)
⇒ y ∈ A and (y ∈ B or y ∈ C)
⇒ y ∈ A and (y ∈ B ∪ C) ...(iv)
⇒ y ∈ A ∩ (B ∪ C)
∴ (A ∩ B) ∪ (A ∩ C) ⊆ A ∩ (B ∪ C) ...(iv)
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) Proved.
De Morgan's Laws
If A and B are any two sets, then
(i) (A ∪ B)′ = A′ ∩ B′
(ii) (A ∩ B)′ = A′ ∪ B′
Proof:
(i) Let x be an arbitrary element of the set (A ∪ B)′ .
∴ x ∈ (A ∪ B)′
⇒ x ∉ (A ∪ B)
⇒ x ∉ A and x ∉ B
⇒ x ∈ A′ and x ∈ B′
⇒ x ∈ A′ ∩ B′
∴ (A ∪ B)′ ⊆ A′ ∩ B′ ...(i)
Again let y be an arbitrary element of A′ ∩ B′ .
∴ y ∈ A′ ∩ B′
⇒ y ∈ A′ and y ∈ B′
⇒ y ∉ A and y ∉ B
⇒ y ∉ A ∪B
⇒ y ∈ (A ∪ B)′
∴ A′ ∩ B′ ⊆ (A ∪ B)′ ...(ii)
From (i) and (ii),
(ii) Let x be an arbitrary element of (A ∩ B)′ .
IIT_JEE 14.
∴ x ∈ (A ∩ B)′
⇒ x ∉ (A ∩ B)
⇒ X ∉ A or x ∉ B
⇒ x ∈ A′ or x ∈ B′
⇒ x ∈ A′ ∪ B′
∴ (A ∩ B)′ ⊆ A′ ∪ B′ ...(iii)
Again let y be an arbitrary element of A′ ∪ B′ .
∴ y ∈ A′ ∪ B′
⇒ y ∈ A′ or y ∈ B′
⇒ y ∉ A or y ∉ B
⇒ y ∉ (A ∩ B)
⇒ y ∈ (A ∩ B)′
∴ A′ ∪ B′ ⊆ (A ∩ B)′ ..(iv)
(A ∩ B)′ = A′ ∪ B′ Proved.
Some Important Results on Cardinal Number of Union, Intersection, Difference
and Symmetric Difference of Sets
If A, B and C are finite sets and U be the finite universal set, then
(i) n(A ∪ B)= n(A) + n(B) − n(A ∩ B)
(ii) n(A ∪ B)= n(A) + n(B) ⇔ A and B are disjoint non-void sets.
(iii) n(A − B)= n(A) − n(A ∩ B)
i.e. n(A) = n(A − B) + n(A ∩ B)
(iv) n(A∆B) =Number of elements which belong to exactly one of A or B.
= n((A − B) ∪ (B − A))
= n(A − B) + n(B − A) [ (A − B) and (B − A) are disjoint sets]
= n(A) − n(A ∩ B) + n(B) − n(A ∩ B)

= n(A) + n(B) − 2n(A ∩ B)
(v) n(A ∪ B ∪ C)
= n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C) − n(C ∩ A) + n(A ∩ B ∩ C)
(vi) Number of elements in exactly two of the sets A, B and C
= n(A ∩ B) + n(B ∩ C) + n(C ∩ A) − 3n(A ∩ B ∩ C)
(vii) Number of elements in exactly one of the sets A, B and C
= n(A) + n(B) + n(C) − 2n(A ∩ B) − 2n(B ∩ C) − 2n(C ∩ A) + 3n(A ∩ B ∩ C)
IIT_JEE 15.
( ) ( )
(viii) n A′ ∪ B′ = n (A ∩ B)′ = n(U) − n(A ∩ B)
Solved Examples
Ex. Describe the following sets in roster form.

(i) x : x is a letter before g in the English alphabet
(ii) {x ∈ N : x is a prime number, 1 < x < 20}
(iii) {x ∈ R : x > x}
Sol. (i) {a, b, c, d, e, f}
(ii) {2,3,5,7,11,13,17,19}
(iii) φ
Ex. Describe the following sets in the set-builder form.

 1 1 1 1 
(i) A 1, , , , , …
=
 2 3 4 5 
(ii) B = {0}
1 2 3 5 6 
=(iii) C  , , , , , …
 2 5 10 26 37 
 1 
A x=
Sol. (i) = :x ,n ∈ N
 n 
(ii)
= B {x
= : X 0}
 n 
(iii) C  2
= : n ∈ N
n + 1 
Ex. Which of the following pairs of sets are equal? Justify your answer.
(i) A = {X : x is a letter of word 'LOYAL'}
B ={x : x is a letter of word 'ALLOY'}
{x : x ∈ Z and x2 ≤ 8
(ii) A = }
B
= {x : x ∈ R and x2 − 4x +=
3 0}
Sol. (i)  We have
A = {L, O, Y, A, L} = {L, O, Y, A}
B = {A, L, L, O, Y} = {A, L, O, Y}
∴ A=B
}
(ii) A = {x : x ∈ Z and x2 ≤ 8 = {−2, −1, 0, 1, 2}
IIT_JEE 16.
B= {x : x ∈ R, and x 2
}
− 4x + 3 = 0 = {1, 3}
 0 ∈ A and 0 ∉ B
∴ A ≠B
Ex. Let A ={1,2,3,4}, B = {1,2,3} and C = {2,4}. Find all sets X satisfying each pair
conditions.
(i) X ⊂ B and X ⊂
/ C
(ii) X ⊂ A, X ⊂ B and X ⊂ C
Sol. (i) We have,

X ⊂ B and X ⊂
/ C
⇒ X is a proper subset of B but X is not a proper subset of C.
⇒ X ∈ P(B) but X ∉ P(C)
⇒ X = {1},{3},{1,2},{1,3},{2,3},{1,2,3}
(ii) We have,
X ⊂ A, X ⊂ B and X ⊂ C
⇒ X ∈ P(A), X ∈ P(B) and X ∈ P(C)
⇒ X is a subset of A, B and C
∴ X = φ, {2} .
Ex. If {a, {b}}, findP(A) .
Sol. Let B = {b}, then A = {a, B}

∴ P(A) = {φ, {a}, {B}, {a,B}}
= {φ, {a}, {{b}}, {a, {b}}}
Ex. Let U = {1,2,3,4,5,6,7,8,9}, A = {1,2,3,4}

B = {2,4,6,8} and C = {3,4,5,6}.
Find
(i) A–B
(ii) A′
(iii) (A ∩ C)′
(A )
′
′
(iv)
(v) (B − C)′
Sol. (i) A −=
B {x : x ∈ A but x ∉ B}
= {1, 3}
(ii) A′ = U − A = {5, 6, 7, 8, 9}
(iii)  A=
∩ C {1, 2, 3, 4} ∩ {3, 4,=
5, 6} {3, 4}
IIT_JEE 17.
∴ (A ∩ C)′ =U − (A ∩ C) = {1, 2, 5, 6, 7, 8, 9}
(iv)  A′ = {5, 6, 7, 8, 9}
(A )
′
′
=U − A′ ={1, 2, 3, 4} =A
(v) B – C = {2,8}
∴ (B − C)′ = U − (B − C)
= {1,3,4,5,6,7,9}
Ex. Let U {1,

= = 2, 3, 4, 5, 6, 7, 8, 9}, A {2, 4, 6, 8} and B = {2, 3, 5, 7} . Verify that
(i) (A ∪ B)′ = A′ ∩ B′
(ii) (A ∩ B)′ = A′ ∪ B′
Sol. (i)  (A=

∪ B) {2, 4, 6, 8} ∪ {2, 3, 5, 7}
= {2, 3, 4, 5, 6, 7, 8}
Now, (A ∪ B)′ = ∪ − (A ∪ B) .
= {1, 9} ...(i)
Now A= U − A .
= {1, 3, 5, 7, 9} ...(ii)
and B=
′
U−B
= {1, 4, 6, 8, 9} ...(iii)
∴ A′ ∩ B′ {1, 3, 5, 7, 9} ∩ {1, 4, 6, 8, 9}
=
= {1, 9} ...(iv)
From (i) and (iv),
(A ∪ B)′ = A′ ∩ B′ Proved.
(ii) Again =
A ∩ B {2, 4, 6, 8} ∩ {2, 3,
= 5, 7} {2}
∴ (A ∩ B)′ =U − (A ∩ B)
= {1, 3, 4, 5, 6, 7, 8, 9} ...(v)
From (ii) and (iii),
A′ ∪ B′ {1, 3, 5, 7, 9} ∪ {1, 4, 6, 8, 9}
=
= {1, 3, 4, 5, 6, 7, 8, 9} ...(vi)
From (v) and (vi),
(A ∩ B)′ = A′ ∪ B′ Proved.
Ex.
IIT_JEE 18.
Let A, B and C be the sets such that A ∪ B = A ∪ C and A ∩ B = A ∩ C . Show
that B = C.
Sol. We have, A ∪ B = A ∪ C .
⇒ (A ∪ B) ∩ C = (A ∪ C) ∩ C
⇒ (A ∩ C) ∪ (B=
∩ C) C [ (A ∪ C)
= ∩ C C]
⇒ (A ∩ B) ∪ (B ∩ C) = C [ A ∩ C = A ∩ B] ...(i)
Again A ∪ B = A ∪ C .
⇒ (A ∪ B) ∩ B = (A ∪ C) ∩ B
⇒ B = (A ∩ B) ∪ (C ∩ B)[ (A ∪ B) ∩ B = B]
⇒ B = (A ∩ B) ∪ (B ∩ C) ...(ii)
From (i) and (ii) B = C Proved.
Ex. If A and B are any two sets, then prove that
(i) A − B = A ∩ B′
(ii) B − A = B ∩ A′
(iii) (A − B) ∪ (B − A) = (A ∪ B) − (A ∩ B)
Sol.
(i) Let x be any arbitrary element of the set A – B.
∴ x ∈A −B
⇒ x ∈ A and x ∉ B
⇒ x ∈ A and x ∈ B′
⇒ x ∈ A ∩ B′
∴ A − B ⊆ A ∩ B′ ...(i)
Again let y be any arbitrary element of the set A ∩ B′ .
∴ y ∈ A ∩ B′
⇒ y ∈ A and y ∈ B′
⇒ y ∈ A and y ∉ B
⇒ y ∈A −B
∴ A ∩ B′ ⊆ A − B ...(ii)
From (i) and (ii) A − B = A ∩ B′ Proved.

(ii) Solution is same as question part (i) [Do yourself]
(iii) Let x be an arbitrary element of set (A − B) ∪ (B − A) .
∴ x ∈ (A − B) ∪ (B − A)
⇒ x ∈ (A − B) or x ∈ (B − A)
IIT_JEE 19.
⇒ (x ∈ A and x ∉ B) or (x ∈ B and x ∉ A)
⇒ (x ∈ A or x ∈ B) and (x ∉ B or x ∉ A)
⇒ x ∈ (A ∪ B) and x ∉ (A ∩ B)
⇒ x ∈ (A ∪ B) − (A ∩ B)
∴ (A − B) ∪ (B − A) ⊆ (A ∪ B) − (A ∩ B) ...(iii)
Now, let y be an arbitrary element of the set (A ∪ B) − (A ∩ B) .
∴ y ∈ (A ∪ B) − (A ∩ B)
⇒ y ∈ (A ∪ B) and y ∉ (A ∩ B)
⇒ (y ∈ A or y ∈ B) and (y ∉ A or y ∉ B)
⇒ (y ∈ A and y ∉ B) or (y ∈ B and y ∉ A)
⇒ y ∈ (A − B) or y ∈ (B − A)
⇒ y ∈ (A − B) ∪ (B − A)
∴ (A ∪ B) − (A ∩ B) ⊆ (A − B) ∪ (B − A)
(A − B) ∪ (B − A) = (A ∪ B) − A ∩ B Proved.
Ex. For sets A, B and C using properties of sets, prove that
(i) A − (B − C) = (A − B) ∪ (A ∩ C)
(ii) A ∩ (B − C) = (A ∩ B) − (A ∩ C)
(
Sol. (i) A − (B − C) = A − B ∩ C′ )  B − C = B ∩ C′ 
 
( )  X − Y = X ∩ Y 
′
= A ∩ B ∩ C′ ′
=A ∩ (B ∪ C ) [ByDeMorgan′ slaw]
′
= ( A ∩ B ) ∪ (A ∩ C)
′
= (A − B) ∪ (A ∩ C) Proved.
(ii) Method 1:
Let x be any arbitrary element of A ∩ (B − C) .
∴ x ∈ A ∩ (B − C) ⇒ x ∈ A and x ∈ (B − C)
⇒ x ∈ A and (x ∈ B and x ∉ C)
⇒ (x ∈ A and x ∈ B) and (x ∈ A and x ∉ C)
⇒ x ∈ (A ∩ B) and x ∉ (A ∩ C)
⇒ x ∈ {(A ∩ B) − (A ∩ C)}
∴ A ∩ (B − C) ⊆ (A ∩ B) − (A ∩ C)
Similarly, we can prove that
IIT_JEE 20.
(A ∩ B) − (A ∩ C) ⊆ A ∩ (B − C)
From (A) and (B),
A ∩ (B − C) = (A ∩ B) − (A ∩ C) Proved.
Method 2:
( )
A ∩ (B − C) = A ∩ B ∩ C′
A ∩ (B − C) = A ∩ (B ∩ C ) ′
= (A ∩ B) ∩ C′
= φ ∪ (A ∩ B) ∩ C′
( ) (
=(A ∩ B) ∩ A′ ∪ (A ∩ B) ∩ C′ )  (A ∩ B) ∩ A′ =

φ

(
= (A ∩ B) ∩ A′ ∪ C′ )
= (A ∩ B) ∩ (A ∩ C)′
= (A ∩ B) − (A ∩ C)
Ex. In a group of 950 persons, 750 can speak Hindi and 460 can speak English and
each person knows at least one of these languages.
(i) How many persons can speak both Hindi and English?
(ii) How many persons can speak Hindi only?
(iii) How many persons can speak English only?
Sol. Method 1:
Let H denote the set of persons who speak Hindi and E, the set who speak
English.
∴ n(HUW) = 950
n(H) = 750
n(E) = 460
(i) Here we have to find (H ∩ E) ?
∴ n(H ∪ E)= n(H) + n(E) − n(H ∩ E)
⇒ 950 = 750 + 460 − n(H ∩ E)
⇒ (H ∩ E)= 1210 − 950= 260
(ii) Number of persons who can speak Hindi only
i.e. n(H − E)= n(H) − n(H ∩ E)
= 750 – 260
= 490
(iii) Number of persons who can speak English only
i.e. n(E − H) = n(E) − n(H ∩ E)
IIT_JEE 21.
= 460 – 260
= 200
Method 2:
Consider the Venn diagram shown in the figure.
Given a + b + c = 950 ...(i)

a + b = 750 ...(ii)
b + c = 460 ...(iii)
(i) Equation (i) – Equation (iii)
a = 950 – 460 = 490
∴ From (ii)
b = 750 – a = 750 – 490 = 260
(ii) From part (i)
a = 490 (iii) From equation (iii)
c = 460 – b = 460 – 260 = 200
Ex. In a survey it was found that 21 persons liked product P1 , 26 liked product P2
and 29 likec product P3 . If 14 persons liked products P1 and P2 ; 12 persons
liked product P3 and P1 ; 14 persons liked products P2 and P3 and 8 liked all
the three products. Find how many persons liked product P3 only.
Sol. Method 1:
Let P1 ,P2 and P3 denote the set of persons who like product P1 ,P2 and P3
respectively.
n (P1 ) 21,n
= = (P2 ) 26,n
= (P3 ) 29
n (P1 ∩ P=
2)
14,n (P3 ∩ P
=1)
12,n (P2 ∩ P=
3)
14
n (P1 ∩ P2 ∩ P3 ) =
8
Number of persons who liked the product P3 only
( )
= n P1′ ∩ P2′ ∩ P3 = n  (P1 ∪ P2 ) ∩ P3 

′
(
= n (P3 ) − n (P1 ∪ P2 ) ∩ P3 ) ( )
 n A ∩ B′ = n(A) − n(A ∩ B)
 
(
= n (P3 ) − n (P1 ∩ P3 ) ∪ (P2 ∩ P3 ) )
IIT_JEE 22.
= n (P3 ) − n (P1 ∩ P3 ) − n (P2 ∩ P3 ) + n (P1 ∩ P2 ∩ P3 )
= 29 − 14 − 12 + 8 = 37 − 26 = 11 [ n(A ∪ B) = n(A) + n(B) − n(A ∩ B)]
Method 2: Venn diagram method
Here we want to find g. Given that

a + b + e + d = 21 ...(i)
b + c + e + f = 26 ...(ii)
d + e + f + g = 29 ...(iii)
b + e = 12 ...(iv) d + e = 12 ...(v) e + f = 14 ...(vi)
e=8 ...(vii)
From (vi),
f = 14 – e
= 14 – 8 = 6
From (v),
d = 12 – e
= 12 – 8 = 4
∴ From (iii), g = 29 – d – e – f
= 29 – 4 – 8 – 6
= 29 – 18 = 11
Cartesian Product of Sets
Ordered pair
An ordered pair consists of two elements in a given order, for example (a,b), (
Ram, Shyam ), (α, β) etc.
NOTE:
(i) Ordered pair is not a set.
(ii) Ordering is important, i.e. (a,b) is different from (b, a) until and unless
specified.
(iii) Two elements need not be distinct.
Equality of ordered pairs
Two ordered pairs (a,b) and (α, β) are equal iff a = α and b = β or
(a,b) = (α, β) ⇔ a = α,b = β . In other words (a,b) ≠ (α, β) if either a ≠ α or b ≠ β
or both.
IIT_JEE 23.
For example:
(1, 2) = (1, 2) and (a,b) = (2, 3)
⇒ a=
2,b =
3, (1, 2) ≠ (1, 3), (2, 1) ≠ (3, 1), (2, 1) ≠ (1, 2) etc.
Cartesian product of sets
Let A and B be two non-empty sets, then the set of all ordered pairs (a,b)
such that a ∈ A and b ∈ B , is called Cartesian product of A and B denoted by
A ×B.
i.e. =
A × B {(a, b) ∣a ∈ A and b ∈ B}
If A = φ or B = φ , then we define A × B =φ
For example:
If A {1,
= = 2, 3},B {a,b} , then
(i) A ×B ={(1, a), (1,b), (2, a), (2,b), (3, a), (3,b)}
n(A × B) = 6 = 3 × 2 = n(A) ⋅ n(B)
(ii) A × A =
{(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}
n(A × A) =9 =(n(A))2
(iii) B × B ={(a, a), (a,b), (b, a), (b,b)} etc.
n(B × B) = 4 = (n(B))2
Observations:
(i) If A and B are finite sets (i.e. n(A) < ∞,n(B) < ∞ ), then n(A × B)= n(A) × n(B)
(ii) If n(A) = ∞ or n(B) = ∞ , i.e. either of A or B is infinite, then A × B is infinite
i.e. n(A × B) =∞
(iii) A × B = φ ⇒ A = φ or B = φ and
n(A × B) = 0 ⇒ n(A) = 0 or n(B) = 0

Some results on Cartesian product of sets
For any four sets A, B, C and D
(i) A × (B ∪ C) = (A × B) ∪ (A × C), A × (B ∩ C) = (A × B) ∩ (A × C)
(ii) A × (B − C) = (A × B) − (A × C)
(iii) A × B = B × A ⇔ A = B
(iv) A ⊆ B ⇒ A × A ⊆ (A × B) ∩ (B × A) and A × C ⊆ B × C
(v) A ⊆ B and C ⊆ D ⇒ A × C ⊆ B × D
(vi) (A × B) ∩ (C × D) = (A ∩ C) × (B ∩ D)
( ) ( )
′ ′
(vii) A × B′ ∪ C′ = (A × B) ∩ (A × C), A × B′ ∩ C′ = (A × B) ∪ (A × C)
(vii) n(A ∩ B) = n ⇒ n((A × B) ∩ (B × A)) = n2
IIT_JEE 24.
(ix) A × B = A × C ⇒ B = C provided A ≠ φ
NOTE:
Any of the above equality (or containment) can be proved using usual
technique of proving equality (or containment) of two sets,
i.e. A = B ⇒ A ⊆ B and B ⊆ A i.e. x ∈ A ⇒ x ∈ B and y ∈ B ⇒ y ∈ A
For example:
To prove
(i) A × (B ∪ C) = (A × B) ∪ (A × C)
(ii) A ⊆ B and C ⊆ D ⇒ A × C ⊆ B × D
Proof:
(i) Let (a,b) ∈ A × (B ∪ C)
⇒ a ∈ A and b ∈ B ∪ C
⇒ a ∈ A and (b ∈ B or b ∈ C)
⇒ (a ∈ A and b ∈ B) or (a ∈ A and b ∈ C)
⇒ (a,b) ∈ (A × B) or (a,b) ∈ (A × C)
⇒ (a,b) ∈ (A × B) ∪ (A × C)
⇒ A × (B ∪ C) ⊆ (A × B) ∪ (A × C) …… (i)
Similarly, let (a,b) ∈ (A × B) ∪ (A × C)
⇒ (a,b) ∈ (A × B) or (a,b) ∈ (A × C)
⇒ a ∈ A and b ∈ B or (a ∈ A and b ∈ C)
⇒ a ∈ A and (b ∈ B or b ∈ C)
⇒ a ∈ A and b ∈ (B ∪ C)
⇒ (a,b) ∈ A × (B ∪ C)
⇒ (A × B) ∪ (A × C) ⊆ A × (B ∪ C) …… (ii)
From (i) and (ii) we get
A × (B ∪ C) = (A × B) ∪ (A × C)
(ii) Let (a,b) ∈ A × C
⇒ a ∈ A and b ∈ C
⇒ a ∈ B and b ∈ D( as A ⊆ B and C ⊆ D)
⇒ (a,b) ∈ B × D
⇒ A × C ⊆ B×D
Relations From A to B
Let A {a,b},B
= = {1, 2, 3}
IIT_JEE 25.
Here R is a relation connecting a ∈ A to {1, 2} ⊆ B,b ∈ A to 3 ∈ B or a is
related to 1 , a is related to 2 and b is related to 3
or denoted by aR1, aR2, bR3
or (a, 1) ∈ R, (a, 2) ∈ R, (b, 3) ∈ R
or R = {(a, 1), (a, 2), (b, 3)}
Also A × B ={(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3)}
∴ R ⊆ A ×B
Definition of relation
Let A and B be the two sets, then R is relation from A to B iff R ⊆ A × B ,
i.e. R is relation from A to B ⇒ R ⊆ A × B and R ⊆ A × B ⇒ R is a relation from
A to B .
NOTE
If R is a relation from A to B , then a ∈ A is related to b ∈ B ⇒ aRb or
(a,b) ∈ R and a is not related to b ⇒ aRb or (a,b) ∉ R .
Total number of relations from A to B
Let A and B be two sets having m and n elements respectively, then
mn and number of relations from A to B is 2mn , as a relation is a

n(A × B) =
subset of A × B , and number of subsets of a set having n elements is 2n .

For example:
= = {1} , then A × B =
Let A {a,b},B {(a, 1), (b, 1)}
Subsets possible are φ, {(a, 1)}, {(b, 1)}, {(a, 1), (b, 1)}
Hence there are 4 relations possible from A to B .
φ and universal relation A × B are called trivial relations from A to B .
IIT_JEE 26.
Domain and range of a relation
Let A {1,
= = 2, 3},B {a,b, c, d} , then n(A × B) = 3 × 4 = 12 and
number of relations possible from A to B is 212 . Let R be

a relation from A to B given by R = {(1, a), (1, d), (3,b), (3, d)} ,
i.e.
Then domain of R = {1, 3} and Range of R = {a,b, d} i.e.
domain of R is the set of all the first components of the ordered pairs of R
and range of R is the set of all the second components of the ordered pairs
of R .
i.e. Dom(R)
= {a ∣(a,b) ∈ R} and Range
= (R) {b ∣(a,b) ∈ R}
Note that Dom(R) ⊆ A and Range(R) ⊆ B

Relation on a set A
Let A be a non-empty set, then a relation from A to itself, i.e. a subset of
A × A is said to be a relation on set A .
For example:
If A = {1, 2, 3} , let R ⊆ A × A be R = {(1, 1), (1, 2), (2, 3)} , then R is relation on set A
shown below
Dom(R)
= {1, 2}, Range
= (R) {1,
= 2, 3} A
Ask Yourself
What is the number of non-trivial relations on the set A = {1, 2, 3}?
Inverse relation
Let A and B be two sets and R be a relation from A to B , then inverse of R
(denoted by R−1 ) is a relation from B to A defined

= as R−1 {(b, a) ∣(a,b) ∈ R}
i.e. (a,b) ∈ R ⇒ (b, a) ∈ R−1

For example:
If A {1,
= = 2},B {a,b, c}
R = {(1, a), (2,b), (2, c)} be a relation from A to B
IIT_JEE 27.
Dom (R) = {1, 2} = A
Range (R) = {a, b, c} = B
Then R–1 is given by R−1 = {(a, 1), (b, 2), (c, 2)} or
Dom (R =)
−1
{a,b, c}= B= (R =) {1, 2}=
Range (R) and Range −1
A= Dom(A) In
general Dom (R) = Range (R ) and Range (R) = Dom (R )

−1 −1
Solved Examples
Ex. =
If A {2,
= 4},B {3, 4, 5} then (A ∩ B) × (A ∪ B) is
(a) {(2, 2), (3, 4), (4, 2), (5, 4)}

(b) {(2, 3), (4, 3), (4, 5)}
(c) {(2, 4), (3, 4), (4, 2), (4, 5)}
(d) {(4, 2), (4, 3), (4, 4), (4, 5)}
Sol. (d) A ∩ B ={4}
A ∪B ={2, 3, 4, 5}
(A ∩ B) × (A ∪ B) =
{(4, 2), (4, 3), (4, 4), (4, 5)}
Ex. For any four sets A, B, C, D prove that (A × B) ∩ (C × D) = (A ∩ C) × (B ∩ D)
Sol. Let (a,b) ∈ (A × B) ∩ (C × D)
⇒ (a,b) ∈ (A × B) and (a,b) ∈ (C × D)
⇒ (a ∈ A and b ∈ B) and (a ∈ C and b ∈ D)
⇒ a ∈ A ∩ C and b ∈ B ∩ D
⇒ (a,b) ∈ (A ∩ C) × (B ∩ D)
⇒ (A × B) ∩ (C × D) ⊆ (A ∩ C) × (B ∩ D) …… (i)
Let (x, y) ∈ (A ∩ C) × (B ∩ D) ⇒ x ∈ A ∩ C and y ∈ B ∩ D
⇒ (x ∈ A and x ∈ C) and (y ∈ B and y ∈ D)
IIT_JEE 28.
⇒ (x ⊂ A and y ⊂ B) and (x ⊂ C and y ⊂ D)
⇒ (x, y) ∈ (A × B) and (x, y) ∈ (C × D)
⇒ (x, y) ∈ (A × B) ∩ (C × D)
⇒ (A ∩ C) × (B ∩ D) ⊆ (A × B) ∩ (C × D) …… (ii)
Hence from (i), (ii) (A × B) ∩ (C × D) = (A ∩ C) × (B ∩ D)
Ex. If A {a,b,
= = c, d},B {1, 2, 3} , find whether the following sets of ordered pairs are
relations from A to B or not.
(i) R1 = {(a, 1), (a, 3), (b, 4)}
(ii) R2 = {(b, 1), (c, 2), (d, 1)}
(iii) R3 = {(a, 1), (b, 2), (3, c)}
Sol. Relation from A to B is ⊆ A × B

A ×B ={(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3), (c, 1), (c, 2), (c, 3), (d, 1), (d, 2), (d, 3)}
(i) R1 = {(a, 1), (a, 3), (b, 4)}
R1 ⊂/ A × B as (b, 4) ∉ A × B
∴ Not a relation
(ii) R2 {(b, 1), (c, 2), (d, 1)} ⊆ A × B
=
∴ R2 is a relation from A to B
(iii) R3 {(a, 1), (b, 2), (3, c)} ⊂/ A × B
=
As (3, c) ∉ A × B
∴ R3 is not a relation.
Ex. Let A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

= and R {(x, y) ∣x, y ∈ A and 2x + y =10} , find
(i) R and R−1 as sets of ordered pairs,
(ii) domain of R and R−1 ,
(iii) Range of Rand R−1

−1
(iv) RoR and RoR .
Sol. (i) R = {(1, 8), (2, 6), (3, 4), (4, 2)}
∴ R−1 = {(8, 1), (6, 2), (4, 3), (2, 4)}

(ii) Dom (R) = {1, 2, 3, 4} Dom (R–1) = {8, 6, 4, 2}
(iii) Range (R) = {8, 6, 4, 2}
Range (R–1) = {1, 2, 3, 4}
(iv)
IIT_JEE 29.
Ex. Determine the domain and range of relations given below.
(i)=R {( x, x ) ∣x ∈ N, x < 6}
2
(ii) R ={(| x + 2 |,| x − 4 |) | x ∈ Z;| x ∣

< 4}
Sol.=
(i) R {( x, x ) ∣x ∈ {1, 2, 3, 4, 5}}
2
= {(1, 1), (2, 4), (3, 9), (4, 16), (5, 25)}
Domain (R) = {1, 2, 3, 4, 5}
Range (R) = {1, 4, 9, 16, 25}

(ii) R= {(| x + 2 |,| x − 4 |) ∣x ∈ {−3, −2, −1, 0, 1, 2, 3}}
= {(1, 7), (0, 6), (1, 5), (2, 4), (3, 3), (4, 2), (5, 1)}
Domain (R) = {1, 0, 2, 3, 4, 5}
Range (R) = {7, 6, 5, 4, 3, 2, 1}
(Page Number 28–42; till start of function is in class XII syllabus of CBSE .
Students may learn this portion in class XII) Types of Relations on a Set A Let
A be any non-empty set, a subset of A × A is a relation on A.
Types of Relations on a Set A
Let A be any non-empty set, a subset of A × A is a relation on A .
(i) Void Relation
IIT_JEE 30.
φ ⊆ A × A , hence φ is a relation on A called as void or empty relation. φ is the
smallest relation on A .
(ii) Universal Relation
A × A ⊆ A × A , hence A × A is a relation on A called as universal relation on A.
A × A is the largest relation on A .
For example:
if A = {1, 2} , then universal relation = {(1, 1), (1, 2), (2, 1), (2, 2)}
(iii) Identity Relation
=IA {(a, a ) ∣a ∈ A} ⊆ A × A is called the identity relation on A , i.e. IA is relation
on A in which every element of A is related to itself and not to any other

element.
For example:
If A = {1, 2, 3} , then IA = {(1, 1), (2, 2), (3, 3)}
NOTE
R1 = {(1, 1), (2, 2)} and R2 = {(1, 1), (2, 2), (3, 3), (2, 3)} on {1, 2, 3} both are non
identity relations, because in R1 , 3 is not related to any element and because
in R2 , 2 is related to 3 .
(iv) Reflexive Relation

A relation R on A is reflexive if IA ⊆ R , i.e. every element of A is at least
related to itself. In that case R2 as defined above is reflexive but not R1 .
Identify relation on A , i.e. IA is always a reflexive relation but not vice versa.
Also universal relation A × A is always a reflexive relation. Hence R on A is

reflexive ⇒ (a, a) ∈ R.∀a ∈ A
Relation R on A is not a reflexive relation if (a, a) ∉ R for some a ∈ A .
Example Set 1:
IIT_JEE 31.
Reflexive relations: R1 ,R2 ,R5 are reflexive relations as
=IA {(1, 1), (2, 2), (3, 3)} ⊆ R1 ,R2 ,R5
Non-reflexive relations: R3  (3, 3) ∉ R3
R4  (1, 1), (2, 2), (3, 3) ∉ R4
R6  (2, 2), (3, 3) ∉ R6
Observations
(i) (IA) = A = Range (IA)
(ii) Dom (Reflexive relation on A)= A= Range (Reflexive relation on A)
Ask Yourself
If R ⊆ A × A and= = A , then
Dom(R) Range(R)
(i) is R an identity relation?
(ii) is R a reflexive relation?
(v) Symmetric Relation
IIT_JEE 32.
Let R be a relation on A , i.e. R ⊆ A × A , then R is symmetric relation on A iff
(a,b) ∈ R ⇒ (b, a) ∈ R or aRb ⇒ bRa
Example Set 2:
Let A = {1, 2, 3}
Symmetric Relations (R1 ,R2 ,R4 ,R6 )
R1  There is no (a,b) ∈ φ for which there is a necessity of (b, a) ∈ φ , hence φ
is vacuously a symmetric relation.

R2 ,R4 ,R6 : ∀(a,b) ∈ Ri , (b, a) ∈ Ri , i =
2, 4, 6
Non-symmetric Relations: R3 : (2, 1) ∈ R3 but (1, 2) ∉ R3
R5 : (1, 2) ∈ R5 but (2, 1) ∉ R5 .
Observations:
(i) A relation R is not a symmetric relation if there exist (a,b) ∈ R but
(b, a) ∉ R
IIT_JEE 33.
R−1 or R ≠ R−1 ⇔ R is not a symmetric
(ii) R is a symmetric relation ⇔ R =
relation
Proof:
Let R be a symmetric relation.
To prove: R = R−1 .
Let (a,b) ∈ R ⇒ (b, a) ∈ R (as R is symmetric).
⇒ (a,b) ∈ R−1
∴ R ⊆ R−1 …… (i)
Now let (x, y) ∈ R−1 .

⇒ (y, x) ∈ R
⇒ (x, y) ∈ R (as R is symmetric)
∴ R−1 ⊆ R …… (ii)
From (i) and (ii), we get R = R−1
Let R = R−1 .
To prove: R is symmetric
Let (a,b) ∈ R ⇒ (a,b) ∈ R−1 ( as R = R−1 )

⇒ (b, a) ∈ R
⇒ R is symmetric
Ask Yourself
Is identity relation symmetric? Is reflexive relation symmetric?
(vi) Transitive Relation
Let R be a relation on A , i.e. R ⊆ A × A , then R is transitive relation on A iff
(a,b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R or aRb and bRc ⇒ aRc
Example Set 3:
IIT_JEE 34.
Transitive Relations: R1 ,R3 ,R6 ,R9 for every (a,b), (b, c) ∈ R, (a, c) ∈ R
Non-transitive Relations: R2 : (1, 3), (3, 1) ∈ R2 but (1, 1) ∉ R2
(R2 ,R4 ,R5 ,R7 ,R8 ) R4 : (3, 2), (2, 1) ∈ R4 but (3, 1) ∉ R4
R5 : (1, 2), (2, 1) ∈ R5 but (1, 1) ∉ R5
R7 : (1, 2), (2, 3) ∈ R7 but (1, 3) ∉ R7
R8 : (2, 3), (3, 2) ∈ R8 but (2, 2) ∉ R8
Ask Yourself
IIT_JEE 35.
Is adding (1, 1) to R2 makes it transitive?
R′2 = {(1, 1), (1, 2), (1, 3), (2, 3), (3, 1)}
Ans. No  (2, 3), (3, 1) ∈ R2 but (2, 1) ∉ R2
Is further adding (2, 1) to R2 makes it transitive?
R2 = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 3), (3, 1)}
Ask Yourself
Is further adding (2, 2) to R2 makes it transitive?
R
2
= {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1)}
Ans. No  (3, 1)(1, 2) ∈ R

2
but (3, 2) ∉ R2
Also (3, 1), (1, 3) ∈ R

2
but (3, 3) ∉ R2
Now adding (3, 2), (3, 3) to R2 makes it a universal relation, i.e.
R
2
= {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)} and universal relation is a
transitive relation.
Add elements to R4 to make it transitive. Let us add (3, 1) to R4 .
R′4 = {(1, 1), (2, 1), (2, 2), (3, 1), (3, 2), (3, 3)}
Is R′4 transitive?
Observation
A relation R is not transitive if there exist (a,b), (b, c) ∈ R but (a, c) ∉ R
Ask Yourself
Is identity relation transitive?
Is symmetric relation transitive?
Is transitive relation symmetric?
NOTE
Symmetric and transitive relations are conditional relations, i.e. dependent on
existence of some elements whereas identity and reflexive are true for all the
elements of the set.
(vii) Equivalence Relation
A relation R on A is an equivalence if it is
(a) Reflexive: (a, a) ∈ R∀a ∈ A
(b) Symmetric: If (a,b) ∈ R ⇒ (b, a) ∈ R
(c) Transitive: If (a,b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R
IIT_JEE 36.
Ex. Identify which of the relations in example set 1, 2, 3 given above are
equivalence relations.
Sol. Example Set 1
R1 is reflexive, transitive but not symmetric as (2, 3) ∈ R1 , but (3, 2) ∉ R1
R2 = IA being an identity relation is equivalence relation
R3 not reflexive as (3, 3) ∉ R3 .
not symmetric as (2, 3) ∈ R3 but (3, 2) ∉ R3
not transitive as (2, 3), (3, 1) ∈ R3 but (2, 1) ∉ R3
R4 = φ not reflexive but symmetric and transitive
R5= A × A being universal relation is equivalence relation
R6 not reflexive, because (2, 2) or (3, 3) ∉ R
not symmetric as (2, 1) ∈ R6 but (1, 2) ∉ R6 is transitive
Example Set 2
R1 = φ : not reflexive but symmetric and transitive
R2 = IA : is equivalence relation
R3 : not reflexive (2, 2), (3, 3) ∉ R3
not symmetric (2, 1) ∈ R3 but (1, 2) ∉ R3 transitive
R4 : not reflexive (1, 1) ∉ R4 is symmetric
not transitive: (1, 2), (2, 1) ∈ R4 but (1, 1) ∉ R4
R5 : not reflexive as (2, 2) ∉ R5
R6 : not reflexive as (1, 1), (3, 3) ∉ R6 symmetric
Example Set 3
R2 : not reflexive as (1, 1), (2, 2), (3, 3) ∉ R2
not transitive as (1, 2) ∈ R2 and (2, 3) ∈ R2 but (1, 3) ∉ R2
R4 : is reflexive
IIT_JEE 37.
not symmetric (2, 1) ∈ R4 , (1, 2) ∉ R4
R5 : not reflexive as (1, 1), (2, 2), (3, 3) ∉ R5 is symmetric
not transitive as (2, 1) ∈ R and (1, 2) ∈ R5 but (2, 2) ∉ R5 .
R6 : not reflexive as (2, 2), (3, 3) ∉ R6
R7 : not reflexive as (1, 1), (2, 2), (3, 3) ∉ R7
R8 : not reflexive as (2, 2) ∉ R8 is symmetric
not transitive as (2, 3) ∈ R8 and (3, 2) ∈ R8 but (2, 2) ∉ R8 .
R9 : not reflexive as (3, 3) ∉ R9
Ex. Give two examples of a relation on A = {1, 2, 3} which is neither identity nor
universal but an equivalence relation.
Sol. R1 : {(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)}
R2 : {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
Observation:
(i) A relation R on A is not an equivalence relation if it not reflexive: (a, a) ⊂/ R
for some a ⊂ A
or not symmetric: (a,b) ∈ R but (b, a) ∉ R
or not transitive: (a,b), (b, c) ∈ R but (a, c) ∉ R
(ii) If R and S are equivalence relations on A , then
(a) R ∩ S is also an equivalence relation
(b) R ∪ S may or may not be equivalence relation
(c) R−1 and S−1 are equivalence relations.

Proof:
(a) Reflexive: (a, a) ∈ R, (a, a) ∈ S∀a ∈ A (R, S is reflexive)
∴ (a, a) ∈ R ∩ S∀a ∈ A ⇒ R ∩ S
Symmetric: Let (a,b) ∈ R ∩ S ⇒ (a,b) ∈ R and (a,b) ∈ S
⇒ (b, a) ∈ R and (b, a) ∈ S (As R, S are symmetric)
IIT_JEE 38.
(b, a) ∈ R ∩ S ⇒ R ∩ S is symmetric
Transitive: Let (a,b), (b, c) ∈ R ∩ S
⇒ (a,b), (b, c) ∈ R and (a,b), (b, c) ∈ S
⇒ (a, c) ∈ R and (a, c) ∈ S (As R, S are transitive)
⇒ (a, c) ∈ R ∩ S
⇒ R ∩ S is transitive
Hence, R ∩ S is an equivalence relation.
(b) Let A = {1, 2, 3} .
R {(1,
= 1), (2, 2), (3, 3), (2, 3), (3, 2)}, S {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
Both R and S are equivalence relation.
R∪S ={(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2)}
But R ∪ S is not an equivalence relation as
(3, 2), (2, 1) ∈ R ∪ S but (3, 1) ∉ R ∪ S
If we take R = S an equivalence relation, then R ∪ S is also an
equivalence. Hence RUS may or may not be equivalence.
R−1 or
(c) If R or S be equivalence relation, then it is also symmetric ⇒ R =
S = S−1 . Hence R−1 or S−1 is an equivalence relation.

(viii) Antisymmetric
A relation R on A is antisymmetric iff (a,b) ∈ R and (b, a) ∈ R ⇒ R =b , i.e. for
an antisymmetric relation if (a,b) ∈ R and a ≠ b , then (b, a) ∉ R .
Or a relation R is not antisymmetric if there exist a pair (a,b) ∈ R for which
(b, a) ∈ R but a ≠ b .
For example:
R1 = {(1, 1), (2, 2), (1, 3)},R2 = φ on {1, 2, 3} are antisymmetric
(ix) Partial order

A relation which is reflexive, antisymmetric and transitive is called partial order
relation.
Composition of Relations
Let R be a relation from A to B and S be from B to C , then we can define a
relation SoR from A to C called as composition of R and S such that
(a, c) ∈ SoR iff ∃b ∈ B such that (a,b) ∈ R and (b, c) ∈ S or aSoRc ⇒ ∃b ∈ B
such that aRb and bSc
IIT_JEE 39.
Let A = {1, 2, 3},B = {a,b, c}, C = {α, β} also let R be a relation from A to B given
as R = {(1, a), (1, c), (2, c), (3,b)} and S be from B to C given as
S = {(a, α), (b, β), (c, α), (c, β)} i.e.
then SoR = {(1, α), (1, β), (2, α), (2, β), (3, β)} (1, α) ∈ SoR as ∃ a ∈ B such that
(1, a) ∈ R and (a, α) ∈ S

Similarly, (1, β) ∈ SoR as (1, c) ∈ R and (c, β) ∈ S and others.
NOTE
(3, α) ∉ SoR as there exist no relation from 3 to α via elements of B .
Observations:
(i) In general RoS ≠ SoR , also its possible that RoS may not exist even if SoR
exist like in above example RoS does not exist.
(ii) If R is a relation from A to B and S be from B to C, then SoR is a relation
from A to C and (SoR)−1 is a relation from C to A given by
(SoR)−1 = R−1oS−1 .
Proof:
Let (c, a) ∈ (SoR)−1

⇒ (a, c) ∈ SoR
⇒ ∃ b ∈ B such that (a,b) ∈ R and (b, c) ∈ S
⇒ (b, a) ∈ R−1 and (c,b) ∈ S−1
⇒ (c, a) ∈ R−1 0S−1
⇒ R−1OS−1 ⊆ (SoR)−1
Hence from (i) and (ii).
IIT_JEE 40.
(SoR)−1 = R−1oS−1
Function
Let A and B be two non-empty sets having m and n elements respectively,
then the number of relations possible from A to B is 2mn . Out of these 2mn
relations some are called function (or mappings) from A to B provided
following two conditions hold in the relation:
(i) All the elements of A are associated to elements of B .
(ii) Each element of A is associated to one and only one element of B , i.e.
no element of A is associated to two (or more) elements of B .
Definition
Function ‘ f ‘ from set A to set B associates each element of A to unique
(i.e. one and only one) element of B denoted by f : A → B (read as ‘f from A
to B ‘)
For example:
Let
= = {1, 2} , then A × B =
A {a,b},B {(a, 1), (a, 2), (b, 1), (b, 2)} and number of
relations from A to B is 22.2 4

= 2= 16 given by
IIT_JEE 41.
Out of these 16 relations only 4 are functions namely R7 ,R8 ,R9 and R10 as they
satisfy both the conditions, i.e. all the elements of A are associated to one
and only one element of B . Relations R1 ,R2 ,R3 ,R4 ,R5 violates only condition 1,
i.e. some of the elements of A are not associated to elements of B . Relations

R6 and R11 violates both the conditions, i.e. some element of A are not
associated and some associated to more than one elements of B .

Relations R12 ,R13 ,R14 ,R15 and R16 violates only condition 2, i.e. some elements
of A are associated to more than one element of B .

Observations:
(i) A relation from A to B is not a function if it either violates condition 1 or
2 or both, i.e. either some element of A is not associated to element of B
or some element of A is associated to more than one elements of B or
both.
(ii) In a function from A to B , two elements of A can be associated to one
element of B (examples R7 ,R10 )
IIT_JEE 42.
(iii) If f : A → B be the function, then o(f) = o(A) and Dom(f) = A.
Domain, Codomain and Range of a Function
Let f : A → B be the function, then set ' A ' is called the domain of f and set
' B ' is called the codomain of f . The set of those elements of B which are
related by elements of A is called range of f or image of set A under f and
is denoted by f(A) , i.e. f(A)
= {f(a) ∣a ∈=
A} Range of f. Clearly, f(A) ⊆ B .
For Example
In the above function R7a,b are called the pre-image of 1 . In R8 : a is called
the pre-image of 1 and b the preimage of 2 and so on.

Ex. Let A = {−2, −1, 0, 1, 2},B = {0, 1, 2, 4} , then check whether relation f from A to B
given by
(i) f(x) = x2
(ii) f(x) =| x |
(iii) f(x) = 2x
is a function or not. Also find range of f in each case.
IIT_JEE 43.
Sol. (i) f( −2) =( −2)2 =4 ∈ B
f( −1) =( −1)2 = 1 ∈ B
f(0)= 02= 0 ∈ B
f(1)= 12 = 1 ∈ B
f(2)= 22= 4 ∈ B
All the elements of A are associated uniquely to the elements of B . Hence f
is the function.
Range
= (f) {0,
= 1, 4} f(A)
(ii) f( −2) = | −2 | =2 ∈ B
f( −1) = | −1 | = 1 ∈ B
f(0)= | 0 |= 0 ∈ B
f(1)= | 1 | = 1 ∈ B
f(2)= | 2 |= 2 ∈ B
All the elements of A are associated uniquely to the elements of B . Hence f

is the function. Range
= (f) {0,
= 1, 2} f(A)
(iii) f( −2) =2( −2) =−4 ∉ B
f( −1) =2( −1) =−2 ∉ B
f(0)= 2(0)= 0 ∈ B
f(1)= 2(1)= 2 ∈ B
f(2)= 2(2)= 4 ∈ B
Here −2 and −1 belongs to A but not associated to the elements of B . Hence
violates condition 1.
∴ f is not a function from A to B.
NOTE
If domain of the function f is finite, then o(f), i.e. number of elements in the
function is also finite and we can define f by giving the images under f
explicitly.
Say if A = {1, 2, 3}
= and B {2, 4, 6}f : A → B , then f can be defined as
f(1) 2,
= = f(2) 4 and f(3) = 6 , but in case if A is infinite say f : z → z or
f : R → R etc., then f is defined by a formula for example f : z → z given by
f(x) = 2x or f : R → R given by f(x) = sin x etc.
Equal Functions
Two functions f and g are said to be equal iff
IIT_JEE 44.
(i) Dom(f) = Dom(g)
(ii) Codom ( f) = Codom(g)
(iii) f(x)= g(x)∀x ∈ Dom(f) or Dom(g)
If all these three conditions holds, then we can write f = g .

Mathematical Way to Prove a Relation to be a Function
If A and B be two non-empty sets, f be the relation from A to B (i.e.
f ⊆ A × B ), then f is function from A to B if
(i) ∀a ∈ A∃b ∈ B st. (a,b) ∈ f and
(ii) x =y ⇒ f(x) =f(y) for any x, y ∈ A
Some Standard Real Functions and Their Graphs
Real functions
Functions in which both domain and
codomain are the subsets of R, i.e. set of
real numbers.
=y f(x) : [a, c] → R , then
Domain of f is [a, c]
Codomain is R
Range is [u, w]
Constant function: f(x) = c
Let f : R → R be the real function defined as
f(x)
= c ∀x ∈ R for some c ∈ R
Dom (f) = R , Codomain (f) = R ,

Range (f) = {c}
NOTE
f : A → B is constant function if ∀a ∈ A, f(a) =c for some c ∈ B.
Identity function: f( x ) = x
f(x) = x∀x ∈ R
Dom(f) = R
Codomain (f) = R
Range (f) = R
NOTE
IIT_JEE 45.
f : A → A , given by f(a) = a∀a ∈ A is identity function denoted by IA (same as
identity relation)
Modulus function: f(x) = | x |
 x, x ≥ 0
f(x)
= |=x| 
−x, x < 0
Domain (f) = R , Codomain (f) = R ,

Range (f) = {x ∣x ∈ R, x ≥ 0} = [0, ∞)
(as | x | ≥ 0)
= set of non-negative real numbers.
Greatest integer function: f(x) = [x]

f(x) = [x]∀x ∈ R = greatest integer less than or equal to x .
For example:
[2.1] = 2 , i.e. greatest integer less than or equal to 2.1 is 2 , similarly
[−2.1] =
−3
[2] = 2
[3.9] = 3
[−3.9] =
−4
Hence [x]= 0 ∀0≤x<1
= 1 ∀ 1 ≤ x < 2 = 2 ∀ 2 ≤ x < 3 and so on.
Also [x] = −1 ∀ − 1 ≤ x < 0
= −2 ∀ − 2 ≤ x < −1 and so on.
Combining we get [x] = n for

n ≤ x < n+ 1 ∀ n∈z
Filled circle means, point is on the graph.

unfilled circle means, point is not on the graph.
IIT_JEE 46.
Dom (f) = R , Codomain (f) = R
Range (f) = z
Exponential function: f(x) = a x

Let f :R →R be the real function
defined as
= ax
f(x) ∀x ∈ R and a > 0, a ≠ 1, a ∈ R
i.e. a ∈ (0, 1) ∪ (1, ∞)

Case I: Let 0 < a < 1
1 x 1
Say a = , then =
y a=
2 2x
Case II:
Let a > 1
Say a = 2, then y = ax = 2x
Domain (f) = R , Codomain (f) = R , Range (f)

= (0, ∞)
IIT_JEE 47.
Special case
a=e>1
y = f(x) = ex
Logarithmic function: y = logb x

Let f : (0, ∞) → R be the real function defined as
f(x)
= logb x∀x > 0 and b > 0,b ≠ 1,b ∈ R i.e. b ∈ (0, 1) ∪ (1, ∞)
Case 1: 0 < b < 1
Case 2: 1 < b
Domain(f) = (0, ∞), Codomain (f) =

R, Range (f) =
R
One-one function (or injective)

A function f : A → B is said to be one-one function or injective if different
elements of A have different images in B , i.e. if a,b ∈ A s.t. a ≠ b ⇒ f(a) ≠ f(b)
Thus f : A → B is 1 − 1 iff
a ≠ b ⇒ f(a) ≠ f(b)∀a,b ∈ A or f(a) = f(b) ⇒ a = b ∀a,b ∈ A
For example:
Let f : {a,b} → {1, 2} be the function given by
IIT_JEE 48.
Here only (ii) and (iii) are one-one functions
In (i) a ≠ b but f(a)
= f(b)
= 1
In (iv) a ≠ b but f(a)
= f(b)
= 2
Hence (i) and (iv) are not one-one functions.
Observation:
(i) To check injectivity of functions
Let f(x) = f(y) if it gives x = y only, then f is a one-one function.
(ii) x=y ⇒ f(x) =f(y) is true for all the functions (condition 2) but its
converse is true for one-one function.

(iii) Injectivity of f(x) can also be checked by its graph. If all lines parallel to
x -axis cut f(x) in not more than one point, then f(x) is one-one function,
i.e. f(x) is not a one-one function if at least one line parallel to x -axis
cuts f(x) in more than one point.
(iv) If f : A → B is 1 − 1 , then o(A) ≤ O(B)
For example:
Let f : R → R given by
(i) f(x) = 2x
(ii) f(x) = x2
(iii) f(x) =| x |
check whether f(x) is one-one or not.
Sol.
(i) Let f ( x 1 ) = f ( x2 )
⇒ 2x 1 = 2x2 ⇒ x 1 = x2
⇒ f is one-one
IIT_JEE 49.
(ii) Let f ( x 1 ) = f ( x2 )
⇒ x21 = x22
⇒ x 1 = x2 or x 1 = −x2
⇒ f is not one-one (As for f to be one-one, f ( x 1 ) = f ( x2 ) should imply
x 1 = x2 only)
Alternative:
f(2) = f( −2) = 4 but 2 ≠ −2
(iii) Let f ( x 1 ) = f ( x2 )
⇒ x 1 = x2 ⇒ x 1 =
x2 or x 1 = −x2 ⇒ f is not one-one
Alternative:
f(1) = f( −1) = 1 but 1 ≠ −1
Using graphs
(i)
Clearly, any line parallel to x-axis cuts f(x) = 2x only at one point, thus f(x) is
one-one.
(ii)
Clearly, y = 4 cuts 2 y x = in two points hence f(x) = x2 is not one-one

(iii)
IIT_JEE 50.
Clearly, y = 1 cuts y = |x| in two points hence f(x) = |x| is not one-one.
Many-one function
A function f : A → B which is not one-one is many-one function, i.e. at least
two different elements of A have same image in B or ∃x, y ∈ A s.t. x ≠ y but
f(x) = f(y) .
For example:
f, g : R → R given by f(x) = x2 , (or g(x)= | x |) ∀x ∈ R are both many-one
functions as 2 ≠ −2 but f(2) = f( −2) = 4 (or g(2) = g( −2) = 2) .

Onto function (or surjective)
A function f : A → B is said to be onto function or subjective if all the elements
of B have preimage in A , i.e. for each b ∈ B∃ some a ∈ A st f(a) = b or
(a,b) ∈ f
i.e. A function is not onto if ∃b ∈ B s.t. there is no a ∈ A for which f(a) = b .
For example:
Let f : {a,b} → {1, 2} be the function given by
Here functions (ii) and (iii) are onto functions as all the elements of B have
pre-image in A . In (i) 2 ∈ B have no pre-image in A and in (iv) 1 ∈ B have no
pre-image in A , thus not onto functions.
Observations:
(i) A : A → B is onto function iff
Range (f) = Codomain (f) = B
IIT_JEE 51.
Proof: Range (f) ⊆ Codomain(f) (by definition) let b ∈ B , then if f is onto
it has pre-image in A ⇒ b ∈ Range(f) (As range ( f ) contains those
elements of B which have pre-image in A). Hence codomain
(f) ⊆ Range (f)
∴ Range (f) = Codomain (f)
(ii) To check subjectivity of function f : A → B , take some y ∈ B and follow
the steps given below:
Step 1: Let f(x) = y
Step 2: Express x in terms of y from above equation say x = g(y)

Step 3: Now find the domain of g , if
Dom (g) = Codomain (f) (i.e. B) then f is onto (or surjective)
(iii) If f : A → B is onto, then o(A) ≥ o(B)

Into function
A function f : A → B which is not onto is into function, i.e. at least one element
of B have no pre-image in A or ∃b ∈ B such that there is no a ∈ A for which
f(a) = b .
So in example given above, functions, (i) and (iv) are into functions.
Bijective function (or one-one and onto)
A function f : A → B is said to be bijective if it is injective as well as surjective,
i.e. one-one as well as onto.
In other words f : A → B is bijective if
(i) f is one-one, i.e. f(x)= f(y) ⇒ x= y and
(ii) f is onto, i.e. for each b ∈ B∃ some a ∈ A st f(a) = b or

Range (f) = Codomain (f)
Observations:
(i) A function is not bijective if it is either not injective or not surjective or not
both.
(ii) If f is bijective, then it is injective ⇒ o(A) ≤ o(B) and surjective
⇒ o(A) ≥ o(B)
Hence o(A) = o(B) .
Number of Functions of Various Types
IIT_JEE 52.
o(A) m,
Let A and B be two non-empty sets, let= = o(B) n and f : A → B be
the function from A to B.
Number of functions from A to B
Each element of A can be associated to n elements of B , so total number of
functions that can be formed from
A to B is n × n × … × n (m times), i.e. nm . Hence total number of functions from
A to B = (o(B))o ( A )
Observations:
(i) Every function is a relation but not vice versa.
o(A) m,
(ii) If A and B are two non-empty sets such that= = o(B) n , then
number of relations possible from A to B is 2mn and number of functions
possible from A to B is nm .
(iii) Number of relations from A to B which are not functions is 2mn − nm or
2o(A).O(B) − (O(B))o(A) .
Number of one-one functions from A to B
Out of nm functions, from A to B some are one-one functions. Now if we

order the elements of A from 1 to m say first, second, ..., mth then for first
element of A we have n choices from set B , for second we have (n − 1)
choices from set B (as function has to be one-one) and so on. Thus total
number of one-one functions possible from A to B is n(n − 1)(n − 2) … (n − m + 1)
, i.e. nPm . Here note that m has to be less than or equal to n , i.e. o(A) ≤ o(B)
otherwise if m is greater than n, i.e. O(A) > O(B) no 1-1 function is possible
from A to B (as in that case first n elements of A will be associated to n
elements of B and still m − n elements of A remains to be associated).
 P
n
if m ≤ n
Hence number of 1-1 functions from A to B =  m
 0 m>n
Observations:
(i) Out of nm functions from A to B,n Pm functions are one-one (provided
m ≤ n ).
(ii) If m ≤ n,nm −n Pm functions from A to B are many-one functions.
(iii) If m > n , then all the nm functions are many-one functions.

Number of bijective functions from A to B
IIT_JEE 53.
A function is bijective iff function is 1 − 1 as well as onto. This implies
o(A) = o(B) , i.e. m = n . Hence for first element of A we have n options, for
second we have (n − 1) options and so on, for last we have only one option.
Therefore, total number of bijective functions from A to B is n(n − 1) … 2.1 =n!
Show all bijective functions from A → B ; where A = {a,b, c} and B = {x, y, z}
n! if m = n
Hence number of bijective functions = 
 0 if m ≠ n
Observations:
(i) If o(A) = o(B) and function is 1 − 1 , then function is onto also and hence
bijective.
(ii) If o(A) = o(B) and function is onto, then function is 1-1 also and hence
bijective.
Composition of Functions
Let f : A → B and g : B → C be two functions, then function gof : A → C
= g(f(x))∀x ∈ A is called the composition of f and g

defined as (g°f)(x)
Observations:
(i) For gof to exist, range of f must be subset of domain of g .
(ii) Similarly for fog to exit, range of g must be subset of domain of f .
Properties of composition of functions
(i) Composition of functions is non commutative, i.e. fog ≠ gof Note that its
possible that fog may not exist even if gof exists.
(ii) Composition of functions is associative, i.e. f, g,h be three functions.
IIT_JEE 54.
Then (fog) oh = fo (g°h)( provided they exist)
(iii) If f and g are bijections, then gof is also a bijection (provided exist)
(iv) Composition of identity function with any function f : A → B is f itself,
i.e. IA of= f=
A
f.
Inverse of an Element
Let f : A → B be the function from A to B , then for any a ∈ A , if f(a) = b , then
a is called the pre-image of ' b ' or inverse of ' b ' denoted by f −1 (b) .
For example:
Let f : A → B be given by,
then f −1 (b1 ) = {a 1 , a2 }
f −1 (b2 ) = {a3 , a4 }
f −1 (b3 ) = φ
NOTE
Inverse of an element may not be unique.
Inverse of a Function
If f : A → B be a bijective function, then we can define a new function from B
to A as inverse of f denoted by f −1 : B → A given by
f −1 (b) = a if f(a) = b∀b ∈ B

i.e. each element of B is associated (or mapped) to its pre-image under f
How to find f −1
If f : A → B is a bijective function, then f −1 can be obtained using following

steps:
(i) Let y = f(x)
(ii) Express x in terms of y , say x = g(y)

(iii) Interchanging x with y , i.e. x ↔ y , we get
=y g(x).
= Then g f −1
Note that before finding f −1 , you have to prove that f is a bijective function
(i.e. 1-1 as well as onto) by using the rules given before.
IIT_JEE 55.
Properties of inverse function
(i) Function is invertible if it is bijective.
(ii) Inverse of bijection is unique.
(iii) Inverse of bijection is also bijection.
−1
(iv) If f : A → B is a bijection, then f −1 of = IA and fof = IB where IA and IB
are identity functions on A and B respectively, i.e. ( f °f ) (a) =

−1
a and
( f°f ) (b) = b∀a ∈ A and b ∈ B

−1
Corollary: If f : A → A is bijection, then fof −1 = f −1 of = IA .
(v) If f : A → B and g : B → C be two bijections, then inverse of gof : A → C is
given by ( gof )−1 = f −1 0g −1
(vi) If f : A → B and g : B → A be two functions such that gof = IA and fog = IB,
then f and g are bijections and g = f −1
(vii) Domain (f) = Range f −1 ( ) and Range (f) = Domain ( f ) −1
Solved Examples
Ex. Let A = {a,b, c} and R = {(a, a), (a,b), (b, c)} be relation on A . What is the
minimum number of ordered pairs to be added to R , to make it transitive
relation?
Sol. (a,b), (b, c) ∈ R ⇒ (a, c) ∈ R for transitivity
Adding (a, c) to R, we get R ' = {(a, a), (a,b), (b, c), (a, c)}
R′ is a transitive relation.
Hence minimum number of elements is 1.
Ex. Let S be the set of all the straight lines on a plane and R be a relation on S
defined as R
= {(I ,I ) | I
1 2 1 }
| I2 ,I1 ,I2 ∈ S , then check R for reflexivity, symmetry
and transitivity.
Sol. Reflexive: (l 1 ,l 1 ) ∈ R as I1 is parallel to itself.
Symmetric: If (I1 ,I2 ) ∈ R ⇒ I1II2
⇒ I2 II I1
⇒ (l2 ,l 1 ) ∈ R
⇒ symmetric
Transitive: If (I1 ,I2 ) , (I2 ,I3 ) ∈ R
IIT_JEE 56.
⇒ I1II2 and I2II3
⇒ I1III3
⇒ (I1 ,I3 ) ∈ R ⇒ Transitive
Ex. Let S = {1, 2, 3, 4, 5} and let A= S × S . Define the relation R on A as follows
(a,b)R(c, d) if ad = cb′ , show that R is an equivalence relation.

Sol. Reflexive: (a,b)R(a,b) as ab = ab
⇒ Reflexive
Symmetric: If (a,b)R(c, d)
⇒ ad = cb
⇒ cb = ad
⇒ (c, d)R(a,b)
⇒ R is symmetric
Transitive: If (a,b)R(c, d) and (c, d)R(e, f)
⇒ ad cb
= = and cf ed
a c c e
⇒
= = and
b d d f
a e
⇒ = ⇒ af =eb
b f
⇒ (a,b)R(e, f) ⇒ Transitive
Hence R is an equivalence relation.
Ex. R be a relation defined on set of natural numbers N as
R {(x, y) ∣
= =x y or x − =
y 1, x, y ∈ N},
Sol. Reflexive: (a, a) ∈ R as a = a∀a ∈ N

⇒ Reflexive
Symmetric: If (a,b) ∈ R
a b or a =
⇒= −b 1
⇒ b =a or b − a =−1
⇒ (b, a) ∉ R
⇒ Not symmetric
Transitive: If (a,b), (b, c) ∈ R
⇒ (a = b or a – b = 1) and (b = c or b – c = 1)
⇒ (a = b and b = c) or (a = b and b – c = 1) or
⇒ (a – b = 1 and b = c) or (a – b = 1 and b – c = 1)
⇒ A = c or a – c 1 or a – c 2
IIT_JEE 57.
⇒ Not transitive.
Alternative: (3, 2), (2, 1) ∈ R but (3, 1) ∉ R hence not transitive.
Ex. Let n be a fixed positive integer, then a relation R on Z defined as $a R b$ or
(a,b) ∈ R ⇔ a − b is divisible by n , i.e.
=R {(a,b) ∣a,b ∈ Z and n divides a − b} . Show that R is an equivalence
relation.
Sol. Reflexive: (a, a) ∈ R∀a ∈ Z as n divides a − a =
0
⇒ R is reflexive
Symmetric: Let (a,b) ∈ R
⇒ n divides a − b ⇒ a − b =
nk for some k ∈ Z
⇒ b − a = n( −k) ⇒ n divides b − a
For some k 1 ,k2 ∈ Z
Adding two equations, we get
c n (k 1 + k2 ) ⇒ n divides a − c ⇒ (a, c) ∈ R ⇒ R is transitive

a −=
Hence R is an equivalence relation.

This relation on z is called as 'congruence modulo n ' relation and ' a − b is
divisible by n ' is denoted by a ≡ b( modn) (read as ' a is congruent to b
modulo n' ) i.e. a ≡ b( modn) if a − b is divisible by n .
Hence from above relation 'congruence modulo n' on z is an equivalence

relation.
Ex. Let A = {p, q,r, s} and B = {1, 2, 3} . Which of the following relations from A to B
is not a function?
(a) R1 = {(p, 1), (q, 2), (r, 1), (s, 2)} (b) R2 = {(p, 1), (q, 1), (r, 1), (p, 2)}
(c) R3 = {(p, 1), (q, 2), (r, 2), (s, 2)} (d) R4 = {(p, 2), (q, 3), (r, 2), (s, 2)}
Sol. (b)
R2 = {(p, 1), (q, 1), (r, 1), (p, 2)} is not a function as it violates both the conditions.
s ∈ A has no image in B and ' p ' has 2 images 1, 2 in B .
Ex. If f : R → R is defined by f(x)

= 2x+ | x | , then f(3x) − f( −x) − 4x =
(a) f(x) (b) −f(x)
(c) f( −x) (d) 2f(x)
Sol. (d)
f(x)
= 2x+ | x |
(3x) − f( −x) − 4x
IIT_JEE 58.
= 2(3x)+ | 3x | −2( −x)− | −x | −4x
= 6x + 3 | x | +2x− | x | −4x = 4x + 2 | x |
= 2(2x+ | x |) = 2f(x)
Ex. Mapping f : N → N given by f(n) = n2 + n + 1 is

(a) one-one into (b) one-one onto
(c) many-one onto (d) many-one into
Sol. 0
(a) Check for one-one
Let f(m) = f(n) for some m,n ∈ N
i.e. m2 + m + 1 = n2 + n + 1
⇒ m2 − n2 + m − n =0
⇒ (m − n)(m + n + 1) =0
m n or m + n
⇒= = +1 0
m n as m + n + 1 ≠ 0 as m,n ∈ N
=
∴ One-one
Check for onto
1 ∈ N (Codomain) let n ∈ N (Domain)
Such that f(n) = 1 ⇒ n2 + n + 1 = 1

n(n + 1) =
0
n = 0 ∉ N or n = −1 ∉ N
∴ 1 ∈ codomain has no pre-image
i.e. codomain ≠ range
∴ Not onto ⇒ into
Ex. Given X = {1, 2, 3, 4} find all one-one onto mappings f : X → X such that f(1) = 1,
f(2) ≠ 2 and f(4) ≠ 4
Sol.
IIT_JEE 59.
Hence in all , 3 one-one onto functions are possible with given conditions.
Ex. Let f=
: A {x, y, z} →
= B {a,b, c} be a one-one function. It is known that only
one of the following statement is true:

(i) f(x) ≠ b
(ii) f(y) = b
(iii) f(z) ≠ a
Find that statement and hence find function f .
Sol. Aso (A) = 0(B) and f is one-one ⇒ f is onto. Only one statement is true ⇒
Two statements are false.
Let (i) is true ⇒ f(x) ≠ b and (ii), (iii) are false
⇒ f(y) ≠ b and f(z) = a i.e. f(x) ≠ b, f(y) ≠ b, f(z) =
a
Contradiction as if f(x) ≠ b, f(y) ≠ b , then f(z) = b for function to be one-one

onto.
Let (ii) be true.
⇒ f(y) = b and (i), (iii) are false
f(y) b,
⇒ = = f(x) b,
= f(z) a
Contradiction as x ≠ y but f(x) = f(y)

Function is not one-one.
Let (iii) be true ⇒ f(z) ≠ a and (i), (ii) are false.
⇒ f(z) ≠ a, f(x) = b, f(y) ≠ b
Hence only statement (iii) is true.

Ex. Set A has 3 elements and set B has 4 elements. The number of one-one
functions that can be defined from A to B is
(a) 144 (b) 12
(c) 24 (d) 64
Sol. (C)
IIT_JEE 60.
oA < o(B)
Hence number of one-one functions
n 4 4!
= Pm
= P3
= = 24
(4 − 3) !
Ex. If R is a set of real numbers and f : R → R is given by the relation
= x2 , x ∈ R , then
f(x) sin x, x ∈ R and mapping g : R → R by the relation g(x)
=
prove f°g ≠ gof .
Sol. (f°g)(x) =
f(g(x))
= f x2 ( )
= sin
= x2 (gof) (x) g(f(x))
2
= g(sin
= x) sin
= x (sin x)2
Hence fog ≠ gof
1
Ex. Given
= f(x) = ,g fof and h = fofof, then the value of f(x) ⋅ g(x) ⋅ h(x) is
1− x
Sol. g(x) =°
(f f)(x) =
f(f(x))
 1 
= f 
1− x
1 1− x x−1
= = =
1 1− x − 1 x
1−
1− x
h(x) = (f°f°f)(x) = f((f°f)(x)) = f(g(x))
 x − 1 1 x
= f=
  = = x
 x  1− x − 1 x − x+1
x
1 x−1
f(x) ⋅ g(x) ⋅ h(x) = ⋅ ⋅ x =−1
1− x x
Ex. = x2 + 1 , then find the values of f −1 (17) and

If f : [0, ∞) → R defined by f(x)
f −1 ( −3) .
Sol. Let f −1 (17) = x
i.e.
= x2 + 1 17
f(x) 17 or =
⇒ x2 =16 ⇒ x =+4 ∈ [0, ∞) but − 4 ∉ [0, ∞)
⇒ f −1 (17) = {+4}
Let f −1 ( −3) =x ⇒ f(x) =−3 ⇒ x2 + 1 =−3
⇒ x2 =−4 ⇒ x =±2i ⇒ x ∉ R
IIT_JEE 61.
f −1 ( −3) =φ
Ex. = 3x − 4 , then f −1 (x) is

Let f : R → R be defined by f(x)
1 x
(a) (x + 4) (b) −4
3 3
(c) 3x + 4 (d) Not defined
−1
Hence find fof and f −1 of.
Sol. (a) Let =
y f(x)
= 3x − 4
y+4
⇒ x
= x ↔ y,
3
x+4
we get y =
3
x+4
⇒ f −1 (x) =
3
−1 x + 4 x + 4
fof= (x) f  =  3 =−4 x
 3   3 
(3x − 4) + 4
= f −1 (3x − 4)
Also, f −1 of (x) = = x
3
Multiple Choice Questions (Single Choice Correct):
1. Which of the following is an empty set?
(A) {x| x is a real number and x2 – 1 = 0}
(B) {x| x is a real number and x2 = x + 2}
(C) {x| x is a real number and x2 + 1 = 0}
(D) {x| x is a natural number and x2 = 5x – 6}
2. If A = {a, {b}}, find n(P(A)).
(A) 2 (B) 3
(C) 4 (D) 1
3. If A and B are two sets, then A ∩ (A ∪ B) is
(A) A – B (B) A
(C) φ (D) B
4. If A = {3, 6, 9}, B = {5, 10, 15} and C = {10, 20}, find A ∪ (B ∩ C) .
(A) φ (B) {10}
(C) {3, 6, 9, 10} (D) {3, 5, 6, 9, 10}
5. The function f : R → R defined by f(x) = (x – 1) (x – 2)(x – 3) is
(A) one-one but not onto (B) onto but not one-one
(C) bijective (D) neither one-one nor onto
IIT_JEE 62.
6. In order that a relation R defined on a non-empty set A is an equivalence
relation, it is sufficient, if R
(A) is reflexive
(B) is symmetric
(C) is transitive
(D) possesses all the above three properties
7. Let A be a set of n distinct elements. Then the total number of distinct
functions from A to A is
(A) 2n (B) n2
(C) nn (d) n!
8. Find the domain for which f(x) = g(x), where f(x) = 1 – 3x and g(x) = 2x2 – 1.
 1  1
(A)  −2,  (B)  −2, 
 2  2
 1
(C) −2,  (D) None of these
 2 
x2
9. Find the range of the function f(x) =
1 + x2
(A) R (B) (0, ∝)
(C) [1, ∝) (D) [0, 1)
2+x
10. The domain and range of the function f(x) =
2−x
(A) R, R – {–1} (B) R – {2}, R – {–1}
(C) R – {2}, R (D) None of these
11. If f(x) = (a – xn)1/n, where a > 0 and n ∈ N, then fof(x) =
(A) a (B) x
(C) xn (D) an
12. If set A has 3 elements and set B has 3 elements, how many many-one
functions (which are not one-one) can be formed from set A to set B?
(A) 27 (B) 6
(C) 21 (D) None of these
13. Which of the following functions is inverse of itself?
1− x
(A) f(x) = (B) f(x) = 5log x
1+ x
2ex
(C) f(x) = 2x(x − 1) (D) f(x) =
ex + ex
IIT_JEE 63.
   
14. The domain of definition of f(x) = log 2  − log 1  1 + 1  − 1  is:
  1  
 2
 x4  
(A) (0, 1) (B) (0, 1]
(C) [1, ∞) (D) (1, ∞)
15. If o(A) = 3 and o(B) = 6, then
(A) max(o( A ∪ B)) = 9 and min(o( A ∪ B )) = 6
(B) max(o( A ∩ B )) = 3 and min(o( A ∩ B )) = 0
(C) max(o( A ∩ B )) = 6 and min(o( A ∩ B )) = 3
(D) both (a) and (b)
ax + b
16. A function f : A B → defined by f(x) = is given to be a bijective function,
cx + d
then
 −d 
(A) A = R, B = R (B) A =
R −   ,B =
R
c 
 −d  a   −d   −b 
(C) A =
R −   ,B =
R−  (D) A =
R −   ,B =
R− 
c  c  c  a 
1  x 
17. If f(x) = cos(loge x), then f(x) f(y) − f   + f(xy) is equal to:
2 y 
(A) 0 (B) cos(logex) + cos(logey)
1
(C) f(x + y) (D) f(x)f(y)
2
18. Let f : (e, ∞ →) be defined by f(x) = loge [loge (loge x)], then
(A) range of f is equal to its codomain
(B) range of f is equal to its domain
(C) f is onto but not one-one
(D) f is one-one but not onto
19. The function f : N → N (N is the set of all natural numbers) defined by f(n) =
2n + 3, is
(A) injective (B) bijective
(C) surjective (D) None of these
 1 1  π π
20. The function f :  − ,  →  − ,  defined by f(x) = sin–1(3x – 4x3) is:
 2 2  2 2
(A) injective only (B) bijective
(C) surjective only (D) None of these
21. If aN = {ax|x ∈N} and bN ∩ cN = dN, where b, c ∈N are relatively prime, then
IIT_JEE 64.
(A) d = bc (B) b = cd
(C) c = bd (D) None of these
22. If A = {1, 2, 3, 4} and R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A, then R is:
(A) reflexive (B) symmetric
(C) transitive (D) None of these
23. Set A has 3 elements and set B has 5 elements. The number of injections that
can be defined from A to B is
(A) 125 (B) 243
(C) 0 (D) 60
24. The domain of definition of the function y = f(x) given by the equation 2x + 2y
= 2 is
(A) 0 ≤ x ≤ 1 (B) 0 ≤ x ≤ ∞
(C) −∞ < x ≤ 1 (D) −∞ < x < 1
1
25. The domain of the function
= f(x) + x + 2 is
log 10 (1 − x)
(A) [−2, 0) ∪ (0, 1] (B) R

(C) [− 2, 1) (D) None of these
26. Find the number of surjections from A = {1, 2, ..., n}; n ≥ 2 to B = {a, b}.
(A) 2n (B) 2n
(C) nn – 2 (d) 2n – 2
27. f(x) sin−1 (| x − 1 | −2) is

The domain of definition of =
(A) [–2, 0] ∪ [2, 4] (B) [–2, 0] ∪ [1, 3]
(C) (–2, 0) ∪ (1, 3) (D) (–2, 0) ∪ (2, 4)
10x − 10− x
28. The inverse of the function f(x) is:
10x + 10− x
1 1+ x
(A) log 10 (2 − x) (B) log 10  
2 1− x
1  2x 
(C) log 10   (D) None of these
4 2− x
29. If a function f : [2, ∞) → B defined by f(x) = x2 – 4x + 5 is a bijection, then B =
(A) R (B) [1, ∞)
(C) [4, ∞) (D) [5, ∞)
 x ∀ x≥0
−
30. If f(x) =  , find fof(x).
2x ∀ x < 0
(A) –2x (B) 4x
IIT_JEE 65.
 4x ∀ x ≥ 0  2x ∀ x ≥ 0
−
(C)  (D) 
−2x ∀ x < 0  4x ∀ x < 0
31. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)} be a relation on
the set A = {3, 6, 9, 12}. The relation is
(A) an equivalence relation (B) reflexive and symmetric only
(C) reflexive and transitive only (D) reflexive only
2x
32. Let f : (–1, 1) → B, be a function defined by f(x) = tan−1 , then f is both
1 − x2
one-one and onto when B is the interval
 π π  π π
(A)  − ,  b (B)  − , 
 2 2  2 2
 π  π
(C)  0,  (D) 0, 
 2  2
33. A real valued function f(x) satisfies the functional equation f(x – y) = f(x) f(y) –
f(a – x) f(a + y) where a is given constant and f(0) = 1, f(2a – x) is equal to
(A) f(a) + f(a – x) (B) f(– x)
(C) – f(x) (D) f(x)
34. If x = {8n – 7n – 1 : n ∈ N} and y = {49(n – 1) : n ∈ N}, then
(A) X ⊆ Y (B) Y ⊆ X
(C) X = Y (D) none of these
1
35. If f : [1, ∞) → [2, ∞) is given by f(x)= x + then f–1 equals.
x
x + x2 − 4 x
(A) (B)
2 1 + x2
x − x2 − 4
(C) (D) 1 + x2 − 4
2
log 2 (x + 3)
36. The domain of f(x) = is
x2 + 3x + 2
(A) R – {–1, –2} (B) (–2, ∞)
(C) R – {–1, –2, –3} (D) (–3, ∞) – {–1, –2}
−1, x < 0

37. Let g(x) = 1 + x – [x] and f(x) = 0, x = 0 , then for all x, f(g(x)) is equal to:
1, x > 0

(A) x (B) 1
(C) f(x) (D) g(x)
38. Let the function f: R → R be defined by f(x) = 2x + sinx, x ∈ R. Then f is
IIT_JEE 66.
(A) one-one and onto (B) one-one but not onto
(C) onto but not one-one (D) neither one-one nor onto
x2 + x + 2
39. Range of the function f(x) = , x ∈ R is:
x2 + x + 1
 11 
(A) (1, ∞) (B)  1, 
 7
 7  7
(C)  1,  (D)  1, 
 3  5
π
40. Domain of definition of the function
= f(x) sin−1 (2x) + for real valued x, is
6
 1 1  1 1
(A)  − ,  (B)  − , 
 4 2  2 2
 1 1  1 1
(C)  − ,  (D)  − , 
 2 9  4 4
41. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)} be a relation on
the set A = {3, 6, 9, 12}. The relation is: [2005]
(A) reflexive and symmetric only
(B) an equivalence relation
(C) reflexive only
(D) reflexive and transitive only
2x
42. Let f : (–1, 1) → B, be a function defined by f(x) = tan−1 , then f is both
1 − x2
one-one and onto when B is the interval: [2005]
 π π  π π
(A)  − ′  (B)  − ′ 
 2 2  2 2
 π  π
(C) 0,  (D)  0, 
 2  2
43. A real valued function f(x) satisfies the functional equation f(x – y) = f(x) f(y) –
f(a – x) f(a + y) where a is a given constant and f(0) = 1, f(2a – x) is equal to:
[2005]
(A) f(–x) (B) f(a) + f(a – x)
(C) f(x) (D) –f(x)
44. Let W denote the words in the English dictionary. Define the relation R by:
R {(x, y) ∈ W × W} the words x and y have at least on letter in common}. Then
=
R is [2006]
(A) reflexive, not symmetric and transitive
IIT_JEE 67.
(B) not reflexive, symmetric and transitive
(C) reflexive, symmetric and not transitive
(D) reflexive, symmetric and transitive
 −π π 
45. The largest interval lying in  ,  for which the function
 2 2
 − x2 −1  x  
f(x)= 4 + cos  − 1  + log(cos x) [2007]
 2  
 π
(A) 0,  (B) [0, π]
 2
 π π  π π
(C)  − ,  (D)  − , 
 2 2  4 2
46. Let R be the real line. Consider the following subsets of the plane R × R: [2008]
S = {(x, y) : y = x + 1 and 0 < x < 2}
T = {(x, y) : x – y is an integer}.
Which one of the following is true?
(A) T is an equivalence relation on R out S is not
(B) Neither S nor T is an equivalence relation on R
(C) Both S and T are equivalence relations on R
(D) S is an equivalence relation on R but T is not
47. Let f : N Y → be a function defined as f(x) = 4x + 3 where Y = {y ∈ N : y = 4x +3
for some x N}. Show that f is invertible and its inverse is: [2008]
y−3 3y + 4
(A) g (y) = (B) g(y) =
4 3
y+3 y+3
(C) g(y)= 4 + (D) (y) =
4 4
48. If A, B and C are three sets such that A ∩ B = A ∩ C and A ∪ B = A ∪ C, then
[2008]
(A) A = B (B) A = C
(C) B = C (D) A B ∩ = φ
49. For real x, let f(x) = x3 + 5x + 1, then [2009]
(A) f is one-one but not onto R
(B) f is onto R but not one-one
(C) f is one-one and onto R
(D) f is neither one-one nor onto
50. Let f(x) = (x + 1)2 – 1, x ≥ –1 [2009]
Statement-1: The set {x : f(x) = f–1(x)} = {0,– 1}
IIT_JEE 68.
Statement-2: f is a bijection.
(A) Statement-1 is true, Statement-2 is true; Statement-2 is a correct
explantion for Statement-1
(B) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct
explanation for Statement-1
(C) Statement-1 is true, Statement-2 is false
(D) Statement-1 is false, Statement-2 is true
51. Consider the following relations:
R = {(x, y) | x, y are real numbers and x = wy for
 m p 
some rational number w} S =  ,   m,n,p and q are integers such that n, q
 n q 
≠ 0 and qm = pn}. Then [2010]
(A) R and S both are equivalence relations
(B) R is an equivalence relation but S is not an equivalence relation
(C) neither R nor S is an equivalence relation
(D) S is an equivalence relation but R is not an equivalence relation
52. Let R be the set of real numbers.
Statement-1 : A = {(x, y) ∈ R × R: y – x is an integer} is an equivalence relation
on R.
Statement-2 : B = {(x, y) ∈ R × R: x y = α for some rational number α } is an
equivalence relation on R. [2011]
(A) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct
explanation for Statement-1.
(B) Statement-1 is true, Statement-2 is false.
(C) Statement-1 is false, Statement-2 is true.
(D) Statement-1 is true, Statement-2 is true; Statement-2 is a correct
explanation for Statement-1.
1
53. The domain of the function f(x) = is: [2011]
| x | −x
(A) (0, ∞) (B) (0, ∞)

(C) ( −∞, ∞) − {0} (D) ( −∞, ∞)
54. Let A and B be two sets containing 2 elements and 4 elements respectively.
The number of subsets of A × B having 3 or more elements is
(JEE Main 2013)
(A) 256 (B) 220
(C) 219 (D) 211
IIT_JEE 69.
55. If X = {4n – 3n – 1 : n ∈ N} and Y = {9(n – 1) : n ∈ N}, where N is the set of
natural numbers, then X ∪ Y is equal to
(JEE Main 2014)
(A) N (B) Y – X
(C) X (D) Y
 1
56. If f(x) + 2f   =3x, x ≠ 0 and S = {x R : f(x) = f(– x)}; then S :
x
(JEE Main 2016)
(A) is an empty set.
(B) contains exactly one element.
(C) contains exactly two elements.
(D) contains more than two elements.
57. If S is the set of distinct values of ‘b’ for which the following system of linear
equations
x+y+z=1
x + ay + z = 1
ax + by + z = 0
has no solution, then S is:
(JEE Main 2017)
(A) an infinite set
(B) a finite set containing two or more elements
(C) a singleton
(D) an empty set
58. Two sets A and B are as under:
A {(a,b) ∈ R × R :| a − 5 |< 1 and | b − 5 |< 1};
=
B
= {(a,b) ∈ R × R : 4(a − 6) 2
}
+ 9(b − 5)2 ≤ 36 , Then
(JEE Main 2018)

(A) Neither A ⊂ B nor B ⊂ A (B) B ⊂ A
(C) A ⊂ B (D) A ∩ B =φ (an empty set)
59. Let S= {t ∈ R : f(x)= | x − π | ⋅ (e|x|

)
− 1 sin | x | is not differentiable at t}. Then the
set S is equal to:

(JEE Main 2018)
(A) {0, π} (B) φ(an empty set)
(C) {0} (D) {π}
60. Let S ={x ∈ R : x ≥ 0 and 2 | x − 3 | + x( x − 6) + 6 =

0} . Then S:
IIT_JEE 70.
(JEE Main 2018)
(A) contains exactly four elements.
(B) is an empty set.
(C) contains exactly one element.
(D) contains exactly two elements.
61. If S1 and S2 are respectively the sets of local minimum and local maximum
points of the function, f(x) = 9x4 + 12x3 – 36x2 – 25, x ∈ R, then:
(JEE Main 2019)
(A) S1 = {–1}; S2 = {0, 2} (B) S1 = {–2, 1}; S2 = {0}

(C) S1 = {–2}; S2 = {0, 1} (D) S1 = {–2, 0}; S2 = {1}
62. A set contains n elements. The power set contains
(A) n elements (B) 2n elements
(C) n2 elements (D) None of these
63. Which of the following is the empty set?
(A) {x : x is a real number and x2 – 1 = 0}
(B) {x : x is a real number and x2 + 1 = 0}
(C) {x : x is a real number and x2 – 9 = 0}
(D) {x : x is a real number and x2 = x + 2}
64. The number of elements in the power set P(S) of the set S = {2, {1, 4}} is
(A) 2 (B) 4
(C) 8 (D) None of these
65. If R is a relation from a finite set A having ‘m’ elements to a finite set B having
‘n’ elements, then the number of relations from A to B is
(A) 2mn (B) 2mn – 1
(C) 2mn (d) mn
66. If R is a relation on a finite set A having n elements, then the number of
relations on A is
2
(A) 2n (B) 2n
(C) n2 (D) nn
67. In the set X = {a, b, c, d}, which of the following is function on X?
(A) R1 = {(b, a), (a, b), (c, d), (a, c)}
(B) R2 = {(a, d), (d, c), (b, b), (c, c)}
(C) R3 = {(a, b), (b, c), (c, d), (b, d)}
(D) R4 = {(a, a), (b, b), (c, c), (a, d)}
IIT_JEE 71.
68. Let A = {x, y, z}, B = {u, v, w} and f : A B → be defined by f(x) = u, f(y) = v, f(z) =
w. Then f is
(A) surjective but not injective
(B) injective but not surjective
(C) bijective
(D) None of these
69. Let Z be the set of integers and f :Z Z → be defined as f(x) = x2 , x Z, ∈ then
function is
(A) bijective (B) injective
(C) surjective (D) None of these
70. The number of bijective functions from set A to itself when A contains 106
elements is
(A) 106106 (B) 1062
(C) 106! (D) 2106
log 2 (x + 3)
71. The domain of definition of f(x) = is:
x2 + 3x + 2
(A) R / {–1, – 2} (B) (–2, ∞)
(C) R / {–1, –2, –3} (D) (–3, ∞)/ {–1, –2}
x2 + x + 2
72. Range of the function
= f(x) ; x ∈ R is:
x2 + x + 1
(A) (1, ∞) (B) (1, 11/7)
(C) (1, 7/3] (D) (1, 7/5)
73. Which of the following functions from A = {x|–1 ≤ x ≤ 1} to itself is a bijection?
(A) cosx (B) |x|
(C) x2 (D) x3
74. Let A be a set containing 10 distinct elements, then the total number of distinct
functions from A to A is
(A) 10! (B) 1010
(C) 210 (D) 210 – 1
75. The composite mapping fog of the map f : R → R, f(x) = sinx and g : R → R, g(x)
= x2 is
(A) x2 sin x (B) (sin x)2
sin x
(C) sinx2 (D)
x2
76. f : R → R is a function defined by f(x) = 10x – 7. If g = f–1, then g(x) =
IIT_JEE 72.
1 1
(A) (B)
10x − 7 10x + 7
x+7 x−7
(C) (D)
10 10
77. If 1 f(x) 3x – 5, then f–1 (x) :
1
(A) is given by
3x − 5
x+5
(B) is given by
3
(C) does not exist because f is not one-one
(D) does not exist because f is not onto.
78. Suppose f(x) (x + 1)2 for x ≥ − 1. If g(x) is the function whose graph is reflection
of the graph of f (x) with respect to the line y = x, then g(x) equals:
1
(A) − x − 1, x ≥ 0 (B) , x > −1
(x + 1)2
(C) x + 1, x ≥ −1 (D) x − 1, x ≥ 0
79. Two infinite sets have m and n elements. The total number of subsets of the
first set is 56 more than the total number of subsets of the second set. The
values of m and n are
(A) m = 7, n = 6 (B) m = 6, n = 3
(C) m = 5, n = 1 (D) m = 8, n = 7
80. =
If R {(x, y)  x, y ∈ z, x 2
}
+ y2 ≤ 4 is relation on Z, then domain of R is:
(A) {0, –1, –2} (B) {–2, –1, 1, 2}

(C) {0, 1, 2} (D) None of these
1
81. The domain of definition of the function
= y + x + 2 is:
log 10 (1 − x)
(A) (–3, –2) excluding – 25 (B) [0, 1] excluding 0.5

(C) (–2, 1) excluding 0 (D) none of these
(x − a)(x − b)
82. For real x, the function will assume all real values provided :
(x − c)
(A) a > b > c (B) a < b < c
(C) a > c > b (D) a ≤ c ≤ b
83. The domain of definition of the function y(x) is given by the equation 2x + 2y =
2 is :
(A) 0 < x ≤ 1 (B) 0 ≤ x ≤ 1
(C) –∞ < x ≤ 0 (D) –∞ < x ≤ 1
IIT_JEE 73.
84. Let E = {1, 2, 3, 4} and f = [1, 2}. Then the number of onto functions from E to
F is:
(A) 14 (B) 16
(C) 12 (D) 8
85. Let function f : R → R be defined by f(x) 2x sinx x ∈ R. Then f is :
(A) one-to-one and onto (B) one-to-one but not onto
(C) onto but not one-to-one (D) neither one-to-one nor onto
x
86. If f : [0, ∞) → [0, ∞) is f(x) = then f is:
1+ x
(A) one-to-one and onto (B) one-one but not onto
(C) onto but not one-one (D) neither one-one nor onto
x, if x is rational 0, if x is rational

87. f(x) = (x) 
0, if x is irrational x, if x is irrational
Then f – g is:
(A) one-one and into (B) neither one-one nor onto
(C) many one and onto (D) one-one and onto
y y
88. If=
f(y) = f(y) = , g(y) then (gof) (y) =
1 − y2 1 + y2
y y
(A) (B)
1 − y2 1 + y2
1 − y2
(C) y (D)
1 + y2
1+ x 3x + x3
89. Given f(x) = log   and g(x) = then (fog) (x) =
1− x 1 + 3x2
(A) –f(x) (B) 3f(x)
(C) (f(x))3 (D) None of these
90. (
If g(f(x)) =| sin x | and f g(x) = (sin x)2 , then:
(A) f(x) sin

= = 2
x, g(x) x (B) f(x) sin
= = x, g(x) | x |
(C)
= 2
f(x) x= , g(x) sin x (D) f and g can not be determined
−1, x < 0

91. Let g(x) = 1 + x − [x] and
= f(x) =
0, x 0 , then for all x, f[g(x)] is equal to:
1, x > 0

(A) x (B) 1
(C) f(x) (D) g (x)
IIT_JEE 74.
αx
92. Let
= f(x) , x ≠ −1 . α is f[f(x)] = x?
x+1
(A) 2 (B) – 2
(C) 1 (D) –1
93. Let f(x) = |x – 1|. Then:
(A) f(x2) = (f(x))2 (B) f(x + y) = f(x) + f(y)
(C) f(|x|) = |f(x) + f(x)| (D) None of these
94. If f : A → B is a bijective function, then f–1 o f =
(A) f (B) f–1
(C) IB (D) IA
95. If the function f : [1, ∞) → [1, ∞) is defined by f(x) = 2x(x–1), then f–1(x) is:
x(x − 1)
 1
(A)  
2
(B)
1
2
(
1 + 1 + 4 log 2 x )
(C)
1
2
(
1 − 1 + 4 log 2 x ) (D) None of these
1
96. If f : (1, ∞) → [2, ∞) is given by f(x)= x + , then f-1(x) equals:
x
x + x2 − 4 x
(A) (B)
2 1 + x2
x − x2 − 4
(C) (D) 1 + x2 − 4
2
97. If f(x) = sinx + cos x, g(x) = x2 –1, then g (f(x)) is invertible in the domain:
 π  π π
(A) 0,  (B)  − , 
 2  4 4
 π π
(C)  − ,  (D) [0, π]
 2 2
98. If X and Y are two non-empty sets where f : X → Y is function is defined such
that
= f(c) {f(x) : x ∈ C} for C ⊆ X and =
f −1 (D) {x : f(x) ∈ D} for D ⊆ Y , for any
A ⊆ Y and B ⊆ Y then :
(A) f −1 (f(A)) = A
(B) f −1 (f(A)) = A only if f(X)Y
( )
(C) f f −1 (B) = A only if B ⊆ f(x)
(
(D) f f −1 (B) = B )
IIT_JEE 75.
(A) is reflexive
(B) is symmetric
(C) is transitive
(D) possesses all these three properties
100. Let A be the set of family. A relation R is defined on A as x Ry ⇒ x is brother
of y. Then which of the following is true?
(A) R is reflexive (B) R is symmetric
(C) R is transitive (D) R is equivalenced
101. Let R be an equivalence relation on a finite set A having n elements. Then the
number of ordered pairs in R is
(A) less than n (B) greater than or equal to n
(C) less than or equal to n (D) None of these
102. Let A = {p, q, r}. Which of the following is not an equivalence relation on A?
(A) R1 = {(p, q), (q,r), (p,r), (p,p)} (B) R2 = {(r, q), (r,p), (r,r), (q, q)}
(C) R3 = {(p,p), (q, q), (r,r), (p, q)} (D) None of these
103. The relation ‘less than’ in the set of natural numbers is

(A) only symmetric (B) only transitive
(C) only reflexive (D) equivalence relation
104. If R ⊆ A × B and S ⊆ B × C be two relations, then (SoR)–1 =
(A) S–1 o R–1 (B) R–1 o S–1
(C) S o R (D) R o S
105. In the set A = {1, 2, 3, 4, 5}, a relation R is defined by R{(x, y)| x, y ∈ A and x <
y}, then R is:
(A) reflexive (B) symmetric
(C) transitive (D) None of these
Multiple Choice Questions (One or More Choice Correct):
x+2
106. If=y f(x)
= then:
x−1
(A) x = f(y) (B) f(1) = 3
(C) y increases with x for x < 1 (D) f is a rational function of x
2x − 1
107. If S is the set of all real x such that is positive, then S contains:
2x + 3x2 + x
3
 3 1  3
(A) (B)  − , −   −∞, − 
 2 4  2
IIT_JEE 76.
 1 1 1 
(C)  − ,  (D)  , 3 
 4 2 2 
108. Let g(x) be a function defined on [–1, 1]. If the area of the equilateral triangle
with two of its vertices at (0, 0) and [x, g (x)] is 3 / 4, then the function g (x) is:
(A) g(x) =± 1 − x2 (B) g(x)

= 1 − x2
(C) g(x) =− 1 − x2 (D) g(x)

= 1 + x2
f(x) cos  π2  x + cos  −π2  x , where [x] stands for the greatest integer
109. If =
function, then :
π
(A) f   = −1 (B) f( π) =1
2
π
(C) f( −π) = 0 (D) f   = 1
4
110. For a positive integer n,
 θ
let
= fn (θ)  tan  (1 + sec θ)(1 + sec 2θ)
 2 
( )
(1 + sec 4θ) … 1 + sec 2n θ then:
 π  π 
(A) f2   = 1 (B) f3   = 1
 16   32 
 π   π 
(C) f4  =1 (D) f5  −1
 64   128 
Match the Column Questions:
x2 − 6x + 5
111. Let f(x) =
x2 − 5x + 6
Match the conditions / expression in Column I with statement in Column II.
Column-I Column-II
(i) –1 < x < 1, then f(x) satisfies (P) 0 < f(x) < 1
(ii) If 1 < x < 2, then f(x) satisfies (Q) f(x) < 0
(iii) If 3 < x < 5, then f(x) satisfies (R) f(x) > 0
(iv) If x > 5, then f(x) satisfies (S) f(x) < 1
Subjective Questions:
112. Show that n{P[P(P(φ))]} =
4
113. Show with the help of Venn diagrams.
IIT_JEE 77.
(i) (A ∪ B)′ = A′ ∩ B′
(ii) (A ∩ B)' = A′ ∪ B′
114. For any natural number 'a' we define
aN = {ax : x ∈ N}. If b, c, d ∈ N such that bN ∩ cN = dN, then prove that d is
the LCM of b and C.
115. For any two sets A and B, prove that P(A ∩ B)= P(A) ∩ P(B) .
116. For any two sets A and B, prove that P(A) ∪ P(B) ⊂ P(A ∪ B) , but P(A ∪ B) is not
necessarily a subset of P(A) ∪ P(B) .
117. For any two sets A and B, prove that P(A) = P(B) ⇒ A = B.
118. Let A1, A2, ... A30 are 30 sets each with five elements and B1, B2, ..., Bn are n sets
30 n
each with three elements. Let 
= Ai 
= B j
S . Assume that each element of
=i 1 =j 1
S belongs to exactly ten of the Ai’s and exactly nine of Bj’s Find the value of n.
119. If A, B and C are any three sets, then prove that
(i) A − (B ∪ C) = (A − B) ∩ (A − C)
(ii) A ∩ (B∆C) = (A ∩ B)∆(A ∩ C)
120. For any two sets A and B, prove that
(i) A′ − B′ =B − A
(ii) A − (A − B) = A ∩ B
121. Let A = {1, 2}. Find the total number of relations on A and list them.
122. Determine the domain and range of the following relations.
(i) R = {(a,b)  a = 2,b < 6,b ∈ N}
(ii) S ={(a,b) | a =
| b − 1 |,b ∈ z,| b ≤ 3
123. Let A and B be two sets such that A × B consists of 6 elements. If 3 elements
of A × B are (a, d), (b, e), (c, d), find A × B and B × A. How many relations are
possible from A to B?
124. For each set of ordered pairs below, state whether it is a function or not giving
reasons (assume that domain is as per the ordered pairs).
(i) {(3, 2), (4, 2), (5, 2)}
(ii) {(2, 3), (2, 4), (2, 5)}
(x + 1)(x − 3)
125. Let y = . Find all the real values of x for which y takes real values.
(x − 2)
126. Let f : N → N given by f(n) = n – (–1)n ∀ n ∈ N check f for bijectivity.

x−1
127. If f : R − {2} → R − {1} defined by f(x) = , show that f is bijective.
x−2
IIT_JEE 78.
128. f : [−1, 1] → [−1, 1] given by f(x) = x|x|, show that f is bijection.
129. A mapping is defined as f : R → R, f(x) = cosx, show that it is neither one-one
nor surjective.
x2 + 4x + 30
130. The function f(x) = is not one to one (T/F)
x2 − 8x + 18
131. If f : A → B, g : B → C and h : C → D are one–one onto mappings, then (hog of)–
1
=
132. If f : (0, ∞) → ( −5, ∞) be defined by f(x) = x2 – 5, then what is f–1(7)?
133. A market research group conducted a survey of 2,000 consumers and reported
that 1,720 consumers liked product P1 and 1,450 consumers liked product P2.
What is the least number of persons who must have liked both the products?
134. An investigator interviewed 100 students to determine their preferences for
the three drinks — milk, coffee and tea. He reported the following observation:
10 students had all the three drinks; 20 had milk and coffee; 30 had coffee and
tea; 25 had milk and tea; 12 had milk only; 5 had coffee only; 8 had tea only.
Using Venn diagram, find how many did not take any of the three drinks.
135. Let R be a relation from A = {1, 2, 4, 5} to B = {0, 2, 3, 5} defined as ‘greater
than’. Then express R as set of ordered pairs, also find R–1 is roster as well as
set-builder form.
 π π
A x : ≤ x ≤  and f(x)= cos x − x(1 + x) find f(A)/
136. Given =
 6 3
137. A function f : R → R where R, is the set of real numbers, is defined by
ax2 + 6x − 8
f(x) = . Find the interval of values of α for which is onto. Is the
α + 6x − 8x2
function one-to one for α = 3? Justify your answer.
138. If the functions f, g, h are defined from the set of real numbers R to R such
that
0 if x ≤ 0
x2 1, g(x) =
f(x) =− x2 + 1,h(x) =
x if x > 0
then find composite function hofog. Also check whether fog is invertible or
not.
139. Let f : R → [–1, ∞) be given by f(x) = (x + 1)2 –1, x –1. Show that f is invertible.
Also, find the=

set S {=
x  f(x) }
f −1 (x)
140. Let f : R → R be defined as f(x) = x2 +1. Find

(i) f–1(–1) (ii) f–1(37)
IIT_JEE 79.
(iii) f–1{26, 5}
141. Let f be a one-one function with domain {x, y, z} and range {1, 2, 3}. It is given
that exactly one of the following statements is true and the remaining two are
false f(x) = 1, f(y) 1, f(z) 2 determine f−1(1).
n
142. Find the natural number a for which ∑ f(a + k)
k=1
= ( )
16 2n − 1 , where the function
f satisfies the relation f(x + y) = f(x) f(y) for all natural numbers x, y and further
f(1) = 2
143. Let f[(x+y) / 2]=\{f(x)+f(y)\} / 2 for all real x and y, If f'(0) exists and equals –1
and f(0) = 1, find f(2).
(A) is reflexive
(B) is symmetric
(C) is transitive
(D) possesses all these three properties
145. Let A be the set of family. A relation R is defined on A as x Ry ⇒ x is brother
of y. Then which of the following is true?
(A) R is reflexive (B) R is symmetric
(C) R is transitive (D) R is equivalenced
146. Let R be an equivalence relation on a finite set A having n elements. Then the
number of ordered pairs in R is
(A) less than n (B) greater than or equal to n
(C) less than or equal to n (D) None of these
147. Let A = {p, q, r}. Which of the following is not an equivalence relation on A?
(A) R1 = {(p, q), (q, r), (p, r), (p, p)}
(B) R2 = {(r, q), (r, p), (r, r), (q, q)}
(C) R3 = {(p, p), (q, q), (r, r), (p, q)}
(D) None of these
148. The relation ‘less than’ in the set of natural numbers is
(A) only symmetric (B) only transitive
(C) only reflexive (D) equivalence relation
149. R be a relation defined on set of natural numbers N as
R
= {(x, y) ∣x > y, x, y ∈ N}. Then check R for reflexivity, symmetry, and
transitivity.
IIT_JEE 80.
150. R is a relation defined on set of natural numbers N as
+ y 10, x, y ∈ N} . Then check R for reflexivity, symmetry and
R {(x, y) ∣x =
=
transitivity.
151. If a relation on a set is symmetric as well as transitive, is the relation reflexive?
Give reasons.
152. Check whether the relation S, ‘greater than or equal to’, i.e. ' ≥ ' on set of reals
(R) is an equivalence relation or not.
153. Let R be a relation defined on set of natural number N as
y 41, x, y ∈ N} . Find the domain and range of this relation. Also
R {(x, y) ∣2x +=
=
verify whether R is (i) reflexive, (ii) symmetric, (iii) transitive.
Answer key
Multiple Choice Questions (Single Choice Correct):

1 2 3 4 5 6 7 8 9 10
C C B C B D C C D B
11 12 13 14 15 16 17 18 19 20
B C A A D C A A A B
IIT_JEE 81.
21 22 23 24 25 26 27 28 29 30
A C D D D D A B B D
31 32 33 34 35 36 37 38 39 40
C B C A A D B A C A
41 42 43 44 45 46 47 48 49 50
D A D C A A A C C C
51 52 53 54 55 56 57 58 59 60
A A B C D C D C B D
61 62 63 64 65 66 67 68 69 70
B B B B A B B C D C
71 72 73 74 75 76 77 78 79 80
D C D B C C B D B D
81 82 83 84 85 86 87 88 89 90
C D D A A B D C B A
91 92 93 94 95 96 97 98 99 100
B D D D B A B C D C
101 102 103 104 105
B D B B C
Multiple Choice Questions (One or More Choice Correct):

106 107 108 109 110
A,D A,D B,C A,C A,B,CD
Match the Column Questions:

111
I-P, II-Q, III-Q, IV-P A,D
Subjective Questions:
112 113 114 115 116 117 118 119 120
4 * * * * * 45 * *
121
16; f, φ, {(1, 1)}, {(1, 2)}, {(2, 1)}, {(2, 2)}, {(1, 1), (1, 2)}, {(1, 1), (2, 1)}, {(1, 1), (2, 2)},
{(1, 2), (2, 1)}, {(1, 2), (2, 2)} {(2, 1), (2, 2)}, {(1, 1), (1, 2), (2, 1)}, {(1, 1), (1, 2), (2, 2)},
{(1, 1), (2, 1), (2, 2)}, {(1, 2), (2, 1), (2, 2)}, {(1, 1), (1, 2), (2, 1), (2, 2)}
122
(i) Domain (R) = {2} Range (R) = {1, 2, 3, 4, 5}
(ii) Domain (S) = {0, 1, 2, 3, 4} and Range (S) = {–3, –2, –1, 0, 1, 2, 3}
123 124 125
64 (i) is a function, (ii) is not a function x ∈ [−1, 2) ∪ [3, ∞)
126 127 128 129
Bijective Bijective Check for one-one Use the definition of surjectivity
onto
130 131 132 133 134 135
True −1 −
(hogof ) = f Og oh1 −1 −1
f (7) = { 12} 1170 20
−1 R–1 = {(0, 1), (0,2),
(0, 4), (2, 4),
(3, 4), (0, 5),
(2, 5), (3, 5)}
R–1 = {( x, y |x ∈B,
y ∈ A, x y ) }
IIT_JEE 82.
136 137 138
1 π [2, 14] for α = 3 not one- x2 Not invertible
π 3 π  π 
 − 1 + , −  1 +  one
 2 3  3 2 6 6  
139 140 141 142
Check for one-one onto, S={–1, 1} (i)φ (ii) {6,–6} (iii) {2,–2, 5,– y 3
5}
143 144 145 146 147
–1 (i) False, 25 Hint: Hint:
(ii) True, (iii) True Let x ∈ A Let (a,b)∈A×(B–C)
148
{(a, a), (b, b), (c, c), (a, b), (b, c), (b, a), (c, b), (c, a), (a, c)}
149 150
Not reflexive, not symmetric, transitive Not reflexive, symmetric,
not transitive
152 152 153
No Not an equivalence relation (i) Not reflexive (ii) Not symmetric
(iii) Not transitive
IIT_JEE 83.

Sets Relations Function

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Sets Relations Function

Uploaded by

Copyright:

Available Formats

Chapter Objectives

Repetition of an element has no effect. Thus {1, 2, 3, 2} is the same set as

For example, = n(A) 5 or O(A) = 5 .

A = {4, 5, 6} and C = {6, 5, 4} are equal, i.e. A = C.

Subsets and Proper Subsets

(ii) Again let A = {2, 4, 6} and B = {6, 4, 2} , then A ⊆ B . Also B ⊆ A .

Proof: Suppose if possible φ is not a subset of a given set A. Then there

exists an element x in φ which is not in A. But φ cannot have any

element. So φ has no element which is not in A, i.e. every element of φ (if

n different things. Therefore each selection of r things gives a subset of

∴ The number of subsets of A having no element =n C0

The number of subsets of A having one element =n C1

The number of subsets of A having two elements =n C2

The number of subsets of A having n elements =n Cn .

Hence, the total number of subsets of A

Also, φ ∈ P(A) and A ∈ P(A) for all sets A.

Also, φ ∈ P(A) and A ∈ P(A) for all sets A .

In the above figures, the shaded parts represents A ∪ B .

B = {4, 5, 6, 7, 8} then A ∪ B ={1, 2, 3, 4, 5, 6, 7, 8}

Then A ∩ B ={1, 2}.

common to all the sets A 1 , A2 , … An .

In the above figure A and B are disjoint sets.

= {1, 2, 4} ∪ {6, 7} = {1, 2, 4, 6, 7} and B∆A = (B − A) ∪ (A − B)

={6, 7} ∪ {1, 2, 4} ⇒ {1, 2, 4, 6, 7}

Note: Please check the above result by taking suitable examples.

(ii) Let x be any arbitrary element of (A ∩ B) ∩ C .

Let x be any arbitrary element of the set A ∩ (B ∪ C) .

(i) Let x be an arbitrary element of the set (A ∪ B)′ .

Again let y be an arbitrary element of A′ ∩ B′ .

(ii) Let x be an arbitrary element of (A ∩ B)′ .

Again let y be an arbitrary element of A′ ∪ B′ .

= n(A) − n(A ∩ B) + n(B) − n(A ∩ B)

Ex. Describe the following sets in roster form.

Ex. Describe the following sets in the set-builder form.

Sol. (i) We have,

⇒ X ∈ P(A), X ∈ P(B) and X ∈ P(C)

Ex. If {a, {b}}, findP(A) .

Sol. Let B = {b}, then A = {a, B}

= {φ, {a}, {{b}}, {a, {b}}}

Ex. Let U = {1,2,3,4,5,6,7,8,9}, A = {1,2,3,4}

Ex. Let U {1,

Sol. (i)  (A=

Again let y be any arbitrary element of the set A ∩ B′ .

From (i) and (ii) A − B = A ∩ B′ Proved.

Given a + b + c = 950 ...(i)

and 29 likec product P3 . If 14 persons liked products P1 and P2 ; 12 persons

Number of persons who liked the product P3 only

= 29 − 14 − 12 + 8 = 37 − 26 = 11 [ n(A ∪ B) = n(A) + n(B) − n(A ∩ B)]

Method 2: Venn diagram method

Here we want to find g. Given that

(a,b) = (α, β) ⇔ a = α,b = β . In other words (a,b) ≠ (α, β) if either a ≠ α or b ≠ β

(iii) B × B ={(a, a), (a,b), (b, a), (b,b)} etc.

n(A × B) = 0 ⇒ n(A) = 0 or n(B) = 0

(vii) n(A ∩ B) = n ⇒ n((A × B) ∩ (B × A)) = n2

or R = {(a, 1), (a, 2), (b, 3)}

mn and number of relations from A to B is 2mn , as a relation is a

subset of A × B , and number of subsets of a set having n elements is 2n .

Hence there are 4 relations possible from A to B .

φ and universal relation A × B are called trivial relations from A to B .

number of relations possible from A to B is 212 . Let R be

Note that Dom(R) ⊆ A and Range(R) ⊆ B

(denoted by R−1 ) is a relation from B to A defined

i.e. (a,b) ∈ R ⇒ (b, a) ∈ R−1

R = {(1, a), (2,b), (2, c)} be a relation from A to B