RElAtIoNs & FUnCtIoNs

LEcTuRe 1
A 1

b 2

C 3

d 4

A B

z Ith ke basics
muumuu

Two sets :
Input set , output set

Cartesian product of 2 sets is AXB →

output set

input
set

here element A maps to

each
of
element B
every of .

For Ln : I a

2 b A =L 1.2.34 ) s { 13123133443
3 c B -

-
Sa b. e3 ,
4,21 41,33
Y
B
A

A- XB is { (I ,
a ) ,
d. b 1,11 ,
c ) ,
( 2. a) 12 ,
b) ,
12 ,
c) ,(3. at ,( 3 b)
, ,
( 3. c) .

( Y at
, ,
4. b) 14,41

Now any subset of AXB is a Relation from A to B .

for En s
s cha ) ,
(2. a ) ,
( 3. all is a RELATION .
 •
In a relation ,
one input can have multiple outputs .

•
In a relation R in the form ( n , y) ,
n is element from input set &

y is from output set .

•
Also IM me
padha tha ki a relation is called a Function if input
has unique output .

'm
12 ke relation me hum A XA me Relations dekhen.ge .

And But
types of relations padhenge . use
peke knock basic questions bar eete hai -

Q, Set A is { 1,2 , 3 , 4 } & R & P are relations on AXA such that ,

R = ( ( 2,1 ) (2 , ,
1) ,
(1,2 ) ,
12,31 14 , 1) ,
/
P =
I ( 2,41 , 6,4 ) , 14 ,
I 1 , 4,213
which of these relations is a
function ? ?

Are In R ,
I is related to 1 & 2 ,
ie input 14 has 2 outputs 142 ie not

a function .

In P .
Each of the input 1,2 , 3,4 has only L output ,
ie P is a function .

Important :
If a relation defined on A XB , if the relations has more elements

than no .

of elements of A then ,
it CANNOT be a
function .

Par Kyun ? ?

Dekho A
input set hai .

Agar A me in elements hai to manimum

case me bhi agar Koi relation ho jisme Saare elements of A are

mapped &
function is created then only in pairs will enlist .

*
Q, How many number of relations can be defined from set A of m elements ?
d
AXA
A- No AXA
.

of relations = no .

of subsets of
No .

of elements in AXA = mxm = m2

Now ,
no .

of subsets = 2K ( where k = no .

of elements in that set )

So ,

It no .

of relations are possible .

Proof [No of .
subsets in a set ] : P = { a , .az . - .
an }

{ a } 1923 . .
.
.
. San } La .az } Ear 933 ,
.
. . .

n
"
Cn
"
C, subsets Cz
→ Moth C , th Cz th Cz .
. .

- { a , ,
Az 0373 .
. -

E )
,

→ 20h ' I '

h
Cz
 Types of Relations

KEELE :
If R is a relation on the set AXA & (n ,
n ) ER F n EA
then it is known as reflexive relation .

For En :
if A =
I 1,2 , 31
& R =
{ 4,11 ,
12,21 ,
13,3 ) ) then R is reflexive .

{ It ) 4,21 621,13 l ) 13,3 ) } R

R =
,
I
, ,
,
,
→ is
reflexive .

R =
Ill ,
11 ,
12,2 ) ) s R is not reflexive .

Every element is
mapped with itself t other pairs ( not nessecary ]
*
If A has m elements ,
then
any Relation R on AXA has minimum of
m elements for it to be REFLEXIVE .

fyymEEk :
If R is a relation & Cn , y l E R then Cy , n ) should also be

present in R for it to be symmetric .

For En -

if A is { 1,2 3,41 ,

R =
{ ( 1,21 ( 2,1 I , .
(l ,
I ) ) is Symmetric .

Unlike reflenive ,
it is not nesseciary that each element of A cis
mapped
with an element But if In y ) is present d ly , a ) is present then
.

any ,

R is
symmetric .

*
If is related to then y is also related to
n
y a .

related to y is related to
Transitive :
If in a relation R ,
n is y , z then

n should be related to z
for it to be transitive .

or

if (n , y ) ER & Cy , 2) ER then Cn, 2) ER for transitivity .

