Relations and Functions

Relation: If A and B two

non-empty sets, then subset & of AXB is called
are
any
Relation from set A to B. i.e. R: A-B<>REAXB

If (x,y)tR then we write

xsRy (read as x is R related to
y) and

If (x,y) & then we write

icy (read as x is not R related to
y)
Domain and
Range of a Relation: If R is
any relation from set A to set B then,

Domain of R is the set of all first coordinates of elements of R and is denoted

by Dom(R).

Range of R is the set of all second coordinates of R and it is denoted

by Range (R)
A relation Ron set A means, the relation from A to A i.e., RAXA

Empty Relation: A Relation in a set A is called empty relation, if no element of A is

related to
any element of A, i.e.B =
PCAXA
Universal Relation: A Relation & in a set A is called universal relation each of A is

related to element of A, i.e. B AXA

every
=

Identity Relation: R
[(x,y):
=

xtA, ye A, x
y3
=

OR R =
P(x, xc); eEA3
ARelation R in a set A is called -

Reflexive Relation: If (a, a)tA, for every at A

Symmetric Relation: If (a,ac) -R implies (a2,a.)-R for all as, act A

If (a,,ac) -R (ac, as) -R (ac,as)tR for all A

Transitive Relation: and implies
a,ac,as-
Relation: is transitive
Equivalence If R reflexive, symmetric and

Antisymmetric Relation: A relation 1 set A is

in a
antisymmetric.
If (a,b) -R, (b, a)tR -> a bv a,btRor aRb and bRa = a =
b, v a, bt R.
=

Inverse Relation: If B,
A and B are two
non-empty sets and be a relation from A to

such that R= [(a,b): atA, beB3, then the inverse of R, denoted

by RI,
is relation from to A and is defined RF [(ba): (a,b) CR3
a
by
=

Equivalence class: Let R be an equivalence relation on a

non-empty set A. For all atA,
the equivalence class of 'a' is defined as the set of all such elements of A

which related a under R. It denoted (a).

are to is
by
i.e. (a) equivalence = class of 'a =
9xEA: (x, a) (R]

Function ·Let X and y be two

non-empty sets. Then a rule of which associates

to each element yeX, a unique element, denoted

by flat of Y, is called

a function from X to Y and written as fix-4 where, flee is called

image of x

is called of f(x) co-domain

and x the
pre-image and set y is called the of f
and f(x) (f(x): <eX3
=
is called the
range off.
One -
One or Injective Function: A function fix-y is defined to be one -
one if the

images of distinct element of X under fare distinct;

i.em,cetX:f(x) f(x) = -> x, =1 Otherwise - is called

many
-
one

NcertKaksha/Umesh
· Saini Vaishali saini
 Onto or Subjective: A function f: X-Y is said to be onto if every element of Y

is the
image of some element of X under f; i.e. for every yet,
there exists an element is in X such that f(x) =

y
One -
One and onto on Bijective: A function fixey is said to be one-one and

onto, if is both one-one and onto.

Note: f: X-Y is onto it and

only if Range of f= Y

composition of function: Let f: A - B and

9:B-> > be two function then the

composition off and

a
denoted
by got and defined as

function got: At

gf((()),
the

+ wetA

Invertible function: A function fix-y is defined to be invertible, if there

exists a function g:Y-X such that

gof: ex and fog
=
ty.
The function g is called the inverse off and is denoted
by 7%.
Binary operation: A binary operation * on a set A is a function *: AXA-A.
denote *(a,b) *b
we
by a

A binary operation * On a set A is called commutative, if a *b

=
b*a, for
bt A.
every a,
A
binary operation *: AXA-A is said to be associative if
(a* b)*c =
a*(b*c), + a, b, ct A

of
identity element

·A *:
binary operation AXA-A, an element etA, if it exists, is called
identity
for the operation *, if a*e=e* a, atA

A
binary operation *: AXA-A with the
identity elemente in A, an element at A

is said to be invertible with respect to the operation *, if there exists an element

bin A such that a* =
e = b*a and b is called the inverse of a and is

denoted by a "

No. of function: Let f: A-B be and (Al=n and IB1 where,

any mapping m
=

IA) represent no. of elements in set A

IBI represent no. of elements in set B

Then, Total no. of function from A to B m"

=

If Total of n
Casecis n m; then no.
mapping
= =

Total no. of one-one

mapping
=
n!
Total no. of onto
mapping
=
n!

n
Case(ii) If Total of
nam; then no.
mapping m
=

Total no. of one-one

mapping
=
mcan!
Total of onto 8
mapping
=
no.

·Case(iii) If Total of mn
n>m; then no.
mapping
=

Total =
no. of one-one
mapping
Total no. of onto
mapping -mlmcacm-n

NcertKaksha/Umesh
· Saini Vaishali saini