called many-one iff t200 oF mop, onesh X to Yis x © elem, . Many-one function. A function ‘f’ from fF from X to Y is called many ao tion One i | hhave same image in Y. In other words, a func tig a one-one. Wr surjective) iff each | led onto (or surje elem t ‘ ion ‘f° from X to Y is cal r Tosi i ent ge I ope ee ‘ Sie i X iv. iff codomain of f= range of f ie. iF Y = F(X), Ty the image of atleast one ele of ; ‘ists atle ion. A function ‘f° from X to Y is called into iff there ex UAC Er, . Into function, A fuctio coment of X ie. iff range of f is a proper subset F codomaiy ny which is not the image of any element of X i edu U neon "off other words, a function ‘f from X to Y is calle N ’ + ” One-one correspondence. A function ‘f’ from X to Y is called a one-one (OrESPOn den, , bijective) iff f is both one-one and onto. ae & a - a that if X, Y are finite sets, then a one-one ethane from x toy fe that n(X) = n(V). However, this may not be true in case of infinite sets, ig Since we will often be proving that certain functions are one-one or onto or both, O. outline the techniques to be used ; () To prove that f is one-one, we must show that either f(x) = f(x) Xp Xz € X or for all xy # xy € X > f(xy) ¥ f(xy). : (i) To prove that f is onto, we must show that either for every y € Y, there exists atleast one elemen, x € X such that y = f(x) or f(X) = Y. For example: = x 2 for a 1. Let X = {a, b, c,d}, Y= (p,q, r,s} and ‘f” be the function from X to Y depicted by the adjoining arrow diagram, then f is (a one-one function. Reason : different elements of X have different images in Y. (i) an onto function. Fig. 1.3 pene gaesch clement of) Y isthe image(of fan element. CEUX of range of F={P.4,1,3) = codomain of f peters femerin! J from Xito Yi Blonc-one ontaflncton fe Ff is a oneone correspondence from X to Y. Note that n(X) = 4 = n(y), 2 Ket X= (a,b cl, Y= (p,4,1,s} and ‘f’be the function from x X to Y depicted by the adjoining arrow diagram, then f is (8) a one-one function, St Reason : different elements of X have different SN imges in Y, (ii) an into function, Reason : there exists r < Y whi ich is not the ima F= |p, 4,8} which is a proper subset of Y Thus, the function f from X to Y is a one-on 3. LetX=(-1,2,5,8, 11), y= Fig. 1.4. ge of any element of X or range of e into function, x {4,6,8) and {f’be the function from X to Y depicted by the adjoining arrow diagram, Say then f is (8) a many-one function, < Reason : different elements ~1 and 11 of x have the Ss same image 6 in Y. Understanding ISC Mathematics-XI1 @(ii) an onto function, Reason ; each element of Y is the image of atleast one element of X. Thus, the function f from X to Y is a many-one onto function. 4, LetX = {-1,2,5,8, 11}, Y = (4, 6,8) and ‘f” be the function from X to Y depicted by the adj then f is ng, arrow diagram, @ a many-one function. Reason ; different elements 2, 5 and 8 of X have the same image 4 in Y, (ii) an into function, Reason ; there exists 6 € Y which is not the image of any element of X. Thus, the function f from X to Y is a many-one into function. 5. LetX= (+1, 0,1,3,5), Y= {-2, 0,2, 6, 10}, then the function f defined by f(x) = 2x for all x € X is both one-one and onto i.e. fis a one-one correspondence. It is depicted by fig. 1.7. Note that n(X)=5=n(¥). "Remark Areal function will be one-one in its domain if any straight line drawn parallel to x-axis meets its graph in -aimost one-point. In fact, if a horizontal straight line meets the graph of a function in two or more ‘points, then corresponding to this value of y there exist more than one points of the domain of the function and hence the function is not one-one. Identity function Let Abe any non-empty set, then the function f: A —> A defined by f(x) = x for all x e Ais called the identity function on A. It is usually denoted by i or I,- Itis easy to see that fis both one-one and onto i. fis a one-one correspondence on A. Constant function Let A, B be two non-empty sets, then the function f : A —> B defined by f(a) = b for all a < A and for a fixed b Bis called a constant function. It is not a one-one function (unless A is a singleton set). Equal functions Two functions f and g are called equal, written as f=s if (8) domain of f = domain of g and (ii) f(x) = g(x) for all x in domain of f (or 8) Otherwise, the functions are called unequal and we write as f g. For example : let A = {0, 2) and B = {1, 2, 3, 4, 5}, f: A> B given by f(s) = 2x + 1 and §:A— B given by g(x) = 27 + 1 forall x ¢ A. Here we note that domain of f= A= domain of g. Also f(0) =2.0+1=1, (0) =0+1=1 => f(0) = g(0) and f(2) =2.2 + 1=5,9(2)=22+1=5 =f(2) =9(2). Thus, f(x) = g(x) for all x « A. Hence, Relations and Functionspe : ZZ detined by f, (x) e func 1Z =0 (i) Let Z be the set of all integers, then the function fo Y fo) = 0 fop aly, is called the zero function on Z. (ii) Let R be the set of all real numbers, then the function fo ! R-> R defined by fy (x) <0 fop a ve Ris led the zero function on R. 0, Sometimes the zero function is denoted by 0. Monotonic function rie Let f be a real valued function, then fis called an increasing function iff for all x, x, X1 SX} DS f(qy) $f(Q) de. iff as we move from left to right the function values do not decrease, fis called a strictly increasing function iff for al xX) € DX fC) < fay). Analogously, fis called a decreasing function iff for all xy, 27 € Dy, 21 f(x) ZA) ie iis “ if as we move from left to right the function values do not increase and fis called strictly decreasing function iff for all xy, x9 € Dp, 41 < xy = f(y) > fla) fh and A function which is either increasing or decreasing is called a monotonic function, a ind a function which is either t strict increasing or strict decreasing is called a strict monotonic function, For example :the function f(x) = 3x ~ 1is strict increasing and the function f(x) =1~3xis strict decreasing (Why?). The absolute value function f(x) = |x| is neither increasing nor decreasing. Remark A strict monotonic function is altoays one-one. Even and odd functions A real function f is called an even Function iff f(x) = f(x) for all x ¢ D, oe fi-x) =-f(a) forall x € D, J F(X) for all xe );and fis called an odd function iff ILLUSTRATIVE EXAMPLES Example 1 Show thatthe function f: NN, defined by f(x) «rx J : , Fe) = 2x, is one-one by Solution. The function fis one-one. me Sut not onto. (NCERT) Reason : Let x4,x> € N be such that f(x,) = f(x.) > 2x, = 2px, =2, Thus, f() = f(x2) => 14 = x) = fis one-one, The function f is not onto. Reason: As 1 € macoHomaln off) and thene does notes any x « W (4 F(x) = 1. So, fis not onto. lomain of f) such that Example 2.Prove that the function f-R—> R, defined by f(x) = 2x, Solution. The function f is one-one. Reason : Let x1, x) € R be such that f(x) = f(a) > 2x = The function f is onto. Reason : Consider any y € R (codomain of f). 18 one-one and onto, f (NCERT) 2x > x, = A * fis one-one, Certainly, x= 5 € R (domain of f). Thus, for all y © R (codomain of f), there exists x = ¥ € R (domain °F A) such a it fey=s(¥)=2-¥ ey = fis onto.Example 3. Let Ry be the set of all non-zero real numbers, show that the function f : Ry > Ro defined by a f(z) = = iS one-one onto. Is the result true, if the domain Ro is replaced by N with codomain being same as Ro? (NCERT) Solution. The function is one-one, Reason : Let x, X2 € Ry be such that f(x) = f(x) ol 1 ee) ex fis one gy =I is one-one, The function f is onto, Reason : Consider any y € Ry (codomain of f), then fa)=y> b=yox=1 y 1 As y#0,— ERy Set gc ne Thus, for all y € Rg (codomain of f), there exists x 1 @=f{1| = fe) 4 ;) y = _ every element in the codomain of f has pre-image in the domain of fF = fisonto. € Ry (domain of f) such that Hence, the given function fis one-one onto. When function f is defined as f : N + Ry by fix) = 4, then f is one-one because fe) =fe)=> = = es = x1 = x for all x1, x» € N. But fis not onto because Y2 € Ry (codomain of fyand there does not exist any element in N (domain of f) whose image is /2. Example 4. Show that the modulus function f : R > R, defined by f(x) = |x| is neither one-one nor onto. (NCERT) Solution. The function f is not one-one. Reason : Since f(2) = |2| =2and f(-2) = |-2| = 2, so that the different elements 2, -2 of R (domain of f) have same image = fis not one-one. The function f is not onto. Reason : For all x € R, |x| 2 0 = range of f = [0, ©), which is a proper subset of R (codomain of f) = fis not onto. Example 5. Show that the greatest integer function f : R -» R defined by f(x) = [x] is neither one-one nor onto. (NCERT) Solution. The function f is not one-one. of R se 3 Reason : since (3) = 3] =0 and (5) = [3] =0, 0 the two different elements 2, (domain of f) have same image = fisnot one-one. The function fis not onto. Reason : Range of f= I (set of integers), which is a proper subset of R (codomain off) => fis not onto. Relations and FunctionsExample 6. Show that the fractional part function f: R > R defined by f(x) = x= [x] is neither ony nor onto. ‘One Solution. The function fis not one-one, Lafd}wad 2 43]..8 1 8 la eeitia ical o= Lant/(2) = $ [3] -3 =1= 4,90 the ty Raison» Since f| 1) a different elements 2, 2 © R (domain of /) have same image = fis not one-one. The function f is not onto. i Reason : Range of f= [0, 1), which is a proper subset of R (codomain of f) | ' |"21) apm isoad = fis not onto. Example 7. Let f: NN be defined by fin) = | 2 forall n € N. Examine whether the | 2) ifmiseven function f is onto, one-one or bijective (NCERT) Solution. The function fis onto Reason : Consider any n € N (codomain of f) Certainly 2 < N (domain of f). Also 2n is even. Thus, forall » € N (codomain of f), there exists 2n € N (domain of f) such that fn) = Mn = fis onto The function f is not one-one. Reason : As 1,2 © N (domain of f) and f(1) = i2 =1fQ)= 2 =1,so that the different elements Land 2 of the domain of fhave same image 1. Therefore, fis not one-one. Hence, fis not bijective. Example 8. Show that the function f R > R defined by f(x) is neither one-one nor onto. aie st (Exemplar) Solution. The function f is not one-one. so the different elements 2 and 2 of R (domain of f) have same image. Therefore, fis not z one-one. The function f is not onto. Reason: Note that 1 © R (codomain of f) Let x R (domain of f) be such that f(x) = 1 => 7771 ee => 2?-x+ 1 =O butt does not give any real value of x. So, there does not exist any x < R (domain of f) such that f(x) = 1, Thus, the element 1 of codomain of function fhas no pre-image. Hence, the funetion fis not onto. Example 9. Show that the function f : R—> R defined by f(x) = 3x? + 5 for all x R is many-one into function, Solution. The function f is ‘many-one. Reason : Since f(-1) = 3.(-1)? + 5 = 8 and f(1) = 3.1? +5 = 8, so the different elements -1, 1 of R (domain of f) have the same image. Therefore, fis a many-one function. es Understanding ISC Mathematics-XII (I)aE The function f is into, Reason : Since for all x € R, x2 20 => 3x220 = 3x2 4525 > f(x) 25 forallxe R => range of f= [5, ©), which is a proper subset of R (codomain of f) ie. range of f# codomain off. Therefore, f is an into function. Hence, the given function f is many-one into. Example 10. Let C be the set of complex numbers and R be the set of real numbers. Show that the furtction fC R defined by f(z) = |2| for all z € C is neither one-one, nor onto. (Exemplar) Solution. The function f is not one-one. Reason: The complex numbers 3 + 4i and 4 + 3i are such that [344i] = 3244? =5and [443i| = V4? +3? =5ie. [3 +4i| = |4+3i|, so the different members 3 + 4i and 4 + 3/ of C (domain of f) have same image, therefore, the function fis not one-one. The function f is not onto. Reason : For all z € C, |z| >0 => range of f= [0, «), which is a proper subset of R i.e. range of fecodomain of f = the function fis not onto. Example 11. Show that the function f: R -> R defined by f(x) = sin x is neither one-one nor onto. Solution. The function f is not one-one. Reason : Since f(0) = sin 0 = 0 and f(n) = sin x = 0, so the different elements 0, x of R (domain of fyhave same image. Therefore, f is not one-one. The function f is not onto. Reason : As -1< sin x <1 for all x € R, it follows that the range of f= [-1, 1], which is a proper subset of R (codomain of f). Therefore, fis not onto. 1, .x >0 Example 12. Show that the signum function f : R -» R defined by f(x) = | 0, x =0 -1, x<0 is neither one-one nor onto. (NCERT) Solution. The function f is not one-one. Reason: As f(x) = 1 for all x > 0 => f(1) = 1 and f(2) = 1. So, the two different elements 1, 2 € R (domain of f) have same image = fis not one-one. The function f is not onto. Reason: Range of f= {-1, 0, 1}, vhich is a proper subset of R (codomain of f) => fisnot onto. Example 13. Show that the function f: R -» R defined by f(x) = |x| +x is neither one-one nor onto. Also find the range of f. Solution. When x 2 0, | x | =x => f(x) =% + x= 2x; when x < 0, lx] = -x => f(x) =-x +x=0. 2x, x20 Ts.) | ne et Relations and Functions 33The function f is not one-one, Reason: As f(x) = 0 for allx <0 > f(-1)=Oand f(-2) = 0. ,-2 e R(domain of f) have same image So, the two different elements ~ => fis not one-one. For range of function f When x20, 242 0. and when x < 0, fiyy=0 =s range of f= [0, ~), The function fis not onto. Reason: Range of f= [0, e), which is a proper subset of R (codomain of f) > fis not onto. R be the set of all real numbers, Show that the function f : R -» R defined by Example 14. Let f(x) =ax +b, forall x e R where a, be Rand a #0 isa one-one correspondence. Solution. The function fis one-one. Reason: Let 2}, %) € R be such that fay) =f) => att death = ary =a => a(x,-%)=0 > 4-%=0 f(x) > 21 =%_ = fis one-one. The function f is onto Reason : Consider any y € R (codomain of f) -b Then f(x) =y = ax+b=y > x= a AsyeRandax0, —" eR. 2 Thus, forall y € R (codomain of f), there exists x= =" e R (domain of f) such that a aang ea” sb fx) fl = | mo +b-y = every element in codomain of fhas its pre-image in the domain of f = fisonto. Hence, the given function fis a one-one correspondence. ‘ Example 15. Show that the function f: NN defined by f(x) = ax + b, a, b « N is one-one but not onto. Solution. The function f is one-one. Reason: Let 21, % € N be such that f(x) = (x2) => ax, +b=ax,+b> ax, =axy (: ae N,soa#0) = a(x, — xy) = 04, -29= > =x Thus, f(x;) = f(x) > x, = 2) > fis one-one. The function f is not onto. Reason: Note that b < N (codomain of f) and if there exi ; fl) =b, then ax + b=b A) sre exist some x € N (domain of f) such that => a=0>x=0 _ Bus <0 shale Se hoc mat ning solution. The function fis one-one, Reason: Let xy, Xy € N be such th > mPtmytlaxtex gy N defined by f(x) = x2 +x + 1 is one-one but not onto. at f(x) = fly) Pareto => (%1-%)) +42 41)=0 aorta s2 (+ xy, 42 € N, 80x, +x) +140) 2 MAX Thus, f(X) = f(g) > x, = The function f is not onto, Reason: Note that 1 € N (codomain of f). Let. x € N (domain of f) be such that f(x) <1 S Pextlelo reread xx41)20 => x=0,-1but0,-1¢N. %2 = fis one-one, . Thus, the element 1 of codomain of fhas no pre-image = fisnot onto. Example 17. Show that the function if: NN defined Solution. The function f is injective, Renson: Let x, x2 € N be such that f(x,) = f(x) = xS=x3>x3-x3=0 by f(x) = x3 is injective but not surjective. 3 1 -%) (P+ x, x +x,2)=0 => %4-%)=0 (oxy x2 € N, 80x12 + x1 x5 + x,2>0) | eo Thus, f(%1) = f(z) = x, = x9 = fis one-one i. Fis injective. The function f is not surjective. Reason: As 2 N (codomain of f) and there does not exist any x ¢ N (domain of ‘f) such that f(x) =2ie. x3 = 2. So, fis not onto ie. fis not surjective. Example 18. Show that the function f: R-> R defined by f(x) = 2x3 — 7 for Solution. The function f is one-one (injective). Reason: Let x, x» € R be such that f(x) = f(x) all x e Ris bijective. = 2} -7 = 243-7 = 2x} = 2x} = P= awe > B-x} =0 > @,-x) (fF +42, +23) =0 3 %-x)=0 or xP +xx, +23 =0 3 =x ox =x,=0 nich yt 93 [> Aes =(n +32) +47 > O forall xy x» € R except when x, = x» =o] Thus, f(x,) = f(x.) = x1 =x, = fis one-one. The function f is onto (surjective). Reason: Consider any y € R (codomain of f). 7 Then f(x) =y = 2x9-7=y = = 47 = x= Relations and FunctionsSeto eee sia ict 3 Thus, for all y € R (codomain of f), there exists x = aca € R (domain of f) such that poses) tz) fevers 2 => every element in codomain of fhas its pre-image in the domain of f => fis onto. Hence, the given function fis bijective. Example 19. Let A= R— (2) and B= R— {1}. Show that the function f: A B defined by f(x) = *=1 bijective. x=2 Solution. The function fis one-one. Reason: Let x, x) € A be such that f(x,) = f(t) ol Soe ape? yxy 2x, — xy + 2=EX—M]- Wy +2 | 3 -2y-xy=-2 22 >= => _ fis one-one. The function fis onto. Reason: Consider any y € B (codomain of f) ie. y ¢ R,y #1. Let fa)=y= 23 =y=xy-2y=x-1 = -)x=2y-1sx= 4) 1 = Asy «Rand y+1,so 4 eR: 1 2y-1 Abo #2because 2¥=1 = J =2=2y- 1 =2y-2=-1=-2, which is impossible. Thus, x= 3 € A (domain of f) such that 2y-1 a¢{ 2y21 fee)=4[ 42) y-l = every element in the codomain of f has pre-image in the domain of f = fis onto. Hence, the function fis bijective. Example 20. Show that the exponential function f: R—> Rg* defined by (x) = eis bijective, where Ry*is the set of all positive real numbers. Solution. The function f is one-one. Reason: Let x1, x2 € R be such that f(x,) = f(x) => eM =e? =x =X Thus, f(x) = f(%2) = %1 = % > fis one-one. The function f is onto. a ISC Mathematics-XII (1)Renson: Consider any y ¢ Ro* (codomain of f) Let f(x)=y>e'=y=>x=logy, As yeRot logyeR. Thus, x = log y € R (domain of f) such that f(x) = flog y) = e084 = y => every element in the codomain f has pre-image in the domain of f = _fisonto. Hence, the given exponential function is bijective. Example 21. Show that the logarithmic function f : Rot > R defined by f(x) = log, x (a > 0,4 #1) isa bijection, where Ro* is the set of all positive real numbers r Solution. The function f is one-one. Reason: Let x1, X7 € Ro* be such that f(x,) = f(x2) = 10g, %1 = log, x > 1 = xp Thus, f(x) = f(x) => xy = x2 = fis one-one The function f is onto. Reason: Consider any y € R (codomain of f). Let f(x)=y = log,x=y=> x =a". As yeRav eR. Thus, x = a¥ € Ro* (codomain of f) such that f(x) =f (@/) = log, aY = y log, a=y.1=y = every element in the codomain of f has pre-image in the domain of f = fisonto. Hence, the given logarithmic function is bijective. Example 22. Show that the function f: W > W defined by n+1, ifmiseven f=" =1, ifnisodd Solution. The function f is one-one. Let n,m ¢ Wbe such that f(n) = f(r). Three cases arise : Case I. When n and m are both even. fit) =flrt) n+l=m+1 an=m. Case II. When n and m are both odd. f(n) =f(m) > n-1=m-1 => n=m. Case IIL. When one of 1, m is odd and the other is even. Let n be odd and m be even. Then f(n) = fm) n-1=m+1 = even integer = odd integer, which is wrong. It follows that when m is odd and m is even, f(r) # f(™) Similarly, when n is even and m is odd, then fn) =f(m) > n+1=m-1 = odd integer = even integer, which is wrong. Itfollows that when n is even and mis odd, f(n) # fm) ‘On combining all three cases, it follows that fis one-one. is bijective. (NCERT) Relations and FunctionsThe function f is onto. Consider any 1 € W. Two cases arise : Case I. When 11 is odd, then 11 1 is even and it belongs to W such that f(n-1)=(1-1) +120, Case I. When n is even, then 1 + 1 is odd and it belongs to W such that f(n+1=(n+1)-len. Thus, in both cases we find that every element in the codomain of f has its pre-image in the domain of f > fis onto. Hence, the given function is bijective. Example 23. Let A and B be tivo non-empty sets, Show that the function f : A x B - Bx A defined by f(a, b)) = (&, a) is bijective, (NCERT) Solution. The function f is one-one, Let (a3, by), (@, bp) € Ax Bbe such that f((ay, by) = f((ay, b)) > (by, ay) = (by ay) > b) = by and a, = ay > by) = (ey). Thus, f((@;, b;)) =F((@y, by) > (ay, by) = (@p, by) = fis one-one. The function f is onto. Consider any element (b, a) € Bx A, thenb « Banda eA => @bcAxB Thus, for any (b, a) « Bx A, there exists (a, b) € A x B such that f(a, b)) = (b, a) = fis onto. Hence, the given function fis bijective. Example 24. Show that a one-one function f: (1, 2, 3) > {1, 2, 3} must be onto. Solution. Since the function f is one-one, three elements of {1, 2, 3} under f must be taken to three different elements of the codomain {1, 2, 3}. Therefore, the function f has to be onto. (NCERT) Example 25. Show that an onto function f : {1, 2, 3} — {1, 2, 3} must be one-one. (NCERT) Solution. Suppose f is not one-one. Then there exist two elements say 1 and 2 in the domain of f whose image in the codomain is the same element. Also the image of 3 under f is only one element. Therefore, the range of f can have atmost two elements of the codomain {1, 2, 3} of f, It follows that the function is not onto, a contradiction. Hence, the function f has to be ‘one-one. Remark The results mentioned in Examples 24 and 25 are true for any arbitrary finite set X. Let X be a finite set and f: X > X be a function, we have (i) if fis one-one, then it must be onto, and (ii) if fis onto, then it must be one-one. In general, let X and Y be finite sets such that n(X) = n() and f : X > Y be a function, we have (i) if fis one-one, then it must be onto, and (ii) if fis onto, then it must be one-one. Example 26. Find the number of all one-one functions from set A = {a, b, c} to itself. Solution. A one-one function from {a, b, c} to itself is simply a permutation on three symbols a, b,c. Therefore, the total number of one-one functions from {4, b, c} to itself is the same as the total number of permutations on three symbols a, b, c which is [3. Hence, the number of all one-one functions from set A to itself = |3 = 6. BD crete energyExample 27. Consider a function f: | 0,” 2 > R given by f(x) = sin x and a function g [o, *| +R given are one-one but f + g is not one-one, (NCERT) Solution. Since for any two distinct elements ry, 4 v8.4 by g(x) = 608 x, Show that both fand 8 1" 0,2), sin.xy ¢ sin xy and cos x # 608 x2 1¢ FO) #FC%) and 9 (x4) # g(x), both fand gare one-one. But (f + 8) (0) =f) + g(0) =sin 0+ cos0=0+1=1and +95) -§) +0(3 = sin™ 4 coat 2) Ma} *8la] = sind + co8% = 1401, Thus, there exist two different elements d © in the domain | 0, % i Oana & inthe domain [o, , | of the function f+.g which have same image 1, therefore, f + 2 is not one-one, Remarks If Aand B are (non-empty) finite sets containing m and 1 elements respectively, then (i) the number of functions from A to B = n'™, (ii) the number of one-one functions from A to B _ | "Pm ifm sn 0, ifm>n. (ii) the number of onto functions from A to B Ecaerc, rif sim 0 ,ifn>m. Particular cases : ‘Ifn=2 and m > 2, then the number of onto functions from A to B = 2" —2. Ifn=3 and m3, then the number of onto functions from A to B = 3" -3(2"— 1). (iv) the number of one-one onto functions i.e. bijections from A to B “ae 0, ifm #n. eA vd baaltgh Wee A noltgaaiari ted Short and long answer questions (1 to 13): 1. Let A = {1, 2}, B = (3, 6}, function f : A > B be defined by f(x) = 3x and function g: A Bbe defined by g(x) = x? + 2. Show that f= g 2. Check the injectivity and surjectivity of the following functions () f:N-N defined by f(x) => Scam (ii) f:Z + Z defined by f(x) = * iad (iii) f: R + R defined by f(x) =? Bre : 3 (iv) f: N > Q defined by f(x) 2 (0) f:Z > Z defined by f(x) = (vi) f: RR defined by (0) =”. BT be the oct of all integers. Show that the function f: 1» I defined by f(x) = |x| is neither ‘one-one nor onto.4, Show that the function f: R > R defined by f(x) = 3x? - 2 is many-one into. 5, Let A=(1,2,3}, B=(4,5,6,7} and: ((1, 4), (2, 5), (3, 6)} be a function from A to B. Show thay fis one-one but not onto. |. In each of the following cases, state whether the function is bijective or not. Justify Your 6. answer. (i) f:R > R defined by f(x) = 20 +1 (if) fs RR defined by f(x) = 3 - Av (CERT) (iii) f:R > R defined by f(x) = 1+ 2°. (CER) 7. Letf:R > R be defined as f(x) = x4, Show that fis neither one-one nor onto. . Show that the function f: R > R defined by f(x) = cos x is neither one-one nor onto, 9, Show that the function f: R > R defined by f(x) = sin? xy + cos? x is neither one-one nor onto. 40. Show that the function f: I> I defined by f(x) = 12 + vis neither one-one nor onto. Hint. (0) = 0 and f(-1) = 0 = fis not one-one. Consider —1 € I (codomain of f). As. x? +x = =1 ie. x2 4.x +1 = 0 has no solution in 1, so there does not exist any x € I (domain of f) such that f(x) = <1. 11. If the function f: 1 > Tis defined by (2x41, ifxisodd f(x) = 1 find 2x -1, ifxiseven, ( £G) (i) f(A) (iii) x, iff) Is this function one-one? 12. (i Show that the function f: N > N defined by os [nen ifn is odd n-1,ifniseven is both one-one and onto. (i) Show that the function f: N > N defined by f(n) =n - (-1)" for all n € N is bijective. 13. Find the number of all one-one functions from the set {1, 2, 3, 4} to itself. Very short answerlobjective questions (14 to 29) : 14. Show that the function f: Q > Q defined by f(x) = 3x - 2 is one-one. 15. Show that the function f: N > N defined by f(x) = 2x - 1 is not onto. 16. Show that the function f: N > N defined by f(n) = n? is injective. 17. Is the function f: N > N defined by f(m) = m + m + 2 one-one? Justify your answer. 18. What is the range of the function f(x) = 7-1! [x-11) x-1 19, Find the domain of the function f(x) = ——-—— - 5-3sinx 20. Find the range of the function f(x) = = 1 (Exemplar) ~ cosx 21. Find the range of the following functions : (i) f(x) =sinx + cos x (ii) f(x) =3sin x +4 cos x. 22, The function f: R > R is defined by f(x) = |2x-3]. (i) Isfone-one? (ii) Isfonto? 23, IfA= (1, 2,3) and B = (3, 5}, then write the number of functions from A to B. AsBie gai rc) andl Bes (172, 34) then write the number of functions from A to P. = (a,b) and B = ' 25. A=la A ene PrN i8Ii then welta Ha number of once w Gscsore fom A to By 26. “ ie ‘ 2 an B= (yal, then write the number of onto functions from A to B 27. A= (1, 2,3, 4) and Bs {1,3}, then write the number of onto functions from A to B. 28. Lee Mie rip RIB se enn Veli tha nlenber of one sila ents Aunctions from pe. IAs (1,2,3,4) and Bm (a,b, cl, then write the number of bijections from A to B. Answers 2. (i) Fis injective but not surjective (ii) fis neither injective nor surjective Gii) Fis neither injective nor surjective (iv) fis injective but not surjective (2) fis injective but not Surje ; ctive (vi) fs both injective and surjective 6 () Bijective (i) bijective (ii) not bijective mn (7 (i) 7 (iii) -4,-5; No 13. 24 17. Yes 18. (1,1) 19.R 20. 5-1] 3 2. (i) -V2,V2] (ii) [-5, 5] 22. (i) No (ii) No 23.8 24. 64 25. 6 26. 6 27. 14 28.6 29.0 1.4 COMPOSITION OF FUNCTIONS Let A, B, C be three non-empty sets, fbe a function from A to Band g be a function from B to C. The question arises: can we combine these two functions to get a new function? Yes! The most natural way of doing this is to send every element x ¢ A in two stages to an element of C—first by applying fto xand then applying g to the resultant element f(x) of B. This leads to: Definition. Let f:.A—> Band g : B—>C be two functions, then the composite of fand g, denoted by 80f, is the function gof : A > C defined by (gof) (x) = g(f(x)), for all x € A. Fig. 1.8 The composite of two functions is also called the resultant of two functions or the function of a function. : Observe that the order of events occur from right to left i.e. gof reads composite of fand g and itmeans that first apply f and then follow it up withg. Note that for the composite function gof to exist, it is essential that range of f must be a subset of domain of g. For example: 1. Let A = {a, b, c,d, e}, B= p,q." 5} and C = (a, B, 7} and the functions f: A > B and : gB ic be represented by the arrow diagram shown in figure 1.9, then the composite function gof: A> Ccan be computed as: Relations and Functions(eof) (a) = g(f(@) = gt (oof) (0) = gf) = gt) = (eof) © = gf) = g) = 8 (eof) (@) = g(f(@) = g(r) =o (wof) (0) = g(FO) = gs) = B The above figure helps us in visualising the resultant function. Note that fis many-one into, g is many-one onto and gofis many-one into. Let Z be the set of all integers. Define f: Z + Z by f(x) = x + 2 and g : Z > Z by g(x) = x2 for all x © Z. Here the composite maps gof: Z > Z and fog: Z > Z both exist and can be computed as (eof) (x) = g(F(®)) = g(x + 2) = (+ 2)-2 =x, forallx eZ and (fog) (x) =f(g(2)) = f(x -2) = (x-2)+2= x, for all x eZ. Note that gof= fog and each is equal to the identity function on Z. 3. Let R be the set of all real numbers. Define f: R > R by f(x) = x2 and ¢:R + R by g(x) = 2x-3 forall x eR. Here the composite functions gof: R > R and fog : R > R both exist and can be computed as v (eof) (x) = ¢(f(%)) = g(x?) = 2x2 -3 for allxe R and (fog) (x) = f(¢(x)) = f(2x - 3) = (2x-3)? for allx e R. Note that (gof) (0) = 2.0?-3 = -3 and (fog) (0) = (2.0-3)2=9 = (gof) (0) + (fog) (0) = gof = fog. 1.4.1 Some properties of composition of functions ‘We state below some properties of composition of functions: 1. The composition of functions is associative i.e, if f:A>Bg:BoGh C + Dare functions then ho (gof) = (hog) of 2 Letf: AB, g : B+ C be two functions. (If f, g are both one-one, then gof is also one-one. i) If f, g are both onto, then gof is also onto. 3 f A> B is a function and 14, Ip are identity functions on A, B respectively, then | @lgof=f (ii) fol, =F. ‘Remark__ aa Na acento eee eeiicatic neat na i Sl een 1.4.2 The general concept of composition of real functions Let f, g be two real functions and let D = (x: x € Dp fix) € Dg) #6 then the composite of f and v denoted by gof, is the function defined by (gof) (x) = (f(x) with domain D. Fig. 1.10. Thus, Deop= {X:X € Dp f(X) € Dg). Similarly, the composite of g and f, denoted by fog, is the function defined by (fog) (x) = f(g (x)) with Dg = (x € Dy, 8(2) € Dy). The composite of two functions is also called the resultant of two functions or function of a function. In particular, if Ry< D, then Dgoy= Dyand if R, ¢ Dy, then Dog = Dy. Remark _ Itmay happen that gof may exist and fog may not exist. Moreover, even if both gof and fog exist, they "may not be equal. | ILLUSTRATIVE EXAMPLES nem = la plo stanhe ad Example 1. Let f : {1, 3, 4) > {1, 2, 5} and g : (1, 2, 5} > {1, 3} be given by f = (1, 2), (3, 5), (4, )} and = ((1, 3), (2, 3), (5, 1)}. Find gof. (NCERT) Solution. Given f= {(1, 2), (3, 5), (4, 1)} => f(l)=2,f(3)=5and f(4) =1. Also g = {(1, 3), (2,3), (6, 1)} => 3(1)=3,g(2)=3,8(5)=1. We note that gof exists and it a function from (1, 3, 4} to {1, 3} Now (gof) (1) = g (F(1)) = 8 (2) = 3, (Gof) (3) = 8 (F(B)) = 8 (5) = 1 and (gof) (4) = g(f(4)) = (1) = 3. Therefore, gof = {(1,3), (3, 1), (4, 3)}- Note that fis bijective, g is onto but not one-one and gof is onto but not one-one. Example 2. The functions f and g are given by | F={(0, 4), (2, 5), (3, 7)) and g = ((4, 2), (5, 0), (7, 2) (i) Find the domain of fand g. (ii) Find the range of f and g. (iii) Write gof and fog as sets of ordered pairs. Solution. () Domain of f= (0, 2, 3}, domain of g = (4,5, 7}. ; (ii) Range of f = (4, 5,7), range of g = (2, 0)- (iii) Clearly range of f c domain of ¢ => gofexists with domain (0, 2, 3}- Relations and Functions—__ Now (gof) (0) = gf) =84)= 2} (of) (2) =9(F@) = 8) =? and (of) (8) = 9 (FO) = 87) =? => gof= {(0, 2), 2, 0), (3, 2} of gc domain off ain = (4, 5, 7): (2) =5, = (0) =4and Also range => _fogexists with dom Now (fog) (4) = f(s) (fog) (7) = f(g) = f2)=5 = fog= {45,647 5 Example 3. Iff:R > R is defined by. f(x) = 3x +2, find (fof) @)- Asf:R> R,fof:R> Rand is given by = 30x +2)+2 Solution. (fof) (x) = FCF) = FBX + 2) =9y +8, forallxe R. = cos x and g(x) = 3x. Show iff: R—> Rand g:R—> Rare given by f@) (NCERT) Example 4. Find gof and fog, that gof + fog. solution. As/;R > Rand g:R— R, therefore, both gof and fog exist. gof:R> Ris given by (gof) (x) = ¢(F(2) = g (cos x) = 3(cos x)? = 3 cos? x and fog: R— Ris given by (fog) (2) = f(g (2) = f(x?) = cos 3x7. Also (gof) (0) =3 cos? 0 = 3 x 12 =3 and (fog) (0) = cos (3 x 07) = cos 0= 1 = (gof) (0) (fog) (0) = gof + fog. Example 5. Find gof and fog, when f: R > Rand g: R— Rare defined by. f(x) = 8x3 and g(x) = x4. Solution. As f:R > Rand ¢: R +R, therefore, both gof and fog exist. gof:R— Ris given by (gof) (2) = g(f(2)) = g (8x9) = (8x9)!/3 = 2x and fog :R > Ris given by (fog) (x) = f(g (2) = f(22/9) = 8(x1/3)> = Bx. os ea iff: R> Rand g: R—> Rare given by f(x) = |x| and g(x) = [2x5]. Solution. As f:R > Rand g: R > R, therefore, both gof and fog exist. gof: R— Ris given by (Gof) (2) = 8(f@) = (|x|) = |2|x|-5| and fog :R + Ris given by (eg) (2) = flg(@)) =f(|2x-5|) = | |2x-5| | = |2x-5]. Also (gof)(-1) = |2|-1|-5| = |2-5] = |-3| =3and (fog)(-1) = |2(-1) -5|= |-7|=7 = gof# fog.7.1 fi R > Ris give ere If fs R > R is given by f(x) = (3 - x3)118, show that fof solution. As: RR, fof exists and fof: R-> Ris given by (fof) (2) = FF) = f((3 = 13)1/3) = B= (=x) = (3-3 -x3))1/3 = (3)1/3 = x, for allx eR => fof=lp Ip where Ip is the identity map Example 8. Ifthe function f: R > R be given by f(x) = x? + 2 and g : R-» R be given by 6X) = 5x 1, find fog and gof and hence find (fog) (2) and (gof) (~3). Solution, fog and gof both exist and are given by (fog) @) = f(g) =(45) : (4 J 42 x-1 = 2+ %x-1P _ 3x?- 4x42 (x-12 @-1P (sof (2) = gf) =g(02-+2)= 2 =F *? forall ce R @242)-1 t+ (fog) (2) = === = === =6 and , for all x € R,x #1 and (gof) (-3) = Example 9. Let A =R- (2|,B-R- {2}, motions f:A -> Band g: B+ A bedefned by : ; , _ 3xt4 _7x+4 fO)= 57 Bd as saaese Show that gof = Ig and fog = Ip, where I, and Ip are identity functions on A and B respectively. ; : (NCERT) Solution. As f: A> B, and g: B— A, gof exists and gof: A> Ais given by x +4 Io t4 3x44) _ (sof) @) = so) =8(F"3) = = 2Zix+28+20x-28 _ AIX _ y for allxe A 15x + 20 15x + 21 41 2 gof = Ih. Also, as g : B > A and f: A — B, fog exists and fog : B — Bis given by giet eG 7x+4 Sy= 3 (jos) (s) = flan =1( 35] set Ee _ 2ix+12+20x-12 _ AIK =, for allx e B = 35x+20-35x+21 41 > ‘fos = Ip Example 10. ff, g, h are functions from R to R, show that (f + g)oh = foh + goh. (NCERT) Solution, Clearly (f+ g) oh: R-> Rand jolr+ gah: R—> B- For all x < R, we have (fg) of) (x) = (f+ 8) HC) =FHCN) +80) Relations and Functions ee5 Also, for all x € R, (foh + goh) (x) = (folt) (x) + (goh) (x) = F(X) + gO) => (f+ g)oh = foh + goh, Example 11. If f: NN, ¢: NN and hs N > R are functions defined by f(x) _ gv) = 3y + and h(z) = sin z for all x, y, z € N, show that ho (gof) = (hog) of. (cep Solution. ho (gof) and (hog Jof are both functions from N to R. For all x € N, we have (ho(gof)) (x) = h((gof (x) = h(g(F))) = h(g(2x)) = h@ x 2x 4 4) = h(x + 4) = sin (6x +4) and ((hog)of) (x) = (hog) (F(x)) = (hog) (2x) = h(g (2x), = h(3 x 2x44) = h(6x + 4) = sin (6x + 4) => ho(gof) = (hog)of. eede0) Example 12. Iff:R— R be the signum function defined as f(x) = | 0, x =0 Ia 0 and g: R + R be the greatest integer function defined as g(x) = [x], then determine whether fog and gof coincide on (0, 1] Solution. Clearly gof: R-> Rand fog: R— R. Consider x = ; which lie in (0, 1]. Now (g0)() =8{#(3)}-8@=11=1 A )-A@)-- = (2 = gof # fog on (0, 1]. (1) and (fe) (5) =f Example 13. ff: ZZ is defined by f(n) = 5n for all n < Zand g: Z > Z is defined by n 3 Se (F Fnisamultipleof5 oy aun ez, 0, if nis not a multiple of 5 then show that gof = Iz and fog +z. Solution. As f: Z > Z and g : Z — Z, therefore, both gof and fog exist and are functions from ZtoZ. g0f: Z + Zis given by (gof)(n) = ¢(f(n)) = g(5n) = a =n =1z(n), forallne Z > gof=lz, fog :Z— Zis given by es ISC Mathematics-XH (I) >eee | 5} ia isa multiple of fO), ifnisnota multiple of 5 n 5x, ifm isa multiple of 5 5X0, if mis not a multiple of 5 e i ifm is a multiple of 5 0, if nis nota multiple of 5 Thus (fog)(n) # 1 for all n € Z. In fact, (fog) (n) = n only when n is a multiple of 5. Therefore, fos #1 Example 14. Iff: R > R is a function defined by f(x) = ax +b ‘for all x € R, then find the constants a and b such that fof = Ip. Solution. As fis a function from R to R, fofis a function from R to R. Given fof = Ix = (fof) (x) = Ig(x), for allx e R F(F@) =x, for allx eR flax +b) =x, forallxeR a(ax +b) +b=x,forallx eR #x+b(a+1)=x,forallxeR @=1 and b(a+1)=0 a=+1and b(a+1)=0. Ifa=1, then b(1+1)=0 > 2b=0 >b=0. Ifa =-1, then b(-1 +1) =0 = b.0 = 0, whichis true for every b € R. Hence, a=1 and b=0 ora =~1 and b canbe any real number. UUUUUD Example 15. Describe the functions gof and fog (if they exist), where (@ f@)= Ve, g(x)=22-1 (ii) f(x) = Vx, g(x) =-(x2 + 0). Solution. () Given f(x) = Vx = D,=[0,~), Ry= (0, ) and g(x) = x2-1 = D,=R,R, = [-1,). For gof: Since Ry = [0, 0) CR = Dy => Dyoy= Dy= (0, 2), » gofis defined with domain [0, 0) and Gof) (x) = (fl) = (Sx) = (Wx P-1=x-1. For fog: Dog = {x;x € Dy and g(x) € Dy) (x; x € Rand x2-1 € (0, «)} (x; x ¢ Rand x7-120} x; x € Rand x22 1) ={x;x € Rand |x| 21) = (-«, -1] U[1, ») +. fog is defined with domain (~2, -1] V [1, 2) and (fog)(2) = f(@ ()) =f? 1) = Vx? - 1. (i) Given f(x) = Jx => Dy=[0, 0), Ry= 10, 0) and g(x) = -(x? + 1) > D,=R, Ry = (-,-1]. Relations and Functions 47For goft Ry= [0, 00) R = Dy = Dy = Dy= 10, ), defined with domain [0, ) and (f0)) = g(t) = (ve P+ =O 4D: HX € Dy and g(x) € Dy) yyxe Rand =(x? +1) € [0,)} = {xx Rand -(7 + 1)20) | =(xjxe Randy? +10) = |xyx e Rand x? s-1) = => fog is not defined. Example 16. If f(x) = ¢* and g(x) = log x, find fog and gof. Are fog and gof equal? Solution. Given f(x) = e* => Dy= Rand Ry= (0, ) and g(x) =log xD, = (0) and R, = R- For fog » Since Ry = R CR = Dy=> Djog = Dy = 0, #) fog is defined with domain (0, ) and (fog) (2) = f(g (a) = flog x) = el8* = x. For gof: Since Ry= (0, ) < (0, 20) = Dy => Dgoy= ‘gof is defined with domain R and (eof) (x) = 8 (F(2) = g(€9) = log e = x loge=x.1=x. We note that Doe # Dey = fog # Sof. ~ got (eo) (x For fog: Dig 8 20 forall x cp) Example 17. flx) = —1, find (fof) (2). Solution. Given f(x) = a = D,=R-(1}- Doy= be: € Dy fla) € Di = {esxeR-(a) Ate Dy] = [rive tte} =|x:xe-1,x#0) = Dgy=R-(-1,0) fof is defined with domain R - {-1, 0} and Gof) (2) =F) lees = =~ +1 + x41 2 z. = 2rdnx-1_-2 x-l¢x41 Example 18. Show that iff: A Band g : B > Care both one-one then gof: A C is also one-one. (NCERT) Solution. Let x,, x € A be such that (gof) (x,) = (gof) (x3) => gf) =s fa) : = flx)=flx) Ge gisone-one)=> =X) Thus, (gof) (1) = (of) (9) =, (:: fis one-one) = X= gofis one-one. Example 19. Show that iff: A —> Band g : B-» C are both onto, then gof : A —» C is also onto. (NCERT) Solution, Take any arbitrary element z ¢ C. Since gis onto, there exists a pre-image y € B of z such that ¢(y) = 2 Ee Bey Since y € B and fis onto, there exists a pre-image x € A of y such that f(x) = y. Therefore, (gof) (x) = 9 (f(x) = gy) =z F Thus, for every element z eC, there exists x € A such that (gof) (x) =z => gofisonto. EXERCISE 1.4 Short and long answer questions (1 to 10) : 1. Iff={2,3,4,5) > (3,4,5,9} and g: {3,4,5,9)— (7, 11, 15} are functions defined as f(2) = 3, £(3) = 4, f(4) = (6) = 5 and g(3) = ¢(4) = 7, ¢(5) = ¢(9) = 11, find gof. 2. Let A =(3,4,5, 6}, B= (13, 14, 15, 16} and C = (23, 24, 25}. If f:A— Band g:B— Care defined by £={(3, 13), 4, 14), (5, 15), (6, 16)} and 8 = {(13, 23), (14, 23), (15, 24), (16, 25)}, then find gof: A> C. 3. Let A=(1, 2,3, 4}. If the functions f: A> Aand g: A— Aare defined by f={(,4), 2,1), G,3), (4,2)} and &={(1,3), (2, 1), (3,2), (4, 4)}, then find (sof (ii) fog (iit) fof. 4. If the functions f and g are given by f= {(1, 2), (3, 5), (4, 1)} and g = {(2,3), 6, 1), (U3), (i find the domain of fand g. (ii) find the range of fand g. (iif) write fog and gof as sets of ordered pairs. 5. Let R be the set of all real numbers. Find gof and fog when f:R > Rand g : R > Rare defined by (i) f(x) =2x-1and g(x) =x? +3 forallxeR (ii) f(x) =x+ Land g(x) = |x| forallxe R (iii) f(x) =P and g(x) = 2x? + Lforallxe R (ISC 2019) (iv) f(x) = sin x and g(x) = 5x? forall x eR. 6. Iff:R— Ris defined by f(x) = x2 -3y + 2 for all x € R, then find fof: (NCERT) 7. Let R be the set of all real numbers. If the functions f : R > R and g: R > R are given by f(x) =x2 + 3x + Land g(x) = 2x3 forall x ER, then find (i) fog (ii) gof (iii) fof (iv) gog. (Exemplar) 8. Iff:R—> Rand g: R > Rare defined by f(x) = x? and g(x) = x + 1 forall x € R, show that gof # fog. j 9. Iff:R—Randg:R— Rare defined by f(x) = x + 1 and g(x) =x~1 for all x € R, show that of = fog = Ip: i F 10. Iff:R-Randg:R> Rare defined by f(x) = 3x7 -2 and g(x) = sin 2x respectively, find ® gof (ii) fog (iii) fof. Relations and Functions 49short answerlobjective questions (IL to 14) + ‘ 11. Iff:R > Ris defined by f(x) = (8 =2°)'73, then find (fof)(x). 12, If: R> Ris given by f(x) = (5 =.15)"/5, then find fof. 3. TE f() = [x] and g(a) = [x] for all ve R, find « @n(-$)— @ eo(-8). 14, TEfQ) = 44 7 and g(a) == 7, find (fog) (7). So: {(2, 7), 3, 7), (4, 11), (6, 11)} 2. gof= ((3, 23), (4, 23), (5, 24), (6, 25)} 3 gof={(1,4),23),,2),4, 0) (ii) fog = (1, 3), (2, 4), (3, 1), 4, 2)} (iti) fof = (1, 2), 24), B,3), 4 DI 4 @ 13,4,125,1) (ii) (2,5, 11, 13, 1) (iif) fog = (2, 5), 6, 2), (1, 5}, gof= {(1, 3), 3, 0, 4, 3). 5. gof:R > Rand fog : R > Rare given by (@ (of) (x) = 4x2 4x + 4, (fog) (x) = 2x2 +5 (ii) (of) (x) = |x +1], (fog) () = [x] +1 (iil) Gof) (x) = (2x? + 198, (fog) (x) = 2x6 +1 (i) (of) (x) = 5 sin? x and (fog) (x) = sin (5x2). 6. fof: R> Ris given by (fof) (x) = x4 - 6x3 + 10x? - 3x. 7. (@) fog: R> Ris given by (fog) (x) = 4x2-6x+1 (@) gof:R > Ris given by (gof) (x) = 2x2 + 6x-1 (ii) fof: R > Ris given by (fof) (x) = x4 + 6x3 + 1422 + 15x45, (i) gog:R > Ris given by (gog) (x) = 4x-9, forall x € R. 10. (i) gof:R > Ris given by (gof) (x) = sin (6x2 - 4) (ii) fog : R > Ris given by (fog) (x) = 3 sin? 2x-2 (Gi) fof: R > R is given by (fof) (x) = 27x4 - 36x? + 10 11. (fof) (x) =x, for alle R 12. fof: R > Ris given by (fof) (x) =x 23. (i) 1 (i) 2 14.7 1.5 INVERTIBLE FUNCTIONS Z Let a function f: X,Y. be one-one onto and y be any arbitrary element of Y. As f is onto, there exists atleast one element % ¥ xe X such that f(x) = y. Also, as f is one-one, this element x of X is unique. Thus, corresponding to every element y € Y, there exists a dt el Sh unique element x ¢ X, therefore, we can define a function, say g, £ from Y to X i. g:Y — X such that g(y) = x for all y € Y. This function g associated with the function f is usually ! denoted by f-1. Thus, we find that if f : X - Y is bijective ie. Figs HL ‘one-one onto, we can define in a very natural way a new function called inverse of f. This leads to: Definition. Let f : X + Y be one-one onto function and if f(x) = y where x eX, y € Y, then L7:Y ~ X defined by f(y) = x is called an inverse function of f. We reiterate that only one-one onto functions have inverse functions. A function whose inverse exists is called an inversible or invertible function. Further, itis clear that() domain of f-! = range of (ii) vange of f= domain of f (iti) FY) = XIE) = y Where x ex yey, Remark From above it follows that if the function f: as Beene argh nyaring X ~ Y is one-one onto, then we can define a function ‘We note that the composite functions gof and fog exist. gof:X > X and fog :¥ > y, ; For all x € X, we have - POW=NEW) =f =y © (sof) (x) = g(f(x)) = gly) = x and for all y € Y, we have => gof=ly and fog = ly. Ae ay hss even converse is true i.e. if f : X — Y is a function and there exists function g:Y > X such that gof = Ix and fog = Iy then f is one-one onto. This leads to : A function f : X —> Y is called invertible if there exi i : ‘ists function g : Y —» X such that gof = Ix and {fog = ly: The function g is called inverse of f and is denoted a ifs 4 ‘ Ps In particular, iff: X > X isa function and fof = Iy, then fis invertible and f! =f. 1.5.1 Some properties of inversible functions We state below some properties of inversible functions: 1. Inverse of a bijective function is unique. 2. The inverse of a bijective function f is also bijective and (f-!)1 = f. 3. If f: A > B is bijective, then () fA of=1, (i) fof" = Ip. 4. Iff: A> Band g : B > C are both bijectives, then gof : A> C is also bijective and (gof) = f- og 5, Let A be a non-empty set and f: A > A, g : A > A be two functions such that gof = Ia = fog, then f and g are both bijectives and g = f"!. ILLUSTRATIVE EXAMPLES Example 1. State with reasons whether the following. functions have inverse. Find f-1, if it exists. (i) f: (1,2, 3, 4) > (10) with f={(L, 10), (2, 10), (3, 10), (4, 10)} (NCERT) (ii) f 5, 6, 7) > (1, 2, 3, 4} with f= 6,4), (6, 3), (7,2)) (iti) f 2, 3, 4, 5) > (7, 9, 11, 13) with f={2,7),(3, 11), 4, 13), © 9) y (NCERT) Solution. (i) We notice that the different elements 1 2,3 and 4 of the domain of f have the same image, therefore, f is not one-one. Hence, fis not inversible. (ii) We notice that the range of f = (4 3, 2} which is a proper subset of the codomain of f, therefore, fis not onto. Hence, fis not inversible. (iii) We notice that all the different elements of the domain of f have different images in the erefore, f is one we range of f = (7, 11, 13, 9} = codomais codomain of f, therefore, f is one-one: Also th f, therefore, Hs ‘onto. ort fis an inversible function and f+ = ((7, 2), (11, 3), (13, 4), , . , i” (9,5). Relations and Functions 51] = (a,b, cl and B= (a, By} and a function f: A —> B be given by f= ((a, 1), be) | ible? Ifso, find fol and werify that fl of = Land fof 1 =I, where ly And Ip are iden) 1s A and B respectively, y ly, @ B) = Bes fis onto function. Also, we find that different elemen er the function f, therefore, the function fis one-one. Thus, Sieg fol exists. Example 2. Let A ( )). Is fine functions on the s Solution, Here range of f= ‘of Ahave different images und one-one onto function and hence it is invertible ie. Further, f°! (y) =» iff f(x) = y where x € A, y € B, f= {(y, a), (@ b), (BO) Also, as fy A> Band fl: B-> A, therefore, fol of: A> A and fof! : BB and these ar, computed as: (of @ = 1 Y@) =f" 0) =a (fof) (&) = FAO) =f @) =, (Mo © = AYO) =f @) = and (fof) (@) = ff (@) = fb) = a, (fof) (B) = FU) = FO = B (fof) ) = fU'M) = f@ = => fof = {(@, a), ( b), (=I and fof = {(a, @), (BB), ( Y= Ip. Example 8. Let fs N—> Y be a function defined as f(x) = 4x + 3, where Y = y:y = 4x +3, x € N}. Show that f is invertible. Also find the inverse function. (NCERT) Solution. The function fis one-one. Reason: : Consider any 21,7 € N such that f(x) = (4) = 4x +3=4+35x,=2) > fis one-one. The function f is onto. Reason » Range of f= {y: y= 4x +3, x € N} = Y= codomain of f = fisonto. Hence, the given function is one-one onto, therefore, fis an invertible function. To find f2 Let fix) =ys4x+3-yox= eS. Now y= (x) and fis invertible = flex =3 => flw= > Thus, the inverse function f : Y N is given by f-1(y) = 43. Alternatively 3 Consider any arbitrary element y of Y. According to given, y = 4x + 3 for some x € N (domain of f) y-3 = x43 4 Let us define g YN by g(y)= 423. Asf:N > Yand g: YN, therefore, the composite functions gof and fog exist. gof: N+ Nand fog: Y > Y. ‘These can be computed as (sof) ()= g(a) = (4x +3) = 273-2 = efor allx eNi F @ =f(e e y-3 and (fog) (Y) = f(¢(y)) = ( ; )=4 y 8 my (or ail ey = gof=Inand fog = 1 > f iwinversible and gis the inverse of Hence, f-': Y > N is given by fly) = ¥=3 Example 4, Let f: R gof= fog = Tp. Solution. Given f: R > R is defined Consider any > R be defined as f(x) = 10x + 7. Find the function g : R -» R such that 8 f(x) = 10x +7, for all xe R arbitrary element y of R y-7 AsyeR, Uo eR. Letus define g : R > R by g(y) = +2 forally eR Asf:R—Randg:R>R, the composite functions gof and fog both exist. These can be computed as : GP ©) = sia) =g U0r+7) = WEAI=7 _, forall eR and (fog) (y) =Few)=/( 4) =10. we +7=y,forallyeR => g0f=fog=lp. Hence, the required function g : R-> Ris given by ¢(y) = ¥=7,, for ally €R. 8 given by g(y) = 4 y Example 5. Consider the function f : R—» R defined by f(x) = the inverse of f. Solution. The function f is one-one. Renson : Let x, x7 € R be such that f(x) = f(x) 3 4x1 43-41 +3 4x, = 4x, 4x + 3. Show that fis invertible. Also find (NCERT) => x,=x) = fis one-one. The function f is onto. Reason : Consider any y € R (codomain of f). 3 Then f(x) = y => 4x +3=y=>x= Asy eR, Yer Thus, for all y e R (codomain of f), there exists x = oe R (domain of f) such that fia) =f(42) =4 48 say = every element in the codomain of f has its pre-image in the domain of f > fis onto. Hence, the given function is bijective, therefore, it is invertible. Tofind (1: Let f(x)=y=4x+3=y>x= Relations and Functions 53,aff Now y =/(a) and fis invertible = Nweranus Thus, the function “1: R > Ris given by flwe — {1}. Consider the fire! tion fi: A>B defined by fla) = * Example 6, Let A = R= 3} and B= that fis one-one and onto, Hence find f-". Solution. The function f is one-one. Reason : Let xy, X> € ‘Abe such that f(xy) =F(%2) y ty +6 = 2X 3N 28+ 6 =3r, 2% 341 = 42> fis one-one. u The function fis onto. Consider any y € B (codomain of f) ie. y€ Ry #1. = (-Dx=3y-2>7= As ar eR 31 Also 22 S22 + sbecause if YF 2-3 3y-2=3y-3 = -2=-3,whichis a sy Thus,x= 34 ? € A (domain of f) such that = _ every element in B has pre-image in A = fis onto. Hence, the given function fis one-one and onto = fis inversible. To find f= ze 3 Let y=fx)>y= 5 = xy-By=x-2 2 =a" = -x=3y-252- ¥ Now y = f(x) and fis inversible = f@arafiy)= 2. y-1 2 Thus, the function 1: B+ Ais given by f-1(y) = 2¥= y-1 A =2 =3 * Show Example 7.1fA = R- {2} ‘and a function f : A —> A is defined by f(x) = 2243 show that fs one-one and onto. Hence find f1, Solution. The function fis one-one. Reason: Let x, 2 € A be such that f(xy) = f(x.)> Mx Xy ~ 16x, + 18. — 12 = 2a yxy + 1B xy = 169-12 = 3dr) = 34x, 9x) = X1 > fis one-one, The function f is onto. We shall find the range of the function f For the range of f, let y = f(x) => Oxy —4y = 4x 43 => (by-4)x= y+3ax= Wes + bute A oy = 6y-440-> ye 2 ie range off= R— {3 an => _ range of f = codomain of f > fis onto. Thus, the function fis one-one and onto = fis inversible. To find f1: Let f(x) = yo #83 =y = 6xy—4y = 443 4y 43 -4)x= eet euoe = y-4x=4y43— x= U8 Now f(x) = y and fis inversible = yoy See nee = PW=23 P=) Thus, the function f-! : A> A is given by f“1(y) = ai ie f(x) = ae Note that f-1=f. Example 8. Let f: N > Y be a function defined by f(n) = n2, where Y = {y: y= n?, n © N}. Show that f is invertible and find its inverse function. (NCERT) Solution. The function f is one-one. Reason : Consider any m,, 11 € N such that f(,) = f(r) md =m? = m2— mg? = 0 (ry —M2) (ny +) =0 => m-n,=0 (co my, my € N => ny +m #0) => m,=n,= fis one-one. The function f is onto. Reason : Range of f = {f(1) : € N} = {n?: € N] = Y= codomain of f => fis onto. Hence, the given function is bijective, therefore, fis inversible. To find f: Letfin)=y >= yaon= ly (2 >) Now f(x) = y and fis inversible = plyen =fW= Vy: Thus, the inverse function f- : Y > Nis given by fy) = Jy Relations and Functions