For 9N : A =
{ I, 2 ,
3, 43
R =
{ ( 1,2 ) ,
(2,31 ,
( 1,3) ,
l l, 4 ) ) e is Transitive

R = { (4,21 ,
( 2,3 ) ,
4,21 ,
11,3 ) } → Not Transitive

*
*
A relation which is
reflexive
o
,
symmetric & transitive is called an Equivalence Relation .
Some questions :

Tyke -
L : A & R are given :

mm

0=1 Let A =
10 ,
1,2 , 33 & define a relation R on A as
follows :

R =
{ 10,0 ) , ( 0,11 ,
10,3 ) ,
I 1,01 , 11,11 . 12,2 ) , 13,0 ) 13,313 .

Is R reflenive ? Symmetric ? Transitive ? ( NCERT EXEMPLAR ]

ALI : ( 0,01 ,
11,1 ) ,
(2,21 13,3 ) ,
are present in R . ie R is Refleniue .

(0,1 ) → 11,01 ,
10,3 ) → (3,0 ) are
present in R
,
ie R is Symmetric .

for 10,01 4 (O ,
l ) → (O , I 1 is present
for (O ,
O ) & (0,3 ) → (0,3) is present
for ( 1,0 ) & (0,0 ) →
( I ,
O) is present
for Cl , O l d (O ,
l) → (I , I ) is present
for 11,0 ) & ( 0,3 ) →
4,3 ) is not present .
ie R is not Transitive .

Pls solve N C E R T
-
-
- -
Enercise 1 for practice .

A- 2 For set A =
I 1,2 , 31 , define a relation R in the set A as follows :

R =
E 11,11 . 12,2 ) ,
13,3 ) , 11,3 ) } .

Write the ordered pairs to be added to R to make it the smallest equivalence

relation . ( NCERT EXEMPLAR]

Am-2 : B has ( 1,11 ,

(2,2 ) ,
( 3,3 ) already ie it is Reflexive .

Mr

R has ( 1,3 ) but (3,1 ) missing is , so add 13 ,

I ) .
Now it is symmetric also .

R is { ( 1st ) ,
(2,21 , ( 3,3 ) ill 3) 13,111 , ,
it is Transitive also as

for 11,3 ) & 13,1) s ( 2,1 ) is present .

So ,
only ( 3,1 ) should be added in R to make it Equivalence .
 Type
hmmm
- 2 : R =
I In y )
,
: Some relation b/w n dy is given }

3 T
Let T be the set of all triangles in a plane & R be a relation in ,
given by
R =/ CT Tz )
, ,
:
T , is congruent to Tz } .
Show that R is an equivalence relation .
(NCERT)

AIL :
clearly R is reflexive by CT Ti ) , .
ER as T, is congruent to itself .

Also R is
symmetric bcz if T , is congruent to Ta then Tz is also

congruent to T. .
ie if (T , , Tz ) ER then -6 ,
T, ) ER .

R in transitive as if IT is congruent to Tz & Tz is congruent to Tz

then definitely T, is congruent to Tz .

9,4 Show that the relation R in the set Z

of integers given by
R =
{ la b )
,
:
2 divides a b )
-
-

is an
equivalence relation .
[NCERT]

Am -4 R for Ca 0
is
reflexive since a) 2 divides a a or 2 divides
: -
.

, ,
mm

R vis symmetric because if 2 divides a -

b then it will definitely divide b -
a .

R vis transitive because if a -

b is divisible by 2 & b -
c is divisible by 2

we can write a -
b = 2 m d b -
C = 2n a -
c =
(a -

b ) + (b -
C ) = 21Mt n )

ie a is divisible 2
c
by
-

ie R is an
equivalence relation .

01,5 let R be the relation on the set N

of natural numbers defined by n Rm if n divides me .

Then R vis

(A) Reflexive and Symmetric

(B) Transitive and Symmetric
(c) Equivalence
(D) Reflexive ,
transitive but not symmetric .
( NCERT EXEMPLAR]

