In previous class, we initiated the st functions a In this chapter, we will stu RELATIONS AND FUNCTIONS | TOPIC 1| Relations ORDERED PAIR A pair of elements listed in a specific order separated by comma and enclosing within the parentheses, i called an ordered pait. e.g. (4,6) isan ordered pair with 4s the first element and b as the second element. CARTESIAN PRODUCT The set of all ordered pairs(a, 6) such that «€ A and e B, is called the cartesian product or cross product of sets A and Bandit is denoted by A % B. Similarly, the set ofall ordered pairs (4) such that be B and ae A, is called the cartesian product or eross product of sets B and A; and itis denoted by Bx A Thus, Ax B= {(a,6):a6 4,66 Bland Bx A=((b,a):a6 Abe B) eg. If A=f1,2,3]and B= (4,5), then AX Bis ((14),(1.5),24),2,5).4.0,5) and Bx A is (4, 1), 4, 2) (4, 3), 5, 19, (5,2) 5s 3h RELATION In Mathematis, the concept of the term ‘Relation’ has been dravn from the ‘meaning of relation in English language, according to which two objects or {quantities are related, if there isa recognisable connection or link between two objects oF quantities. ly of relations and functions, whe about domain, eodomain and range alongwith differe we studied types of specifie real-valued. lations and functions. lypes of relations and functions. basics of CHAPTER CHECKLIST © Relations © Functions and Their TypesRelation on Sets A and B Let 4 and B be two non-empty sets, then a relation 2 from set Aw set Bisa subset of AX B, ic. REAXB. Here, the subset R is derived by describing a relationship between first and second elements of the ordered pairs in AX B. The second element is called image of firs element. eg, Let A'= Set of students of class XII of a school and B= Set of students of dass XI of the same school. Then, R= (a,b) © AXB + age of is greater than age of bis a subset of A Band thus Risa relation from set A to set B. Noto i (a.6).€ then wo wrt as aAb and wo say hat as roted {0 b under the relation A. I (ab) «A, then we wate it as aflo and we say that ais not related to unearth relation. Relation on a Set Let A be a non-empty set, then a relation from A to itself, ise. a subset of A A, is called a relation on set A (ora relation in set 4) e-g, Let A={1,2,3,4], then Ra {(a,b)@ AX A:a~b=3}= (61) is a relation on set A Domain, Range and Codomain of Relation Lee us consider a relation R from set A to set B ie RAB. Then, the set of all fist clements of the ordered pairs in Ris called the domain of relation and the set of all second elements of the ordered pairs in 2 is called range of the relation, ie. domain (A) = (a =(a,6)€ R) and range (R) = {b:(a, )€ R}. The set B is called the codomain of relation R, Thus, the domain ofa relation & from set Ato set B isa subset of set A and range isa subset of set B, ie. range isa subset of codomain, EXAMPLE [1] IER = ((x y) : x +2y =8) is a relation on a set of natural numbers (MN), then write the domain, range and codomain of R. {All nlia 2014) Sol. Given, R= (x, y)2x + 2y = 8)on a set of natural numbers Consider, x + 2y = & which canbe reeriten a y = 2%, Now, as x,y'€.N, therefore substitute values of x from ratural numbers such that ye N. s=2 (On puting x= 2 we get y 3 (On putting x #4, we get y 2 z NG On putting x6 we get y= $a ‘Thus, R= (2.9.04, 2,60) [+ there is no other value of x, far which ye N’] + Domain of R= (2 4,6), codomain of, and range of R= (32 1} TYPES OF RELATIONS ‘There are various types of relations on a set A, which are given below EMPTY OR VOID RELATION Relation 2 in a set A is called an empry relation, if no. clement of A is related to any clement of A, inc. R=QCAKA eg, Let set A= {I,2, 3,8, 10, 11} and R bea relation in A, given by R= {(a,8):4—b=4}, Then, R is an empry relation, Since, no clement (a,6)€.AX A satisfy the property a—6=4, UNIVERSAL RELATION Relation Rin a set A is called an universal relation, ifeach clement of A is related to every clement of A, ice. RaAxA, eg: Let set A={1,2,3,4} and relation R is given by R= {(a,6):|a —6|20}. Then, R is a universal relation, Since, all oered pairs (a,)€ A x A satisfy the property |a-s[20. IDENTITY RELATION Relation 2 in a set 4 is called an identity relation, ifeach clement of A is related to itself only and it is denoted by Tay ines 14 = R= Ma, a): € Al. Let set A= {1,2}, then the identity relation R on A in by R = (1,1), 2,2)}. But the rel {(,D,(2.2),(1,2)1 is not an identity relation on A, because element 1 is related to elements 1 and 2. REFLEXIVE RELATION Relation R in a set A is called reflexive relation, if (ade R, for every ae A, ic. aR a, V ae A, em (i) Let A= (11,12, 15} and relation on itis defined as Re {(11, 1) (12,12), (115 12), (15, 15)6 (1, 15), (12, 15)}. Then, & isa reflexive relation, Since, for every element 11, 12and 15 of A, (11, 11), (12, 12) and (15, 15)€ R. (ii) Let A be the set of real numbers and relation on it is defined as R={(x, y)ixt ye Al. Then, Risa reflexive relation. Sings, sen of two seal numbers i alo a ral number, therefore R= AX A Hence, R is reflexive, as (asa) € Ry for every a A,SYMMETRIC RELATION Relation R in a set A is called symmetric relation, if (abe R = (bae R, for every abe A ie, aRb => bRa WV a,be A. eg (i) Let A= {1 1,12, 13} and relation on it is defined as R= {14 1D, (11, 12), (12, 12), (12, De ‘Then, Ris asymmenic relation Since, (1, 12)€ R= (12,1) €R (i) Let Abe these of even natural numbers and relation ‘on it is defined as Re=(x, yhix y is divisible by 2). ‘Then, i is asymmetric relation, Since, sum of two even natural numbers is always even and hence divisible by 2, therefore R'= Ax A. ‘Thus, & is symmetric as (a, 6) € R = (b,a)€ R, for every a,be A. ‘TRANSITIVE RELATION Relation Rin a see Ais called transitive relation, if(«,b)e R and (6) € R= (a,c)E RV abc€ A ive. aRband bRe = ake, Va,b,c€ A. eg: (i) Let A= {11 12, 14} and relation on it is defined as R= {(11, 1M, (11,12), (12, 14), (12, 12), (11, 14)}. ‘Then, itis a transitive relation. Since, (11, Il) € Rand (11, 12)€ R= (11, ER, (1L, 1D e Rand (11, l4)e R= (11, 14) eR, (11, 12)e Rand (12 ,14)€ R=(1L 14)e R, (IL 12) Rand (12,12) R= (11, eR and (12, 12) € Rand (12, 14)€ R =9(12, 14)e R. (i) Let A be the set of positive integers and relation on it isdefined as R= {(x, y):x°< JV x; 7 AD. Then, it isa transitive relation, Since, x< yand y <2 = x Gane R Since, x6 A was arbitrary element, therefore (xa)e RV x6 A, So, Ris reflexive, ‘Symmetric Clearly, 2,4 A and 4 is divisible by 2, but 2 isnot divisible by 4. F Ge Rbu(d.2€R So, Ris not symmetric, ‘Transitive Let x,y.26A such that (x.y)@ Rand Gisek Now, as (x, y) R, therefore y is divisible by x, te Lakin) 0 where, kis a natural number and as(y, 2) R, therefore = is divisible by y ie Zak, (ay) ii) y where ky sa natural uber, ‘On multiplying Eqs. () and (i), we get 2xkakt, > Lekk, "y ¥ where, kk sa natural number. +s divisible by x. ‘Fis, (x, she & for (x, yh y, de ke. (nye R(y.z)@ R=9(n2)e R Hence, R istransitve. EXAMPLE |4| Check whether the relation R defined in set A = {1,2,3, .., 13,14) as R= {(x, y): 3x~y=0) is reflexive, symmetric and transitive. Sol. Given, R= ((x, y):3x~ y= 0) and A= 234,5,67,8,9,10 1112.18.24) Reflexive Here, 2€ H (2, 2)¢ R then X2)~2=0 = aso {not tre) 8 (ner So, Ris not reflexive. Symmetric Here, 1,36 A Clearly, (1,3)¢ Ras Xi) =3=0 But if(,1)6@ R,then 363) 1 =0 > Sno {not trae) Thus.(, Je RPA NER So, Ris not symmetric ‘Transitive Here, 13,96 A Cleary, (1,3)¢ Ras 3()-3=0 and (3, 9)€ R a83(3)-9=0 But (1, 996 8, then 3(1) -9=0=>-6=0=9(1,9) €R ‘Thus.(, 3) Rand (a. 9)e RCL, Ne RK So, Ris not transitive. EXAMPLE [5| Give an example of a relation, which is (i) symmetric but neither reflexive nor tansitiv, (i) transitive but neither reflexive nor symmetric. (ii) reflexive and symmetric but not transitive. {Gv teflexive and transitive but not symmetric, (9) symmetric and transitive but not reflexive. (NCERT] Sol (i) Let A= {t, 2,3) and defined a relation Ron A as Ra K(h, 2,(2, ‘Then, R is symmetric, as (1, Je R= (2, the R Ris not reflexive, ab 16 A but (1, eR Ris not transitive, a, 2), (21)e Rbut 3) € (@) Let Aw (1,2, 3) and defined a relation R on A as Re (0, 23,22). ‘Then, Ris tansitve, a8 (0,2,(22)6 R= (1,2)6 R Ris not reflexive, a1. A but 1) € Ris not symmetric, as (1, 2)e R but (21) @ R (ii) Let A's (1, 2, 3) and defined a relation R on A, as Re (1), .2) G9. (1,2) 21.29.02) ‘Then, Ris reflexive, as fr each a A,(a, a) R Ris symmeti, as (1, 2)€ R=9(2 t)e R and (2,3)e R=9(3, eR Ris not transitive, as, 24 (2, 3)¢ Rbut 3) €R (iv) Let As (1, 2, 3} and defined a relation Ron A as Re (0.1), 248,9, (1,2) ‘Then, Ris reflexive, as far each a A,(a, )€ R Ris transitive, an (1) R (,2)6 R =2(h 2) R and (296 R(2, ERG, DER Ris not symmetric, a(t, 2)€ Rbut (21) €R. (v) Let A= (1, 2, 3) and defined a relation Ron A as Re (2, 2), (3, 3). ‘Then, Rissymmetric, as R does not have any element of the type (ab). where a # b. Ris transitive, a8 Rdoes not have elements ofthe type (a Byand (6). Ris not reflexive, as1€ A but (1,1) @R EXAMPLE |6] Let a relation R on the set N of natural number be define as R= {(x, y):3x° = Txy + dy" x, yeN }. Then, show that relation R is reflexive but neither symmetric nor transitive.Sol, Given, R= {(x,y}3x?=7ay +4y" =O YEN) = ((my):3e? = Say day +4y? #0, YEN) = U(x yhidele = y)=4y(e yee x, ye ND (x, ysl = y)8x = 4y) 0 x, ye NY Here, we get those ordered pairs(x, y) which satisfy the ‘equation defined in Reflexive Since, xR =9(x — x)(3x~ 4x) =0 3080, which is tru, so R is reflexive. Symmetric Now, sy =(x = y\3v—4y) #0 and ye =9(y~ xy8y 4x) =0 Cleary, Ry =p ye So, Ris not symmetric ‘Transitive Now, xy =9(x ~ yx ~4y)=0 pits (y= 2)y= 42) 0 and ae (x ~ 2)3x~42)=0 Here, (x = y\3x =4y) = 0and (y =2W(3y =4z) 0 (xn 2\Gx—dz)=0 So, Ris not transitive. EQUIVALENCE RELATION A telation Ron a set Ais said to be an equivalence relation on A ifFicis (i) efleve ic. aRa oF (a; a) RW ae A (i) symmettc i. akb = bRa or (4,6) €R = (bale Rwhere a,b A. (ii) transitive ie, iF at and bRe, then ake or (a,b) R and (b,c)e R= (aye) R, where a, be € A. EXAMPLE |7| Let be the set ofall triangles ina plane with R is a relation in T given by R=((ty,%):7, is congruent to T,andT,,,)€T} Show that R is an equivalence relation. Sol. Given, T= et ofall triangles ina plane and = (7, Ta): i congruent to T, and 1,7 € 7) We know that two triangles are said to be congruent, if they have same shape and same size. Reflexive Let T, € T be any arbitrary element. We know that every triangle is congruent to itself. So, T,RT,, .e.(T,, T,) 6 R Now, as 7, was arbitrary element of 7, therefore His reflexive, Symmetric Let 7, T, 7, such that (Ty, T,)€ RT, is congruent to Ty > Tyiscongruent to 7, {ia triangle is congruent to another triangle then they are congruent to each other] = (ry Ter 5 Rs symmetric “Transitive Let Z, Ty, Ty €T, such that (7,.T,)e Rand (Ty. Ty)e R > T, is congruent toT, and T, i congruent to 7, > 1 is congruent to 7, = (T.T)eR Ris transitive “Thus, the relation Ris reflexive, symmetric and transitive, So, Risan equivalence relation, EXAMPLE [8] Given a non-empty set X. Consider P(X), which is the set ofall subset of X, Defined the relation Rin P(X) as follows For subsets A and Bin P(X), ARB if and only if A cB 1s R an equivalence relation on P(X)? Justify your answer, Sol. Given, R= (A,B A G Band A, Be FLX) Reflexive We know that every sets a subset of itself then ARA.Y Ae AX) So, Ris reflexive. Symmetric Let A, Be XX) such that ARB =2 A&B ‘This may not be implied tha 8 & A For instance, if A= fl, 2}and B= (3) then A is related to B, but it eannot be implied that Bis related toa, So, Ris not symmetric. Hence, Ris not an equivalence relation on P(X}. since it {snot symmetric EQUIVALENCE CLASSES Consider an equivalence relation R on a set Aand let a@ A. ‘Then, the set ofall those elements of A which are related to 4, incalled the equivalence class of R determined by a; and it is denoted by [a]. Thus, [a] = (be A:(a, )€ Ri. Now, by finding the clases determined by the elements of Awe can write A as union of disjoint classes, We cll these classes as equivalence classes of R. Thus, R divides A into mutually disjoint equivalence classes, In other words, if is an equivalence relation on a set X, then R divides X into mutually disjoint subsets A, called partitions or sub-divisions of X, satisfying (foreach iall elements of A, are related to each other, Gi) no element of 4, is related to any element of Aj, inj (ii) UA, = Xand A, 0A, = 4 Then, subsets A, are called equivalence classes of R. 4g, Consider a equivalence relation X on the set Z of all integers defined as R= (a,0):4,6€ Z, a~6 is divisible by 2h, then Z =[0]ULl} ic. & divides Z into mutually disjoint equivalence classes, [0] and [1]. Justification We know that (0 if both a and b ate even or odd integer, then « ~b is divisible by 2 and hence (a, 8) € R.eget, then a~b is not divisible by 2 and hence lade R “Therefore, all even integers including 0 are related ro 0, ‘which implies as (0, 0), (0,4 2), (0,24), ete lie in R, Also, all odd integers including 1 are related to Iwhich implies as £D, (3), ete lie in R “Thus, all even integers belongs tothe class determined by 0 {Gve. denoted by {0}) and all odd integers belongs to the class sletermined by I (ie. denoted by [1]). Also, we know that the set Z isthe union of set of even integers and set of odd inwogers. Hence, Z = [0] [1h EXAMPLE [9| Let R be the equivalence relation in the set A = {0,1,2,3,4,5} given by R = {(a,b): 2 divides (a ~b)}. ‘Then, write equivalence class {0}. Delhi 2014¢;) Sol, Given, A = {4,234.5} and Re (0); 2 divides (a~b)) Clearly, (0] [be A (0) e R) = (be A £2 divides (0~6)) = [be A 2 divides(~b), ‘So, beam be 0,2. 4 Hence, equivalence elas 0] = 0,24) EXAMPLE [10] Let A= (1,2,3,...,9} and R be the relation in A x A defined by (a, B)R(c,d), ifat+d=b+c for (a,b), (c,d) in A x A. Prove that is an equivalence relation and also obtain the equivalence class {(2,5)} [Dethi 2014; NCERT Exemplar] Sol. Given a relation R in Ax A, where A= (28... % defined as R= ((a.b).(6.d):a¢d=b+e} or (ab) RC dh ifarde bre Reflexive Let (a b)be any arbitrary element of A x A. he (a, bye AX A, where a, be A Now,as a+beb+a [addition is commutative} “ (a, byR(a,b) ‘So, Ris reflexive ‘Symmetric Let(a,b).(e,d)e AX A, such that (GDR, dh thena+ dm b+e = bem atd a ctbadta = (¢,d)Mab) So, R is symmetric. ‘Transitive Let (a, bh(c, dhe, Ye AX A such that (a bile, d)and(e, dale, f). Thenatdabteandet fadte ‘On adding LHS to LHS terms and RHS to RHS terms, we a dtdtet fabserdte = at fabte = (adie, f) So, Ris transitive. Thus, Ris reflexive, symmetric and transitive. Hence, Ris an equivalence relation. Now, equivalence class containing an elernent x of Ais given by (yx Ry} Here,(a B)R,d) = atdebte So, for (2,5), we will find (c,d)such that 2+ d= 54+, Clearly, (2,5)R0,4) as 244=541 (2.925) a5 245m542 (2.)RG.6) as 2468543 (25)R,7) as 2475 44 (25)RG5,8) as 2486545 and (2.5)RG9) as 249—546 496A. wvalence class ((2 5)] = (0,4), (2 5). 9) EXAMPLE [11] Show that the relation R in the set A=(1, 2, 3,4, 5} given by R= ((a, 6) :|a~ blis divisible by 2) is an equivalence relation, Write all the equivalence classes of R. [All ndia 2015¢} ‘Sol We have a relation Rin set A (2.44, 5} defined as Rem (a,8):1a~ Hf is divisible by 2) hearty, R= (3) (49) (5) (2,2), (24,1). 6,3)... (4, 2.64, 4)6,0).6.91. 65.5) Reflexive For any ae A, we have|a~ a 0, which is Aiviibe by 2 > (wae Rv aed ‘Thus, Ris reflexive Symmetric Leta, be A, such that (a, Bye R => |a=b lis divisble by 2 = [a= b]= 2h for some he N = |b=alm 2) for some ke N = (haven ‘Thus, Ris symmetric, ‘Transitive Let @ b,€€ A, such that (a,b) Rand (oer = [a= Hisdivisble by 2 and |b—~clis divisible by 2 = a= Ha 2 and|b-~ cl 24, for some A, te N => (an bat 2h and(bc)mt 2H Now, Ja~c]=l(a~b)+(b~e)fmlt 2h +(¢ 20) sie 2h 2 dum aft dtu] = {some positive number} => lac indivisible by 2 = (a ce R ‘Thus, Ris transitive Hence, Ris an equivalence relation. Now, [al re As(a x) eR} Equivalence classi} (5). (2) = (2 4) (3) (1 85}, H4}=(2.4)and (5) (3,5) ‘Hence, [1] 3] =(5}= 4.35) and [2] = [4] (24) EXAMPLE | 12| Let 1 be the set ofall Lines in XY-plane and R be the relation in L defined as. Re ((L y Ly) 22 is parallel to L,). Show that Ris an equivalence elation. Find the set of all lines elated to the line y=2x + 4 INceRT) Sol. Given, Rly. Ly): 4, is parallel to L,) [Reflexive Ris reflexive as any line dis parallel oiself eh, Lye R fela~b]= b= aH)Symmetric Now, let (Ly. Lae R => Ly is parallel to Ly = Ly ix parallel to, > (Ly hye R So, Ris symmetric. ‘Transitive Now, let (Ly, Ly) (Ly Lye R ‘Then, fy is parallel to ai Ls parallel tL > bispanllel to, > (ly bye R. So, Ris transitive Hence, Ris an equivalence relation. ‘The set of all lines related tothe line y = 2x 44s the set of all lines that are parallel tothe line y = 2 +4 Slope of line, y= 2-448 m #2 tis known that parallel lines have the same slop. ‘So, the line parallel tothe given line wll be of the form ye desewhereee R Hence, the set of all lines related tothe given lin is sgiven by y= 2x46, wherec € R TOPIC PRACTICE 1 | OBJECTIVE TYPE QUESTIONS. 1 Atelation f from CtoR is defined by xf y calls y. Then, the correct option is eros 3/9) win (aes /13 2 AarelationR om the set (1,2, 3)be defined by Rea((,Q),thenRis INCERT Exemplar} (a) reflexive (©) transitive (©) symmetric (@) None of these 3. The relation R in the set of natural numbers N defined as R= (x, )): yx Sand x<4)is {a)reflexive (0) symmetric (6) transitive (€) None of these A Let set X'=(1,2, 8) anda relation R is defined in X as:R=((, 3), (2,2), 8,2)) then minimum ‘ordered pairs which should be added in relation R tomake it reflexive and symmetric are (CBSE 2021 (Herm) (a) (0,0), 2,3), (1,29) (b) (6, 8), (3,0), 1,29) (10,0, 8,3), 8,1), 2,39) (2) (0,0, (8,3), (3,1), ,29) 5 MAs (ve Z:0.x512) and Ris the relation in A given by R= ((a,6):a=0). Then, the set of all elements related to 1 is (a) (1,2) ©) 2,3) (et) (2) VERY SHORT ANSWER ‘Type Questions 6 IfR isa relation ‘is divisor of ' from the set Ax (12,3) to B= (4,10, 15}, then write down the Set of ordered pairs corresponding to R. 7 Let = ((a.a"):aisa prime number less than 5) be relation. Find the range of R. (Foreign 2014), 8 State the reason for the relation R in the set (2,2, 3) given by R = ((,2),(2,)) is not to be transitive. [Foreign 2011) SHORT ANSWER Type I Questions 9 Let A=(0,1,2,3) and define a relation R on Aas R =((0,0).(0,1,(0,3),(,0),(L0),22),(3,0),(3,3)} Is R reflexive, symmetric and transitive? INCERT Exemplar} 10. For real numbers x and y, define xR y if and only ifx=y+y2is an irrational number, Is R transitive? Explain your answer, 11 Let A= (a,,)and the relation R be defined on. Aas R= {(a.9),(b.¢),(a0)). Then, write minimum. umber of ordered pairs to be added in R to make R reflexive and transitive. SHORT ANSWER Type II Questions: 12 Let A= (xe Z:0s x5 12} Show that Rem ((a,0) :0,be A, lablis divisible by 4) is an equivalence relation, Find the set of all elements related to 1 Also, write the equivalence class [2]. (ens 2018) 13. Show that the relation R in the set A of real numbers defined as R's ((a, 6): a) is reflexive and transitive but not symmetric. (NCERT] 14 Show that the relation S in the set R of real numbers defined as S = ((a,0):a,b¢ Rand a B°)is neither reflexive nor symmetric nor transitive. [Delhi 2010}15 Letarelation R on the set Aof real numbers be defined as (a,b) eR 31+. >0,V/a, be A. Show that Ris reflexive and symmetric but not transitive. 16 LetN be the set of all natural numbers and let R bea relation in N, defined by R= ((a,6):aisa multiple of b). ‘Show that itis reflexive andl transitive but not symmetric. {7 Let Abe the set of all points in a plane and Rbe a relation on Adefined as R = ((P,Q): distance between P and Qis less than 2 units). Show that Ris reflexive and symmetric but not transitive. 18 Leth be a relation defined on the set of natural numbers N as R = ((x,)):0€N, ye N and 2x4 y=24), Then, find the domain and range of the Felation R. Also, find whether R is an. ‘equivalence relation or not. {Delhi 2014¢), 19 Let A (1,2, 3}-Then, find the number of ‘equivalence relations containing (1,2). 20 Prove that the relation R om Z, defined by Re ((x, 9): (x= yp is divisible by 5)is an. ‘equivalence relation. [Dethi 2020) 24 Let R be a relation on the set A of ordered pairs Of positive integers defined by (x, ») R (u,v) if and only if.xv= yu. Show that R is an ‘equivalence relation. iNceRr} 22. Show that the relation R defined by (a, 8) R (c,d) =a +d=b-4+contheset N x Nisan ‘equivalence relation. {All India 2010) LONG ANSWER Type Questions 23. Show that the relation R in the set A= (1,2, 3,4, 5) given by R = ((a, ): |a~dlis even) is an equivalence relation. Also, show that all elements of (1, 3,5) are related to each other and all the elements of (2, 4) are related to each other, but no element of (1,3, 5) is related to any element of (2, 4). INceRET] 24 Show that the relation R in the set Aof points in a plane given by R= ((P,Q): distance of the point P from the origin is same as the distance of the point Q from the origin) is an ‘equivalence relation. Further, show that the set, ofall points related toa point P # 0,0)isthe circle passing through P with origin as centre. ween) 25. Show thatthe relation ‘is similar to’ on the set ofall triangles in a plane is an equivalence relation. 26 IFR, and; are equivalence relation in a set Athen show that R, 4 R, i also an equivalence relation, Also, give an example to ‘show that the union of two equivalence relations on a set Anced not be an equivalence relation on a set A. 27 Letx =(1,2,3,4,5,6,7,8, 9}. Let R, bea relation on X given by Ry = ((x):~ ys divisible by 3) and f, be another relation on X given by Ry = ((4)): (xy) © (4,7) or {xy © @ 5, 8)or (x,y) < (3, 6, 9)). Show that Rye Ry Incenny 28 Inthe set of natural numbers N, define a relation R as follows Vn, me N.nRim, if on division by 5 each of the integers n and m leaves the remainder less than 5, Le. one of ‘numbers 0, 1,2, 3 and 4, Show that R is an equivalence relation. Aiso, obtain the pairwise disjoint subset determined by R. INCERT Exemplar} 29. IEN denotes the set of all natural numbers and R is the relation on N x N defined by (2,0) Rd), ad(b + ¢) = be(a +d). Show that R {san equivalence relation. [Dethi 2025) | HINTS & SOLUTIONS LG) Hint|a+ ible fe 2 () Hint R does not have elements of the type (a) and (her 3. ©) Hint R= (0,6), (27).08)) 4. (6) Hint For R to be reflexive and symmetric, we should add (1, 1,,3), (3,1), 2,39) 5. (@) Hint The set of all elements related to 1 is fee Asai} 6. Here, R= (lab: b/a;ae A, be B) = ((1, 4,0 10), (,15).(2 4), (2,10)48,15)) 7. Given, R= ((a,a?):ais a prime number less than 5} = Ra (28),(4 7) Hence, range of R = 27)8. Here,(t, 2)¢ Rand (2,1) R but (1) € R. Hence, Ris not transitive, 1D, Hint (i) 8 is reflexive, as (a, a) € R,Vae A, (i) Ris symmettic, as (0,1)e R90, 0)6 Rand (,3)e R SadeR (ii) Ris not transitive, a8(8.0), 0,1) RP NER {Ans. Reflexive, symmetric aid not transitive) 10. Hint Consider(x, ) = (, ¥5)and(, 2)= (3, 43) Ans. No: LH, For R to be reflexive, (bb) and (6) should belong to R and for R to be transitive (a, ¢) should belong to R, as (abe R and (bee R Hence, minimum number of ‘ordered pairs tobe added in Ris 3. 412. Given, a relation Ron Am {01,23 32} defined as Re ((a.b):abe A, |a~blis divisible by 4) ‘To show Ris an equivalence relation () Reflexivity Let ae A be an arbitrary element. ‘Then, Ja~ d= 0, which is divisible by 4 » (aaer Bate A was arbitrary, (ale RV ae A ‘Thus, Ris reflexive (i) Symmetrcity Leta be A such that, b)e R (aber — |a=b| is divisible by 4 > |=(b=a)lis divisible by 4 > [bmalisdivisble by 4 = (baer Thus, (qb)e R= (hae R Henee, Ris syrametic. (ii) Tramsitivity Let af, © A nich that (a, 6) Rand (eve + (a Bland ( e)belongs to R :-Bath|a~b| and|b~¢ are divisible by 4 Let]a~ Head and] bc [m4 fr some real numbers Handy. anbetihandd= cm tay byr(b=e) ah tan m4(th tH) hich i divisible by 4 s.|a~¢|is divisible by 4=9(a,c)e R Thus(a, be K(k cle R=(a. cle R Hence, Ris transitive, From above, we can cone hat Rian equivalence relation, Clearly, the set of all elements related tot s equivalence class of 1 = {ae Ast abe R} = {ae A:|1~alis divisible by 4} 059 Now, consider a~ Similarly, (2] = {a As] 2~cl is divisible by 4} = B61} 1B. Given, A= Set of real numbers and Re (4,6): ab} Reflexive Leta A be any arbitrary real number. ‘We know that every real number is equal to itself, eae. So, we can write asa = (a.a)e R So, Ris reflexive. Symmetric Let(a, bye f, then a 0}. ‘Reflexive Let abe any real number ‘Then, — 1-aami+a'>0 [va@2qVeeA) = (aaeRVacd So, Ris reflexive Syma ate fhn Teanetl sine = “aie Tim (ae (hen Vaben steer rote Weare 3} a [rab ba abe A] atiterstoo 2 But ( -1)¢# K, because 141 x(=1) #070 80, Ris 16, Similar as Example 3 17. Given, A = Set of all points in a plane. R= ((P, Q):Distance between P and Qis less than 2 units) Reflexive Let Pe A be any arbitrary point. Then, distance between P and Pis 0, which is less than 2 units = (PPeR ‘Thus,(P, P)e R for all Pe A So, Ris reflexive, ‘Symmetric Let P,Q € A such that(P, Q)e R, i.e. distance between P and @ is less than 2 units ‘=> Distance between Q and P's less than 2 units. 3, Pe R So, Ris symmetric.‘Transitive Consider the points P, Q_and Shaving «coordinates (0), (1,0) and (2,0), respectively, We ean observe that the distance between P and Qi uit, which is ess than 2 units and also the distance between Q and S is Hunt But the distance between P and Sis 2 units, which isnot less than 2units Ths, (P, Q)e RQ, S)e Rbut(P, S)e R So, R isnot transitive. Given, R= (x.y): x6 Nye N and 2x+ y 224) Here if x1, then y #22 [spat x tin 2x+y = 24, we get y= 22) My 2, then y= 20, Wee athen y=18 Ix m4, then y=16 Wr then yet; ee then yaiy Wem, then y=10, Ieee then ya Wer es then ye erin theny es; Wx ett, theny= 2s + Rm 422), (2 20), (918), (4,16), (514), (612), (7,10), (88.08.6009, ¢04 2) Hence, domain f,2.3,4,5,67, 89.10.13) cand range = {22 20, 18, 16,14, 12 10, 8 6,4, 2}, Reflexive Clealy, 1 N but, 1) R s0 Ris not rellecive. Hence, Ris not an equivalence relation 19. It is given that A= (l, 2.3}, Am equivalence relation is reflecve symmetric and transtiv. ‘The: a ‘equivalence relation containing (1, 2) is wee = (042 2.(89).0 2.00) Now, we are left with only four pairs, (2 3). (3,2), (1,3) and (3, 1). If we add any one pair [say (2,3)] to R, then forsymmetry, we must ald (3,2). ‘Also, fortanstvity, we are required toad (1 3)and 3,2) Hence, the only equivalence relation (bigger than R,) x the iver elation “This shows thatthe total number of equivalence relations containing (1, 2)is two. Given, Re (x y)e5divides(x y)) and. ZaSet of integers Reflexive Let x'¢Z be any arbitrary element. Now if (Gx) Rethen 5 divides x=, which s true. 50, isrefledve. Symmetrie Let x,y Z, such that (x, ye R95 divides (x= y) 2 5 divides [=(x = y)] = 5 divides(y = x) => (y, x)e R So, Ris symmetric, ‘Transitive Let x, y, 26 Z, such that(x, y) © Rand (ze R => x= yand y~z both are divisible by 5. S xn yt yor indivisible by 5. > (x =2)is divisible by 5 = (x,2)€ R So, Ris transitive. ‘Thus, Ris reflexive, symmetric and transitive. Hence, Ris an equivalence relation 21, Given, A # N XN and a relation Ron A, defined as (x,y) Ru, v) fv = yu Reflexive Let(x, y)« A be any arbitrary element. ‘Now, we have to show that (x, y) Rx, y) Clearly, xy = ye => (x, yD R(X, y) (x, y)e A was arbitrary. SOG yPROG YW (x ye A So, Ris reflexive. ‘Symmetric Let (x, y)and (a, v)€ A such that (sy) Ru v) Now, we have to show that (u,v) R(x, y)- Le. uy = vs ‘2 (RW v) = we yu > yuna = uy = ve = (uv) R(x y) So, R is symmetric, ‘Transitive Let (x, y).(u, vpand (a, 6) A, such that (sy) Ru, v)and Gu, v) R¢@, b) "Now, we have to show that (x, y) R(a bh ie. xb ya, ~ (&)RWY) > vee * and (4 ¥) R(a,b) =9 ub ve "Now, multpying both sides of a, by 2, we get “Gt = »(}=»(2) (using Eq) = abayo > (xy) Rad) So, Ris transitive. Hence, Kis an equivalence relation, 22, Similar as Example 10, 23. Given, Aw {1,2.3.4.5) and Re (a, 8):Ja~ 0] 6 even}. Reflexive For any a6 A, we have fa~ a) 0 which is even, Thus, (@ ade RVae A So, Ris tellerve Symmetric Leta, be A such that(a,b)e R= ja— (b= a) is even, = |bmaliseven. = (haeR So, R is symmetric, ‘Transitive Let a,b, ¢€ A such that(a, bye Rand (oer = [a=H} isevenand |b cliseven. => (aan b both are even or both are odd) and (bande both are even or both are add)Case When is even In this cae, ais even and is even Slam cliseven = (ace R Case When bis odd In this ease, ais od and is odd la~cliseven > (a.c)e R Thus(a He Rh eRe ce R So, Ris transitive Hence, Ris an equivalence relation, Now, all elements of the set (1,3, 5} are related to each ‘other as all the elements of this set are odd So, the modulus of the difference between any two ‘elements will be even. Similarly al elements ofthe st (2,4) ae elated to each other as all the elements of this set are even. So, the tol the dference between ny two elements wi But no element of the set {1 3,5} can be related to any clement of 2,4) asall the elements of set (1,3, 5) ate odd and all the elements of set (2,4) are even, So, the modulus of the difference between the two ‘elements each from these two subsets as3~2=1 not ‘even, 5~ 23 not even ee] will nt be even, 24, Given, A = fall points ina plane} and R= (P,Q): distance of the point P from the origin isthe same asthe distance of the point Q from the origin} Reflexive Let ?'€ A be any abit * (PPE R So, Ris reflexive. Symmetric Let(P,Q)e R. where P,. Qe A, =) The distance of point P from the origin is same as the distance of point Q from the o = The distance of point Q from the origin is same asthe distance of point P from the origin. = (Q.PeR ‘Thus, (P,Q) R=9(Q,F)€ R where ROE A So, Ris symmetric. ‘Transitive Let (P,Q), (Q. S)e R where RQ, Se A. = oP = 09) 307 205 and 00 = 08 Le. the distance of points P and S from the origin is same, y Pp Q s x = 4P,s)eR So, Ris transitive, Hence, Ris an equivalence relation on A, Let P # (0 0)be a fixed point in the plane and Q(x, y)be any point in the plane related to P, Le. (P, O)e Ror distance of P from origin is same as distance of Q from origin. ‘Then, OP = OQ =k (say) x= Oey = OF kaos rye ‘This is an equation ofthe circle with centre (00) and radius k (distance of point P from origin), Thus, all the ‘points related to P satisfy this equation. Hence, the set of Ei points related tom point Pi the cece pasing ‘through P with origin as centre, 25, Similat as Example 7. 26, Given, K and R, are two equivalence relations on set A Now, we have to show that R, © R; isalso an ‘equivalence relation on set A Reflexive Let ae A be any arbitrary element, ‘Then, (a a)e A, and(aa)e R, {e=both Rand Ry ate reflexive] > laden nk ae A was arbitrary, So, R, 0 Ry isrellexive Symmetric Leta, Be A such that(a, bE RO Ry = (ade R and(a,d)e Ry 3 (hae Rand(b,a)e R, [both Rand R, are symmetric] > hae OR, $0, 8, © R, issymmetic. ‘Transitive Let a bce A such that (a, 8)e RR, and Woe R OR. (HER, OR (a. be R, anda, bye Ry and (bc)@ RA Ry (bce R, and (b ede Ry > (ace Rand(acye R Fe-both R, and &, are transitive] > @deRnk So, R, 0 Ry is transitive, Hence, Ry © Ry isan equivalence relation. Now, define relations R, and R, on aset.A=, 23) as Ry 9). (2.23, (30, 2), 200) Ry = (0.0.2 2,3, BDF Clearly, R, and R, are equivalence relations but ROR, (22.89.6220. 09.0) is not an equivalence relation, as (2.1)6 ROR, (36 ROR, bull, 3) €R UR, 27. Note thatthe characteristic of sets (1, 4,7}, (2, 5,8) and {8.6.9} is that difference between any iwo elements of these sets is a multiple of 3. ‘Therefore, (x, ye R, > x= yis divisible by 3=9 x= yis 4 multiple of 3 = (x, yh (14, 7} oF (x, YE (25.8) oF 18, YE (6 9} (x,y) © Ry Hence, 8 © RySimilarly, (x, y)e R, > fx yhE (4, Thor ts ye S.A} or fk, yc 69} = x=y indivisible by 39(x, ye R ‘This shows that Ry & R,. Hence, R, = Ry 28, Ris reflexive, since for each a€ N, aka. Ris symmetric, sinee if aRb, then ba for a, Be N. Also, R is transitive, since for a,b, ¢€N, if aRb and bRe, then ake Hence, R is an equivalence relation in N' which will patito the set N into the pairwise disjoint subsets. ‘The equivalence classes are as mentioned below A, (Set of numbers, which leaves remainder 0} =(5,10,15, 20...) Ay = (Set of numbers, which leaves remainder 1) N611,16 2.) A, {Set of numbers, which leaves remainder 2} = (27,1217, 22...) A, {Set of numbers, which leaves remainder 3} SAIAIG 24.) = {Set of numbers, which leaves remainder 4) 14.9.14,19, 24,0) eis evident thatthe above five sets ate pairwise disjoint and AVA, UA, UA,U A= AN 29. We have a relation Ron N XN defined by (a, BR d). if ad{b + 6) be(atd) Reflexive Let (a,b) N x .N be any arbitrary clement. We have to show that (a,b) (a,b). Le 4ab(b-+ a) = bua + b) which is always true, as natural ‘numbers are commutative under usual multiplication and addition. Since, (a,b) € N XN was arbitrary, 90 Ris reflexive, Symmetric Let (ab), (e,d)€N x N such that (a,b) R(e,d).Le-ad(b-+e)= be(a+d) A) | TOPIC 2| Functions and Their Types FUNCTION (MAPPING) AS A RULE For any two non-empty sets A and B, a function f from A to B isa rule which associates each clement of set A to a tunique element of set B. A function f from A to B is represented by f: A> B or A B. eg NN define as f(x) = x? isa function, where N is the set of natural numbers, Function (Mapping) as a Set of Ordered Pairs For any two non-empty sets A and B, a function from set A to set B isa relation from A to B (denoted by f) satisfying the following conditions ( Foreacha € A, thercexistse Bsuch that(a,6) € f. We have to show that (c,d) R(a; b, ie cb(d + a) = dale +) Prom Eq, (i), we have ad(b + e) = be(a + d) = dfe +b) = eld +a) (-e natural numbers are commutative under ‘usual addition and multiplication) > ch(d+a)mdate +) = (dR b) So, Ris symmetric, ‘Transitive Let (a,b), (c, d)and (e, fe NX N such that (a,b) Ree, dandc,d) Rle, f) (a,b) R(e,d) > adlb +e) = be(a +d) i) i) = afle +b) bel f +0) = af b+ e) abla f) = (a,b) (6, f) So, Ris transitive. Hence, Ris an equivalence relation EXAMPLE [1] Let A= (12,3) and B= (2,4,6,8}. Consider the rule f : A» B, defined as f(x) = 2x, x6 A. Find the domain, codomain and range of f. (Find the image af 1,2, 3 using definition of Sok Given, f(x)=2x,V xe A Value of function at x1, /() = 2) = 2 Value of function at x= 2 f(2) = 2(2)=4 Value of function at x = f(3)= 23) = 6 Weecan write itas f = ((,2)(2.4).(8 6)) s: Domain of f (1,2, 3}, Codomain of f = (2.4, 6,8)(ii) a,be f and (ade f> b=6. eg IFA= (1, 2,3} and B= 14, 5}, then f= (0,4), 2, 5), 3,4) isa funtion but Ff =1G, 4 (1, 9), 2 4), G, 5) is nota Function as def, (Le f p45. Note Every function is a rlaion but converse isnot always 29,tHA = (12,8) and B= (44), thon R= {0 9.(h 4). relation but po fuser, Domain, Codomain and Range of a Function Consider a function f :A—» B, then clements of set A are called domain of f and elements of set B are called codomain off, and the se ofall f-images obtained in set B corresponding to each element belongs to set A is and range of f= (2.4, 6) RELATION BETWEEN RANGE AND CODOMAIN Range and codomain may be same or may be different. A function, whose codomain is a set (or a subset) of real numbers, is known as real-valued function and a function whose domain and codomain both are the sets (or subsets) taf real numbers, is known as real function, Note that every real function isa real-valued function, but converse may not be true. eg f 2 C > Risa real-valued function but nor real function, where C is a set of complex numbers. Some Special Real Functions Some special real functions and their domain, range and ‘graphs are given below called range of f Funeton eg Let f: A B be a function, where A= [4,6] and Ygentity function = B= (248,16), defined as Haxwrer Domain - * * Renge A i; ‘Constant tneion y dec, VxeR ume Domain - xg x ‘Then, domain = 4 d,ch, codomain = (2, 4,8, 16} renee le and range = {2,48}. Funston ‘raph Funston Reciprocal funtion Exponent tuncton W= Ay xe R-{0} 1(9)= a, where a> Oand e caivien i —— aoe A le Case tvnana> ange — (0) fet torre a nyeat fot toned > trae 0 (Govsieat ing: i: aa Case When d< act, function Re ee >t rn 0 Range -! o fe Domain ~ oe <3 i & ie range ~(0, ») Properties of greatest integer function nc xB be a function represented by the following diagram. Here, f is a one-one function, because each element have distinct image. Many-One Function Logarithmic function fa)slogs Vx. whore a > Oand a 1 Caso When a> f a.torx> 1 Cate hen dat Soteoc et wo frame Jcaless oman range TYPES OF FUNCTIONS As we know that if f:A—> B is a function, then f associates all the elements of set 4 to the elements in set B such that an element of set A is associated to a unique clement of set B. But there are some more possibilities, which may occur in a function, such as (more than one elements of A may have same image in (ii) cach elements of B is image of some elements of A. (ii) there may be some elements in 8, which are not the images of any element of A. EXAMPLE [2| Determine whether the function Ff: A— B defined by f(x) = 4x +7, x € A is one-one. J Show nat no wo elements in domain have same image in cogomain Sol Given, f:A—> B defined by f(x)= 4x47, r€A Let xy, ¥;€ A, sueh that fx) = f(x) 3 Ax t7 24x,47 9 4x, So, fis one-one function, Ky ex EXAMPLE [3] Show that the signum funetion 1 ifx>0 fROR sme] 0, if x =0is many-one. -1, if xo Sol, Given, feR—> R defined by f(x)= 4 0 ifx=0 ifx B is called a many-one function, if there exist atleast rwo distinct elements in A, whose images are same in B, ic there exist 4, € A, such that a, #1) and f(a,) = fla), then f is many-one, In other words, a function f:A—> B iscalled a many-one Function, ifit isnot ‘one-one. eg Let f:A+B be a function represented by the following diagram, ' Here, f is many-one function, because a, and ay have same image by. METHOD TO CHECK WHETHER A FUNCTION IS ONE-ONE OR MANY-ONE Sometimes, a function is given to us and we have to check whether this function is one-one or many-one. For this, we use the following steps 1, Fits, consider any two arbitrary elements, say 4, a3 € (domain of function). M, Put f(a,)= faa) and simplify the equation, TL IF we get a, a3, then f is one-one and if we get 44, # ay, then f is many-one. eg Let fA B and g:X—Y be two functions represented by the following diagrams. Here, fis an onto function and_g is an into function because y, andy, are elements of ¥, which do not have pre-image in X, METHOD TO CHECK WHETHER THE FUNCTION IS ONTO OR INTO Sometimes, a function is given to us and we have to check whether this function is onto or into, For this, we use the following steps ~ foo)e0wherede R and flat) fla 2)= fle) = where 1-236 8 a ‘We can observe that all postive real numbers have same image 1 and ll negative real numbers have same mage ~3, Hence, it is a many-one function, Noto ardor © prove isnot one-one, is suicnt show that i= Vande) 1 Onto (Surjective) and Into Function A function f + A—> B is said vo be onco (or surjective) if ‘every element of isthe image of some elements of A under fis, for every be B, there exists an element a in A such that f(a) =, In other words, f:A—> B is ono if and only if Range of f = 8 ie Range = Codomain Afunction g:X — ¥ isan into Function, ifthere exists one clement in Y, which have no_pre-image in X. In other words, ifa function isnot onto, then it isan into function. ‘Then, ys f(x) > ya ax42 = x Nom whe yn then eth Thus, y=0eZ (Codomain of f) does not has presage in Zomain). Hence, fis not an onto funetion, Le. isan into function One-One and Onto. Function (Bijective) A function f :A— B is said to be one-one and onto (orbijective), if f is both one-one and onto, ic. all elements of A have distinc images in and every element of Bis the image of some elements of A. eg Let f:A>B be a function represented by the following diagram, ‘[Lae iA B be’ the given farstion, then fie conser y be an arbitrary element of B. 11, Put y= f(s) and simplify eto obtain xin vermsof y. IIL Now, iffor any y€ B, the corresponding value of x dlocs not belongs to A, then f isnot onto, i. fis ino but if orally B, the coresponding valu oF x belongs to A, then f is oneo, Note Somatines, we sen fin he range of ction range of {uncton= Cooma of uncon, hen the keto ono, ciheie fan eo uncon. EXAMPLE |4| Check which of the following function is ‘onto or into. (0) f:A-+ 8, ven by fe) #3, where A= (0,1,2) and Be (0,36). (ii) £12 — Z, given by f(x)=3x+2, where Z = set of integers Sol, () We havea function fA > B, given by f(x) =38, where A = (0,1, 2} and B= (0, 36) ‘Let ye B be any arbitrary element, Then, ya f(x) 9 yasecorad o vat yaa xa teoe Now,at yaa Se06 A 3 Atyesxedared yeaxed 6 Mys6xeSerea ‘Thus foreach element yof A, there isa pre-imagein A, So, f:A-» Bis an onto funetion, (i) Wehavea function f:2—»2, given by f(x)= 3x42 Let ye Z,(codomain of f )be any arbitrary element, EXAMPLE |6| Show that the function f:R—> defined as f(x) = x* is neither one-one nor onto, Sol, Given, a function f : R—» R defined as f(x) = x" For one-one Here, at xt, f()=1 and at xm =t, f(=1)=(-1)? = ‘Thus, fli) f(-i)= butt et So, f isnot one-one. For onto Let ye & (codomain) be any arbitrary semen ‘Then, ya f(x) = yex? = rene Now,for ye-2eR xatvDen So, f is not onto Hence, given function is neither one-one nor onto, Here, f is bijective function because each clement have distinct image and every clement of B have pre-image. EXAMPLE [5] Let be the set of all non-zero real ruumbers, Then, how that f:R—»R, given by f(x) == is ‘one-one and onto. Sol. Given, f(x) a4 For one-one Let x, x, € R such that f(x) = f(x) [mess ads i fad 1 = owt (expressing x in terms of ; {expressing xin terms of y] Wisclear that for every ye R(codomain), x € R(domatn) Thus, for each ye R (codorain), there exist 1 me R(domain), such that f(x) = (4) a zene » beet 5; gy” y [ie every element of codomain has [pre-image in domain} So, fis onto. TOPIC PRACTICE 2] OBJECTIVE TYPE QUESTIONS 1 f:X4Y tsonto, ifand only if (a) range of f =¥ (©) range of f +¥ (6) range of f <¥ (@) range of f 2 2. The number of all one-one functions from set A= (12,3) toitself is (a2 6 3 @a