FORMULAE CLUSTER

For CBSE Term 1 Exams (2021-22)

90

RELATIONS & FUNCTIONS

RELATION ON A SET AND ITS VARIOUS TYPES

relation on A. In other words if A is
A relation R from a non-empty set A into itself is called a
a non-empty set, then a subset
of A x A A2 is called a relation on A.
=

n o . of relations on set A
is 2*
Note. If A be a finite set having n elements then,
ie. 2
void relation
relation: A relation R set A is said to be empty relation or a
on a
1. Empty element of A is
In other words, relation R in a set A is empty relation, if no
if R =¢. a
related to any element of A, i.e., R = ¢CAxA.
on A if
set A is said to be the universal relation
2. Universal relation: A relation R on a
R in a set A is universal relation, if each
R A x A i.e., R =A2. In other words, a relation
=

R Ax A.
element of A is related to every element of A, i.e.,
=

universal relation i.e., A x A o n A a r e respectively

Note. The void relation i.e., o and sometimes called
on the set A. Also these are
the smallest and largest relations defined
relation is called a non-trivial relation.
Trivial Relations. And, any other
relations.
T h e relations R =¢ and R =A xA a r e two ertreme
on a set A is said to be the identity
relation on A if R =

3. Identity relation: A relation R

(a, b):a A,b e A and a b}.
e
=

Va A).
Thus, identity relation R {(a, a):
= e

The identity relation on set A is also denoted by l

relation on A, every element of A should
be related to itself only.
Note. In an identity
R on a set A is said to be reflexive Ra Va e Aie.,
ifa
4. Reflexive relation: A relation
Va cA.
(a,a) e R
Note. The identity relation is always a reflexive relation but the opposite may o r may
not be true.

1
 8
Mathematic
5. Symmetric relation: A relation R defined on a sett A is symmetric if(a, b)a
) Rimplie
(6, a) e R Va,b eAi.e., aRb > bRa (i.e., whenever aRb then, bRa).
6. Transitive relation: A relation R on a set A is transitive if (a, b) e R and (
nd (b, c)
implies (a, c) e Ri.e., aRb and bRe > aRe.
7. Equivalence relation: Let A be a non-empty set, then a relation R on A is
an equivalence relation if
id to te
()R is reflexive i.e. (a, a) e R Va eA.
(ii) R is symmetrici.e. (a, b) e R implies (6, a) e R Va, b e A
i ) R is transitive i.e. (a, b) e R and (6, c) e Rimplies (a, c) eR

Equivalence Classes
Let R be an equivalence relation in a set A and let a e A. Then, the set of all those elements
A which are related to a, iscalled equivalence class determined by a and it is denotedby iniof
Thus, la) ={b eA: (a, b) e R}. la
Note. () Two equivalence classes are either disjoint or identical.
(i) An equivalence relation R on a set A partitions the set into mutually disjoint
equivalence classes.

An important property of an equivalence relation is that it divides the set into pair-wise
disjoint subsets called equivalence classes whose collection is called a partition of the
set. Note that the union of all equivalence classes gives the whole set.
e.g. Let R denotes the equivalence relation in the set Z of integers given by R = la, b): 2
divides a -b]. Then the equivalence class [0] is [0] = {0, t 2, t 4, t 6 , . .

N o . of Reflexive relations defined on a set of n elements = 2nn -1)

n(n+1)
No. of Symmetric relations defined on a set o f n elements = 2 2
nln-
No. of Refexive and Symmetric relations defined on a set of n elements = 2 2

No. of Transitive relations defined on a set having 0, 1, 2, 3 and, 4 elemen

13, 171 and, 3994 respectively.

FUNCTION
Defininga Function: Consider A and B be two non-empty sets then, a rulefwhich assoCiae
each element of A with a unique element of B is called a function or the mapping trom
to B orf maps A to B. Iffis a mapping from A to B then, we write f: A > B which is reaaBas f
is a mapping from A to B'
fis a function from A to B'.
or

lff associates a e A to b e B, then we say that 'b is the image of under the
the elemen
functionf or b is the f-image of a' or the value of f at a' and denote it by f (a a
we
we

write b = fla). The element a is called the pre-image or inverse-image ot d.