Ans S
nm
- : R =
( (n , m ) : n divides m )
R is reflexive since n will always divide n
itself .

R is not Symettnc as 2 divides 4 but 4 doesn't divide 2

R is Transitive as
if u divides m d m divides
p then obviously
also
divides p m in p Mm →
p =Cµ Hn
n = =
.
,

ie (D ) is correct .
I
RElAtIoNs & FUnCtIoNs
LEcTuRe 2
A 1

b 2

C 3

d 4

A B

Functions :

Already last lecture me dekha tha ki vo relations jisme inputs ke UNIQUE outputs
note hair untie mum Functions bolte hair .

CE If R is a
function ,
R =
( ( 1,21 , (2,3 ) ,
(3,31 (4,211
, .
Find its domain &

range .

E Here elements from input set together make the domain & elements from output
set create range .

ie Domain is :
{ 1,2 ,
3 Y
, )
& Range is : I 2, 33

Ab is lecture me hum types of functions padhenge . .

1) One -
One Functions :

(#) theft
1 a
input has a
different
2 b .

3 C No two
inputs have same image .

Y d one -
one
functions are called injective Functions .

A B
Q,
"
check whether f is one -

one or not ?

f- is Ill ,
a ) , L2 ,
b) ,
13 ,
a ) .
Hi d) 3

is not one
2 -

inputs s same output → Is a

,
3 → a this function -
ore .

Mathematical
mmmm
Definition
i m
:

In a function f : As B
for any n , , na E A ,
f-In ) , t flu ) .

t
domain /
co domain
-

If any two inputs give the same output then function is not one -
one .

A to equate f- In )
way prove in questions : take n , y C- Domain & & fly ) ,

it that then
if concludes n -
-

y fin) is one -
one .

ie if Hn ) =
fly ) n =
y then f is one -
one .

Graphical interpretation :

/ ~

2) Many -
one
functions : A function which is not one -
one is known as a Many - one
function .

crummier

3
1- a Here ,
both 2 & are
mapped to b .

2 b ie two inputs have the same output .

3 c

Y
/ d

A B
 Oi, Prove that f- In ) = at 7 is a one -
one function .

¥ For one -
one : n, y E Domain e f- In ) =
fly )
n -17 =
y -17
n y
-
-

ie f is one -
one -

Q, Prove that flat = n' -

9 is not one -

one -

¥ For one -
one : n , y ED flat =
fly )
'
of-9 =
y -
9

n2=y2
n =
ty
Also , fll ) = R 9 - = -
8 , fl - t ) = f- IT 9 - = -
8

f- is not one -
one

f- is many -
one

Q, A function is defined from AXA where A vis Gl , 2,33 : f is { ( 1,2 ) .

(2,3 ) (3 I ) )
, ,

Is f injective ?

As Domain i { I ,
2, 33 & Range → I 1 , 2,3 }
1 → 2

2 13

3 -
L f is one -
one

1- is injective

**
Q, How many one -
one
functions can be defined from A to B if A has m elements

& B has n - elements ,

considering that every element of A is taken .

a) if man

b) if n
-

m -

*
c) if m > n

As if A has m elements ,
then each element will pair with exactly one element &

other element will be The has

no
mapped with it .

first element n choices ,

the neut has n -

l l so on .
So no .

of ways : n
-

Cn -
t ) .
. . n -
(m -
l l
"
I or Pm
Ln ml !
-

"

if m = n then Pn = n !
if mon then no one -
one
function can exist .
 Also , Range of flu) is R .
bcz y
= Un +5 = codomain

ie f is Onto .

A, Show that the onto function f : l l 2,3 }, e f l, 2,33 is always one -

one .

E clearly if f is onto then each output must be

mapped from atleast one
input
& also So
each input must be mapped to one &
only one
output . the function has

to be one -
one .

coexecutor Pack :

Q, Show that the one -

one
function f : El 2,33
,
→ L l, 2,33 is onto .

l :# 41*981
A-
-

our

onto