RELATIONS a5 Ina symmeti relation on A there can be any number of ordered pairs from the ordered pairs lying on or below the diagonal in the above arrangement. The number of these wen man ordered pairs is "=" 4. = . Any number of ordered pairs can be chosen from these 2 en wast ordered pairs in2 2 ways. So, the number of symmetric relations on A is ona waters: ae sulle SOLVED EXAMPLES (MULTIPLE CHOICE QUESTIONS (MCQs)_ AXAMPLEL Let R be a reflexive relation on a set A and Ibe the identity relation on A. Then, (a) R=I ) Ret (IcR (d) Rel Ans. (0) SOLUTION The identity relation is always a reflexive relation but a reflexive relation need not be the identity relation. For example, the relation R = ( (1, 1), (2, 2), (3, 3), (1, 2)} is reflexive but not the identity relation I ={(1, 1), (2, 2), (3, 3) AXAMPLE2 The relation R =((1, 3), (4, 2), (2,4), (2, 3),(3, DJ onset A =(1, 2, 3, 4} is (a) reflexive (©) not symmetric (c) transitive (4) identity Ans. (b) SOLUTION R is not reflexive because I ¢ R. We find that (2, 3) eR but (3, 2) ¢ R. So, R is not symmetric. We also observe that (1, 3) ¢ R and (3, 1) €R but (1,1) ¢R. So, Ris not transitive. EXAMPLES The relation R =((3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3,9), (3,12),(3, 6) on set A=(3, 6,9, 12} is (a) reflexive only (©) reflexive and symmetric only (6) reflexive and transitive only (@) an equivalence relation Ans. (0) SOLUTION We find that the identity relation I on A is a subset of R. So, itis reflexive on A. We also observe that (6, 12) € R but (12, 6) ¢ R. Therefore, R is not symmetric. It can be checked that Ris transitive. Hence, R is reflexive and transitive only. EXAMPLE4 Let R bea relation on the set N given by R ={(a,b):@=b-2,b > 6}. Then, (a) (2,4)eR (b) (3,8) ER () (6,8) eR (@) (8, 7)eR Ans. (c) INCERT] SOLUTION If a=6 and b =8, then a=b-2 and b >6. Therefore, (6, 8) ¢ R. So, option (c) is correct. AKAMPLES Let A =(1,2, 3) and consider the relation R ={(1, 1), (2, 2), (3, 3), (1,2), (2, 3), (1, 3)}- Then Ris (a) reflexive but not symmetric (b) reflexive but not transitive (c) symmetric and transitive (d) neither symmetric nor transitive. Ans. (a) INCERT EXEMPLAR] SOLUTION We find that A ={1,2, 3} and (1, 1), (2, 2), @, 3) eR . So, R is reflexive. Clearly, (1,2) eR but(2,1) €R.So, Ris not symmetric. R isa transitive, because (1, 1) ¢ R and (1,2) €R 3,2) eRj(2, ER and (2,3)eR = (2,3)eRi(1,2eR and (2,3)eR = (1,3 eR; (1,2eR and (2,2)¢R = (1,2) €R;(2, 3) R and (3,3) eR = (2, 3) eR; (1,3)eR and Beka 3) € R. Hence, R is reflexive and transitive but not symmetric. EXAMPLE Ifa relation R on the set A =(1,2, 3) be defined by R =((1, 2), then Ris (a) reflexive (&) transitive (©) symmetric (d) none of these Ans. (b) INCERT EXEMPLAR] Scanned with CamScannerSS 14 MATHEMATICS p, SOLUTION Given that A ={1,2, 3}. Therefore, for relation R to be reflexive, G, 1), 2,2) and G,3). But, it does not So, itis not reflexive. Since (i, not symmetric. R is transitive as it contains (1, 2) only and does not contzin pair beginning with 2 AGMPLET Let A={l, 2, 3). Then the mumber of relations cont reflexive and symmetric but not transitive is @i @2 3 @-s Ans. (2) D SOLUTION The smallest relation R; containing (1, 2) and (1, 3) which symmetric is Ry =[(1, 0), (2, 2),(3, 3) 2, 2), L, 3), (2, 1, (3, )). Clearly, i is not transitive as GD, (1,2) ER but G, 2) eR. If we add one of the ordered pairs (2, 3) or (3, 2), then symmetric. So, to make it symmetric we have to add both (2,3) and (3,2) toR;- new F is the largest relation ie. the universal relation on A whichis reflexive, symmetric and transitive, Hence, there is only one relation R, which is reflexive and symmetric but not transitive. CERT EXEM INCERT EXEMPLAR] relation on A={1,2,3} is the identity relation I, ={C.D,2, 2), (3, 3)}-lf we add ordered pair (1, 2) to I, we must also add (2, 1) tomake Se relation symmetric. The relation Ry =((1,1).(2, 2),(3, 3), (1, 2), (2, )} so obtained is transitive also and hence it isan equivalence relation on A. Similarly, by adding (2, 3) (3,2) tolz, wecbiin Ry ={(4, 0), (2, 2),(3, 3), (2, 3), (3, 2)} an equivalence relation on 4. By. adding (1,3) and G, 1)t I, we obtain R; =((1,), (2, 2),(3, 3), (L, 3), (3, ) as an equivalence relation on A. If we add (1, 2)and 2, 3), then we must also add (2, 1), (3,2) (1,3) and (3, 1) to make the relation symmetic and transitive. The relation so obtained is the universal relation. Hence, in all there are 5 equivalence relation on set A ={1,2,3}. EXAMPLES Let A ={1,2,3). Then the number of equivalence relations containing (1, 2) i @1 () 2 ©3 @+ Ans. (b) SOLUTION As discussed in Example 8, the equivalence relations containing (1,2) are @ (G,1),2,2),8,3),(1,2),2, Dl and (i) ((L,1),2,2),6,3),(,2),2,2,3)8,0,2,3)8,2) EXAMPLE 10 Let us define a relation S on set R of all real numbers by the rule aRb ifa 2b. Then, RS INCERT, CBSE 2020 (2) an equivalence relation (©) reflexive, transitive but not symmetric (c) symmetric, transitive but not reflexive () neither transitive nor reflexive but symmetric Ans. (b) INCERT EXEMPLAR] SOLUTION For any aR, a2ais true. Therefore,(a, a) < $for all a ¢ R. So, Sis reflexive. Leta, b,c € R such that (a,b) ¢ Sand (b, c) eS. Then, azbandb2e = are >(a,c)eS So, Sis transitive on R. Sis not symmetric because7 2 3 but 3 $7 ie.(7, 3) mdivides and n divides p = mdivides p => (m, p) oR So, R is transitive. Hence, option (d) is correct. EXAMPLE 12. Let L denote the set of all straight lines in a plane. Leta relation R be defined by IRm iff is perpendicular tom for all, m ¢ L. fa eo ae (a) reflexive (b) symmetric (c) transitive (d) none of these Ans. (b) [NCERT EXEMPLAR] SOLUTION A straight line in a plane cannot be perpendicular to itself. Therefore, (I, ) ¢ R for any | ¢ L. So, R is not reflexive, Let (I,m) €R. Then, IL m=> m 11 => (m,1) eR. So, R is symmetric. Now, let I,m, 1 ¢ L such that (I,m) ¢ R and (m,n) ¢ R. Then, IL mandm tn = Lis parallel ton = (I,n) @R So, R is not transitive. EXAMPLE 13. The relation R on the set A =(1,2,3) given by R =((1,2),(2, 1), (3, 3)} is (a) symmetric and transitive, but not reflexive (b) reflexive and symmetric, but not transitive (©) symmetric, but neither reflexive nor transitive (A) an equivalence relation Ans. (0) SOLUTION Given relation R is not reflexive because (1, 1), (2, 2), (3, 3) do not belong to R. Relation R is symmetric but it is not transitive because (1,2) eR, (2,1) €R but (1,1) ¢R. EXAMPLE M4 IfA =(1, 2, 3}, then which of the following relations are equivalence relation on A? @) Ry =(0, 0, (2,2),(3, 9) (©) Ry =((1,1),(2, 2), (3, 3),(1.2),(2,D) (©) Ry =101,1),(2, 2),(3, 3),(2, 3)-(3, 2) (A) Ry, Ry and Ry Ans. (d) SOLUTION Relation Rj is the identity relation on A and hence itis an equivalence relation on set ‘A Relations Ry and R are also equivalence relations on A. Hence, option (d) is correct. ASAMPLEIS For any two real numbers a and b, we define aRb iffsin®a + cos*b =1. The relation R on the set R ofall real numbers is (a) reflexive but not symmetric (b) symmetric but not transitive (©) transitive but not reflexive (d) an equivalence relation Ans. (d) SOLUTION For any real number a, we have sin2a+cos?a=1 => aRaforallacR So, R is reflexive. For any a,b € R, we find that aRb= sin2a+cos2b =1=> 1-cos*a+1-sin2b =1 => sin?b+.cos*a=1 = bRa So, R is symmetric. For any a,b,c ¢R, we find that aRb and bRe =>'sin? a+ cos*b =1, sin*b + cos*c=1 2 = sin? a+ cosb+sin2b +cos*¢=1+1 = sin?a+cos*c=1 = aRe So, Ris transitive. Hence, R is an equivalence relation. Scanned with CamScanneros’ 1.6 MATHEMATICS.xy, EXAMPLE 16 Let $ be the set ofall real numbers. Then the relation R =((a,b):1+ab >0} on $ ig (a) reflexive and symmetric but not transitive. (b) reflexive and transitive but not symmetric (©) symmetric, transitive but not reflexive (A) reflexive, transitive and symmetric Ans. (a) SOLUTION For anya ¢$, we find that1+axa=1+07 >0.Therefore,(a, a) eR forallacs, So R is reflexive on S. Let a,b € Ssuch that (a,b) € R= 1+ab >0=> 1+ba>0= (b, a) € R. So, R is symmetric on S, 33 3.3 We find that (3 ser and G S)er but (3 -g)er a5 14-Z3 $0, So, Ris not transitive. Aramis ry IfA is the set of even natural numbers less than 8 and B is the set of prime numbers less than 7, then the number of relations from A to B is @? &) 9? © % @ 2 Ans. (a) SOLUTION Itisgiven that A =(2, 4, 6)and B=(2, 3,5}. Therefore, Ax B has 3x 3 = 9elements. Hence, number of relations from A to Bis 2°. E1 Let W denote the set of all words in the English dictionary. Define the relation R by R= (x, y) EW xW : the words x and y have at least one letter in common). The relation R on W is (a) reflexive, symmetric but not transitive () reflexive but not symmetric and transitice (©) an equivalence relation (4) not reflexive but symmetric and transitive Ans. (a) SOLUTION For any word xin set W, x and x have all letters in common. Therefore, (x, x) ¢R - Thus, (x, 2) €R for all x €W. So, R is reflexive on W. Let(x, y) €R. Then, (x,y) €R = Words x and y have at least one letter in common. = Words y and x have at least one letter in common = (y, 2) eR So, R is symmetric. We find that BOLD is related to BAT and BAT is related ACE. But, BOLD is not related to ACE. So, R is not transitive. ExampLe 19 Let R be a relation on the set Z of integers given by aRb <> a =2'b for some integer k. Then, Ris (a) reflexive but not symmetric (©) symmetric and transitive but not reflexive (©) reflexive and transitive but not symmetric (a) an equivalence relation } Ans, (d) j soeurion For any integer a, we can write a = 2°a, Therefore, aRa. Thus, aRa for alla ¢ Z.So, Ris Letb eZ such that aRb = a=2*b for some integer k => b =2"*afor some integer k => bRa Thus, aRb = bRafor all a,b ¢ Z. So, R is symmetric, Let a,b, c € Z such that aRb and bRc, Then, aRb=> a=2*bandbRe=> b =2'cfor somek,1€Z. aRb and bRe=> a=2*b andb=2e = a=2+e = ake So, R is transitive. Hence, R is an equivalence relation. —————E———EESSSSSSSSS_===_a_a_==_a=aa=__a Scanned with CamScanner| scenes WRLAIHINE hit NA Qnnnyeat Nata Qn PE niyo agin Fy PRY UP ea = Uy He PE an) wean wt Aaa AND sophev diye iid Homa die (8) VR ENE RAH (WN) as espuirontenien pvlabianh NR NANHIN Nesey Hk Vo any titoons hon fv foet acd ea ay AWW ANY Hava eB. M 8 beatin, meses VOU, We aw NL AW SLY Vhs L ee Qube ee [weap tog gee Yn ANY VAY AN ATE We NN, A boat o, Sgnetstyn Wo tient that Wy NN voy f ‘ 4 | fl fst owt |) t]sviva o(")a() aut () , pet ae [Peet tdi cs Pa) ant (9) a4) oun Ay Whe Hwnnalllvs, ANAM {nti venules addon need avnpabid dey a 1 ehonnnttr fv egiill to we we q ne) Wren Awa) NON Tet Le hts yy aos ety WO the ot conabitiyy af elementis Than, eaeh reflexive Qa tboun ony oh aatent Hayne Rattoono gy A netarwat adie (ahs thy) (iy Hg)s any yy a) ANCL ANY: Naber y—¥ isan integer => (y, 2) ¢A Ais symmetric relation on R. Transitivity: Let(x, y) € A and (y, 2) € A. Then, x~yis an integer and y zis an integer => x—zis an integer = (x,2) ¢A y Scanned with CamScannerRELATIONS 41 A=(S,D}, B={1, 2, 3,4,5, 4 (@) Leta relation on set B be defined by R = (x,y) :y is divisible by x). Then, R is (a) Reflexiveand transitive but not symmetric (b) Reflexive and symmetric and not transitive (6) Not reflexive but symmetric and transitive (d) Equivalence (i) Raji wants to know the number of relations on set B. The number is (a) 22 (b) 25 (0) 36 (a) 12 Gi) LER be the relation on B defined by R =((1, 2), (2, 2), (1, 3), (3, 4), (3, 1), (4, 3), G, 5)}- Then (a) symmetric (b) reflexive (c) transitive (d) none of these three (iv) Rojfwants to know the number of relations possible from A to B, How many relations are possible? @ 6 () 26 © 6 (@ 2” (v) Leta relation on B be defined by R =((1, 1), (1, 2), (2, 2),(3, 3),(4, 4), 6,5), (6, 6)}, then R is (@) symmetric (&) reflexive and transitive (6) transitive and symmetric (@) equivalence SOLUTION (i) Ans, (a): We observe the following properties of R: Reflexivity: For any xeB=(1,2, 3, 4,5, 6), xis divisible by itself ie. (x, x) € R.So, R is reflexive. ‘Symmetry: We find that 2 divides 6 but 6 does not divide 2. This means that (2, 6) ¢R but (6,2) €R.So, Ris not symmetric, Transitivity: Let x, y,z€ Bbe such that (x,y) eR and (y,2) eR = yisdivisible by x and.zis divisible by y = zis divisible by x = (x,2)¢R So, R is transitive. Hence, R is reflexive and transitive but not symmetric. (i) Ans, (b): Set Bhas 6 elements. Therefore, 2°*° =2% relations can be defined on set B. (ii) Ans, (4): We find that (1, 1), 3,3) ¢ R.So, R is not reflexive. Clearly, (1, 2) € R but (2, 1) ¢ R.So, R isnot symmetric. We find that(1, 3) eR and(3, 4) ¢ R but (1, 4) €R.So, R is not transitive. Hence, R is neither reflexive, nor symmetric nor transitive. (v) Ans, (d): A has 2 elements, B has 6 elements. Therefore, Ax B has 12 elements. Hence, number of relations from A to Bis 217. (¥) Ans.(b) Clearly, the identity relation on Bis a subset of R.So, R is reflexive. We observe that (1, 2) ¢R but (2, 1) ¢R.So, R is not symmetric. Clearly, R is transitive. Asami ss An organization conducted bike race under 2 different eategories — boys and girs. Totally there were 250 participants. 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 =[by, by, bs] G =(g1, 83} where B represents the set of boys selected and G the set of girls who were selected for the final race. "Scanned with CamScannerON 4.12 MATHEMATIC. yy Ravi decides to explore these sets for various lypes of relations and functions (i) Ravi wishes to form all the relations possible from B1oG. 1 Tow many such relations are possible? (@) 2 @) (0 (a) 2° (i) Let R bea relation on Baefined by R =((% Y) # * and yare students of same sex), Then this relation Ris (a) equivalence (b) reflexive only (6 reflexive and symmetric but not transitive (A) reflexive and transitive but not eymmetric (iii) How many reflexive relations are defined on G? fa) 2 4 3 (d) 16 (iv) The number of non-reflexive relations on B is (a) 448 444 (c) 64 (d) 512 (v) The number of equivalence relations on G is (4 (b) 2 3 (d) 16 [CBSE 2023] SOLUTION (i) Ans, (a): B has 3 elements and G has 2 elements. Therefore, BxG has 3x2=6 subset of Bx G, which is 25. elements, Total number of relations from B to G is the number of (i) Ans. (a): The relation R on Bis reflexive, symmetric and transitive, because all students in B are of the same sex. Hence, R is equivalence relation. (ii) Ans. (b): The number of reflexive relations on a set consisting of 1 elements is 2" ‘Therefore, number of reflexive relations on Gis 2°"! = 4. (iv) Ans. (a): The number of non-reflexive relations on a set consisting of n elements is 2 20-28", Therefore, the number of non-reflexive relations on Bis 2° ~2° = 448. (v) Ans. (b): The equivalence relations on G are the identity relation and the universal relation. Hence, the required number is 2. AXAMPLES4 Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y =x-4. Let L be the set of all lines on the ground and R bea relation on L. (n-1), Fig. 1.4 Answer the following using the above information. () Let relation R be defined by R =((Ly, Lp) :Ly|| Lp where Ly, Ly € L) then Ris (2) an equivalence relation (b) not reflexi ive (only reflexive (d) symmetric but not transitive. (i) Let R =((Ly, Lp): Ly L Ly, where Ly, Ly € L). Then which of the following is true? Scanned with CamScannerRELATIONS 143 (a) R is symmetric but neither reflexive nor transitive. () Ris reflexive and transitive but not symmetric. (©) Ris reflexive but neither symmetric nor transitive. (d) Ris an equivalence relation. Let R ={(Ly, Lp) : Ly és parallel to L) be a relation on L. If (Ly, Lp) Rand Ly: w) 3x-2, then hich of the following can be Ly? (@) y=2x43 ) yo-hxe2 (Q y=3x411 (@) y=-3x+2 (iv) Let R=((Ly,1,):Ly 1 Ly, where Ly,Ly €L} be a relation on L. If (Lyla) €R and [y:2x-3y+1=0, then which of the following can be Ly? @ 2x+3y+1=0 (b) 3x+2y+5=0 (©) 2x-3y+7=0 (d) x+3y+1=0 (v) LER =((Ly, Lp) : Ly || Ly, where Ly, Ly € L) be an equivalence relation on L. Then, the equivalence class representing y =2x+1is (a) {y=2x+c:c isa real number) (b) {y=2x+c;c is an integer} (0 y=2x+e:cisanatural number} (a) 2y=x+c:c isa real number} SOLUTION (i) Ans. (a): Reflexivity: Let I be an arbitrary line in L. Since every line is parallel to itself. therefore, I|| l. Thus, (I, 1) ¢ R for all < L.So, R is reflexive. Symmetry: Let I, ly €L such that (lh, h) €R. Then, (h, ) R= hl, => bllh= (a,b) eR Thus, (I [p) € R= (Ip, 4) €R for all h, lp € L-So, R is symmetric. Transitivity: Let l, ly, Is € L such that (ly, 2) €R and (Ip, 3) €R. Then, All and fy f5 => Alls => (hts) eRe ‘Thus, (I, fp) €R and (Ip, Is) € R= (ly fg) €R.So, R is transitive. Hence, R is an equivalence relation on L. (i) Ans. (a): Reflexivity: Any line in L cannot be parallel to itself. So, R is not reflexive. Symmetry: Let h, lp € Lbe such that (by, ) Rh Lh= ht h= (ah) eR So, R is symmetric. Transitivity: Let ly, Ip, I Lbe such that (hb) Rand (by, fs) R> HL bandh Lh hills yb) eR So, R is not transitive. Hence, R is symmetric only. ) Ans. (c): Itis given that (Ly, Lp) € R ie is parallel to La and Ly x —2. Therefore, La is a line parallel to Ly-Clearly, y= 3x +11 is parallel to Ly. Hence, Ly :y = 3x +11. (iv) Ans. (0): It is given that (Ly, La) €R ie. Ly is perpendicular to Iyand Ly :2x-3y+1=0. Therefore, L; is any line perpendicular to 2x - 3y +1 = 0.Cleatly, 3x+ 2y-+5 =0is perpendicular to Ly. Hence, Ly : 3x +2y +5 =0. (v) Ans. (a): The equivalence cl x +1. Clearly, y = 2x + ¢ repre equivalence class is {y= 2% + ¢:¢ 1s am PRACTICE EXERCISES — MULTIPLE CHOICES QUESTIONS (MCG: Jass representing y=21+1 is the family of all lines parallel to sents family of lines parallel to y = 2x +1. Hence, the required yy real number}. ‘Mark the correct alternative in each of the following: 1. Let R bea relation on the set N given by R = (0, b):a=b-2,b >6).Then, (a) (2,4) eR (b) (3,8) ER (c) (6,8) €R_ (@) (8,7)eR Scanned with CamScannerTIONS ELA 417 Statement-2(R): A relation R on asset Ais transitive, if (a/b) eRand (b,c) R= (a,c) eR. A transitive relation on a set A is always a reflexive relation. IER is a transitive relation on a set A, then (ab) ER and (b, a) R= (a, 0) ER for alla,beA. ae R =((1, 1), (2, 2),(3, 3),(1, 3)} is reflexive on the set =fl, 2, 3). 42, Statement-1 (A): Statement-2 (R); 43, Statement-1 (A): Statement-2 (R): A relation R on a set A is a reflexive relation if every element of A is related to itself only, 44, Statement-1(A): The relation R ={(p, p)) on set A =p, q, 7) is an equivalence relation. Statement-2(R): The relation R =|(p, p)} on set A =|p, 4, is symmetric and transitive but not reflexive. (CASE STUDY BASED QUESTIONS) AS. Mohit is persuing his B.B.A. Course from a reputed institute. For his college project he Visited two societies in Gurugram and prepared the lists of school going kids from the two societies. Let A={a, a2, a3, ag, as) and B-=|by, b,b3,b4) be the sets of school going students of societies $, and 5, respectively. Using the above information answer the following questions: (i) The number of relations from A to Bis (a) 20 (&) 2° (9 2 (@2 (ii), Mohit wants to define a reflexive relation on set A. The total number of such relations is (@) 25 oF (© 2” @2” ) The number of symmetric relations on set Bis (a) 2° () 26 2” (a) 2° (iv) The number of relations on A which are not reflexive is (a) 229 (b) 27°15 (©) 20x 31 (4) 2% x 33 (v) The relation R ={(a, b): aand b are students of the same age} on set Ais (a) reflexive only (b) reflexive and symmetric but not transitive (©) symmetric and transitive but not reflexive (4) an equivalence relation (AG. Aarushi and Mira are playing monopoly in their house during COVID. While rolling the die their common friend Avni noted that the outcomes of throw every time is one of the elements of the set ( 1, 2, 3, 4, 5,6]. Let A denote the set of players and B be the set of all possible outcomes on the upper face of the die, Then, A =(A, M) and B=(1, 2, 3, 4,5, 6. Based on the above information answer the following questions: (j) The total number of relations from A to Bis @e (b) 28 (2 (a2 (ii) The relation R ={(1, 2) (2, 2), (1, 3), (3, 4), (3, 1), (4, 3), (6,5)} on set Bis (a) reflexive (b) symmetric (c) transitive (d) none of these (ii) The relation R =((1, 1), (1, 2), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)} on set Bis (a) reflexive and transitive (b) symmetric (c) symmetric and transitive (a) an equivalence relation Scanned with CamScanner1.18 (iv) The number of equivalence relations on set A is @4 ©) 6 ©@2 (v) The number of symmetric relations on Bis (a) 26 (b) 2% (9 2? Lo, ANSWERS, 10 20 #3@ 4@ 5@ 60 © 1.) 12) 13.) wma) 15. (b) 19.) 20.) 21.) 22.) 23, (b) 24. (©) 48. (0), 29. (4). 90.(c) 31. (b) 92 (a), 38: (b) 37. @)_— 38. (@) 39. (b) 40.) at. (a), (©) 5BO@ GO GE WOE WH @ 6.0 @) G)@ GidD@ GO ) ACTIVITIES = MATHEMATICS. xy, (a) 8 (@ 215 7.4(c) || 8 (a) 9. (c) 16. (c) 17. (b) 18, (a) 25. (b) 26. (a) 27. (b) 34. (b) 35. (a) 36. (c) 43. (c) 44. (d) Scanned with CamScanner10. 1. 12. 13. 4. _Aramecer Let A= freR:-1SxS1}=B $= (a) S defines a function from A to B (©) Sp defines a function from A to C ON MATHEMATICS, i n. (<0 "Cer" ime 1 ii) Number of onto functions from A to B = ) = 0, ifm Bisa bijection, then g:B > Ais inverse of f, iff fO)=y = Sax or, gof = Iq and fog = Ip Let f:A > Band g: BA be two functions. (i) Ifgof =14 and f isan injection, then g is (i) If fog =Ig and f is a surjection, then gis an injection. Let f:A > Band g: B—> C be two functions. Then +Cisonto => g:B—>Cisonto. + Cis one-one => f:A > Bis one-one. Cis one-one > f:A—>B isonto. A Bisonto = g:B— Cis one-one. a surjection. (ii) gof:A > Cis onto and g:B (iv) gof:A > Cis one-one and f: SOLVED EXAMPLES — «MULTIPLE CHOICE QUESTIONS (MCQs)| and, C=freR: x2 +y? =1) and S ={(x, 9) AxC sx2+y? =1). Then, (b) S defines a function from A to B (d) Sdefines a function from A to C {(x,y) €AxB: Ans. (6) , SOLUTION We observe that S is the set of all points on the circlex? +y? = 1asshownin Fi Fig. 2.1 (a), Tine test, $ does not define a function from A to B, Clearly, Fig. 2.1 (b) shows that 2.1 (a) and Sis the set of all points on the semi-circle x? + y?=1 shown in Fig. 2.1(b).In ‘wean draw vertical lines intersecting x2 + y =1 at two points. So, by using vertical Sy defines a function from A toC. y on y 1) s| ro (-1,0)/ 5 (1, 0) a c eu rr xo a0, ee " ©) v Fig. 2.1 "Scanned with CamScanneree FUNCTIONS 23 2x; x>3 WNAMILE? Let fi > R be defined by f(x) ={.x2j 1. R be defined as f(x) =c0s fn] x + cos [nx the 13) = (0 (b) -1 (1 (2 Ans. (c) SOLUTION We have, f(x) = cos [r] x + cos [1] x for all x eR => fx) =c08 3x4 cos(—42) = cos 3x + c0s4x => HE) conf +s a Bik SAMPLES Iff(2) = 05 fe] + €05 [+e] x, then ((3)- (1 wo Ox @ Ans. (a) SOLUTION Wehavee~ 2.71 fl) = 00s [e] x + cos [-e]x = cos 2x + cos (32) = cos 2x + cos 3x x Bos dt} = Af)resfroF=—F ASAMPLES Let f :[2, 00) > R be the function defined by f(x) =x? -4x-+5. Then the range of fis @R (>) BL, ») (© 4, ) (@) B,») Ans. (b) (NCERT EXEMPLAR] SOLUTION We have, f(x) =x? -4x+5=(x-2)? +1 Now, xel2,«) = x-220 = (x-2* +121 = fa)21 = feel, 0) Hence, range(/) =[1, ALITER We have, f(x) = => f(x) =2x-420 forall x €[2, «) => f(x) is increasing function on [2, 0) => Range (f) =[f(2), f(@)) =U, =) EXAMPLES Let: —> R bedefined by f(x) =x? +1.Then, pre-images of17 and ~3, respectively, are (@) 61-4, 4) ©) -3, 316 (©) (-4,41,6 (@) 4,412, Ans. () INCERT EXEMPLAR] SOLUTION Let the pre-images of 17 and -3bea andb respectively. This means that the images of aand b are respectively 17 and 3. fl) =17 and f(b) =-3. = @41ai7 and b2+12-3> a=+4 and b? +1 Thus, the pre-images of 17 and -3 are (~4, 4) and grespectively. 24x45 forall x e[2, 0) i 3is not possible for anyb eR. Scanned with CamScanneroN 24 MATHEMA TICs, EXAMPLE Let N be the sel of natural numbersand the function f NV ~¥ N be defined by f(ny . =n forall ne N.Then, fis (a) surjective (b) infective (6) bijective (d) none of these Ans. (b) INCERT EXEMPL pp) SOLUTION Let m,n @N be such that f(m) = f(n). Then, Son) = f(r) = Im 3.2 2+ 3= men So, f :N > Nis injective, Let be any natural number, Then, 21 =» 2n22 =72n4 325 = fin 25 Thus, range (f) = (5,7, 9,..} # Co-domain = N. So, f+ N ~» Nis not surjective. xAel , ASAMPLES The equivalent definition of f+ R | (0) > given by fle) == Ta] is (a) f(x) =O forall x eR ~(0) (b) f(x) =-2 forall x & R -(0} 0, x>0 © sea-{ 9 229 9 sor={ 9225 Ans. (0) x, x20 x, x<0 SOLUTION We know that: Isl et zl x ce x-(-4) “x f(x) = 29) og, x0 EXAMPLES If f(x) =4x? + 327+ 3244, then #4(2)i 1 a a 2 @) ® Fy @ { 1( 2} (@) foe) Ans. (d) SOLUTION We have, f(x) =429 + 3x7 + 3x44 044343 = x4(4}- 24 4x3 = = s(4) staat ths Os (sade 3e4 3x7 44x =f) a) PewsiirEsy WAS R > R be defined as f(x) =2x-+| x|, then f(2x)+ f(-x) f(x) = (a) 2x (b) 2[z] (©) -2x (A) -2|2| Ans. (b) OLUTION (21) + f(-2)~f(x) = 2 (2x) +] 2x] + (-2x) +|-x| -(2x +] x]) = 4x42] 2x|-2x+| x]-2x-| x] =2] x] PARAPLED Lal sR —> Redefined by f(s) = forall eR. Then, f is (a) one-one (b) onto (C) bijective (d) not defined Ans. (d) INCERT EXEMPLAR] SOLUTION We find that f(x) is not defined at x = 0.S0, option (d) is correct, ne Scanned with CamScannerFUNCTIONS 2s EXAMPLE 12 Let f: R~(0} > R be defined by f(x) =. Then, fis x 2 ran (b) onto (0) bijective (4) not defined s. SOLUTION For any x, yeR~(0}, we find that: f(x) = f(y) => 1, x=y.S0, fis one-one. y Forany x eR ~(Q,, f(x)=y> boy x Since x + 0. So, y takes all real values except 0. So, Range (f) = R ~(0} * co-domain. Hence f is not onto. AMPLE 13 Let A = i t ey nan end N Be theft umber Te the mapping f2N— A dina (@) one-one (b) onto (© a bijection (d) one-one but not onto Ans. (b) [NCERT EXEMPLAR] SOLUTION The mapping f relates all odd natural numbers to 0 and alll even natural numbers to 1.So, itis not one-one. But, itis onto because range (f) =(0, 1} = A. EXAMPLES Let A =[1, 2, 3, .....,1] and B= (a,b). Then the number of surjections from A into Bis (@ "Py (b) 27-2 (© 2-1 (4) none of these Ans. (b) INCERT EXEMPLAR] SOLUTION Each element of set A can be mapped to either a orb ie. in two waysand there aren elements in A.So, total number of functions from A to Bis 2". Out of these only two functions are into one in which all elements of A are mapped to aand the other under which all elements are mapped tob. Hence, the total number of onto functions is 2*—2. 2 ALTER Total number of onto function = 7 (-1)?-7 7G, P*=-7C + 7Cqx2*=2"-2 ral _PUSPLE 15 If the set A contains 5 elements and set B contains 6 elements, then the number of one-one mappings from A to Bis (@) 720 () 120 oF (@) 5° Ans. (a) SOLUTION The number of one-one mappings is equal to the number of ways of arranging 6 elements in B by taking 5 ata time, which is equal to °C; «5!=720. EXAMPLE 16 Ifthe set A contains 5 elements and set B contains 6 elements, then the number of one-one and onto mappings from A to B is (@) 720 () 120 (0 (A) none of these Ans. (c) [NCERT EXEMPLAR] SOLUTION We find that the set Bhas more elements than the set A.So there cannot be an onto mapping from A to B. Hence, the number of one-one onto mappings is zero. Bouma 17 Which of the following functions from Z to Z is a bijection? @ f=x? (b) gx)=x+2 — (Of(X)=2x41 (Ad) f(x)=x7 +1 Ans. (b) SOUMION f:Z—+Z given by f(2)=%? is an injective map but it is not surjective, because range (f) =(0, £1, 48, + 27,..] # Z (Co-domain). So, option (a) is not correct. Function g:Z —+ Z given by g(x) = x + 2s one-one, because g(x) = g(y) => x+2=y+2— x=, Itis also onto, because for any every y € Z (Co-domain) there exists y~2 ¢Z (domain) such that S(y-2) =y.So, gis a bijection. Scanned with CamScanneroa MATHEMATICg., i x +1 is one-one, because Function ht: Z —> Z given by h(x) Nx) =iy) => 2x41 =2y+1 = x=y. tis not onto, because even integers in co-domain donot have there pre-images in the domain $:Z = Z given by (x) =x? +1 is many-one, because toe = $(2)-So, option (A) is incorrec, SAMPLES Let f :N > R be the function defined by f(x) = hand g:Q > R beanother function defined by g(x) =x +2. Then, gof ( 3) is @1 2 of (d) none of these INCERT EXEMPLAR) Ans. (d) and g(x) =x+2 => s(3)=1 and g(1)=3 SOLUTION We have, f(x) (2-6 (2)-m- 3 (? 2x-1 _ 3 3 = r2=x+3> oo(Z) 243 ALITER gof(x) =g(f(X) =. z EXAMPLE19 Let f:R > R, ¢:R > R bedefined by f(x) = 3x? -5 and g(x) = 1 - Then, gof(x)is + 3x2-5 3x25 3x2 3x2 (c) (a) © S302 426 oe etaze Wa2—a x4 + 30x? -2 Ans. (a) INCERT EXEMPLAR] 3x25 3x2-5 = =9(3x? -5) = >? — = ~~ _ SOLUTION gf(2) = SU) = 8132" 9) (3x2-5)?+1 9x -30x7 +26 Aoosie 20 Let f :R > R be given by f(x) = tan x. Then, f(A) is ) { mst me z} (0) does not exist (d) none of these x @ 4 INCERT EXEMPLAR] Ans. (b) SOLUTION Let f~(1) =x. Then, f(x) =1=> tanx=1=> tanx=tant = venntT med fa) ={ne+F naz} FOOMPLE21 Function f :R > R given by f(x) =x+ (a) injective (b) surjective (c) bijective (d) none of these Ans. (d) SOLUTION We have, f(x) =x+Vx? =x+| x fizz yx< Graph of f(2) is shown in Fig, 2.2. Clearly, it is not one-one because all negative real numbers a" mapped to zero. Also, f(x) is not onto because range (f) =[0, co) * R (co-domain). Scanned with CamScannerFUNCTIONS 27 y Fig, 2.2 Graph of f(x)= + ASAMPLE22 If f(x) = sin? xand the composite function g(f(2)) =| sin x|, then g(x) i equal to (@) Ve=t ) VE (©) Weed @ -ve Ans. (b) SOLUTION We have, f(a) =sin? xand (f(x) =| sin x| = g(sin22) =| sin x| =Vsin?x => g(x) =V¥ EXAMPLE Let f :R — R be given by f(x) = 3x+4, then f(x) = sta 43 a= x3 (a) 3 ) t © a (d) TT Ans. (c) SOLUTION Clearly, f: R + R isa bijection. So, f-! exists such that x-4 Sofa) =x => fifty) =1= 3f a) +4=x= $7) = SAMPLED If g(f(2)) =| sin x| and fg(x)) = (sin V2), then @) f(x) =sin? x, g(x) =e ©) fle) =sinz, g(x) =|] (0 fla) =2?, 9(x) =sin Vz (A) fand g cannot be determined. Ans. (a) SOLUTION We have, (f(a) =I sin x| and f (g(x) =(sin Vz)? > (f(x) =Vsin?x and f(g(x)) =sin? Vx = f(x) = 2.x and g(x) = Vx _AASSERTION-REASON BASED MCQs Each of the following examples contains STATEMENT-1 (Assertion) and STATEMENT-2 (Reason) has following four choices (a), (b), (c) and (d), only one of which is the correct answer. Mark the correct answer. (2) Statement-1 is true, Statement-2s true; Statement-2 isa correct explanation for Statement-1, (b) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for Statement-1. (©) Statement-1 is true, Statement-2 is false. (d) Statement-1 is false, Statement-2 is true. EXAMPLE 25 Statement=1 (A): If A and B are two sets having 3 and 5 elements respectively, then the total number of functions that can be defined from A to B is5°, Statement-2(R): Afunction from set A to set B relates elements of set A to elements of set B. Scanned with CamScannerON 2.8 MATHEMATICS, Ans. (c) SOLUTION A function from set A to Brelates every element of set A toa unique elementin sets Consequently, statement-2 is not true, one of five elements in B and there are; Since, each element of set A can be associated to any elements in set A. a Total number of functions from A to B =5x5x5=5 So, statement-1 is true. _PSOMPLE26 Statement-1(A): If tio set X and ¥ contain 3 and 5 elements respectioly then 55x31 one-one functions can be defined from X to Y. Statement-2 (R): A one one function from X to ¥ relates different elements of set X different elements of set Y- Ans. (a) SOLUTION A one-one function from set X to set Y associates distinct elements of X to distinct elements of Y. This can be done in ®C3 x 3! ways. Hence, 5c, x 3! one-one functions can be defined from X to Y. So, statements-1 & 2 are true and statement-2 is a correct explanation for statement-1. AxamPiez7 Statement-1 (A): Let A and Be too sets having m and n elements respectively such tht men Then, Number of surjections from A to B = Ss ™, (-1)"7 r™ rl Statement-2(R): Iff:A > Bisa surjection, then every element in B has a pre-imagein A. Ans. (d) SOLUTION Since Bhas more elements than A. So,melements in set A can be related to at mostmt elements in B, Consequently, remaining (1! -m) elements in B will not have their pre-images in. So, it is not possible to define an onto function from A to B. Hence, statement-1 is a false. However, statement-2 is true. _FXAMPLE2S Statement-1 (A): The function f : R -» R defined by f (x) = x? + 4x5 isa bijection. Statement-2 (R): Every odd degree polynomial has at least one real root. Ans. (a) SOLUTION Foranyx,yeR SQ) =fY) = x9 4+4x-5=y3 +4y-5 > x9-y3 44 (x-y) =0 => (x? tay+y? +4) =0 = ory [: 4+ fR > Risan injective map. Let y be an arbitrary element in R (Co-domain of f ). Then, f(x) =y = x3 +4x-Say = x944x-G+y) =0 Forgiven value of y, this equation has at Forgiven valu ofythiseg at least one real root, say a, as every odd degree equation 2 (4,2 Peay tyteaa(ned) «(2B 4}>otranssyet] Scanned with CamScanner _deE— FUNCTIONS 29 a3 +4a-G+y)=0 = f(a)ay ‘Thus, foreach y € R (Co-domain) there exists a ¢ (domain f ) such that f (a) = y.So,f:R > Ris asurjection. Hence, f is a bijection. ‘Also, statement-2 is a correct explanation for statement-1. EXAMPLE 29 Statement-1 (A): Iff:R — Rand g: R-> R be two functions such that f (x) =x? and g(x) =2°, then fog (x) = gof (x). Statement-2 (R): The composition of functions is commutative. Ans. (©) SOLUTION We have, Seg (3) =f (9 2) = $83) = (4)? =28 and, gof (0) =g (F(2) = 8 (27) =)? = ‘fog (x) = gof(x).So, statement-1 is true, If f(x) =x? and g(x) =sin x, then fog (x) = sin? x and gof (x) =sin x. ‘fos(s) # gof (x). So, the composition of functions is not commutative. Hence, statement-2 is false. EXAMPLE. Let f:A > A and g: A — Abe two functions such that fog(x) = gof(x) =x forallx € A. Statement-1 (A): {x € A: f(x) =g(2)} = {x © A: fl) =a} = Ag (2) = 3} Statement-2 (R): fA > Aisa bijection. Ans. (a) SOLUTION We have, {fox x) = gofx) =x for all x eA => fog (x) = gof(x) =I(z) forall eA fog= = f isinvertible such that g =f ~1 => f isa bijection => — Curvesy=f(2) and y=g(x) meet at y=x => freAsf(x)=g (2) =(reA:f (2) =x) = fr © Arg) =x} ‘Thus, both statements are true and statement-2 is a correct explanation for statement-1. PXAMPLES1 Let f :[-1, <0) €[-1, ce) bea function given f (x) =(x+1)?—1, x2—1. Statement-1 (A): The set (x: f (2) =f") (2)} = (0,-1) Statement-2 (R): f is a bijection. Ans. (a) SOLUTION It can be checked that f is a bijection and hence invertible. Therefore, the solutions of equations f(x) = f~ 1(x) and f(x) =x are same. Now, f(x)=x = (x+1)?-1=x= ex=0>x(x+1)=0>x=-1,0 be: f(@) =f) =F, 0 ‘Thus, both the statements are true and statement-2 is a correct explanation for statement-1. _ASampLe 32 Statement-1 (A): The function f NN given by f (9) =n—(-A)" for all ne N is invertible, Statement-2 (R): The successor and predecessor of an even natural number are odd natural numbers and that of an odd natural number are even natural numbers. Scanned with CamScannerPaO MATHEMATICS, 0 Ans. (a) ‘n-1, if nis even SOLUTION We have, f(n) en-cotef n+1, ifnisodd Injectivity Letn, mbe any two even natural numbers. Then, f(i) = fm) = n-1=m-1=>n=m If, mare any two odd natural numbers. Then, f(r) =f) > m+1=m+1 = n=m Thus, in both the cases, we obtain: f(n) = f(m) => =m. nis even and mis oda, then # m. Also, f(1) is odd and f(m) is even. So, f(r) f(m) Thus, n#m => f(n) # f(mn).So, f is an injective map. Surjectivity Letnbe an arbitrary natural number. Ifnis an odd natural number, then there exists an even natural number n + 1 such that f(n+I=en+1-1=n Ifnis an even natural number, then there exists an odd natural number (11-1) such that fln-1) =n-1+1=" Thus, every € N has its pre-image in N.So, f:N -> N isa surjection. Hence, f :N + Nisa bijection. LAXAMPLES3 Let fx[-1, 3] R be defined as f(x) = 4x° —12x Statement-1(A): The image of{-1, 3] under f is not the interoal [f (1), f (3)]- Statement-2(R): f is not an injective map. Ans. (a) SOLUTION We have, f(x) =4x3 -12x = f’(x) =12x? -12 =12(x-1) (x+1) The signs of f’(x) for different values of x are as shown below. = 1 Fig. 2.3 Signs of f'(x) So, f() attains a local maximum at x =—1 and local minimum at x =1.Clearly, (2) s decreasing in [-1, 1] and increasing in [1, 3]. So, f is not an injective map and the image of [-1, 3] is (F), f))=-8, 72} EXAMPLE 34 Let f be a function defined by f(x) =(x-1)? +1, (x21). Statement-1 (A): The set (x:f (x) =~ 1(x)} = (1, 2} Statement-2(R): fisa bijection and f-\(x) =1+VJx—1, x21. Ans. (a) SOLUTION It is evident from the graph of f (x) that f (x) is a bijection for all x 21 and hence invertible. Now, fof (x) =x for all x21 > (fe) =x forallx21 > (f(a) -1)? +1 =x forall x21 => f71(x) =14,Je-0. forall x21 — - Scanned with CamScanner= FUNCTIONS 2a go, Statement-2is correct, since f is a bijection. Therefore, equations f(x) = f~\(x) and f(x) = x have the same solution set. FON = fe:F(0) =3}+L x-1)? +1=x}={1,2) Hence, Statement-1 is also correct and Statement-2 is a correct explanation of statement-1. _ASAMrLE SS Shown below is the graph ofthe function f:R =O} —> R defined by, 9-x? reed fQ)= xet3 Statement-1 (A): The function f is not onto. Statement-2 (RJ: 3 € R (co-domain of f) has no pre-image in the domain of f. Ans. (©) SOLUTION Itisevident from the graph of f(x) that Range (f(2)) = R (0 + R (Co-domain). So, f is not onto. Consequently, statement-1 is true. i #43 We find that f(x) =4 9x-x° Riel pXst3 3)-5 = Sie. the pre-image of 3 is. + So, statement-2 is not true. Hence, option (c) is correct. ‘CASE STUDY BASED EXAMPLES EXAMPLE 36 In two different societies, there are some school going students including boys as well as girls, Raman forms two sets with these students as his college project. Let A ={ay, a2, a3, a4, 03) and B=0y,by,bs, by), where q's andb;'s are school going students offirst and second society respectively. Using the above information, answer the following questions: (i) The mapping f ={(ay, by), (az, b3), (a3. b2), (ag, b4), (a5,bg)} associating students of first society to the students of second society is (a) one-one but not onto (b) only onto but not one-one (©) one-one and onto both (a) neither one-one nor onto (i). The number of functions from A to B is (@) 20 @ 5* oF (a) 5P (iii) The number of functions from B to A is @) 20 () 54 oF (a) 5P, (iv) The number of one-one functions from A to B is (@) 5P, @ 5 o* @ 0 (¥) The number of onto function from A to B is (a) 240 (b) 480 (©) 1024 (a) 512 Qe Scanned with CamScanneryr FUNCTIONS 243 @ 8 (b) 6 ©O4 (a) 64 [CBSE 2023] SOLUTION (i) Ans. (a): Number of relations from B to G = 23 *? = 2, (i) Ans. (d): Number of functions from B to G = (1(G)]"8) =23 (ii) Ans. (b): We observe that f(b,) = f(b3) = g; and range (f) =G (co-domain). Therefore, f is surjective but not injective. (iv) Ans. (a): We find that set Bhas more elements than set G. So, a one-one function cannot be defined from B to G. 2 3 (v) Ans. (6): The number of surjections from BtoG is ¥° (-1)?-! r3 2c, =-2+29 =6 ral 'LE3S Raji visited the exhibition along with her family. The exhibition had a huge swing, which attracted many children. Raiji found that the swing traced a parabolic path given by y = x. SEE Aree er Fig. 2.6 Answer the following questions using the above information. (i) Let f :R > R be defined by f(x) =x? is (a) neither surjective nor injective (b) surjective (©) injective (d) bijective (i) Let f:N +N be defined by f(x) =x? is (a) surjective but not injective (b) surjective (©) injective (4) bijective (iil) Let f:{0,2, 3, .) UL, 4, 9, .} be defined by f(x) =x? is { (a) bijective (b) surjective but not injective | (©). injective but surjective (a) neither surjective nor injective (iv) Let f :N > N be defined by f(x) =”. Range of the function among the following is (a) (1,4,9,16,...} (b) {1,4,8,9, 10,..-1(c) {1,4,9, 15, 16...(d) (1, 4, 8, 16, ...) — Scanned with CamScanneroS 2.14 MATHEMATICS, ql (v) The function f :Z > Z defined by f(x) =x? is (a)_ neither injective nor surjective (b) injective (6) surjective (a) bijective SOLUTION (i) Ans. (a): We find that f(-2) = f(2) = 4 and range (f) =[0,») # R (co-domainy So, f is neither injective nor surjective. (i) Ans. (©): Let x, y € N be such that f(x) = f(y). Then, f(x) = f(y) = 7 So, f is injective. Clearly, range (f) =I, 4, 9, 16,..) # N (co-domain). So, f is not surjective, 2, 3, «.] > [1, 4,9, .-) defined by f(x) =x? is injective as well as surjective, Paya xny, Hence, it is bijective. (iv) Ans.(a): The range of f:N > R defined by f(x) =x? is (x? :x €N] =(1, 4, 9,16 (W) Ans. (a): For the function f:Z — Z defined by f(x) =x”, we find that f(-2) = f(2) =4 and range(f) =10,1, 4,9,16....} # Z (co-domain). So, it is neither injective nor surjective. LAKAMPLES9 Port Blair, the capital city of Andaman and Nicobar Islands is directly connected to Chennai and Vishakapatnam via ship route. The ships sail from Chennai/Vishakapatnams to Port Blair and vice versa, Swaraj Diveep and Shaheed Dweep are two popular tourist islands in Andaman Islands. One has to take a ferry from Port Blair to reach these islands. There are ferries that sail frequently between the three islands - Port Blair (PB), Stara Dwoeep (SwD) and Shaheed Dweep (ShD). Shown below isa schematic representation ofthe ship routes and ferry routes. Fig.2.7 X is the set of all 5 places and Y is the set of 3 places in Andaman Islands. That is, X=(C, V, PB, SwD, ShD] and Y = (PB, SwD, ShD). A relation R defined on the set X is given by, R= ((x1, 2): there is a direct ship or direct ferry from x, to xp). A function f :Y +'X is defined by, f(PB) =V, f(SwD) = PB, f(ShD) = SwD. Scanned with CamScannera FUNCTIONS 2.15 (i) List all the elements of R. (ii) Is the relation R symmetric? Give a valid reason. (iii) Is the relation R transitive? Give a valid reason. SOLUTION (i) R=((C, PB), (PB,C), (V, PB), (PB, V),(PB, SwD), (SwD, PB),(PB, ShD), (ShD, PB), (SwD, SkD), (SHD, SwD) (i) We find that (xy %) ER = Thereis direct ship ot ferry from x, tox = There is direct ship or ferry from x3 to x, => (x2, 1) €R So, Ris a symmetric relation. (iii) We observe that there is direct ship from Chennai to Port Blair and there is direct ferry from Port Blair to Swaraj Dweep. But, there is no direct ship or ferry from Chennai to Swaraj Dweep ie. (C, PB) €R and (PB, SwD) ¢ R, but (C, SwD) ¢ R. Hence, R is not transitive. (iv) The function f:y -> X can be represented by Venn diagram as shown in Fig. 28. Clearly, f :y + Xis a one-one function but itis not onto as C and ShD do not have their pre-images under f. i : 7" PRACTICE EXERCISES ” Scanned with CamScanner