Relations and Functions POINTS TO REMEMBER 1. Relation: IfA and B are two non-empty sets, then any subset R of A x Bis called relation from set A to set B. ie, R:A>B oo RCAXB For example: Let A= (1, 2], B= (3,4) Then Ax B={(1,3), (1,4), 2,3), 2, 4)} A subset R, = {(1, 3), 2, 4)} CA x Bis called relation from A to B. Similarly, other subsets of A x B are also relation from A to B. IF @,y) € R, then we write x R y (read as xis R related toy) and if (x,y) ¢ R, then we writex Ry (read as xis not R related to y). 2. Domain and Range of a Relation: If R is any relation from set A to set B then, (a) Domain of R is the set of all first coordinates of elements of R and it is denoted by Dom (R).. (6) Range of R is the set of all second coordinates of R and it is denoted by Range (R) Arelation R on set A means, the relation from A to Aie,ROAX A. 3. Some Standard Types of Relations: Let A be a non-empty set. Then, a relation R on set A is said to be (a) Reflexive: If (x, x) € R for each element x € A, i, if xRx for each element x € A. (©) Symmetric: If (x, y) ¢ R= (y, 2) € R for all x,y € A, ie, if Ry = yRx for all x, ye A. (0) Transitive: If (x, y) © Rand (y, 2) © R= (x,2) € R forall x,y,z € A, ie, ifxRy and yRz > xRz. 4. Equivalence Relation: Any relation R on a set A is said to be an equivalence relation if Ris reflexive, symmetric and transitive. 43) o a | n | ©) ze) fal c& fal x ® inal A 5, Antisymmetric Relation: A relation R ina set A is antisymmetric if @ b) ER, (6,0) €R = a=bWa,be R,oraRband bRa = a=b,Va,beER. For example, the relation “greater than or equal to, “>” is antisymmetric relation as a>bbea > a=bVab [Note: “Antisymmetric” is completely different from not symmetric.] 6. Equivalence Class: Let R be an equivalence relation on a non-empty set A. For all @ © A, the equivalence class of ‘a’ is defined as the set of all such elements of A which are related to ‘a’ under R.Itis denoted by [a] ie, fal squivalence class of “2” ix € A: (xa) eR}Forexample, Let A= (1, 2,3) and R be the equivalence relation on A given by R=((1,1),2,2), 8,3), (1,2), 1) ‘The equivalence classes are [1] = equivalence class of 1 = {x € A: (x1) € R} = (1,2) Similarly, [2] = (2, 1) so [1] = [2] and [3] = (3) 7. Tk Aisa finite set with n elements, then () Total number of relations in A (ii) Total number reflexive relations in A = 2" ~ ne) (Gi) Total number of symmetric relations in A= 2? (iv) Total number of equivalence relations in A = B,, where B, denotes the Bell numbers given by By=1, B,=1, B)=2 and B= 3 "C,B, for n>2 ne ko ™ Ie Where "= Epoe 8, Function: Let X and Y be two non-empty sets. Then, a rule f which associates to each element x € X, a unique element, denoted by f(x) of Y, is called a function from X to Y and written as: X + Y where, fox) is called image of x and xis called the pre-image of f(x) and the set Y is called the co-domain of fand fO0) = {fia}: x € X}is called the range of f 9. Types of Function: (® One-one function (Injective function): A function f: X — Y is defined to be one-one if the image of distinct element of X under rule fare distinct, ice, for every x, X, € X, fit) = fix) implies that x, = 2, (i) Onto function (Surjective function): A function f: X + Y is said to be onto function if each element of ¥ is the image of some element of x, ie, for every y ¢ Y, there exists some x € X, such that y = flx). Thus fis onto if range of f= co-domain of f (iii) One-one onto function (Bijective function): A function f: X > ¥ is said to be one-one onto, if ‘fis both one-one and onto, (é) Many-one funetion: A function f : X > Y is said to be a many-one function if two or more elements of set X have the same image in Y. ie,,f: X > Y is a many-one function if there exist a, be X such that ab but fla) = fb). 10. Composition of Functions: Let f: A > B and g : B > C be two functions. Then, the composition of fand g, denoted by gof, is defined as the function. ge gage gc: +_ = panenL 2 2B. us. gof:A+C — givenby goftx) = g(flw), Vxe A Clearly, dom(gof) = dom(f) Also, gofis defined only when range(f) c dom(g) Identity Function: Let R be the set of real numbers. A function 1: R + R such that Ta) Obviously, identity function associates each real number to itself Number of Functions: If X and Y are two finite sets having m and m elements respectively then the number of functions from X to Y is n™. Vx Ris called identity function. im! if mSn Ifn(A) = m, n(B) = n then, number of one-one function from A to B= "5 ig m>n Ie (A) then number of onto functions from A to B 0, ifm B, if there exists a function g : B-> A such that gof = I, and fog = Ie, where I, and Ip are identity functions, then f is called an invertible function, and g is called the inverse of f and it is written as f= g. . If n(A) = n, then total number of bijective maps from A to A =n! . If Aisa finite set then any one-one map from A to A must be onto function. If Aisa finite set then any onto functions from A to A must be one-one. If A is an infinite set then any one-one function from A to A not necessarily onto function and vice Vertical Line Tests tis used to check whether a telation is a function or not. Under this test, graph of given relation is drawn assuming elements of domain along x-axis. Ifa vertical line drawn anywhere in the graph, intersects the graph at only one point then the relation is a function, otherwise it is not a function. £0) yaxis pyanis \ Vertical ine = Verical tne @ © (@) Itis graph of function i, ffx) = x7 is a function. (b) Itis not the graph of function ie., f(x) =+V'x is not a function. . Horizontal Line Test: It is used to check whether a function is one-one or not. Under this test graph of given function is drawn assuming elements of domain along x-axis. If a horizontal line (parallel to x-axis) drawn anywhere in graph, intersects the graph at only one point then the function is one- one, otherwise it is many-one.vais gg) eared yas Horizontal ine Horizontal @ ay (0) ff) = 2x + 1 is one-one function. (b) fiz) = 2° is many-one function. Multiple Choice Questions Choose and write the correct option in the following questions. 1. A relation Rin set A = 1,2, his defined as R ={(1, 1), (1,2), 2,2), 3, 3)}. Which of the following otdeted pair in R shall be removed to make it an equivalence relation in A? [CBSE Sample Paper (2021-22) (Term-1)] @ a1) () (1,2) (e) (2,2) @ G3) 2. Let the relation R in the set A = {x € Z:0 y,x,yeN) WR (© R= (x,y): xy is the square number, x,y © N} (@) Reale, y):x+4y=10;x,yeN) @,y):x+y=10,x,ye N}8. The number of equivalence relations in the set {1, 2, 3} containing the elements (1, 2) and (2, 1) is [CBSE 2021-22 (Term-1)] @o 1 2 3 9. A relation R is defined on Zas: @ Rb if and only if a*—7ab + 6b* = 0. Then, Ris [CBSE 2021-22 (Term-1)] (a) reflexive and symmetric (®) symmetric but not reflexive (©) transitive but not reflexive (@) reflexive but not symmetric 10, Ifa relation K on the set (1, 2, 3) be defined by R = ((1, 2)}, then Ris INCERT Exemplar] (a) Reflexive (H) Transitive (©) Symmetric (@ None of these 11, Let Rbe a relation on A = {a, b, c} such that R ={(a, a), (b, b), (c,d, then Ris (a) Reflexive (®) Symmetric only (©) Non-transitive (@) Equivalence a=b-2,b>6}, then ICBSE Sample Paper 2021-22 (Term-1)] (@) @4)eR () G8eR () © 8)eR @@&eR 13. Let A and B be finite sets containing m and n elements respectively. The number of relations that can be defined from A to Bis 12. Let R be the relation in the set N given by R = ((a,b) (@) 2" wo (©) mn (@o 14, Let A= {3,5}. Then number of reflexive relations on A is, [CBSE 2023 (65/5/1)] (a) 2 @4 oO @s 15. The relation Rin the set (1, 2, 3) given by R= ((, 2), (2,1), (1, D)is [CBSE 2020 (65/2/1)] (a) symmetric and transitive, but not reflexive (b) reflexive and symmetric, but not transitive (©) symmetric, but neither reflexive nor transitive (d) an equivalence relation 16, Let A={1,3, 5}. Then the number of equivalence relations in A containing (1, 3) is ICBSE 2020 (65/2/1)] (a) 1 @2 3 @4 17, The function f: R— R defined as flx) = x° is [CBSE Sample Paper 2021-22 (Term-1)] (a) one-one but not onto (®) not one-one but onto (©) neither one-one nor onto (@) one-one and onto 18, Set A has 3 elements and the set B has 4 elements. Then the number of injective mapping that can be defined from A to Bis INCERT Fxemplar] (a 144 12 (©) 24 @ 64 19, LetA={1,2,3}, B= (4, 5, 6, 7and let ={(1, 4), 2, 5), G, 6)} be a function from A to B. Based on the given information, fis best defined as [CBSE Sample Paper 2021-22 (Term-1)] (a) surjective function (b) injective function _(¢) bijective function (d) function 20. The number of functions defined from (1, 2, 3, 4, 5} —- {a, b} which are one-one is {CBSE Sample Paper 2021-22 (Term-1)] @5 3 2 wo 21. The function f: R — R defined by fix) = 4+ 3 cos xis ICBSE 2021-22 (Term-1)] (a) bijective (b) one-one but not onto (©) onto but not one-one (@) neither one-one nor onto22. Letf:R — Rbedefined by flx)=, forall x, x€R.Then,fis (CBSE 2021-22 (Term-1)] (@) one-one ©) onto (6) bijective (@) not defined " 23, The function f: N — Nis defined by f=] , grifniseven +1 itnisodd [CBSE 2021-22 (Term-1)] The function fis (a) bijective (8) one-one but not onto (©) onto but not one-one (4) neither one-one nor onto Answers 1.6 2@ 3@ 40 5. (d) 6. () 20 8. (0) 9. (d) 10. ® @ 2© 3B. (a) 4. ® 15. (a) 16. () 17. @) 18. (c) 19. @) 20. @) 21. @) 22. (d) 23. (¢) Solutions of Selected Multiple Choice Questions 1. Given relation R on set A = {1, 2,3) is, R={, 0,02, 228,31 From the given relation R if we removed (1, 2) then R= (1), 2,2), G,3)} is an equivalence relation in A. Hence, ordered pair (1, 2) should be removed. Option (b) is correct. 2 cs [sre A: |x-1| isa multiple of 4) = {1,5,9} Option (a) is correct. 4. Given, aRb = aisbrotherofb This does not mean that b is also a brother of a because b can be a sister of a. Hence, Ris not symmetric. Again, aRb- = aisbrotherofb and bRe = bis brother of c. So, ais brother of c Hence, R is transitive. <- Option (b) is correct. 5. Number of equivalence relation in A = By 2 =B,,,= 2 GB, net = Cee ="C,By+?C,B, =1424225 [ Option (a) is corzect 6. ForlmeL if(L me R > lim > mil > (mDeR Ris symmetric. ©. Option (#) is correct.10. 1 2 A relation R is defined on N by R = {(x, y) : xy is the square number, x, yeN | Let xeN => (x,x):xx x =x? which is a square number eN > x) eR :. Ris reflexive on N. Option (¢) is correct. We have total possible pairs = {(1, 1), (1, 2), (1,3), (2,1), (2,2), 2,3), 3,1), 2), 3 The smallest equivalence relation R, containing (1, 2) and (2, 1) is {(1, 1), (2,2), 3,3), (1,2), (2 1) Now, we are left with any 4 pairs namely (2, 3), (3, 2), (1,3) and (3, 1) If we add any one, say (2, 3) to R, then for symmetry we must add (3, 2) also and for transitivity wwe are forced to add (1, 3) and (3, 1). Thus the only equivalence relation bigger than R, is the universal relation. This shows that the total number of equivalence relations containing (1, 2) and Q 1)istwo. Option (¢) is correct. We have a relation R defined on Z as aRb if and only if a” - 7ab + 60° = 0. Reflexive: LetaeZ Itis reflexive. Symmetric: Leta, beZ and (a, b)eR aRb =>? —7ha + 6 = ‘but bRa because #? - 7ha + 6a” # 0 (may or may not be zero) 2. Tt is not symmetric Hence, R is reflexive but not symmetric :. Option (@) is correct. R=(Q,2hA= (12,3) Clearly R is neither reflexive nor symmetric. As (1,2) € Rbut 3 (2,6) © Rforb © A such that (1,b) ER Hence Ris a transitive relation on A. <. Option (b) is correct. R={(@,0),(0,0), (4) Reflexive: Let (x, 2) € R Vx A So, R is reflexive. Symmetric: For (x,y) © R, So, Ris symmetric. Transitive: For (x,y) € R there is no (y,z) € R such that (x, z) € R so Ris transitive. Hence, R is an equivalence relation (VER Ye yeA <. Option (d) is correct a=b-Zandb>6 > ©8eR - Option (¢) is correct.4. 16. 17. 18. 19. 20. hs Ifa set containing n elements then number of symmetric relations in A = 2"°~" Here n(A) =2 :. Number of symmetric relations = 2”°~? . Option (b) is correct. . Given zelation R in the set {1, 2, 3} given by R = {(1,2), (2, 1), (2, 1)] is symmetric and transitive, ‘but not reflexive because (2,2) € R and 3,3) €R Option (a) is correct. Given set A ={1,3,5) We have, smallest equivalence relation R, = ((1, 1), (3,3),(5,5), (1,3), Dh If we add (3, 5), then we have to add (5, 3) also, as it is symmetric. * Second equivalence relation will be R= (1,3), (3,1), 1, 1), GB, 3), (5, 5), 3, 5), 5, 3), 5), 0} Hence, number of equivalence relations containing (1, 3) is 2 <. Option (b) is correct. Lot fly) =flry) ¥ xm BR (domain) = = yen = fisone-one Let fix)= =yVye R (co-domain) i = xsyseR (domain) Every image ye R (co-domain) has a unique pre image in R (domain). = fisonto. Hence, fis one-one and onto. Option (a) is correct ‘The total number of injective mappings from the set containing n elements into the set containing melements is "P,. So here itis “Ps = 4! = 24. Asevery pre-image x € A has a unique image y € B = fis injective function. Option (b) is correct. Let X= {1,2,3,4,5) and ¥ = {a,b} Number of functions defined from ft X + Y which are one-one is zero (0), because number of elements in set X is 5 and number of elements in set Yis2 = n(X) > n(¥) = No one-one function possible. :. Option (d) is correct. Given function f: R + R defined by f(x) = 4+3 cos x One-one: Let x, =O and x) =2n iemex > cos x1 =¢080=1 and cos x) = cos 2x =1 608 x4 = 608 X 2 4+3cosx, =4+3 008% = fl) = flea) Itis not one-one. Onto: As we know that for all xeR, we have 15 cosx $1 3-3 <3cosx 53.315 443cosx<7 S-1s fy <7 >Rangeoff=[1,7]Range of f# co-domain of fF fis not onto. Hence, fis neither one-one nor onto. :. Option (d) is correct. 22, Given function R > Rbe defined by fix) 1, for all xe Clearly, when x=0eR fo) (~) (not defined) <. Option (€) is correct. ntl 2’ if nisodd 23. Given function f: Ns Nis defined by for)=} | Fg if niseven One-one: 141 Letu=1 (odd) = fil)= 2 and, 1 (even) > id= Clearly, itis not one-one function. Onto: For every value of n whether it is even or odd fine N Co-domain = Range Itis onto, Hence, function fis onto but not one-one. Option (¢) is correct. Assertion-Reason Questions The following questions consist of two statements—Assertion(A) and Reason(R). Answer these questions selecting the appropriate option given below: (@ Both A and Rare true and R is the correct explanation for A. () Both A and Rare true but R is not the correct explanation for A. (© Ais true but R is false. @ Ais false but R is true, 1, Assertion (A) : Let R be the relation on the set of integers Z given by R = {(a, #) :2 divides (ab) is an equivalence relation Reason (R) : A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. 2. Assertion (A) : Let f:R — R given by f(x) = x, then fis a one-one function, Reason (R) : A function g: A+ Bis said to be onto function if for each b ¢ B,3.a € A such that 9a) =b, 3. Assertion (A) : Let function f: {1, 2, 3} (1, 2, 3} be an onto function. Then it must be one-one function,Reason (R) : A one-one function g: A > B, where A and B are finite set and having same number of elements, then it must be onto and vice-versa. 4, Assertion (A): Letf: R + R such that f(x) = 2°. The function fis an onto function. Reason (R) : A function g: A> Bis said to be onto function if ¢(A) = B ie, range of g = 5. Assertion (A): The number of all onto functions from the set (1,2, 3,4, 5} to itself is 5! Reason (R) : Total number of all onto fuinctions from the set {1,2,3,...,t] to itself is nt. 6. Assertion (A): Let f: R > R given by 1 if x>0 fay= lal o if x=0 isabijection. 1 if x<0 Reason (R) : A function g: A> B is said to be bijection if it is one-one and onto. 7. Assertion (A): Let A = {1, 2,3) then define a relation on A as R= {(1,2), (2, 1)}, Ris not transitive relation, Reason (R) : Azrelation R defined on a non-empty set A is said to be transitive relation if (a,b), GOER= @peR Answers 1 @ 2 3. @) 4 5. (a) 6) 2@ Solutions of Assertion-Reason Questions 1 Reflexivity: Clearly (a, a) € Rasa which is an even integer and is divisible by 2. So, itis reflexive. Symmetry: Let (@, b) € R > 2 divides (a6) = 2divides—(a—) => 2dividesb—a = (b,a)eR So, itis symmetric. Transitivity: Let (@ b) Rand eR => 2 divides a~b and 2 divides b - So, itis transitive. = 2dividesa—b+b- a-c = @ceR = Relation R is an equivalence relation. So A is true Clearly R is also true and gives the correct explanation of A. Hence option (a) is correct. Let xy %, € R such that fix, fle) = x=% = fisa one-one function. Clearly A is true and R is also true. But R does not give correct explanation of A Hence option (b) is correct. Suppose fis not one-one function. ie,3 two elements say 1 and 2 in the domain mapped to a single element of the co-domain. Then 3 can be mapped to any one of two remaining element. So, range set has only two elements.=> RY) {1,2,3} which contradict the fact that fis an onto function. Thus f must be a one-one function. So, A and R gives the correct explanation of A. Hence option (a) is correct. 4. Clearly R(p = [0,) Here R (f)# R = (-0,«0) = fis not an onto function. So, A is false but R is true, Hence option (d) is correct. One-one 1 can map to any one of 1,2, 5ie., 5 ways. After that 2 can be mapped to any four of the remaining 4 elements, After that 4 can be mapped to remaining three elements. Now 4 can be mapped to remaining two element. And 5 can be mapped to remaining one element. Total number of one-one functions = 5 x 4x3x2x1 We know that total number of onto map on a finite set = Total numbers of one-one map = 5! :. Total number of bijective map = 5! So A is correct statement. Also R is a correct and gives correct explanation of statement A Option (a) is correct. 6. f: RR such that 1 if x>0 fx)=} 0 if x=0 Hl if x<0 For 1,2 R (domain) f@)=1=f2) but1 #2 = _fisnot one-one. Also R() = (-1,0, 1] # R (Co-domain) = _fisnotonto. ‘fis neither one-one nor onto. > fisnot a bijective map. So A is not a true statement. But R is the correct statement and R does not gives correct explanation of A. <. Option (@) is correct. 7. Wehave A= (1,2,3), R=(,2,2,0) (1,2), @,1) € Rout (1,1) ¢R = Risaot transitive. So statement A is correct. Also statement R is correct and gives correct explanation of statement A. <. Option (a) is correct.Case-based/Data-based Questions Each of the following questions are of 4 marks. 1. Read the following passage and answer the following questions. A general election of Lok Sabha is a gigantic exercise, About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever. ONE -. ONE - ELECTION, FESTIVAL OF DEMOCRACY GENERAL ELECTION- 2019 JATION Let Ibe 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 I as follows: R= (Vj, V2): Vi, Va € Land both use their voting right in general election 2019), (@ Two neighbours X and Ye I. X exercised general election - 2019. Is XRY? Give reason. (if) Mr.X’ and his wife “W” both exercised their voting right in general election -2019. Is it true that XRY and YRX? Give reason, (iii) (a) Three friends F,, F, and F, exercised their voting right in general election- 2019. Is it true that FLRF,, FRF, = F,RF;? Give reason. OR (ii) (b) Mr. Shyam exercised his voting right in General Election ~ 2019, then find the equivalence class of Mr. Shyam. Sol. We have a relation ‘R’ is defined on Las follows: R={V,, Vo}: Vy Vz € Land both use their voting right in general election - 2019}. (@ Two neighbours X and ¥ € I. Since X exercised his voting right while ¥ did not cast her vote in general election ~2019 Therefore, (X,Y) € R (ii) Since Mr. "X’ and his wife 'W both exercised their voting right in general election — 2019, -. Both (X, W) and (W, X) € R. (ii) @ Since three friends F,, Fy and F, exercised theit voting right in general election - 2019, therefore (F,,F,) © R, (Fy, F3) © Rand (Fy, F;) eR OR (ii) () Mr. Shyam exercised his voting right in General election -2019, then Mr. Shyam is related to all those eligible voters who cast their votes. is voting right while Y did not cast her vote in2. Read the following passage and answer the following questions. Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set (1,2,3,45,6]. Let A be the set of players while B be the set of all possible outcomes, A={S,D), B= (123456) [CBSE Question Bank] (d Let R: B— Bhe defined by R ={Gy, y): is divisible by x). Verify that whether R is reflexive, symmetric and transitive. (id) Raji wants to know the number of functions from A to B. Find the number of all possible functions. (i) (a) Let R be a relation on B defined by R = ((1, 2), 2,2), (1,3), 8,4), 8, 1), 3), (5, 5)). Then Ris which kind of relation? OR (ii) (b) Raji wants to know the number of relations possible from A to B. Find the number of possible relations. Sol. (@) Given R: B+ Bbe defined by R= {(x, v):y is divisible by xb Reflexive : Let x € B, since x always divide x itself @xeR It is reflexive. Symmetric: Let x,y © Band let (x,y) € R. = yis divisible by x. == k,, where fy is an integer. xl = yg Finteger WwxeR It is not symmetric. Transitive: Let x,y,2€ Band let (ay) @R = Zk, where kis an integer. and, (y,z)¢R > e k,, where ky is an integer. edi, kGnteger) > GER It is transitive. Hence, relation is reflexive and transitive but not symmetric.(ii) We have, A={S,D) = m(A)=2 and, B={1,2,3,4,5,6) > (B)=6 Number of functions from A to Bis 6° = 36. (id) (@) Given, Rbe a relation on B defined by R= ((1,2), (2,2, ,3), 3,4), 8,1), 4,3),6,5)} Ris not reflexive since (1, 1), (3,3), (4,4) €R Ris not symmetric as (1, 2) € R but (2,1) ¢ R and, Ris not transitive as (1, 3) ¢ R and (3, 1) € R but (1,1) ¢R Ris neither reflexive nor symmetric nor transitive. OR (i) (= n(4)=2,m(B)=6 > (4x B)=12 Total number of possible relations from A to B = 27 3. Read the following passage and answer the following questions. 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 which are parallel on the ground and R be a relation on L. [CBSE Question Bank] ( Let relation R be defined by R = ((L, L,): L, | L, where L,, LL}. What is the type of relation R? (id) Let R= ((Ly La): Ly 1. Ly where Ly, Ly L}. What is the type of relation R? (iif) (a) Check whether the function f:R — R defined by fix) = x ~ 4 is bijective or not. OR (iid) ©) Let f: RR be defined by fix) = x + 4. Find the range of flx). Sol. (?) Given relation R defined by R= {(Ly 12): Ly || Ly where Ly, 1, € L} Reflexive: LetyeL > Ly |i; > (Uy Ly eR Itis reflexive. Symmetric: Let Ly, L, ¢ Land let (Ly, L,) eR. Shik > Lilly > Qyby)eR «. Itis symmetric. Transitive: Let Ly,L,,L,€L. and, let (Ly,1,) €R and (LyL;) ¢R Ll and LIL, > Lill, > Gy) eR It is transitive. Hence Ris an equivalence relation.(ii) Given relation R defined by R = ((L,, L,):Ly Ly whete Ly, Ly € L} Reflexive: Since every line is not perpendicular to itself = (yhjeR Itis not reflexive. Symmetric: Let Ly, 1, ¢ Land (L,,1,)¢R Sl, => Lik >(bh)erR Itis symmetric. Transitive: Let Ly, Ly,L,€L and, let (Ly,1;) © R and (Ly,1,) €R L, LE, and In 11, > htl => ULjeR Iti not transitive. Hence relation R is symmetric but neither reflexive nor transitive. (ii) @ Given function f:R—R defined by flx) =x-4 Injective: Let xy, € Rsuch thatxy # x2 Sy 4 ey 4 = fly ¥ flay) Itis injective. Surjective: Lety=x-4 = reyt4 For every y © R (co-domain) there exists x = y +4 € R (domain). ie, Co-domain = Range It is surjective. Hence given function is bijective. OR (iii) (b) Given function f:R +R defined by fx) =x+4 Tet y=ft) = yaxtd = x=y-4 Fory ¢ R (co-domain), 3 x=y-4e R (domain) such that jx) = R Range of f(x) is R (Set of real numbers). 4. Read the following passage and answer the following questions. ‘An organization conducted bike race under two different categories- Boys and Girls. 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,, by, bal and G = {g;, g3], where B represents the set of Boys selected and G the set of Girls selected for the final race. [CBSE 2023 (65/5/11( How many relations are possible from B to G? (i) Among all the possible relations from B to G, how many functions can be formed from B toG? (iif) (a) Let R: B+ B be defined by R = ((x, y) :x and y are students of the same sex}. Check if Ris an equivalence relation in B or not. OR (iii) (6) A function f: B > G be defined by f= {(b,, 1), (by, $2), Ws, &:)}- Check if fis bijective, Justify your answer. Sol. B= [by by, bs) G = (gy So) (8) = 3, n(G) =2 n(B x G) = n(B) xm(G) =3 x2 (@ Number of relations from B to G-= (ii) Number of functions from B to = (n(G)"=2 =8 (i) @ R:B—B, R={(x, y)| x,y students of same sex} Reflexive: (xy x)eRVxeB =| Ris reflexive. Symmetric: Let (x,y) eR => —_-xand yare of same sex. => —_yand x are of same sex. = WxveR Transitive: Let (x,y) and (y,2) €R => xand y are of same sex. and y and z are of same sex. > xand z are of same sex. = @&2)eR > Ristransitive. Hence R is reflexive, symmetric and transitive. . Ris an equivalence relation in B. oR Gi) © f= {by 81), by 82), bs 0) Fle) = &1 and flbs) = 8 => —_flby) = flb,) but by # by As b, and b; represents two different boys. => _fisnotone-one. = —_fisnota bijective map. 5. Read the following passage and answer the following questions. Dhanush wants take test of his son Amitis a student of class XI. Dhanush said to Amit, “Observe the two functions fix) and g(a) carefully” f: R > R,g: R > B such that‘The Dhanush asked some questions related to fix) and g(x) and Amit answered correctly. Write the correct response given by Amit of the following questions, (® Check whether fix) is bijective or not. (i) Check whether g(x) is bijective ornot. Sol. ()f: R > R such that fix) =x One-one: Let x3) € R (domain) such that fo) > nen = fisone-one Onto: Lety © R (Co-domain) such that fey > ey Now fix) = fly) = So fory © R (Co-domain) 3 such that f(z) =y ye RB (domain) > fisonto. Asfisone-oneand onto. = f isbijective. i) Wehave g: RB —> R such that g(x) =x One-one: 1,-1€ R (domain) such that g(1) = 1, g¢1) =1 ie, g(l)=g(-1) butle-1 = gisnotone-one. Onto: s@)=220VreR RG) =[0,«0)# B (Co-domain) = gisnotonto. ie, g is neither one-one nor onto. CONCEPTUAL QUESTIONS 1. Let A = (1, 2, 3, 4h. Let R be the equivalence relation on A x A defined by (a, b) R (c, d) iff a+d=b+ 0c Find the equivalence class [(1,3)] [CBSE Sample Paper 2018] Sol [CL 3)= Ue ye Ax Aix +3=y+1l= (0,9) © Ax Ary—x=2) ((1, 3), (2, 4)) 2 If R= Mx, wix+ 2y = 8) isa relation on N, write the range of R [CBSE (AD) 2018) Sol. Given: R= (x, y)sx+2y=8} x+2y=8 = SSB whene=6,yetix= Range={1, 2,3)3. State the reason for the relation R in the set {1, 2, 3) given by R = ((1, 2), (2, 1)} not to be transitive, ICBSE Delhi 20111 Sol. Ris not transitive as (1, 2) € Rand (2,1) © Rbut (1,1) eR [Note: A relation R ina set 4 is said to be transitive if (a,#) « Rand (b,) ER > (a,c) RV a,b,c R] 4. Let R=((a,a°):a isa prime number less than 5} be a relation. Find the range of R. (CBSE (F) 2014) Sol. Here R= ((q,a°):a isa prime number less than 5) => R=(28), B27) Hence range of R = (8, 271 A relation R in the set of real numbers R defined as R = {(a, b): Va = bhis a function or not. Justify. [CBSE Sample Paper 2021) Sol. No. R={G@,): ya =} not the function because y/a does not exist for all a (~ 4,0) = Image of all elements of domain does not exist. 6. An equivalence relation R in A divides it into equivalence classes A,, Ay, Ay. What is the value of A,UA,UA, and A,.A,0.A,? [CBSE Sample Paper 2021] Sol, A,UA,UA,=Aand 4,04,NA,=6 7. A relation Rin $ = {1, 2, 3} is defined as R = {(1, 1), (1, 2), 2 2), (3, 3)). Which element(s) of relation R be removed to make R an equivalence relation? Sol. (2, 1) because if (1,2) € R then for being symmetric (2, 1) should belong to R. 8. How many reflexive relations ate possible in a set A whose 1t(A) = 3. Sol. Number of reflexive relation 2° ~" = 2-3 = 2° reflexive relations 9. IfX and Yare two sets having 2 and 3 elements respectively, then find the number of functions from X to ¥. Sol. Number of functions from X to Y = 3?= 9. Very Short Answer Questions 4. Check if the relation Rin the set R of real numbers defined as R =((a,}):a- acbthenbta > (b,a€R It is not symmetric. f re: Leta, b,c © B (set of real number) i) (i) Tran: @GbeR = ach and) R = => bee From (i) and (ii), we have acc = @oeR Itis transitive. a ICBSE Marking Scheme 2020 (6515/1))2 Sol. Sol. Sol. Write the inverse relation corresponding to the relation R given by R = {(x, y:x € N,x<5,y=3h Also write the domain and range of inverse relation. Given, R= [(x,y):xeN, x<5,y=3} = R=(,3),23),,3),4,3)) Hence, required inverse relation is R*={G, 0,6,2), 8,3), 8,4) = (3}and Range of R™ = (1, 2,3, 4} A function fi A — B defined as flx) = 2x is both one-one and onto. If A = {1, 2, 3, 4}, then find the set B. ICBSE 2023 (65/1/1)) Domain of R |. Given a function f: A B defined as flx) = 2 is both one-one and onto. ifA=(1,2,3,4) sll) =2% 1=2,fQ)=2%2=4, 3) =23=6and fd) (2,4, 6, 8) Consider /:R, — [4, 0) given by fla) = x7 + 4. Show that fis invertible. ICBSE (AD) 2013; (F) 2011) One-one: Letx;,x2€R, (Domain) fxs) > xfedexZed = af > en [+ x, xz are +ve real number] Hence, fis one-one function. Onto: Let y € [4, =) such that v=fa) VxeR, [set of non-negative zeals] => yesed = oxnyy-4 [+ xis + ve real number] Obviously, Vy ¢ [4, «), xis real number ¢ R_ (domain) ie, all elements of codomain have pre image in domain, = fis onto, Honce, fis invertible being one-one onto. Letf: R-{-$}~R bea function defined as flx) = 5.7; Show that, inf: R-{-$} — Range of fis one-one and onto, [CBSE 20171C)] 3} Let, x R-{ 4x, 3x44 3x +4 Now flay) =f) > 12x, x,416x,= 12x, x, + 16x, => 1xy=16y > 4=% Hence fis one-one function. Since, co-domain fis range of f So, f:R- fH} —> Range of fis one-one and onto function.6. Sol. Sol. Sol. [x-1| What is the range of the function f(x) = 2 [CBSE Delhi 2010) , [x11 Given f@) = Ty (-1) if x-150 of x>1 =(@=1) if x-1<0 or x1, fle)" 1, i) ¥x<1, f@)= Let f:R~R be the function defined by f(x) = y—Z5gy, ¥ x€ R. Then, find the range of f INCERT Exemplar] 1 Given function, fey= zoey VIER it ¥* FHcose = Qy-yoosr=1 > -ycosx=2y-1 = =o = = cosx=2 ¥ = acts 1 y = = 18753 So, range of y Prove that the function fis surjective, where f: N—> N such that met ifmisodd 3” ifniseven Is the function injective? Justify your answer. ICBSE Sample Paper 2023] Let y € N(codomain). Then 3 2y € N(domain) such that 2 fey= y. Hence, fis surjective. 1 1,2 © N(domain) such that f(1) = Hence, fis not injective. a [CBSE Marking Scheme Sample Paper 2023] Short Answer Questions Check whether the relation R defined on the set A= {1, 2,3, 4,5, 6}as R={(a, b):b=a+ this reflexive, symmetric or transitive. {CBSE 2019 (65/2/1))Sol. R={(,2),2,3),G,4), 45), 6,6) Sol. ForleA,(1.1)¢R = Ris not reflexive 1 For 1,2 ¢ A, (1,2) ¢ Rbut (2, 1) ¢ R > Risnot symmetric 1% For 1,2,3€ A,(1,2),(2,3) € R but (1,3) ¢R = Ris not transitive % ICBSE Marking Scheme 2019 (65/2/1)] Detailed Solution: Given relation R defined on the set A = (1,2, 3,4,5,6] as R={(a, b):b=a+1) Now, Reflexivity: Leta eA Wehaveasat1 > (aaeR :. Itis not reflexive. Symmetric: Leta =1andb=2 ie. abeA bea+l > 22141 = WHER butazb+lasiz2+1 > (a)eR Itis not symmetric. Transitive: Let a,b,c © A Now, if @b)eR = bea+l ol) and (eR > cab+1 (ii) From (i) and (ii), we have (a+1+1=0+2 > cxat2 > @OeR Isis not transitive. Hence, relation R is neither reflexive nor symmetric nor transitive. Show that the relation R on the set Z of all integers, given by R = {(a, b) :2 divides (a—b)} is an equivalence relation. [CBSE 2019 (65/3/1)] Given relation R = {(a, b) :2 divides (a -5)} on the set Z of all integers Reflexive: Leta ¢ Z Since (a—a) = 0, which is divisible by 2 ie, (@, a) € R Ris reflexive. Symmetric: Leta, b € such that (a,b) €R N > (a-b)is divisible by 2. = -(@-b)is also divisible by 2 > (b-disdivisibleby2 > (b,a)eR ie, @beR > &aeR Ris symmetric. Transitive: Leta, b,c ¢ Z such that (a,6)€R => (a—b)is divisible by 2 Leta—b = 2k, where k, is an integer ld) and (b,0)¢R = (b-c)isdivisibleby2 = b-c=2k where ky isan integer (i Adding (i) and (fi), we have (@-)+b-)=2 +h) > a-c=2(hy+k) = (a-o)is divisible by 2 = @oeERRis transitive. ‘Thus, R is reflexive, symmetric and transitive. Hence, given relation R is an equivalence relation. 3. Show that the relation S in the set A= (x ¢ Z:0 |a-a| = Owhichis divisible by 3 > Gaes Itis reflexive relation. Symmetric: Let a,b € AThen (a,b) eS > |a-b| is divisible by 3. = |b=a| is also divisible by 3. > Gaes Itis symmetric relation. Let a,b,c € A Then (@b) €S = |a-b] is divisible by 3. = a—b=+3k, where kis an integer (,c)€$ = [b-c| isdivisibleby3. = bc = 4 3ky, where ky is an integer a-C=a-b+b-c=43k, +3k, = 43k, +h) => |a-c| is also divisible by 3. > @oes Itis transitive relation, Hence, the relation $ is an equivalence relation, 4. Show that the relation Ron IR defined as R = (a, 6) : a |a-a| = Owhichis divisible by 3 > Gaes Itis reflexive relation. Symmetric: Let a,b € AThen (a,b) eS > |a-b| is divisible by 3. = |b=a| is also divisible by 3. > Gaes Itis symmetric relation. Let a,b,c € A Then (@b) €S = |a-b] is divisible by 3. = a—b=+3k, where kis an integer (,c)€$ = [b-c| isdivisibleby3. = bc = 4 3ky, where ky is an integer a-C=a-b+b-c=43k, +3k, = 43k, +h) => |a-c| is also divisible by 3. > @oes Itis transitive relation, Hence, the relation $ is an equivalence relation, 4. Show that the relation Ron IR defined as R = (a, 6) : a Ta veletton iW tuua owty ab Bry: pst 309 eg (Topper’s Answer 2019) 5. Check whether the relation R in the set N of natural numbers given by R ={(a, b): a is divisor of b} is reflexive, symmet ‘or transitive. Also determine whether R is an equivalence relation. [CBSE 2020 (65/2/1)] Sol. Given relation R on the set N of natural number given by R>{(@,b): ais divisor of b} Reflexive: Let a€N We have a is divisible by a itself : aRaie,(a,a) ER It is reflexive. Symmetric: Let a,b ©N @Rb= ais divisor of b. = b=ka, where kis any positive integer. 1 1 > Er PE? Pr EF any integer = bisnotdivisor ofa. > (a) CR <. Itis not symmetric, Transitive: Let a,b,c © R @Rb = aisdivisorofh. => — b=ka @ where ky is any positive integer and, bRe = bisdivisor of c ob (i) where ky is positive integer From () and (i), we have c#kXka > c=kka c > ok, Se ositive integer > aisdivisorofe > — (@)ER = aRe Itis transitive. Hence, R is not an equivalence relation. 6. Let A= (1,2,5,.., 9} and R be the relation in A x A defined by (a, b) R (c,d) (a,b), (c,d in A x A. Prove that R is an equivalence relation and also obtain the equivalence class (2,51 INCERT Exemplar] atdeb+cforSol. Sol. Lf @)= |x| = Given that, A= (1, 2,3,...,9] and (a, 8) R(¢, d) fa +d=b+c for a,b) € Ax Aand (c,d) eAx A. Reflexive: Since (a, 6) R(a, B) as atb=beavabed So, Ris reflexive, Symmetric: Let (a, b) R(c, d) then a+d=b+c +a (a) Rab) > c+ So, Ris symmetric. Transitive: Let (a, #) R(c, d) and (¢, d) R(e,f) then a+ +cande+fed+e > a+d=b+candd+e=c+f > @HRE/) So, R is transitive Hence, R is an equivalence relation Now, equivalence class containing [(2, 5)] (x,y) | 2+y=5+x} =lzy |y-r=3) = {(1,4), (2,5), 3, 6), 4 7), , 8), (6, 9). Show that the modulus function f:R —R given by f = |x|, is neither one-one nor onto, Where |x| is.x, ifis positive or 0 and |x| is, if xis negative. x ifx20 x, fx <0 ‘One-one: Let x; = 1, x) =—1 be two elements belongs to R ‘fx,) =f) = [1] and fl) =f) =- Ca) = fix) = flr) for x, # = ffx) isnot one-one. 1 = |x| =-1eR, whichis not possible. = fix)isnot onto. Hence, fis neither one-one nor onto function. ~{3}, B= R-{1}. If f:A > Be defined by ftx)==3, v xe A. Then, show that fis [NCERT Exemplar] Given that, A=R-(3},B=R-{1} f:A— Bis defined by f(s) For injectivity: Let fx) WEA a2 _ 4-2 fie) > BES > (1 — 2)@q—3) = (2-2) — 3) > 4.2)7 Bx Dey + 6 = 4) —3ty— 2x + 6 > = 3x, = 2p = “Bx, - Dey > =n So, fix) is an injective function.For surjectivity: Let = x-2eay-3y 2-3y => = ay 3 = xf eavyes [codomain} So, fx) is surjective function. Hence, f(x) is a bijective function, 9. Let A = R-(2} and B= R- {1}. If f: A Bis a function defined by ftx) _ show that fis E 2019 (65/4/1)] one-one and onto. Sol. Letx,, x, ¢ R- {2} such that f(x,) = f(x) feu od = qo? yee a Sh Dy 4,42] xh 2-4, 42 1 > Hem So fis one-one, % For range let fx) = y x-1 = 4 1 y Range of f= R - {1} = co-domain (B) = fisonto. % [CBSE Marking Scheme 2019 (65/4/1)] Long Answer Questions 1. Let N denotes the set of all natural numbers and be the relation on N x N defined by (a, 8) R (6, d) if ad(b + ¢) = be(a + d). Show that R is an equivalence relation. ICBSE Delhi 2015] [CBSE 2023 (65/4/1)1 Sol. Here R isa relation defined as R= ((a,b), (6, A] sad +o) =be(a+ a} Reflexivity: By commutative law under addition and multiplication beasath VabeN ab = ba VabeN ab(b + a) = ba(a +b) VabeN > (a,b) R(a,b) Hence, Ris reflexive. Symmetry: Let (a,b) R (cd) (8) Rd) = adlb +c) = bela + d)Sol. = bola + d) = ad(b +0) => cb(d + a) = da(c + b) [By commutative law under addition and multiplication] = ARB) Hence, R is symmetric Transitivity: Let (a, b) R (c,d) and (c,d) R(e,f) Now, (a,b) R(,d) and (c,d), ) = adlb+c)=be (a +d) and ofld +e) = dec +f) = bee _atd | dee _ ctf he = ad 84g = = dh amend fie Adding both, we get Ag Bay Be > pe s fra of > fbte=bar) = @HRE/ c,d#0] Hence, Ris transitive. In this way, R is reflexive, symmetric and transitive. Therefore, R is an equivalence relation. Determine whether the relation R defined on the set R of all real numbers as R = {(a, b): a,b eR and a~b+ v3 € S,where Sis the set of all irrational numbers}, is reflexive, symmetric and transitive. (CBSE Ajmer 2015] Here, relation R defined on the set R is given as R=((a,b):a,h¢ Randa-b+ V3.5} Reflexivity: Let a € R (set of real numbers) aes Now, (a, a) © Rasa-a+ ¥ ie, Ris reflexive. Symmetry: Taking a= y3 and b=1, wehave (a be Rasa—b+v3 = V3-14+ V3 =2v3-1ES But b-aty3~1-y3+/3-128 = @aeR As (a,b) € Rout (ba) # RK . Ris not symmetric. Transitivity: Taking a=1,6= /2ande= /3 (@,b)e Rasa—b+/3=1-y2+V3ES > @ HER b-cty3=V2-vV3+v3=V2E5 = ER But a-c+y3~1-/3+/3-1E5 = |@OER ‘As (a, b) and (c, d) belongs to R but (a, c) does not belong to R. <=. Ris not transitive. Hence, Ris reflexive but neither symmetric nor transitive. Show that each of the relation R in the set A = lx ¢ Z:0 @xeRVxed Ris reflexive. Symmetric: Let, y eA and (x,y) €R > |x-y| isa multiple of 4 or x-y=+4p — {pisany integer} > y-xr=F4p = ly-x|isamultipleof4. = (y,x)eR > Ris symmetric. Transitive: Let x,y,z © 4, (x,y) € Rand (y,2) eR |x-y| is multiple of 4 and | y-z |is multiple of 4. xy is multiple of 4 and y-z is multiple of 4 (x-y) + (y-2) is multiple of 4 = (x-2) is multiple of 4 |x-2| is multiple of 4 (2)eR > Ris transitive. So, Ris an equivalence relation. Let B be the set of elements related to 1 B=(aeA: |a-1| is multiple of 4} = B={1,5,9) [as |1-1] <0, [5-1 |=4, 19-1] =8] (i) R=(@,):a=b} Reflexive: Letx eA as =x > (xeR > Risreflexive. Symmetric: Let x,y € A and (x, v) eR = y= yex > WX > R Ris symmetric. Transitive: Let x,y,z A and let (x,y) € Rand (y,2) €R = xeyandy=z => x= Ris an equivalence relation Let C be the set of elements related to 1. C= (we Aja=t= fi). vuubuUY => (&2)eR = Ristransitive, Check whether the relation R in R defined by R = {(a, b) : a (AER Hence, R is reflexive. Transitive: Let A, B, C € P(X) such that (A,B), B,.C)eR > AcBBcC DACC2AOeER Hence, R is transitive. Symmet 6, € P(X) such that § X. Hence, (g, X) eR. But, X4, Which implies that (X, 4) ¢ R. Thus, R is not symmetric. 6. LetNbe the set of natural numbers and R be the relation on Nx N defined by (a, 8) R (c,d) iff ad = be for all a,b, ¢,d & N. Show that Ris an equivalence relation. [CBSE Sample Paper 2023] {CBSE 2020 (65/1/1)] Sol ae Cab) (Ga) Te adebe | for veMevve ter Gere ay ON i : :__[[fee gyemenie lek _abed EN “Quon Mor _CaWDR CA? and Coa nlePs 3 ad=be Len éoTng telason ts Kongiive Ag te xy isan irrational number = v.xis also an irrational numberSol. Sol. = (v.2) eR Itis symmetric. Transitive: Let x,y,z € Ruch thatr=Ly= V2, if(%,y)eR => xyisan irrational number ie, 1x7 '2 is an irrational. and, (y,2)€R => yz = v2x3=3V2isan irrational. Now, (1,2) > xxz=1x3=3 @ eR Itis not transitive. Hence, R is symmetric but neither reflexive nor transitive. Consider f: R, > [-9, «) given by fix) = 5x" + 6x9. Prove that fis invertible. [CBSE Allahabad 2015] To prove fis invertible, itis sufficient to prove fis one-one onto. Here, fx) = 5x +6x—9 One-one: Let x, € R., then f%) = fx) = Bat 6x, -9= 5x2 + 6x,-9 bx? +6x, —5x— 6x, =0 = 5x2 -xJ)+6x,-x) = ate) t6% =O — (%,-x,) Gx +5x,+6)=0 = [e 5x, +5x, +60] = 45%, ie, Fi8 one-one function. Onto: fea) Sr?+6r-9=5{22+ 202% =5|tezerx As fis both one-one and onto. = fis bijective. Hence, fis one-one onto function, ie, invertible. Consider f: R, > [4, «) given by f(x) = x7 + 4. Show that fis invertible. [CBSE (AD) 2013; (F) 2011] One-one: Let x;,x2 € R, (Domain) fx) = fox)[. x, are +ve real number] Hence, fis one-one function. Onto: Let y € [4, <0) such that yafa) VxeR, [set of non-negative reals] > yates 4 [xis + ve real number] Obviously, V y ¢ [4, 0), xis real number ¢ R, (domain) ie,,all elements of codomain have pre image in domain, = fis onto. Hence, fis invertible being one-one onto. 10, Show that the function f: (- ©, 0) > (- 1, 0) defined by f() = ,X € (-,0) is one-one and Talal at [CBSE 2020 65/3/1) Sol. Let a x, © (00,0) such that fx: = i). ie, = a S Aone S Hes {fis one-one 1 Let y (1,0) such that y = Shee = a5 1 For each y€(-1,0), there exists x€ (6,0), ave A ity such that f() = Az) me | Ty oa T¥ ey, 1 ee 1y Hence fis onto. [CBSE Marking Scheme 2020 (65/3/01 11, Prove that the greatest integer function f:R —> R given by /(x) = Ix], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal tox. (CBSE 2017(C)] Sol. f:R—R givenby f(2) = [x]Injectivity: Let x, =25 and x, =2 be two elements of f(a) =f (25) = [25] =2 £@2)=f@)=[2)=2 a F(x) =f Gy) for x # x) = F(x) = [x] isnot one-one ie,, not injective. Surjectivity: Let y= 25 ¢ R be any element. 2 fl=25 = [e1=25 Which is not possible as [x] is always an integer. = f (2) = [x] isnot onto ie,, not surjective. 12. Let: WW be defined as n-1, ifnisodd fat n+1, if mis even Show that fis invertible. Here, W is the set of all whole numbers, [CBSE (Panchkula) 2015] Sol. 4y nds odd pn Lk essen, [poe Tnak tix one ene # | wet ous abuppese Abb 97,6 WwW apt My. ast. fim) = 4 Hy Lat cou 3 Yn, Bn, axe oad E _4au) =f) aX Hea Se oie lush Ui | nel 204 tym ont e6em . l an bacltslies'. eae “odd - “yy wt_actel 2-8 an ener ano’ dh “Awe get om! owen go bub 2, i edd Uatrldly a6 Again contractuclion fiom these 4 point ust oe that dbi= fom) ondy ym >a ‘i “ommend4 blued sw heh ta Which ts 2u20n t oa ", a 4 ot mi = fr oe yt Uatuels is oda we oe Tally Dae emis -pereis an, uo ! J sof “Bato.” He One-Owe~ avad. Onde he dt i at. (fopper’s answer 2015) 13. Considerf: R - =r >R- ( given by f(x) = 23. show that fis bijective. [CBSE (AD) 2017] Sol. fe) = dag Eo Ciares disor) = (ut) (3 oy) ao es ae 29%, + Ome ve14. Sol. Sol. Seo pale eee Herma = fe) da oon Gunton = ‘dled da bie ______Topper’s Anstwor 2017] ‘ Also, check whether fis an onto function or not. ICBSE 2023 (65/4/1)] 4 ax Given function f :R- {4} —R bea function defined as f(x) = axed One-one: Let ps, © R-{ A] such hats #2 2 dy Hae, and 3x, # 3x, > 3x t4 vox t4 ay 4, Byte * ata Se fe) (fz) is one-one function. Onto: Let y=fay= => > bay +dy=dx cay __ti => xGy-4)=-4y => pt a3 > Mi *" g-3y 4 Clearly when y= >, therefore does not existx ie,, + has no pre image. Itis not onto A function f: [4,4] — [0, 4] is given by fx) =/16-22, Show that fis an onto function but not a one-one function, Further, find all possible values of ‘a’ for which flx)= v7. [CBSE 2023 (65/2/1)] Given a function f: [-4, 4] > [0, 4] defined by f(x) = ¥/16— 2". Let y=Vie-? = yste-? > v=16-y' = xe/le-y* Clearly for x to be real and xe[-4, 4] 16-f 20 > y-1620 =>-4)94+4)50 > -4sys4 “ But y=V16-x720 (x20)> yz0 =) From ( and (i), we have Osys4 Thus, for every value of ye[0, 4] there exists some xe[-4, 4] =. Given function is onto. When x=4 = y=vi6-16=0 xe-4 > y=VI6-16=0 Here, different value of x there is some y. So itis not one-one. Hence, given function is onto but not one-one. Now, fla)=v7 (given) = vi6 \7 = 16-?=7 > @=16-7=9 > a= 3,3} 16. Prove that a function f: [0, «) —> [-5, «) defined as fix) = 4x" + 4x ~5 is both one-one and onto. ICBSE 2023 (65/3/2)] Sol. Given function f :[0, 2°) + [-5, «) defined as fix) = 4x” + 4x-5 ‘One-one: Let x; ,x, € [0, 0) such that x, +x, 4x, #42, = 4x-Sedx,-5 = Axi td, -5 A 4xp + de, 5 > flx)efte) Function is one-one. Onto: For x €[0, <0) 2 fx) = 427 + 4-5 => fxy>-5 => RY) =[-5, ©) Given function is onto. Hence, function is both one-one and onto. OU el MLM 9 1 Objective Type Questions 1. Choose and write the correct option in each of the following questions. (8 Let R bea relation on the set N of natural numbers defined by nRm if n divides m. Then R is @ reflexive and symmetric (8) transitive and symmetric (© equivalence (@ reflexive, transitive but not symmetric (i) Let A ={1, 2, 3} and consider the relation R= {(1, 1), 2,2) (3,3), (1, 2), 2,3), (1,3). Then R is (@) reflexive but not symmetric (b) reflexive but not transitive (© symmetric and transitive (@) neither symmetric nor transitive (ii) Ifa relation R on the set {1, 2,3} be defined by R = {(1, 2), then Ris (@ reflexive (f) transitive (©) symmetric (@) none of these(io) LetfzR > R be defined by fa) = v.xe R. Then fis (@ one-one () onto (©) bijective (@) fis not defined (0) fA = (1, 2,3}, B = (1,4, 6,9} and R isa relation from A to B defined by ‘x is greater than y. Then range of R is @ 114,69) (146,91 © uy (@) none of these (i) IER = (x, y):x,y €Z,x° + s 4} isa relation in the set Z, then the domain of R is ICBSE 2021-22 (65/2/4) (Term-1)] (0, 1,2} (®) (-2,-1,0,1,2} (c) {0,-1, -2 (@ (1,0,1) (oii) Let X = (x”|x € N) and the function f: N — X is defined by fx) = x”, x € N. Then this function is ICBSE 2021-22 (6512/4) (Term-1)] @ injective only __(b) not bijective __(c) surjective only _(d) bijective (viii) A function f:R + R defined by flx) = 2+: is [CBSE 2021-22 (65/2/4) (Term-1)] (@ not one-one (®) one-one (©) not onto (@) neither one-one nor onto Conceptual Questions 2. A= 13,5,7] and B = (2, 4,9) and Risa relation from A to B given by “is less than”, then write R asa set of ordered pairs. 3. Check whether the relation R in the set (1, 2, 3) given by R = (1,2), (2, )} is transitive, 4. For the set A = (1, 2, 3}, define a relation R in the set A as follows R = {(1, 1), (2,2), (3,3), (1,3) ‘Write the ordered pair to be added to R to make it the smallest equivalence relation. 5. Arelation Rin $= (1, 2,3} is defined as R = {(1,1), (1,2), (2,2), (3, 3)}. Which elements) of relation R be removed to make R an equivalence relation? 6. Check whether the function f:R —R defined as (x) = x*is one-one onto or not. Se, ifx>3 7. Let f:R—R be defined by f(x)=]2" , if1 N, defined by f(x) = 2? + x + 1 is one-one but not onto. [CBSE 2019 (65/1/1)] = Long Answer Questions 22. Show that the function f:R——R defined by f(x) See vx €R is neither one-one nor ¥ ‘onto. [CBSE 2018] 28, Show thatthe relation R defined by (a,b) R (od) <2 a+ d=b + con the A x A, where A = {1,2,3, 10) is an equivalence relation. Hence write the equivalence class of [G, 4)};2, 8, ¢,d € A. [CBSE (East) 2016] 24, Check whether the relation R in the set N of natural numbers given by R= (@,8) ais divisor of 6} is reflexive, symmetric or transitive. Also determine whether R is an equivalence relation. 25. Check if the relation R in the set R of real numbers defined as R =((a, 6) a <) is () symmetric (i transitive. 26. Let A= R ~{3}, B= R - {1}. Let f: A> B be defined by fix) Ee eexea Show thatyis bijective. 27. Lot Rbe a rolation on the set of natural numbers N as follows: R= ((x,»)|x ¢ N, y © N, 2x4 y= 41). Find the domain and range of the relation R. Also verify whothor Ris roflexive, symmetric and transitive. 28, Show that the relation 5 in the set A = (x € Z;0 < x < 12) gives by $= {(e,8):a,beZ, |a—b| is divisible by 4) is an equivalence relation. Find the set ofall elements related to 1 Answers 1 0@ We@ (i) © @) @ oo i) @) (i @) — (vit) @ 2 R={@,4),(3,9),6,9), 7,9} 3. No, it is not transitive. 4. (3,1) 5. (1,2) 6. fis neither one-one nor onto. 7. 17 9. {(1, 1), (1, 2), (2, 1, 2, 2), (2,3), 3,2), (3,3), (3,4), 4,3), (4,4), 6,5}10. Reflexive, Symmetric but not transitive. 41. Reflexive but neither symmetric nor transitive. 14. Domain = {2,3}, Range = {8,27} 17. 1,4,7, 10 23. {(1, 2), (2, 3), (3, 4), (4,5). G, 6), (6,7), (7,8). (8, 9), (9, 10)} 24, Reflexive and transitive but not symmetric, No 25. () Not symmetric (i) Transitive 27, Domain of R = {1,2,3, ..20}. Range of R = {1,3,5,7,9, »,39), Ris neither reflexive, nor symmetric nor transitive. 28. [1]= (95,1)