0 ratings0% found this document useful (0 votes) 10 views18 pagesDocScanner 19 Jan 2024 06-09-2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
pelations and Functions
Relation
sion R from a set X to a set ¥ is defined asa subset of
A relat an product X XY ie. RX *Y.
the cartesian
Domain and Range of a Relation
et of first clements of all ordered pairs in R
Te Sica p)e R}is called the domain of relation R and the
1S rsccond elements of all ordered pairs in R.
JEG. 0) eR} is called the range of relation R.
then n(A x8) = pq and numberof relations
The st
NOTE Hfn(A)=p and (6)
from set A to set
Types of Relation
1 Empty (or Void) Relation A relation 2 in a set Xis
Ealed on empty relation, itno element of X is related
to any element of X
ie R=OCKXX
2, Universal Relation A relation R in a set X's called
tniversal relation, ifeach clement of is related to
every element of X
ie RaXXK
Both the empty relation and the universal relation are
some times called trivial relations.
Reflexive Relation A relation R defined on a set A is
said to be reflexive, if
GxeR, Vxed or aRx, Vxe A
‘Symmetric Relation A relation R defined on a set 4
is said to be symmetric, if
(ER > OER VA YEA
or -xRy=> yRx, Wxyed
‘Transitive Relation A relation R defined on a set 4 is
said to be transitive, if (x, »)€ Rand (35 =)¢ R
= (% JER, V EK ZEA
or xRyand yRz =>xRz,Vx.y. 264
Equivalence Relation A relation R defined ona set A
is said to be an equivalence relation, if R is reflexive,
symmetric and transitive.
Equivalence Classes Let & be an equivalence relation
ina set 4 and let a ¢ 4. Then, the set of all those
elements of 4 which are related to a under the relation
R, is called the equivalence class determined by a
and it is denoted by [a].
So,[a]= {be A: aRb}
NOTE () Two equivalence classes are either disjoint or identical
{i The union oF all equivalence classes gives the whole set.
(ii) Identity relation is always reflexive, symmetric and
transitive,Function
Let A’ and" be two non-empty sets. A function ot
mapping f from ¥ into Y written asf: —> } jsamule by
which each clement x € X is associated to a unique clement
ver.
Domain, Codomain and Range of Function
The elements of are called the domain of f and the
clements of Y are called the codomain of f. The images of
the elements of 4” is called the range of f which is a subset
ofr.
[NOTE Cvery function's relation but every relation isnot action
Types of Function
1, One-One (or Injective) and Many-One Function
A function £:.° —> Y is said to be a one-one function,
ifthe images of distinet clements of ’ under f are
distinct.
1 Mark Questions
Multiple Choice Questions
1. Select the correct option out of the four given options
Let & be a relation in the set W given by
R= {(a,b):a =b-2,6>6) (CBSE 2023
Thea,
- @B&NER (0) (6,8)ER
COGBER 4k
2, Let A= {3,5}. Then, number of reflexive relations on A
is case 2023
@2 (o)4 ()0 @s8
@ Waiconcerr
fina set A n(A)=x, then the number of reflexive
relations on Als 2".
3. Arrelation R in set A = {I,2,3} is defined as
R= (11), (1.2), (2,2), 3,3)}. Which of the following
ordered pair in R shall be removed to make it an
equivalence relation in A? (CBSE 2022 (Term |)
@LD OL2) (22 3,3)
@P——_________________ choptonviso CBSE Solved Paper
EMATHEMATI Cg
P(x) = SC)
eX
Thus, fis one-one i
or f is one-one iffy 4.x;
= fy) #F05)
for all xy.13 6X.
A function which is not one-
rmany-one function,
2. Onto (or Surjcctive) and Into Functlon A function
Y e an onto function. if ever
I Fis said to be an onto function, if every
F ic. for every ye Vs there exists an element x in 4°
such that /(3)= 9: a \
ion is called an onto function,
In other words, a function is called an ont a
its range is equal to codomain. A function 2.1 yi,
said to be into function, ifthere exists atleast one
‘element in ¥, which do not have any pre-image in 1,
3. Bijective Funetion A function f:X > Y is said to by
‘a bijective function, if tis both one-one and onto,
cone, is known as
4, Let the relation & in the set A= (xe Z:0S.x S12),
{(a,):|a ~ b|is a multiple of 4}. Then
given by R= multiple
{1}, the equivalence class containing 1, is
(CBSE Sample Poper 2022 (Term)
(a) (1,5, 9}
(b) (0,1,2,5)
©
@a
5. The function f:R — R defined as f(x) =x? is
CBSE Sample Poper 2022 (Term
(a) one-one but not onto
(b) not one-one but onto
(c) neither one-one nor onto
(4) both one-one and onto
6. Let A = {l,2,3}, B= (4,5,6,7} and let
SL ={(h,4), 2,5), B,6)) be a function from A to B.
Based on the given information f is best defined as
CBSE Sample Paper 2022 (Term)
(a) surjective function
(b) injective function
(©) bijective function
(@) None of the abovetations ond Functions
olotion:
ertion-Reason
sertton (A) The relation
7080.2, 3:4) > (38 5 P) defined by
(G.3)@ 99.2) biective Rinetion,
Reason FD The function /:4,2.3)
that = (0,2 2,39. @,2)) is one-one
(a) Both A and R ae true and Ris the eee
© explanation of A. "© correct
Both A and R are true, but R is not thee
? explanation of A }ot the correct
(@) Ais tue and Ris false,
(@ Ais false, but Ris true,
Very Short Answer Questions
8. How many reflexive relations are possible in se
yi Someta
9. Check whether the function /:R > R defined as
o
Fee)=2) is one-one Ont. Case sample rose 30m
40. A relation R is $ = (1,2,3) is defined as
R= {(D- (2), (2.2), G,3)}. Which clement(s) of
relation R be removed to make R an equivalone
relation? CASE Semple Poper 2021
11. An equivalence relation R in A divides it into
equivalence classes ,, 42, 4,. What is the value of
A UA, Ay and A, Ay Ay?
‘CBSE Somple Poper 2021
12. A relation R in the set of real numbers R defined as
R={(a, 5): Va =} is a function or not, Justify.
(CBSE Somple Poper 2021
++ telation, if each
All india 2020
% PI such
CBSE Sample Poper 2023
13. A relation in a set 4 is called
element of 4 is related to itself.
14, Let A = (1,2,3,4} and R be the equivalence relation on
AXA defined by (a,b) R (6) iffa+d=b+e. Find
the equivalence class [(1, 3)]. CBSE Sample Paper 2018
15. If R = ((a, a): a is.a prime number less than 5} be a
relation, then find the range of R. Foreign 2014
16. Let R is the equivalence relation in the set
A= (0,1,2,3, 4,5} given by R = {(a, b) :2 divides
(a~b)}. Write the equivalence class[0} Delhi 2014c
IFR = ((x, y):x +2y=8} is a relation on N, then write
the range of R. All Indi. 2014
(4.5.6, 7) and
whether. D1 I8 fumers
Tis one-one or not "Mn from a tp, State
‘an
2 Marks Questions indi2013
19. function 7:4» AeFined as
one-one nd ome. fees to
then find the set 9
(CBSE 2029,
LN N such that
mst
Sal 2°
ifnis oda
3 Marks Question
22. Check whether the relation R
elation Rin the st 2 of integers
defined as R= (a,):a + bie “divsbicee ee
reflexive, symmettic or tanstive Wen oe
equivalence class containing Oe.
RE Some oper 2021
& |CONCEPT
Find the set ofall hose elements ofz which ae related to
Ole.l0=ber=(0,6)eR)
4 Marks Questions
23. Check if the relation R in the set R of real numbers
defined as R = {(a,b):a6}
Gy a Nex? tpn 422) =
since, 6>6
1 b=7, then a=7-2=5
When bo8. then a =8—-2=6 FHA ands? +x4x, +33 20
So, (5, 7)ER and (6,8)ER ++ S(3) is one-one function.
a Range of f(x) = (co, 0)
‘odomain
= Range
+S (2)is also onto function,
Hence, f(x) is both one-one and onto.
6. (b) We have, A = {1,2,3}, B= {4,5,6,7}
2. (b) Here, n(A)=2
The number of reflexive relations
=2"°", where mis the number of elements in the set.
ent apt? a2? a4
(6) We have, A= {1,2,3} Function f = {(1, 4), (2,5), 3,6)}
R= (00, 02).22.8,3)} Clearly, f is injective function.
R is an equivalence relation in A, if (1,2) is removed Now, range of f = {4,5,6}
from R. Codomain = (4,5,6, 7}
a) A= (0,1,2,3,...12} Here, Range # Codomain
{(a,6):|a —b| is multiple of 4} +S is not surjective function.
he equivalence class containing 1 is {1, 5,9}. 7. @ Given relation, f :(1,2,3,4) (, », 2 p}
® Concept The equivalence class containing j and S=(40,2 8,2}
Enhancer 1is given by [1]={b ¢ A: (1.6) Bis defined asf = (04), (2,5), 6,6)
14, Here, A= {1,2,3, 4}, then be FU" 4F0 )= Sand FO)
. It-can be scen that the images of distinct elements of 4
under fare distinct. So, fis one-one, 0
(G3)]= (@, y© Ax A(x, ») R(1,3)}
NEAR A += yt) 19, Given, f:A > B
HE Ms 4xdryaxs3) Such that f(x)=2x is both one-one and onto
= (Ge AxAry—x=2} = ea
= (03),.24)) 5
15. Given, R = {(a, a*):ais a prime number less than 5}
We know that 2 and 3 are the prime numbers less than
5. So, a can take values 2 and 3.
Thus, R= {2,2°),(,3°)}= (2,8), G,27)} oa
Since, f(x) is onto
Hence, the range of R is {8,27}. w
++ Codomain of f = Range of f
; P_eorcept The set of all second elements of j
Enhancer the ordered pairs in Ris called
Range of the relation.SS
- os
Te STR
SS Sewease:
oan
RIE RARE
SS 6S SSS,
a POR
RE
SOROS
aa
REDE ET PAG NETO
aE.
SRS SD RANA TENSE ORAM
~
SSB
~ Seoede
a
®
A
SOP FR =
> Screen
eS, >
ROSARIO ERROR.
SINR A RE
SS RRR
SERRE RONG, a
ARE RHE ECAR,
SACHS
SW RSSR THAD RARER AW
SS AW DRA Sy SN RAN RA
S
NERS DSRS DEE
RAEN MHMDBAK,
eS
NEPOMOKBKG HNC THES Ve},
YEN A ERAN. we™~
SEN
Wen erteete pas Stee oso n
Ree ay eC Bat AY)»
& ~PEHMHGS =~ 254,
SOP Rn aay By Sy Hea way,
—— eon ” 2 See NG
me PRE R OCR oan aheeyeeoen ae SHY TENTH “IAD
Pe mete. = aan
o Aas
- Ra
™
Tes f= Fay)
x = yea tae
eS Dee Pace Sa fs 2 anos fat.
SSS Shere nine segue (Ome tonction I= ve $= R- Bn, *
Bergersd ay
4a
— 2S sandmie fra re},
Seen aceem se? ]
aS RTL
22.8 ess) @ |
ee PLP TEE oe |
Geieoe Ses
Sia
Sumer Western oS efee ‘Thus Gor each pe dev eis eS ys
Soe? fee rt
Teme Feet Ce Feet
Mi SePa Se Se Femme @
Tee J eee ieee eee
=e
& 72 see ee =pel
31.
sjians 14 FUNCTIONS
hiyen, wielation IDA A, where 4 = 1.2.3,
Nsctined 28 (aD) HAC Da dm by ¢
pefterive Lt (u,b) be any atbitrary element of Ay A
je (a, DEA X A Where a, he A,
Now.as ath=b+a
(a, b)R (A,B)
‘So, Ris reflexive
symmeteie Let (a, 0). (6 d)€ 47 4, such that
(a, bc, 4) Then, a+dehse
= browasd
= cth=dea
9h
[ addition i cemnmrmatative}
an
(+ addition ix commatative}
= (c,d)R(a,b)
So, R is symmetric. am
Transitive Let (a,b). (od (ef )E A» A stich that
(a,b) Rled)and (cd Ref).
Then, a+d=b+candc+f=d+e
(On adding the above equations, we get
ardterfabtrerdre
= atfabre = (a,b)R(ef)
So, R is transitive.
Thus, R is reflexive, symmetric and transitive,
Hence, R is an equivalence relation. oO
Now, for {(2, 5)]. we will find (c,d )e Ax A such that
2+d=Stcord-c=3 an
Clearly, (2,5)R (4) as 4-123
(2,5) R (2,5) as 5-2=3
(2,5) R G,6) as 6-3 =3
(2,5)R (4,7) as 7-453
(2,5) R (5,8) as 8-5=3
any
and (2,5) R(6,9) as 9-6=3,
Hence, equivalence class {@,5)]
= 10, 4), 2,5),B,6),(4, 7). (5,8)-(6,9)}. 0)
Do same as Q. No. 28.
Given, f(x)=
4x43
2
4253 sauce ant}
One-One function Let x,,x,€ A=R— I such that
Sy)= SOx)
Then, Mn, #3 ay
wnje%
~ a;~4
(44, 9) hee 4 a
hay, - Vor, 043, Pe thes By thy 4;
Whe, Vanes, te,
~ Dr, Me, ~12
$0. 8 one-one thnctiem
Onto function Lex a
Ye ses metre ™
brary cement of 4
Then,
<4)
= -ays3
by-4
Cheasty, x = 4223
iy. = 7 is areal number for att yx 422
7 veS.2
0%
Ee Aes 2
6y-473
4y+3_ 2
Also, *5 |= lay+9m12y-8
92-4 which is aber
Thus, foreach ye A (codomsin), there exists
y+:
x= 7253 € A (Comain) such that
4yx3
je
Moy r12+18y
“Jays 1B—24yo16
ae
Sse
Hence, f is onto function. wo“a
32. Given, function iSS°N N such that
Sey=f*+ ifvisodd
2) es if xiseven
‘One-One function
Caser When '*) and x, are even, then
. See mn
(=i
= x “”
Therefore, the funct ao
of
= 4
Thus, in both the cases,
SOV)=F63)
= ne
‘Case I When x, is odd and x, is even, then
ax
Also, £(x,)is even and /(x,) is odd,
a car Y” >,
x
we
So, SO)#S (ey)
Thus, A tx
ead SO)#S 0)
Case IV When x; is even and x, is odd, then
ay tx
Also, (x; ) is odd and. Lf (x2) is even,
So, LS) # Sy)
Thus, Atay
= SO) # S02)
Hence, from cases I, Il, III and IV, we can observe
that f(x) is a one-one function,
Onto function Let ye N (codomain)
@
be any arbitrary
number.
If yis odd, then there exists an even
(domain) such that
SO+= (yt 1)-1ey
If is even, then there exists an od
(domain) such that
SOI) =(y-I tly
Thus, every element in V (codomain) has a pre-image
in N (domain). o
number y+1eN
id number y~1e N
~~
Chapterwise CBSE Solved Papers : MATH,
"
‘Therefore, f(x) is an onto function,
Hence, the function f(x) is bijective,
Common 0 consider the folowing
Mistakes whens, isodd and, i.
{iwhen x, is even and x, is odd en
‘The given function is f :R > R such that
LQ)=4P +7
To show J is bijetve, we have fo show thay,
\ one-one and onto.
ch One-One function Let x,,x2 € R such that
Sead=Stea)
dee 72a} 47
= fx 2dr}
= x} =0
2 G-n)GFtamtdy=0
2
(ea? -B =(a~ bya? tabs)
;
ee Jl: +3) pile
= Either x, -x, =0
"3
BY) 3.20,
(+8) sdeeo s
But Eq. (i) gives complex roots as x,,x, € R,
‘ 4,77) 20 3 3, =x,
of)
Thus, f(%,)= fx)
= * =a, Vary eR
Therefore, f(x) is a one-one function, 0
Onto function Let ye & (codomain) be any arbitay
number.
Then, S@)=y
= 42 47=y
>
>
=
[-yeal
which is a real number.
@jad Functions
fons O"
petation®
=> (eR Vrex
Therefore, R is reflexive.
Symmetric Let (x, y)eR ay
‘Then,
= Sx) /
> (uxeR
Thus, (% YER =(%XER, Wx, ve X
‘Therefore, R is symmetric,
i ”
_posyisan nto function aay ‘Transitive Let x, »; 2X such that
mf oth one-one and onto, so it isa
since, f(2) is both one: iy ( se Rand ()
bijective: Then, x)= -
a Concept Afunction f definedtromseta es FO) 50) i
Enhancer to Set Bwill be a bijection if all SO=S()
cements of Ahave distinc images in Set Band From Eqs. (i) and (i), we get
/ clemertement of Bis the image of some elements ( SO)= Sle) = (user
at. Thus, (ER and (%2)ER
‘34. Given, relation is 5 = GER Wx, rex ;
5 ={(a,b):4, DER and a S67} Therefore, 2 is transitive, aw
eal ty Since, R is reflexive, symmetric and transitive, so it is
Reflexive As, $[3 ) + where 7¢ Ry is not true. an equivalence relation, aay
F 37. Given, function f:R— Ris such that f(x)=ax+b;
(Ga)es a, beR,ar0,
7 acaive o ‘One-One funetion Let x,, x, €R such that
Thus SOU ras
symmetric As,-2S@ )°, . Then, ax tbe ax, +b
but3<(-2 )? isnot true, = ayaa :
jue. (-2,3 eS but 3-2 JES. = won aad
‘Therefore, 5 is not symmen. 3 i) Thus, f(%1)=fG2) = % any
3 3.(4 Therefore, f(x) is a one-«
save An3<(2) an3($) ote
itrapeith 6) 2°G Onto function Let ye R (codomain) be any arbitrary
3 4p areuuebut3 <(4) isnot wue clement. Then, f(x) = y= ax+
23 Senwemenuas($) so “ oan |
3 34 4 a
ie. ( 3) Sand G $e ors ( 3)e5 Clearly, x is real number. [eyer]
Sra aati Want Cemiave? ay Thus, foreach ye R (codomain), there exists
Hence, S is neither reflexive nor symmetric nor
transitive. any
35. Do same as Q. No. 29.
36. The given function is f : —> Y and relation on X is
‘Therefore, f(x) is an onto function. an
Bele) Haye 5G) ‘As, (3) is both one-one and onto, so it is a bijective
Reflexive Since, for every x X, we have peed an
S)=L(H)CChopterwise CBSE Solved Papers : MAKE,
4
SS. Given relation 8 detiond oa a set of reat number R
SSE BREA = {(4, pox yds an rational number}
Reexive \3 is a real number.
is not an irrational number
Older
Fis pov referive wa
Spmmetric consider V3 and \F are nvo real numbers
slaty, \F.\F = 15 isan irational number
= 5G
is 23 irasonal number,
= Risommenic. a
‘Transitive Consider three real numbers 2. and 3.
Chearty,2. V5 225
‘6 is Dot an irrational number
= Risoot masitive.
39. Given, f:8 +R defined as f(x) = S
For one-one Letx.,¢R
‘Such that #(x,) = f(x)
@
@
Let ye. (codomsin) be any arbitrary element,
Thea, y= f(x)
= Srs4ys3r
Thus, for each ye R, there exists
sr83 6
=)
such that f(x) = /|
Ae
So. f is onto. °
ae caf
40, Given. SO) Vg MER { soe
For one-one Let /()) = (32) for some
nares f
fy ts
i Ry td Sn +4
(Gr +) =63)8% +4)
Aye ty =3y8; te
= 4x, =4ky oy =x
= f(x) is one-one function.
For onto Let
= itd
= x(4-3y
4
os Range of f(x) =R — {i
~ Range of f (x) # Codomain of f(x)
So, f(x) is not an onto function. fi
41. Given, function f:[—4,4]— [0,4]
Defined by f(x) =V16-x?
For one-one Let x}, €[~4,4]
Such that f(x) = f(xy)
or 48,20 > x, xy of, =x
= f(x) is not one-one function, @
For onto
Let y¢[0,4] (codomain) be any arbitrary clement.
Then, y= f(x)
=
>pavaionsandifunctions
spins, for each 3° [0.4], there exists
xeylo
[4,4]
such that =»
ge. fis 0010,
Abo given f(a)2V7 = Viera? oj
Wo-a?=7 >a
v omeaed °
az, We have, relation R on Nx N defined by
(a, B)R(G.), fad( +c) = bea +d)
Reflexive Let (a, 6)€ N x N be any arbitrary element,
We have to show (a, b) R (a, b) i.e. to show
ah(b+a)=ba(a +b) which is trivially true as natural
numbers are commutative under usual multiplicaties
and addition.
Since, (a, b)€ N x N was arbitrary, therefore R is
reflexive.
Symmetric Let (a, 6), (6 d)€ N x N such that
(a, B)R (6,4). ie. ad(b + €) = bela +d)
To show, ( d) R (a,b)
i.e. to show cb(d +a) = da(e+ b)
From Eq.(i), we have
ad(b+ 0) = be(a +d)
any
=)
= dalc+b)=cb(d +a)
[+ natural numbers are commutative under usual
addition and multiplication}
= ch(d+a)=dale+b)= (c,d) R (a,b)
Sattar
‘Transitive Let (a, 5), (cd) and (e, fe Nx N
such that (a, 5) R (6 d) and (6, d) R (¢, f)
Now, (a, 6) R (c,d) =2 ad(b+ 0) = bela +d)
Ewe
et at ata ai
and (6, d)R (ef) =f (d+ 0) = deer f)
ema
Gaye m5
On sing Ee 1) ond
(53)(oe4)-(eea)643)
any
=
Leth fra
= Tbe * af
= af (e+ b= bef +a)
af (b+) =bea+f)
43,
(4,0) 8 (ef)
= Ris transitive
Thus, 2 is reflexive,
an equivalence r
Given,
Ron-empty set as (4, 4
Let se Pox)
‘Then,
DERI AKR
Aca
(A ADeER
Hence, R is reflexive,
Now, let9, 4e P(x)
Such that9c4
@ADER
But dco
a
(AgeR
Ris not symmeuric,
Let a,8,Ce P(X)
Such that (4,B),(B,C)e R
= AcBandBoc
Hence, ch
= ACC = (4C)eR
Hence, & is transitive, @
is an equivalence relation if
symmetric and transitive.
‘We know that a relation &
itis reflexive,
For reflexive
For any (a, b)e Nx
ab= ba
C+ multiplication is commutative on N')
> (a,b) Rad)
[from definition of relation & on Nx N)]
‘Thus, R is reflesive,
For symmetric
Let (2, 0), (6d) be arbitrary elements of
(RGA
ad =
benat
ob ta
lus a. Ke de N and mukiptication
{is commutative on N]
gas
* (DY
2B ivnymmontio,
o
woSteller ta umn teint lla ”
Se wise CBSE Solved Press MATH
— "
Por transitive
Led. (6.2, NN
SSN SY he arbitrary elements of NX)
MEO Da OM
oe wis defined at V ye (-L 1D.
Mahan gee 3 SE) sont.
= OW) Case When x
= [Res WHENX Gey}
St@3osrey} =
HARAOKAy = ‘x
a ss F()is one-one.
eso, Checking onto :
We have, f(x) ft 42" Let y= f(x) such that ye (- 1.)
z
Toe F<0 x a =
Wx in S yaply seers iS
1 When 20 wetave .V ye (CLD ,ais defined.
f@= > 2S (8) is onto,
s ad Hence, f(x) is one-one and onto function. |
Checking oosone :
x 45. Given, f:R—> R, defined by F2)=— Veen
S@ j= Metx, 2] =. th
Letxy,xy €R such that f(x,) = f(xy)
MetseR] x
On putting f(x, )= (x5) =
= ALL
+x, Tex, =
3) tae, tay =:
> mx = =0
“F-(2) is one-one. > Fy=a, oF yy =]
Ss eae et
Checking onto :
Let £(x)= J; such that ye(—L.D.
xy
*F isnot one-one, as if we take x, =3and xy[-smests]
Tee Reif 4k? <0
or (12k) (142k) 1/2 ork <-1/2
So, f is not onto.
Hence, f is neither one-one nor onto.
46. Given, R= {(x, y):(x— )) is divisible by 5}
and Z=Set of integers
Reflexive Let xe Z be any arbitrary clement. Now, if
(x) e R, then x — x is divisible by 5, which is true.
So, R is reflexive. @
@
Symmetric Let x, ye Z, such that
(x, eR 5 divides (x - y)
= Sdivides(-(x- y)]
= 5 divides(y-x)
=> (ver
So, R is symmetric. fel
‘Transitive Let x,y, =€ Z, such that (x, y)e Rand
On zER
=2x-y and y= zboth are divisible by 5
=ox- y+ y= is divisible by 5.
= (x~2)is divisible by 5 = (x 2)eR
So, R is transitive.
Thus, R is reflexive, symmetric and transitive.
Hence, R is an equivalence relation. @
j Concept A relation ona set Ais said to {
Enhancer be an equivalence relation on A
iff it is reflexive, symmetric and transitive
47. Given, relation is S = {(a, 6) :|a — | is divisible by 4
and a, be A}
and Az {eixe Zand 0Sx $12)
‘Now, A can be written as
A= 0.1,2,3,-..512} w
Reflexive As, for any x ¢ A, we get|x—x|=0, which
is divisible by 4.
48,
Unie
Relations ond Functions SO
Now, let ke R be any arbitrary element
and let SX) =*
= (NES Vreg
Therefore, S is reflexive
Symmetric As, for an
w
YO NES,
divisible by 4, DES. we gett = pig
(by using definin
¥ Using definition of given relat
= IX Y= 4A fo iameie ee lation}
= [yn x1= 4) forsomea ez
= (axes
Thus, (x,
MESS ONES WY ved
Therefore, 5 is symmetric.
s q
Transitive For any (x, eS andy, 2)¢.5, we a
{x slis divisible by 4 and y~ lis divisible by 4
{by using definition of given relation)
= x= y= Mand) y— ze
for some Ape Z.
Now, x=
4,
(=) 40-2)
Ht4A tau s4Qrspy
=> [x= z/is divisible by 4,
= (ses
Thus, (x, ES and (y, se S
= WES Va red
‘Therefore, S is transitive w
Since, 5 is reflexive, symmetric and transitive, so itis
an equivalence relation, Now, set of all elements
related to 1 is {1,5,9)
‘The set of all clements related to [2]
{a € A2|2~alis divisible by 4) = 26,10) «y
The given relation is R= ((x, y):4, ye Zand x= yis
divisible by 3)
To prove R is an equivalence relation, we have to
prove R is reflexive, symmetric and transitive, «ly
Reflexive As, for any x€ Z, we have x —x=0, which
is divisible by 3.
= (£=2)is divisible by 3
= (eR WxeZ
Therefore, R is reflexive, w
Symmetric Let (x, y)€ R, where x, ye Z.
=> (x-y)isdivisible by 3. [by definition of R]
3.4 for some Ae Z,
3(-A)
x) is also divisible by 3. > (yx)¢ R
Therefore, R is symmetric. w‘ ved Papors : 1,
jorwiso CBSE Sol ATH
S15 ho Ma
eZ,
Transitive Let (x, ye R where
S (= y)is divisible by 3,
= ¥~ Y=34 forsome Ae Z
Again, let (1. 2)e &, where 5,
=> ( ble by 3,
= 5 34 for some B € Z,
Now. (=) (y= 2) 34449
= ==3(A4+B)
ible by 3 for some
(A+ B)EZ = (x, 2)ER
Therefore, R is transitive.
Case Based Questions
=ase Based Questions
1 An organisation conducted bike race under two
different categories-Boys and Gitls, There were 28
Participants in all. Among all of them, finally three
from category 1 and two from category 2 were
Selected for the final race. Ravi forms two sets B and G
with these participants for his college project.
Let B = {b,53.0s) and G= (g,,¢3}, where B
[ePresents the set of Boys selected and G the set of.
Girls selected for the final race.
an
Based on the above information answer the following
questions,
@ How many relations are possible from B to G?
Gi) Among all the possible relations from B to G how
many functions can be formed from B to G?
Gil) Let R :B > B be defined by R = {(x, y):x and y
are students of same sex}. Check if & is an
equivalence relation.
Or
A function R :B ~ G be defined by
R= {6,81 )s (2,82) (3,8; )}
Check if & is bijective. Justify your answer,
is reflexive, s netric and tra
Thus, iseftextve, symmetric and tang
itis an equivalence relation,
itis
¥ Iratlenst one of the conditions ic eflexiyg
0 ymmetric and transitive, is not satisfied,
that the given relation is not an eq
Ng
n
lence
lig
49. (i) Do same as Q. No. 46.
ii) Clearly, [1 ]= {1.3.5}
oc (B]= 13,5)
[2]=Q4)
[4]= 2,4)
3,5)
i Jk Sabha is a gigant
2. A general clection of Lo! isa ex
‘About 911 million people were eligible to vote ct
voter turnout was about 67%, the highest ever,
‘ONE - NATION
(ONE - ELECTION
FESTIVAL OF
DEMOCRACY
GENERAL
ELecrion-2019 BATT
Let / be the set of all citizens of India who were
eligible to exercise their voting right in general
election held in 2019. A relation R is defined on
Tas follows
RAG M2) M Vy eT)
and both use their voting right in general
election-2019}.
Answer the following questions using the above
information. (CBSE Question Bn
(i) Two neighbours X and ¥ € 1. X exercised his
Voting right while ¥ did not cast her vote in
general election-2019. Which of the following i
true?
@)(X¥)eR
OU,eR
OK DER
MYERpettons ond Fnctions
|S Gy Me. X and his wife I both &
ight in general election 2019. Which ufthe
following is tnic?
(a) both OC Wand WAXY
WAM Rud eR
(© both (Wand GAY eR
WON Kbwt WW) ee
(ii) Three friends Fy, Fy and Fy exercised
right in general election:
following is trac?
FH e ROS Re R
and KE eR
OE. PERE, Bek
and (A. Bye R
(OG. FIER, FER
bur. Rye
4. @ We have n(B) =3,
n(G)=2
Total number of possible relation from B to
Given, n(B)=
Number of function from B to G =:
Gil) We have, R = (x.
same sex}
Here, (x,x)€ R, Vee B
= Risreflexive
G MER@ONER a eB
= Ris symmetric
and (x, 3)€ Rand (y, =) R
Vx re B
(x 2)ER
=8
yx and yare students of the
=
= Ris transitive
Hence, R is an equivalence relation.
Or
Given, R:B 9G
defined by R = ((b,,8) ).(b3-82)s(by.81))
Here, b, and byhave same images g,. So, R is
many-one function,
and since, range of.
Nervised their voting,
their voting
2019, then which of the
mn 1 Unit a
1
and, Pye yen
(iv) The above deti ied
Th above tine cao
(0 Univermt relation
(© Enavatonee
(tenon
(0) Me Shyam eterise io
Hiection-2019, then Mr. §}
ofthe following? nM Shy
(a alsa
(0 Family met
(Allenizens ty
(0) Bg
relation
ot aymmet
‘ymmetrie and,
i right in Generat
'm is related to which,
ible voter who eaat
9 of Me Shyam,
nin
ible voters of India
$0. is ont function
Since, Ris notone-one
Thus, R is not bijective function, _
2. (W) (d) Given, R OND K Wy ety and =
use their voting right in general election-2019,
-¥ €1-N exercised his voting right while
Y didnot canhervoteingeneateaeeceie
Clearly, (X,Y )e R.
i) (@) Relation is symmetric,
2 (XM ER = WH xDeR, -
ii) (@) Since, (FF) ER, F eT
and F use their voting right.
> Ris reflexive,
(FER
= (Fy, FER
Ris symmetric,
and (F\, Fa)e Rand (Fy, Fy)€R = (Fi, FyeR
(By transitive property)
iv) (c) Given, relation & is reflexive, symmetric and
transitive.
++ Ris equivalence relation.
(¥) (@) Clearly, Mr. Shyam exercised his voting right
in general election-2019, then Mr. Shyam is related
to all those eligible voters who cast their votes."099 100 8900 pF +5
como st fy
(0°) 0) €
ON
“Senisues tou poe onounats aanxopoy
suemsuy
‘wonsuny
SmPatig st Sem nous 75.0) /s0%5 50
S29 9/ 64 pauep wonoiny e-tonD “gy
‘wonouny
DF 6a pomp
”
aso4s “EL
suousend SHOW s
“9a est Soy mys uo, + xy =(0)/
SA pouysp wonouny amy sty y= SIZE
We Jou aap om
Bujoqyo sopadond
jarouyap (ye =F “LL
fe sou aurounks
‘ounounucs
uv oaxoyar st (g's 0: (4
‘sisqunt ato 78s aun y Laney
ng ansuen
= x 58 pouyop
on rep MONS “g
SuoHSEND syn
CVS hq
4 mn yo0GD +
‘uu pur au0-ueu
HUN am Ip OS, “9
Put £1 Jo seus
PIS COL Aa pause ay ean fick
jot 30 OW 1x5 — E(x) f
Feonouy om HoH agp
Poppe 99 01s
mm Ho "uaa (Cg
88 ¥ Wo Pou 9 one
"OMY CAF wonoary 1p Jo Aaa
OSH CY: Foon
Ka pouyop 2y ey:
: {2809 nok ured
coamena a aun ear ee oy
3 A100 ue 1 suo a