CHAPTER

1 Relations and Functions

Relations Equivalence Relation

If A and B are two non-empty sets, then a relation R from A to B A relation R on a set A is said to be an equivalence relation, if it is
is a subset of A × B. simultaneously reflexive, symmetric and transitive on A.
Functions
Representation of a Relation
Let and B be two non-empty sets, then a function f from set A
Roster form: In this form, we represent the relation by the set of to set B is a rule which associates each element of A to a unique
all ordered pairs belongs to R. element of B.
Set-builder form: In this form, we represent the relation R from Domain, Codomain and Range of a Function
set A to set B as If f : A → B is a function from A to B, then
R = {(a, b) : a ∈ A, b ∈ B and the rule which relate the elements (i) the set A is called the domain of f(x).
of A  and  B}. (ii) the set B is called the codomain of f(x).
(iii) the subset of B containing only the images of elements of A
Domain, Codomain and Range of a Relation is called the range of f(x).
Let R be a relation from a non-empty set A to a non-empty set  B.
Number of Functions
Then, set of all first components or coordinates of the ordered
Let X and Y be two finite sets having m and n elements respectively.
pairs belonging to R is called the domain of R, while the set of all
Then each element of set X can be associated to any one of n
second components or coordinates of the ordered pairs belonging elements of set Y. So, total number of functions from set X to set
to R is called the range of R. Also, the set B is called the codomain Y is nm.
of relation R.
Number of One-One Functions
Thus, domain of R = {a : (a, b) ∈ R} and range of R = {b : (a, b)
Let A and B are finite sets having m and n elements repectively,
∈ R}
 nP , n ≥ m
then the number of one-one functions from A to B is  m
Types of Relations  0, n < m
Empty or Void Relation: As f ⊂ A × A, for any set A, so f is a
n(n − 1)(n − 2)...(n − (m − 1)), n ≥ m
relation on A, called the empty or void relation. = 
 0, n<m
Universal Relation: Since, A × A ⊆ A × A, so A × A is a relation
on A, called the universal relation.
Number of Onto (or Surjective) Functions
Identity Relation: The relation IA = {(a, a): a ∈ A} is called the
Let A and B are finite sets having m and n elements respectively,
identity relation on A. then number of onto (or surjective) functions from A to B is
Reflexive Relation: A relation R on a set A is said to be reflexive
n m − nC1 (n − 1) m + n C2 (n − 2) m − nC3 (n − 3) m + ..., n < m
relation, if every element of A is related to itself. 
= n !, n=m
Thus, (a, a) ∈ R, ∀ a ∈ A ⇒ R is reflexive. 0,
 n>m
Symmetric Relation: A relation R on a set A is said to be
symmetric relation iff (a, b) ∈ R ⇒ (b, a) ∈ R, ∀ a, b ∈ A Number of Bijective Functions
i.e. a R b ⇒ bRa, ∀ a, b ∈ A Let A and B are finite sets having m and n elements respectively,
Transitive Relation: A relation R on a set A is said to be transitive them number of bijective functions from A to B is
relation, iff (a, b) ∈ R and (b, c) ∈ R n !, if n = m
= 
⇒ (a, c) ∈ R, ∀ a, b, c ∈ A 0, if n > m or n < m
Properties of Greatest Integer Function d
(iii) If f(x) is an even function, then f(x) is an odd function and
(i) [x + n] = n + [x], n ∈ I dx
(ii) [–x] = –[x], x ∈ I d
if f(x) is an odd function, then f(x) is an even  function.
dx
(iii) [–x] = –[x] –1, x ∉ I
(iv) The graph of an even function is symmetrical about Y-axis.
(iv) [x] ≥ n ⇒ x ≥ n, n ∈ I
(v) The graph of an odd function is symmetrical about origin
(v) [x] > n ⇒ x ≥ n + 1, n ∈ I or symmetrical in opposite quadrants.
(vi) [x] ≤ n ⇒ x < n + 1, n ∈ I (vi) An even function can never be one-one, however an odd
(vii) [x] < n ⇒ x < n, n ∈ I function may or may not be one-one.

(viii) [x + y] = [x] + [y + x – [x]] for all x, y ∈ R Properties of Inverse Function

(ix) [x + y] ≥ [x] + [y] (a) The inverse of a bijection is unique.
(b) If f : A → B is a bijection and g : B → A is the inverse of
Important Points To Be Remembered f, then fog =  IB and gof = IA, where IA & IB are identity
(i) Constant function is periodic with no fundamental period. functions on the sets A & B respectively. If fof = I, then f is
inverse of itself.
1
(ii) If f (x) is periodic with period T, then and f ( x) are (c) The inverse of a bijection is also a bijection.
f ( x)
(d) If f & g are two bijections f  : A → B, g : B → C & gof exist,
also periodic with same period T. then the inverse of gof also exists and (gof)–1 = f–1 og–1.
(iii) If f(x) is periodic with period T, then kf (ax + b) is periodic (e) The graph of f –1 obtained by reflecting the graph of f about
T the line y = x.
with period , where a, b, k ∈ R and a, k ≠ 0.
|a| General
If x, y are independent variables, then :
Properties of Even and Odd Functions (a) f(xy) = f(x) + f(y) ⇒ f(x) = klnx
(i) gof or fog is even, if both f and g are even or if f is odd and (b) f(xy) = f(x) · f(y) ⇒ f(x) = xn, n ∈ R or f(x) = 0
g is even or if f is even and g is odd. (c) f(x + y) = f(x) · f(y) ⇒ f(x) = akx or f(x) = 0
(ii) gof or fog is odd, if both of f and g are odd. (d) f(x + y) = f(x) + f(y) ⇒ f(x) = kx, where k is a constant.

2 JEE (XII) Module-1 PW