Thus for a function from A to B,
(i) A andB should be non-empty.
(ii) Each element of A should have image in B.
(iii) No element of A should have more than one image in B.
Formulae Cluster 9

Domain, Co-domain and Range of a Function:

Let f: A B be a function. Then set A is called the domain of the function f and the set B
is called the co-domain. The set of the images of all the elements of A under the functionf
is called the range of the function fand is denoted as f(A).
Thus range of the function fis f(A) = f ) : x e Al.

Clearly f(A) CB.

Types of Functions: A ->B is one-one
1. One-one funetion (Injective function o r Injection): A functionf:
function or injective function if distinct elements of A have distinct images in B.

fla) =fb) > a b Va, b e A

Thus,f: A >B is one-one =

a : b f ( a ) * f (6) Va, b eA.

A -> B is onto
2. Onto function (Surjective function or Surjection): A function f:
of some element of
function or a surjective function if every element of B is the f-image
A. That implies f(A) = B or range of fis the co-domain off.
Thus,f: A >B is onto f(A) = B i.e., range off = co-domain off.
A function f: A > B
3. One-one onto function (Bijective function or Bijection):
one-one and onto i.e., if the distinct
is said to be one-one onto or bijective if it is both
elements of A have distinct images in B and each element
of B is the image of some
element of A.

sOME IMPORTANT FACTS

Note that a bijective function is also known as a one-to-one function or one-to-
one correspondence.
.Iff: A >B is a function such that,
() fis one-one n(A) < n(B).
(ii)fis onto n(B) sn(A).
(ii) fis one-one onto i.e., fis a bijection ^ n(A) =
n(B).
A > A is necessarily onto and an onto
F o r an ordinary finite set A, a one-one function f:
set A.
function f: A > A is necessarily one-one for every finite
elements then the number of functions
and B have respectively m and n number of
ifA
defined from A to B is n".
two sets having m and n elements respectively such that m sn, then total
IfA and Bofareone-one
number functions from set A to set B is "C, x m! i.e., "P.
from set A to set B will be 0.
Ifm>n, then no. of one-one functions
functions defined from A to itself is n!.
n then the number of injective
If n(A) =

such that m 2n, then total

.IfA and B are two sets having m and n elements respectively
B is
no. of onto functions from set A to set

Definition of Bijective function has been given so that, there is no learning gap
inverse trigonometrie functions.
in the understanding of
 10
n+(-1)'x "C, x (n - 1y" + (-1)' x "C, x (n - 2" + (-1P + "C, x (n -3yn
Mathemalic
n -3"+.
(-1p-1x"C,x (1)" =

2-1yz"C.
Ifm <n, then no. of onto functions from set A to set B will be 0.
r=0 ,n-r
IfA and B are two sets havingm and n elements respectively such that m
a bijective function can be defined from A to B. n, only thn

So, no. of Bijections from set A to set B will be m!

Ifm >n or, m <n, then no. of bijections from set A to set B will be 0.

INVERSE TRIGONOMETRIC FUNCTIONS

Note the followings and keep them in mind

()The symbol sin-lr is used to denote the smallest
such that the sine of this angle whether positive or negatie
angle will give us x. ative
Similarly, cos-lx, tan'x, cosec-lx sec-x and cotlx are defined.
,

(ii) You should note that sin-lx can

be written as arc sin *.
Trigonometric Functions can also be written as arc cos x, arcSimilarly,
tan x, arc
other Inverse
(iii) Also note that sin'x (and sec x ete.
similarly other Inverse Trigonometric Functions) is
different from (sinx', In fact, sin'x is the entirely
measure
of an angle
in
Radians whose
sine is x whereas (sin x)' is
(which is obvious
as per the laws of
iv) Keepin mind that these inverse sin exponents.
i.e., they are valid only for sometrigonometric relations are true
values of r for which inverse only their domains
in
are well defined! trigonometrie functions
Principal Value of lInverse
Trigonometric Functions
Numerically smallest angle is known the as
.The principal value is
never
principal value.
numerically greater than t.
Domain and Range of Inverse
Trigonometric Functions
Inverse Trigonometric
Functions ie., fx) Domain Range
(Values of a) (Values offa)
sin'x
H1, 11
COSx
-1, 11 10, r
cosec x
R--1, 1)