MATHS CONTENT CLASS-XII CHAPTER-1 RELATIONS AND FUNCTIONS KEY POINTS TYPES OF RELATIONS A relation R in a set A is called reflexive if (a,a)¢ R for every a cA, A relation R in a set A is called symmetric if (a,b) € R implies that (b,a) € R for all ab © A relation R in a set A is called transitive if (a,b) eR and (b,c) € R implies that (a,c) € R for all a,b,c EA. EQUIVALENCE RELATION Arelation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. EQUIVALENCE CLASSES Every arbitrary equivalence relation R in a set X divides X into mutually disjoint subsets (4,) called partitions of subdivisions of X satisfying the following conditions: a) All elements of 4, are related to each other for all i b) No element of 4, is related to any element of A; whenever it] c) 4U4;=X and 4, 9 4;=9.These subsets (4; ) are called equivalence classes For an equivalence relation in a set X, the equivalence class containing aeX,denoted by [a],is the subset of X containing all elements b related to a. DIFFERENT TYPES OF FUNCTIONS fis one to one (injective) mapping, if any two different elements in A is always correlated to different elements in B ,i.e. x, #2, > Flas) Fz) OF Flai)= fm) 9 41 = xe fis many one mapping if 3 at least two elements in A such that their images are same f is onto mapping (surjective) ,if each element in B is having at least one pre ~image in A (domain) or range =codomain. fis into mapping if ranges codomain f is bijective mapping if it is both one to one and onto.MULTIPLE CHOICE QUESTIONS Let R be a relation on the set N be defined by Qn.t — |R={(x, y) Vx, YEN, 2x + y = 41}, Then, Ris (a) Reflexive (b) Symmetric (c) Transitive (d) None of these Qn.2 | For real numbers x and y, we write x R y © x - y + v2 is an irrational number. Then, the relation R is (a) Reflexive (b) Symmetric (c) Transitive (d) None of these Qn.3__ |The relation R = {(4, 4), (2, 2), (3, 3), (4, 2), (2, 3), (1, 3} on set A= {1, 2, 3} is (a) Reflexive but not symmetric (b) Reflexive but not transitive (c) Symmetric and transitive (d) Neither symmetric nor transitive Qn. 4 | Consider the non-empty set consisting of children in a family and a relation R defined as a R b if a is brother of b. Then Ris (a) symmetric but not transitive (b) transitive but not symmetric (©) neither symmetric nor transitive (d) both symmetric and transitive Qn.5 [Let P= {(x, y) : x*+ y= 1, x, y ER}. Then, Pis (a) Reflexive (b) Symmetric (c) Transitive (d) Anti-symmetric Qn.6 Let S be the set of all real numbers. Then, the relation R= {(a, b) : 1+ ab > 0} on Sis (a) Reflexive and symmetric but not transitive (b) Reflexive and transitive but not symmetric (c) Symmetric, transitive but not reflexive $$$ ieetinnive transitive and symmetries Qn.7__ | Let R be the relation in the set Z of all integers defined by R= {(x, y) :x- y is an integer}. Then R is (a)refiexive (b) symmetric (c) transitive (d) an equivalence relationQs For the set A = {i, 2, 3}, define a relation R in the set A as follows R = {(1, 1), (2, 2), (3, 3), (1, 3)} Then, the ordered pair to be added to R to make it the smallest equivalence relation is (a) (1, 3) (b) (3, 1) (c) (2, 1) (d) (1, 2) Qn.9 [Let A= (i, 2, 3} andR = {(i, 2), (2, 3)} bea relation in A. Then, the minimum number of ordered pairs may be added, so that R becomes an equivalence relation, is (a)7 (b) 5 (c) i (a4 Qn.10 Let A= {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3), which are reflexive and symmetric but not transitive, is (a1 (b) 2 (3 (a4 Qn.i1 [Let f: R > R be a function defined by f(x) =x'+ 4, then fis (a) Injective (b) Surjective (c) Bijective —(d) None of these Qn.12 Let X = {0, i, 2, 3} and Y = {-1, 0, 1, 4, 9} anda function f =X 3Y defined by y =x*, is (a)one-one onto (b) one-one into (c) many-one onto (d) many-one into Qn.i3 [Let g:R>R g(x) = x?- 4x - 5, then | (a) g is one-one on R (b) g is not one-one on R (c) gis bijective on R (d) None of these Qn.i4 |The mapping f : N > Ngiven by f(n) = 1 +n? _, n € N when Nis the set | of natural numbers, is (a) a one-one function (b) an onto function (c) a bijection (d) neither one-one nor onto Qn.i5 | The function f: R R given by f(x) = x? - lis z= (a) 2 one-one function (b) an onto function (c) a bijection (d) neither one-one nor onto Qn.i6 A function f : XY is said to be onto, if for every y ¢ Y, there exists an element x in X such that (a) fo) = y (b) fly) = x (c) fx) +y =O (d) fly) +x =0 Qn.i7 [Let R be the relation in the set (1, 2, 3, 4} given by R = {(i, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2). (a) Ris reflexive and symmetric but not transitive (b) R is reflexive and transitive but not symmetric (c) Ris symmetric and transitive but not (d) R is equivalence relationQn.18 [Let A = {1, 2, 3} and B = {a, b, c}, then the number of bijective functions from A to B are (a) 2 (b) 8 (c) 6 (d) 4 Qn.19 |The number of surjective functions from A to B where A = {i, 2, 3, 4} and B = {a, b} is (a) 14 (b) 12 (c)2 (a) 15 Qn.20 |The function f : R > R defined by f (x) = (x - 1) (x- 2) (x- 3)is (a) one-one but not onto (b) onto but not one-one (c) both one-one and onto (d) neither one-one nor onto IESTION: Qn.4 If A={1,2,3}and R = {(1, 1), (2, 2), (3, 3), (1, 3)} Then, the ordered pair to be added to R to make it the smallest equivalence relation is Qn.2 Check Sy is square of an integer x, y EN” . Above relation is ..... (Reflexive, symmetric and transitive.) Qn.3 Give an example of a function which is one-one but not a onto. Qn.4 | Let D be the domain of the real valued function f defined by f(x)=V25 — x? . Then, write D. Qn.5 |ifg= (i, 4), (2, 3), (3, 5), (4, 7)} a function? If g is described by 9(x) = ax+ b, then value of ais.........and value of b is... Qn.6 | Let the function f: R> R : be defined by f(x )= cos x; vx € R. Show that f is neither one-one nor onto. Qn.7-10 | MATCH THE FOLLOWING 7. [Ff ROR foc (i) Neither one one nor onto 8. | f RON: (x) s (ji) One one and into 9. |f: 232 (iil) Many one and onto 10. | f: NON: (iv) One one but not onto Qn.11 | Examine if the relation g ={(2,1),(4,2),(6,3),(8,4),(10,5),(12,6),(14,7)} is one one onto State the reason. _— Qn.i2_|IFR = {(x, y) : x + 2y = 8} is a relation in N, write the Domain of R. Qn.i3__/If a function f:X= (-1,1) defined by y=cosx is one-one and onto function, then value of X Qn.i4 [Let A be the set containing ‘m’ distinct elements, then the total number of distinct functions from A to itself iss...Qn.is 1,2,3,4 and B={1,2,3},then number of mappings from A to B Qn.16 0,2] > [0,00] be a function defined by y=sin(®),then fis ..(injective/surjective/bijective) Qni7_| Ifa function f:[2,00)>B defined by f(x)=x?—4 x+5 Is a bijection, then Qn.i8 (a,a):a is a prime number less than 4} be a relation. Then the range of R is. Qn.19 | Ifa relation R on the set {I, 2, 3} be defined by R = {(1, 2)}, then R is -(reflexive/symmetric/transitive) Qn.20 | Let f:R-9R be defined by (x)=x*+1, then pre-image of 17 and -3, respectively, AF @...enm senses SHORT ANSWER QUESTIONS Qn.i___| Find the type of relation, which is describes as the relation "less than” in the set of natural numbers. Qn.2_ | Show that the function f : N> N given by f(x) = 2x is one-one but not onto Qn.3___ | Show that the function: f : N > N given by f(1) = f(2) = 1 and f(x) = x -1, for every x > 2 is onto but not one-one. qn.4 |IFR={(x, y) : x + 2y = 8} is a relation in N, write the range of R. Qn.5 If the function /:R-34 given by (x)=; is a surjection, then find 4 Qn.6 | If the relation R is defined by aRb, if and only, if b lives within one kilometer from a, then check if the relation is reflexive, symmetric or transitive. Qn.7__ | The function f:X3Y defined by f(x) =sinx is one-one but not onto, then find X and Y. Qn.8 ifx>3 Let f:R-9R be defined by f(x)=}x? ifl R,then f(x) is (a)Injective (b) Surjective (c)Bijective (d) Into(v) If a Robot follows the f:N-{1}— R — {4}, then f(x) is (a)Injective (b) Surjective (c)Bijective (a) Into Qn.5 ‘An organization conducted bike race under 2 different categories — boys and girls. 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=, ,bz,b3} G={gz,g2},where B represents the set of boys and G the set of girls who were selected for the final race. Ravi decides to explore these sets for various types of relations and functions. (i). Ravi wishes to form all the relations possible from B to G .How many such relations are possible? (aye (b) 2 (c) 28 (d)o (iD, Let R:B-B be defined by R={(cy): x and y are students of same sex},Then this relation Ris... a (a)Equivalence (b) Reflexive (c) Reflexive and symmetric but not transitive (d) Reflexive an transitive but not symmetric. (iii). Ravi wants to know among those relations, how many functions can be formed from B to G? (a)2? (b) 247 (c) 3? (d) 28 (iv). Let R: BG be defined by R={(bs,.91)( bz 92)( bs, g1)},then R WS.sscsnce (a)Injective (b)Surjective (c)Neither Surjective nor Injective (d)Surjective and Injective (v)Ravi wants to find the number of injective functions from B to G .How many numbers of injective functions are possible. (a)o (b)2! (c)3! (d)o! Qn.1 Qn.2 Let A = R- {3}, B =R-{1}. If f: A> B be defined by f(x) LONG ANSWER QUESTIONS vx eA. Then, show that f is bijective - If A= {1, 2 ,3, 4 } define relations on A which have properties of being (i) reflexive, transitive but not symmetric, (ii) Symmetric but neither reflexive nor transitive. (iii) Reflexive, symmetric and transitiveQn.3 [letA={1 ,2,3,4....9 } and R be the relation in AXA defined by (a,b) R (c,d) if at d= b +c in AXA . Prove that R is an equivalence relation and also obtain the equivalent class. [(2, 5)]. Qn.4__ | Let A = Nx N be the set of ail ordered pairs of natural numbers and R be the relation on the set A defined by (a, b) R (c, d) iff ad = be. Show that R is an equivalence relation Qn.5 | Show that the relation R on R defined as R = {(a, b):a 0}, is reflexive, symmetric or transitive. Qn.8 | Let N denote the set of all natural numbers and R be the relation on N x N defined by : (a, b) R(c,d) is ad(b + c) = be(a + d). Show that R is ____|an equivalence relation - Qn.9 | Let f: R* > [-9,c0) be a function defined as : f(x) = 5x? + 6x - 9. Show than f(x) is bijective Qn.10 | Let f: [-1,00) + [-1,00) is given by f(x)= (x? + 1)*-1, x21.Show that Fis bijective UTIONS ANSWER KEY-MCQs 1d) | 2(a)_[3(a) [4(b) [5b) [éta) [7(4) | 8(b) [9Ca) | 10(a) 11(c) | 12(b) | 13(b) | 14(a) | 15(c) | 16(a) | 47(b) [18(c) |19(a) | 20(b) A UESTIONS 1.{(3,1)} 2. Transitive 6.correct proof 7.1) 8.(iii) 9.(iv) 10(ii) 11.unique image therefore funct “[12.42,4,6} | 13.(0,n) 14.mo 15.3° 1016.Injective _[17.[5,00) 18.{8,27 19.Transitive [20{-4,4},0 ANSWER KEY /SOLUTION: HORT QUESTIONS [Qn.1 | Transitive Qn.2 | Letxz,x2 € N. Now, f(x;) = F(x) > 2x; = 2x, > xy =x; > Fis one- ‘one. Now, fis not onto. » for 1 € N, there does not exist any x € N such that f(x) = 2x = 1. Hence, f is one-one but not onto Qn.3 | Since f(1) = (2) = 1, « (1) = f(2), where 1 # 2. +.‘ is not one-one. Let y € N, y # 1, we can choose x as y + 1 such that f(x) =x-1=y+1-1=y. Also1€N, f(1) = 1. Thus'f’ is onto. Hence, ‘f' is onto but not one-one Qn.4 | {1,2,3} Qn.5_| (0,1) Qn.6_| Symmetric only ‘Qn.7 On.8 [Qn.9 (Qn.10/3 — Qn.11 but f(a =positive real numbers .This implies that negative numbers of co domain has no pre-images in domain. Therefore into. This function is many one into. Qn.12 | R-{1} ib=-1 | {(1,1)(2,2)(3,3)} (a,a)e R Therefore reflexive. Also if(a,b) ER then( b,a) € R is also element of R .Therefore symmetric.(a,b) €R and (b,c) ER this implies (a,c) ER Therefore transitive. Therefore is an equivalence relation (b,b)(¢,c)(a,c) | {(1,1)(2,2)(3,3)(4,4)} {0,41, +2} R={(1,3)(3,1)(1,1)(3,3)} on A={1,2,3} For n=1 f(1)=1=f(2) Therefore function is Many one but range f(n)=co domain therefore f(x) is onto _ ‘SI CASE @ 0) Gi Ww) ™) STUDY NO. 1 A d a D a 2 Ae c —_|A a 3 A d d B a 4 B a c D a 5 A a d B a unANSWER KEY /SOLUTIONS-LONG QUESTIONS QML | Let f(x1)= f(x) = 5 of f(x) Range of F(x) f(x) is Bijective Qn.2 | (i) {(1,1)(2,2)(3,3)(4,4)(1,2) (i) {(1,1)(2,2)(3,3)(2,4)(4,2)} it) €(1,1)(2,2)(3,3)(4,4)} Qn.3_ |IF (a,b) R (c,d) then at d= b +c Reflexive :/f (a,b) R (a,b) if at b= b +a,which is true Therefore relation is reflexive. Symmetric:- If (a,b) R (c,d) then a+ d= b +c = If (c,d) R (a,b) then c+b=d+a,which is true, Therefore symmetric Transitive: If (a,b) R (c,d) then a+ d=b +c... And if (c,d) R (e,f) then CHEd#@...un Adding (i) and (ii) ,we get a+f=b+e Therefore (a,b) R (e,f) . Therefore relation is an equivalence relation. Now, equivalence class containing [(2, 5)] is {(1, 4), (2, 5), (3, 6), (4,7), (5, 8), (6, 9)}- x2 30ne one .Similarly, find range ‘0 domain Therefore f(x) is onto. Therefore (ii) Qn.4_ | (a, b) R (, d) ifand only ifad = be. (1) (a, b) R (a, b) iff ab = ba, which is true. [+ ab = ba va, b € NJ Thus, R is reflexive, (I) (a, b) R (c,d) = ad (c, d) R (a, b) = cb = da But cb = be and da = ad in N = (a, b) R (c, d) = (c,d) R (a, b). Thus, R is symmetric. (IIT) (a,b) R (c, d) = ad = be ...(1) (c,d) R (e,f) = cf = de... (2) . Multiplying (1) and (2), (ad). (cf) = (be), (de) = af = be = (a,b) = R(e,f). SS EIS ET RE TE TEE Hence, R is an equivalence relation. be Qn.5 | We have : R = {(a, b)} /3 Now, (a, b) € Rand (b,c) ER | bandb |a ~ b| is divisible by 4 = |b - al is | divisible by 4 Thus, R is symmetric. Transitive: Let (a, b) € R and (b, c) € R = a ~ b] is divisible by 4 | and |b - c| is divisible by 4 = Ja- bl] = 4A 3 a~ b= #4) ...a(L) | and |b - cl = 4p > b- c= # 4p wcce(2) | Adding (1) and (2), (a-b) + (b-c) = #4(A + y) Sa-c=+4 (A+) | 3 (a, CER. Thus, R is transitive. Now, R is reflexive, symmetric and transitive. Hence, R is an equivalence relation. (ii) Let ‘x’ be an element of A such that (x, 1) € R = |x - 1] is divisible by 4 | >xX-1=0,4, 8, 12,... 2x =1,5,9,13,.. Hence, the set of all elements of A which are related to 1 is {1, 5, 9}. (iii) Let (x, 2) € R. Thus |x - 2] = 4k, where k < 3. +x = 2, 6, 10, Hence, equivalence class [2] = {2, 6, 10}. Qn.7 [R= {(a, b): 1+ ab> 0}. Reflexive: Now, 1+ aa=1+a?>0 = (a,a)eRVAER Thus, R is reflexive. Symmetric: Let (a, b) € R. Then 1 + ab > 0 >1+ba>0 = (b, a) € R. Thus, Ris symmetric. Transitive: Take a = -1,b = -4,c=1 Now, 1+ ab = 14 (-1)(-4) = 3/2> 0 = (a, b) ER and, 1+ be = +(-D >0 =(b, c) ER. But 1 + ac =1 + (-1)(1)=0 = (a,c) eR. Thus, R is not transitive. Hence, R is reflexive, symmetric but not transitive. Qn.8 [We have : (a, b) R (¢, d) > ad (b + c) = be (a + d) onN. 3T (i {a, b) R (a, b) = ab(b + a) = ba (a +b) > ab(a +b) = ab (at b), which is true. Thus R is reflexive. (ii) (a, b) R (c, d) = ad(b + c) = be (a + d) = be(a + d) = ad (b +c) = cb(d + a) = da (c + b) [v be = cb anda +d =d +a; etc. Va, b, c,d € N] > (cb) R (a,b). Thus R is symmetric, (iii) Let (a , b) R (c, d) and (c, d) Re, f) «ad (b +c) = be(a + d) and cf(d + e) = de(c + f) = be(atf) = af(b+e) = af(b+e) = be(a+f) = (a, b) R(e,f). Thus R is transitive. Hence, R is an equivalence relation. Qn.9 Let F(x,)= fl) > 5m? + 6x- 9 =5x,? + 6x, 9 x, = x2 ONE ONE Similarly, find range of f(x) Range of f(x)= Co domain Therefore f(x) is onto, Therefore f(x) is Bijective Qn.10 Let F(x,)= flim) = Oy? +1)? -1 = G2 + D?—1,,5 y= % | XyX Slone one .Similarly, find range of f(x) Range of f(x)= Co domain Therefore f(x) is onto. Therefore f(x) is Bijective FEES IBIS IOSI OCIS ISOC IO IEICE IACI EI IORI AREA AE