Chapter| af (RELATIONS AND FUNCTIONS) 1.1 Overview 1.1.1 Relation Arelation R from a non-empty set A to a non empty set B is a subset of the Cartesian product A x B. The set of all first elements of the ordered pairs in a relation R froma set A to a set B is called the domain of the relation R. The set of all second elements in arelation R from a set A to a set B is called the range of the relation R. The whole set B is called the codomain of the relation R. Note that range is always a subset of codomain. 1.1.2 Types of Relations Arelation R in a set Ais subset of A x A. Thus empty set and A x A are two extreme relations. (i) Arelation R ina set A is called empty relation, if'no element of A is related to any element of A, ic, R= CAXA. Gi) Arelation R ina set Ais called universal relation, if each element of Ais related to every element of A, ie., R= AXA. (i) A relation R in A is said to be reflexive if aRa for all ae A, R is symmetric if aRb = bRa, y a, b € Aand it is said to be transitive if aRb and bRe => aRe Va,b, ce A. Any relation which is reflexive, symmetric and transitive is called an equivalence relation, & Note: An important property of an equivalence relation is that it divides the set into pairwise disjoint subsets called equivalent classes whose collection is called a pattition of the set, Note that the union of all equivalence classes gives the whole set. 1.1.3 Types of Functions (i)_A function f: X —> Y is defined to be one-one (or injective), if the images of distinct elements of X under fare distinct, ie., xa, EX SO) =f (t) > 4 =x, ii) A function f:X — Yis said to be onto (or surjective), if every element of Y is the image of some element of X under f.ie., for every y € Y there exists an element we X such that f(x) = y. 20/04/20182 Gi) (MATHEMATICS A function f: XY is said to be one-one and onto (or bijective), if fis both one- one and onto. 1.1.4 Composition of Functions a (ii) Gi) (iv) () LS @ ii) (iv) 11.6 @ (ii) (ii) (iv) Let : A Band g : B > C be two functions. Then, the composition of f and g, denoted by g of, is defined as the function g of: A— C given by sofM=s FO), vre A. Iff: A Band g : B—> Care one-one, then g of: A C is also one-one Iff: A— B and g : BC are onto, then g 0 f: A— Cis also onto. However, converse of above stated results (ii) and (iii) need not be true. Moreover, we have the following results in this direction, Let f: A B and g : BC be the given functions such that g 0 f is one-one. Then fis one-one. Let f: A—> B and g: B > C be the given functions such that g 0 f is onto. Then gis onto. Invertible Function A function f : X + Y is defined to be invertible, if there exists a function g: YX such that g 0 f=I, and fo g=1,. The function g is called the inverse of f and is denoted by f* A function f: X > Y is invertible if and only if fis a bijective function If f:X 9 Y,g:Y—> Zand h: ZS are functions, then holwof=(hog of. Let f:X > Yand g: ¥ > Z be two invertible functions. Then g 0 fis als invertible with (g 0 f)" =f! 0g" Binary Operations binary operation + on a set A is a function « : Ax AA. We denote « (a, b) byaxb. A binary operation « on the set X is called commutative, ifa + b=b «a for every abeX. A binary operation * : A x A > A is said to be associative if (axb)*c=ax(bs0c), forevery a,b, ce A Given a binary operation « : Ax AA, an element ¢ € A, if it exists, is called identity for the operation », ifaxe=a=exa,y ae A. 20/04/2018RELATIONS AND FUNCTIONS 3 (v) Given a binary operation * : A x A A, with the identity element e in A, an clement a € A, is said to be invertible with respect to the operation +, if there exists an element b in A such that a x b = e=b a and b is called the inverse of and is denoted by a. 1.2 Solved Examples Short Answer (S.A.) Example 1 Let A= {0, 1, 2, 3} and define a relation R on A as follows: R= ((0,0), 0,1), 0,3), (1,0), (1, 1), 2, 2), (3, 0), (3. 3) Is R reflexive? symmetric? transitive? Solution R is reflexive and symmetric, but not transitive since for (1, 0) € R and (0, 3) € R whereas (1,3) € R. Example 2 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 pairs to be added to R to make it the smallest equivalence relation. Solution (3, 1) is the single ordered pair which needs to be added to R to make it the smallest equivalence relation, Example 3 Let R be the equivalence relation in the set Z of integers given by R= {(a, b) : 2 divides a—b). Write the equivalence class {0} Solution [0] = (0, +2, #4, + 6,...) Example 4 Let the function f: R — R be defined by f(x) show that fis one-one. 4x-1, y xe R. Then, Solution For any two elements x,,.x, € R such that f (x,) =f (x), we have 4x,= > 4x, =4n, ie. x, =4r-1 Hence fis one-one. Example 5 If f= {(5, 2), (6, 3)}, ¢ = {(2, 5), G3, 6)}, write fo g. Solution fo g = ((2, 2),(3.3)} Example 6 Let f: R > R be the function defined by f (x) = 4x - 3 y x R. Then write f“. 20/04/20184 MATHEMATICS Solution — Given that f(x) = 4x — 4x sy 43 = y (say), then y+3 y+3 Hence f*Q)= > =f 1) 4 Example 7 Is the binary operation « defined on Z (set of integer) by men=m-—n+mn Ymn © Zcommutative? Solution No, Since for 1,2 € Z, 1*#2=1-241.2=1 while2»1=2-142. sothat l+242*1 Example 8 Iff = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}, write the range of fand g. Solution The range of f= (2, 3} and the range of g = (5, 6). Example 9 A= {1,2,3} and f, g are relations corresponding to the subset of Ax A. indicated against them, which of f, g is a function? Why? S={G, 32,3) ,2} g={,2),(, 3), D} Solution f isa function since each element of A in the first place in the ordered pairs is related to only one element of Ain the second place while g is not a function because 1 is related to more than one element of A, namely, 2 and 3. Example 10 If A= {a, b, ¢, d} and f= (a, b), (b,d),(c, a), (d, ¢)}, show that fis one- one from A onto A. Find f-'. Solution fis one-one since each element of A is assigned to distinct element of the set A. Also, fis onto since f(A) = A. Moreover, f-! = ((b, a), (d, b), (a, ©), (€, d)} sample {1 In the set N of natural numbers, define the binary operation « by m xn = gcd (m,n), m,n N. Is the operation « commutative and associative? Solution The operation is clearly commutative since me n=ged (m,n) = g.c.d(n,m)=nxm ym,neN. It is also associative because for /, m,n € N, we have gc. d(l, gcd (m,n) gcd. (g. c.d (l,m), n) =(lem)en Ts (men 2004/2018RELATIONS AND FUNCTIONS 5 Long Answer (L.A.) Example 12 In the set of natural numbers N, define a relation R as follows: \yn,me N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1,2,3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R. Solution R is reflexive since for each a € N, aRa. R is symmetric since if aRb, then bRa for a, b € N. Also, R is transitive since for a, b, c € N, if aRb and bRe, then aRe. Hence R isan equivalence relation in N which will partition the set N into the pairwise disjoint subsets. The equivalent classes are as mentioned below: A,= (5, 10, 15,20...) A, ={1,6, 11, 16, 21... A, = (2,7, 12, 17,22... A,= (3,8, 13, 18, 23, A,= (4,9, 14, 19, 24, evident that the above five sets are pairwise disjoint and 4 VA, VA, UA,UA,= UAEN, Example 13 Show that the function f: R > R defined by f(x) = neither one-one nor onto. Solution For x,, x, € R, consider F(x) =f (x) _— Spt GH We note that there are point, x, and x, with x,#.x, and f(x, 2 =f (x,), for instance, if 1 2 1 J: then we have f(x,) => and f(x,)= > but an Hence we take x, = 2 and x,= 5 5 Fis not one-one, Also, fis not onto for if so then for 1¢R 3.x R such that f(x) = 1 0104/20186 MATHEMATICS which gives . But there is no such x in the domain R, since the equation tl x —x + 1 = 0 does not give any real value of x, Example 14 Let f, g : R — R be two functions defined as f (x) = |x| + x and 8 @)= |x] -x y xe R. Then, find fo g and g of Solution Here f(x) = |x| +. which can be redefined as 2xif x20 f=) if <0 Similarly, the function g defined by g (x x may be redefined as Oif x20 8 Vovit x<0 Therefore, g 0 f gets defined as : For x20, (gof)W=g8f() =g 2x) and for x<0,(g of) (x) = 8 (f @)=¢ (0) =0. Consequently, we have (g of) (x) =0, y xe R. Similarly, fog gets defined as: For x20, (fog) ()=f(g (=f) =0, and for x <0, (fo g ) (x) = f (g(x) = f (-2 x) = - 4x. 0,230 ie. (ron={ 4 bxx R defined as 8 Oe e Therefore, (g of) (0) = s(f(@) = 8 (4x +5) Ax+5-5 => = or gof =ly Similarly Fo 8) ) =F (gO) “2 Hence fis invertible and f~! = g which is given by pia@=*2 oes Example 16 Let * be a binary operation defined on Q. Find which of the following binary operations are associative @ a*b=a-bforabeQ b wi) axb= fora. be Q@ (ii) axb=a-b+abforabeQ (iv) a+ b=a¥ for abe Q Solution (i) * is not associative for if we take a= 1, (1 «2)"3= (1-2) «3 1*(2*3)=1* (2-3) 0104/20188 MATHEMATICS Thus (a * b) * c#a # (b * c) and hence « is not associative. Gi) is associative since Q is associative with respect to multiplication. (ii) « is not associative for if we take a= 2, then (ab) #c=(2%3)"4= (2-346) 4425 e4=5—4420=21, and ae (bec)=2* (3x4) =2% (3-44 12)=2e 1 =2-11422=13 Thus (a % b) » ¢# a % (b * €) and hence * is not associative. (iv) is not associative for if we take a= 1, b = 2 and c = 3, then (a » b) » c= (1 2)#3=463=4x9=36andax (be c)=14Q¥3)=1 8185 Lx 18? = 324 Thus (a « b) + ¢ #a + (b + 0) and hence * is not associative. 3andc Objective Type Questions ‘Choose the correct answer from the given four options in each of the Examples 17 to 25. Example 17 Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is (A). Reflexive and symmetric (B) Transitive and symmetric (C)_ Equivalence (D)_ Reflexive, transitive but not symmetric ‘Solution The correct choice is (D). Since n divides n, yn € N, R is reflexive. R is not symmetric since for 3, 6 € N, 3 R 6 #6 R 3. R is transitive since for n, m, r whenever n/m and m/r = nir, i.e.,n divides m and m divides r, then n will devide r. Exanmple 18 Let L denote the set of all straight lines in a plane. Let a relation R be defined by IR if and only if Vis perpendicular to m vy 1, € L. Then R is (A) reflexive (B) symmetric (©) transitive (D) none of these Solution The correct choice is (B). Example 19 Let N be the set of natural numbers and the function f: N— N be defined by f (n) =2n+3 wne N. Then fis (A). surjective (B) injective (C) bijective (D)_ none of these Solution (B) is the correct option. Example 20 Set A has 3 elements and the set B has 4 elements. Then the number of 20/04/2018RELATIONS AND FUNCTIONS 9 injective mappings that can be defined from A to B is (A) 144 (B) 12 © w4 (D) 64 Solution The correct choice is (C). The total number of injective mappings from the set containing 3 elements into the set containing 4 elements is “P, = 4! = 24. Example 21 Let f: R > R be defined by f(x) = sin x and g : R — R be defined by 8 @) =2°, then fo g is (A) sin x (B) (sin x)? (©) sin? (D) > x Solution (C) is the correct choice. Example 22 Let f: R > R be defined by f (x) = 3x~ 4. Then f(x) is given by xt4 x = a4 ws ®) 5 (©) 3x44 (D) None of these Solution (A) is the correct choice, Example 23 Let f: R R be defined by f (x) and ~ 3, respectively, are (A) 6, {4,-4} (B) (3,-3},6 (©) {4,4}, (D) {4,-4, [2,-2} Solution (C) is the correct choice since for f-! (17) =x => f (x) = 17 orx +1 = 17 => x=440r f(17) = (4-4) and forf"(3) =x f@)=-3 Sxtl =-3=9.x°=—4 and hence f 3) = 6. x + 1, Then, pre-images of 17 Example 24 For real numbers x and y, define xRy if and only if x ~ y + JZ is an irrational number. Then the relation R is (A) reflexive (B)_ symmetric (C) transitive (D) none of these Solution (A) is the correct choice. Fill in the blanks in each of the Examples 25 to 30. Example 25 Consider the set A= (1, 2, 3} and R be the smallest equivalence relation on A, then R = 20/04/201810 MATHEMATICS Solution R= {(1, 1), 2,2) (3,3)} Example 26 The domain of the function f : R > R defined by f(x) = x? -3x+2 is Solution Heres? -3x+220 => @-N@-2)20 => xSlorx22 Hence the domain of f = (—, 1] U [2, 2) Example 27 Consider the set A containing » elements. Then, the total number of injective functions from A onto itself is Solution nt Example 28 Let Z be the set of integers and R be the relation defined in Z such that aRb if a — b is divisible by 3. Then R partitions the set Z into disjoint subsets. Solution Three. Example 29 Let R be the set of real numbers and « be the binary operation defined on Rasaxb=a+b-ab y a,be R. Then, the identity element with respect to the binary operation = is Solution is the identity element with respect to the binary operation +. State True or False for the statements in each of the Examples 30 to 34. Example 30 Consider the set A = (1, 2, 3) and the relation R= ((1, 2), (1, 3)}. Risa transitive relation. Solution True. Example 31 LetA bea finite set. Then, each injective function from A into itself is not surjective. Solution False: Example 32 For sets A, B and C, let f: A B, g : B > C be functions such that 4 0 fis injective, Then both fand g are injective functions. Solution False. Example 33 For sets A, B and C, let f: A B, g : BC be functions such that g of is surjective. Then g is surjective Solution True. 20/04/2018RELATIONS AND FUNCTIONS 11 Example 34 Let N be the set of natural numbers. Then, the binary operation « in N defined asa xb =a+b, ¥ a,b € N has identity element. Solution False. 1.3 EXERCISE Short Answer (S.A.) 1. Let A={a,, c} and the relation R be defined on A as follows: (a, a), (b, ©), (a, b)} Then, write minimum number of ordered pairs to be added in R to make R reflexive and transitive, 2. Let D be the domain of the real valued function f defined by f(x) = J25—° « Then, write D. 3. Let fg: RR be defined by f(x) = 2x4 1 and g(x) = -2, ye R, respectively. Then, find g 0 f Let f : RR be the function defined by f (x) = 2x3 yx R. write f-!. If A= (a,b, c,d} and the function f= ((a, b), (b, d), (¢, a), (d, ¢)), write Ff. If f : RR is defined by f (2) = ~ 3x + 2, write f/@)). Is g = {(1, 1), (2, 3), (3, 5), G4, 7)) a function? If g is described by g(x) = ax +B, then what value should be assigned to ot and B. 8. Are the following set of ordered pairs functions? If so, examine whether the mapping isinjective or surjective. (@ {G, y): x is a person, y is the mother of x}. (ii){(@, b): ais a person, b is an ancestor of a}. 9. If the mappings f and g are given by F= (C1, 2), B, 5), (4, I} and g = {(2, 3), (5, 1), (1, 3)), write fo g. 10. Let Ce the set of complex numbers. Prove that the mapping f: C9 R given by f(@ =e, v z€ C, is neither one-one nor onto. LL, Let the function f: R — R be defined by f(x) = cost, y x € R. Show that fis neither one-one nor onto. 12, Let X= (1,2, 3}and Y= (4,5). Find whether the following subsets of X xY are functions from X to Y or not. @ f= (0,4), (1,5), (2,4), 3,5)} Gi) g=((1,4), (2, 4), 3,4) Gi) —h= {(1,4), 2, 5), 3, 5)} (iv) k= ((1,4), (2, 5). 13. If functions /: A—> B and g : B >A satisfy g 0 f= 1,, then show that f is one- one and g is onto. ae Pe 20/04/2018‘MATHEMATICS 14. Let f: RR be the function defined by f(x) = Z—g5,, vx e R-Then, find the range of f 15. Letn bea fixed positive integer. Define a relation R in Zas follows: y a, b e Z, aRb if and only if a ~ bis divisible by n . Show that R is an equivalance relation, Long Answer (L.A.) 16. IfA=(1,2,3,4 }, define relations on A which have properties of being (a) reflexive, transitive but not symmetric (b) symmetric but neither reflexive nor transitive (©) reflexive, symmetric and transitive. 17. Let R be relation defined on the set of natural number N as follows: R = ((x, y): weN, yeN, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive. 18. Given A = (2, 3, 4), B= (2, 5, 6, 7}. Construct an example of each of the following: (a) an injective mapping from A to B (b)_ a mapping from A to B which is not injective (©) amapping from B to A. 19. Give an example of a map (i) which is one-one but not onto (ii) which is not one-one but onto ii) which is neither one-one nor ont. x22 20. Let A= R ~ (3), B =R~ {1}. Let f: A B be defined by f(x) = 73 wx e A. Then show that f is bijective, 21. LetA=[-1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective: x @ fe=z Gi) g@) = |x| Gil) he) = x] (iy) kQ) = 8 22. Each of the following defines a relation on N: () xis greater than i) x+y=10,x,yeN yeN 20/04/201823. 26. 27. RELATIONS AND FUNCTIONS 13 (ii) xy is square of an integer x, ye N (iv) x+4y=10 4 ye N. Determine which of the above relations are reflexive, symmetric and transitive. Let A= (1, 2, 3,... 9} and R be the relation in A xA defined by (a, b) R (¢, d) if a+d=b +c for (a,b), (c,d) in AXA. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)]. Using the definition, prove that the function f: A B is invertible if and only if fis both one-one and onto. Functions f, ¢ : R > R are defined, 1 g() = 2x—3, find @ fog Gi) gof (iii) fof liv) gog Let » be the binary operation defined on Q. Find which of the following binary operations are commutative @) axb=a-byabeQ (i) axb=a+PyabeQ Gi) axb=ataby abeQ (iv) asb=(a-bP y abe Q Let « be binary operation defined on R by a «b= 1+ab, y a,be R. Then the operation = is e+3r+1, spectively, by f (x) (commutative but not associative ii) associative but not commutative Gii) neither commutative nor associative (iv) both commutative and associative Objective Type Questions Choose the correct answer out of the given four options in each of the Exercises from 28 to 47 (M.C.Q.). 28, 29. Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ya, b € T. Then R is (A) reflexive but not transitive (B) transitive but not symmetric (©) equivalence (D)_ none of these Consider the non-empty set consisting of children in a family and a relation R defined as ab if a is brother of b. Then R is (A) symmetric but not transitive (B) transitive but not symmetric (C)_ neither symmetric nor transitive (D)_ both symmetric and transitive 20/04/20184 30. 31, 32, 33. 34, 36. MATHEMATICS ‘The maximum number of equivalence relations on the set A= {1, 2,3} are @ 1 (B) 2 © 3 (D) 5 If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)), then R is (A) reflexive (B) wansitive (C) symmetric (D) none of these Let us define a relation R in R as aRb if a 2 b. Then R is (A) an equivalence relation (B) reflexive, transitive but not symmetric (C)_ symmetric, transitive but (D)_ neither transitive nor reflexive not reflexive but symmetric. Let A= (1,2, 3) and consider the relation R= (I, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3))- Then R is (A) reflexive but not symmet (B)_ reflexive but not transitive (C) symmetric and transitive (D)_ neither symmetric, nor transitive The identity element for the binary operation + defined on Q ~ (0) as ab axb= > wabe Q- (0) is (A) 1 (B) 0 © 2 (D) none of these . If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is (A) 720 (B) 120 © 0 (D)_ none of these Let A= (1, 2,3, ..2} and B = {a,b}. Then the number of surjections from A into Bis (a) "P (B) 2-2 (© 2-1 (D) None of these 0104/2018RELATIONS AND FUNCTIONS 15 1 ‘37. Let f: R = R be defined by f(x) = yee R. Then fis (A) one-one (B) onto (©) bijective (D) fis not defined 38. Let f: R R be defined by f(x) = 3x°-S andg: R> Rby g(@)= > Then g ofis A 3x -5 » xa (\) 930%? +26 ®) 9x 6x? +26 2 __3# fs © ae ®) Ox 30x 39. Which of the following functions from Z into Z. are bijections? (A) f@ax (B) f@sx4+2 (©) f=2r4l (D) f@=rel 40. Let f: R > R be the functions defined by f (x) = x° + 5. Then f+ (x) is 1 1 (A) (45) (B) (x53 L © 6-»3 (D) 5-x 41. Letf: A > Band g : B > C be the bijective functions. Then (g 0 f)" is (A flog (B) fog © gtof (D) g of R 2 3x42 42. Let f: R-Y 3 R be defined by f(x) = 5,3 Then (A) ft @=fO) (B) f1@)=-f@) 1 © (fof)x @) f' @= of x, if visrational 43. Let f: [0, 1] — [0, 1] be defined by f(x) = if xisirrational 20/04/201816 MATHEMATICS Then (fof) xis (A) constant (B) 1+x © «x (D) none of these 44. Let f: [2, 2) + R be the function defined by f(x) = ° — 4x + 5, then the range of fis (A) R (B) [l,°) (C) [4,00 (B)_[5,09) 45. Let f:N — R be the function defined by f (x) = a and g:Q—Rbe 3 another function defined by g (x) = x +2, Then (g of) > is (A) 1 (B) 1 © i (B)_ none of these 46, Let f: R > R be defined by 2x:x>3 fafa? sexs 3xrxs1 Then f 1) +f(2) +f Ais (a) 9 (B) 14 og (D) none of these 47. Let f: R—> R be given by (x) = tan x. Then f~' (1) is x x OF @) (nn+ Fine Z} (C) does not exist (D) none of these Fill in the blanks in each of the Exercises 48 to 52. 48. Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R 49. Let the relation R be defined on the set A= (1,2,3,4,5) by R= ((a, b) : la — F< 8. Then R is given by 50. Let f= {(1, 2), (3, 5), (4, 1) and g = {(2, 3), (5, 1, (1, 3)}. Then g of and f 0 g = ——. 20/04/2018RELATIONS AND FUNCTIONS 17 51. Let f:R > R be defined by f(3)= Then (fo fof) (x) =——— 52. If f @) = 4 — 0-7)"), then f-(9 = State True or False for the statements in each of the Exercises 53 to 63. 53. Let R= ((3, 1), (1, 3), (3, 3)} bea relation defined on the set A= {1,2,3). Then R is symmetric, transitive but not reflexive. 54. Let /: R > R be the function defined by f(x) = sin (3142) yx € R. Then fis invertible. 55. Every relation which is symmetric and transitive is also reflexive 56. An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive. 57. Let A = (0, 1} and N be the set of natural numbers. Then the mapping f:.N — A defined by f (2n-1) = 0, f(2n) = 1, yn € N, is onto. 58.The relation R on the set A= (1,2, 3} defined as R= ((1, 1), (1, 2), (2, 1). 3, 3)} isreflexive, symmetric and transitive. 59. The composition of functions is commutative. 60. The composition of functions is associative. 61. Every function is invertible. 62. A binary operation on a set has always the identity element. = 0104/2018