ILLUSTRATIVE EXAMPLES how that the function fs N > N, defined by f(x) = 2x, is one-one bul not alto, (NCERD Example 1, Solution, The fiction fis one-one, Reason : Let ay, xy & N be such that FQy) =f Qy) = 2xy = 2x => Thus, #(,) (y) =x) = 4) = fis one-one, The fimetion f is not onto Reason: As 1 € N (codomain of /) and there does not exist any x N (domain of f) such that FQ) = 1.80, fis not onto. Example 2. Prove that the function f: RR, defined by £0) Solution, The function fis one-one. is one-one and onto: (NCERT) Reason : Let xy, a5 € R be such that The function f is onto, Re (x,) = 2x, = 2x) > x, = 2, = f is one-one Consider any y © R (codomain of f). Certainly, x= 2 © R (domain of f). Thus, for all y © R (codomain of f), there exists x = t € R (domain of f) such that Ty) fa) =s[$) =2. 4 ey = fis onto. Example 3. Let Ry be the set of all non-zero real numbers, show that the function f : Ry > Ry defined by FQ) = = is one-one onto. Is the result true, if the domain R, is replaced by N with codomain being same as R,? (NCERT) Solution. The function is one-one. Reason : Let x1, x, € Ry be such that f(x,) = f(r.) = tel sx=x fis one-one. He 2 The function f is onto. Reason : Consider any y € Ry (codomain of f), then fe)=ysbayor=t As y #0, Te Ry ‘Thus, for all y © Ry (codomain of f), there exists x ; © Ry (domain of f) such that 1 soso @ scanned with OKEN ScannerULATIONS AND FUNCTIONS 58N = every element in the cadomain of / has preimage in the domain of f => fis onto, Hence, the given function fis one-one onto, When function f is defined asf: N—> Ry by fQ) = 1, then fis one-one because i ved PO) = FO) 58 Low a xy xy for all xy, 4p @ Ne But fis nol onto because y2 Ry Ra a (codomain of f) and there does not exist any clement in N (domain of f) whose image is. 12 « Example Show that the modulus fimetion fs R > Ry defined by f(x) = Lx is weilher one-one nor one, (CERT) Solution. The function f is not one-one, Reason : Since FQ) = 121 = Zand f2)= 1-21 = 2, so that the di Romain of f) have same image = fis not one-one, The function f Reason: offsf not onto, alle R, Lvl 2.0 = range of f= [0, «), which is a proper subset of R (codomain iS not onto, Example 5. Shotw 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, = [eomas(d (domain of f) have same image = fis not one-one. The function f is not onto. Reason : Range of f= I (set of integers), which is a proper subset of R (codomain of f) = fis not onto. Example 6. Show that the fractional part function fs R > R defined by f(x) onte nor onto. Solution. The function f i not one-one awn see (3) = 4- [3] different elements }, 3 ¢ R (domain of f) have same image Reason : Since f {4 _ G = 0, so the two different elements 5,5 of R = [x] is neither one- 1 1 3, 80 the two es F ana f (3) = fis not one-one. ‘The function f i not onto. Reason : Range of f= [0, 1), which is a proper subset of R (codomain of f) = fis not onto. Example 7. Show that the function f: N— N, given by f(1) = fQ) = 1 and f(x) 1 for every x > 2, is onto but not one-one. ce Solution. The function f is not one-one. Reason : As f(1) =/(2) = 1, $0 thatthe different elements 1 and 2 ofthe domain of fhave same image 1. Therefore, fis not one-one, ‘The function f is onto. Reason : Consider any y € N (codomain of f), y # 1. Certainly, x = y +1 € N (domain of f). ‘Thus, for all y € N (codomain of f), y #1, there exists x = y + 1 € N (domain of f) such that a) fy s+ Deytl-i=y. ee ue N (codomain of f), we have f(1) = 1. ‘Therefore, the function f is onto, tl @ scanned with OKEN Scannera UNDERSTANDING ISC MATHEMATICS. "+1 itnisodd 3 Example 8, Let f: N -> N be defined by fn) = for all n € N. Examine whether jy, E, puis eon function f is onto, one-one or bijective. (CERT Solution. The function f is onto, Reaso : Consider any n € N (codomain of f). Certainly 2n € N (domain of f). Also 2n is even. Thus, for all € N (codomain of f), there exists 2n ¢ N (domain of f) such that £0n) = an = Fis onto. The function f is not one-one. Reason : As 1, 2. N (domain of f) and f(1) = it = 1, f(2) = 2 =1,s0 that the different elements 1 and 2 of the domain of f have same image 1 Therefore, f is not one-one. Hence, f is not bijective. is neither one-one nor onto (NCERT Exemplar) Example 9. Show that the function f : R > R defined by f(x) = == Solution. The function f is not one-one. 2 Reason : Since f(2) = > — so the different elements 2 and i of R (domain of f) have same image. Therefore, f is not one-one. The function f is not onto. Reason : Note that 1 € R (codomain of f). aT but it does not give any real value of x. Let x € R (domain of f) be such that f(x) = 1 = = toxtl= Hence, the function f is not onto. Example 10. Slow that the function f: R ~> R defined by f(x) = 322 + 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, f is a many-one function * ‘The function f is into. Reason : Since for all x € R, x20 > 3220 => 3x7 +525 = fl) 25 forallxeR = range of f=[5,), which isa proper subset of R(coslomain off), range of fx eodomain of en {fis an into function. Hence, the given function fis many-one into, @ scanned with OKEN ScannerRELATIONS AND FUNCTIONS Example 1, Let C be the set of complex numbers and R be the set of real nunibers. Show that the function f: C — R defined by f(z) = \z| for all z € C is neither one-one, nor onto. (NCERT Exemplar) Solution, The function F is not one-one. Reason : The complex numbers 3 + 4i and 4 + 31 are such that "344i = VB? 44? = 5 and 1443i1= VF 43? =5 ie 1344i1= 144311, so the different members 3 + 4i and 4 the function f is not one-one The function f is not onto, Reason : For all z ¢ C, |z1 of f # codomain of f = the function f is not onto. Example 12. Show that the function f : RR defined by fix) = sin x is neither one-one nor onto. Solution. The function f is not one-one. * 31 of C (domain of f) have same image, therefore, 20 => range of f= (0, =), which is a proper subset of R ie. range Reason : Since f (0) = sin 0 ~ 0 and f(x) = sin x = 0, so the different elements 0, x of R (domain of f) have 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= subset of R (codomain of f). Therefore, f is not onto. Example 13. Show that the signum function f : R—> R defined by Ge) f=) 0, x=0 -1 x<0 1, 1], which is a proper 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), which is a proper subset of R (codomain of f) = fis not onto. : Example 14. Show that the function f: RR defined by f(z) = Lx1 +. i8 neither one-one nor onto. Also find the range of f Solution. When x 2 0, 1x1 =x = fa) =x4x= 2% when x <0,[xl=-2 =f) =-r+4=0. ax , x20 ts se {5 oY eo: The function f is not one-one. Reason: As f(x) = 0 for all x <0 = fel) =0and f(-2) = 0. é So, the two different elements ~1, ~2 € R (domain of f) have same image = _ fis not one-one. For range of function f : When ts 0, 2x 2 0 and when x <0, fe) =0 = range of f= [0.). ad @ scanned with OKEN Scanner> « wpenstanDINe 15C MATHEMATICS -Xi1 gy 38 The function f is not onto, iain of f) Renson: Range of f= (0, =), which is a proper subset of oe => fis not onto. & snl by vn that the function f: R Example 15. Lat R be the set of all real numbers. Show that the fi es f(s) = ar + b, for all xe Rrwhere a, be Rand a #0 is a onerone Solution. The function f is one-one, Reason : Let Xy, 3 € R be such that f(x) = G2) = at, thar +b = ax, = 0x; a0) 0 + x-y=0 Thus, f(4) =f) 3 x= 4; = fis one-one. The function f is onto. Reason : Consider any y € R (codomain of f) b Then fx) =y > axtb=y 33 Asye Randaxo, eR, ‘Thus, for all y € R (codomain of f), there exists x = € R (domain of f) such that +bey Fo) =4( = every element in codomain of f has its pre-image in the domain of f = fis onto. Hence, the given function f is a one-one correspondence. Example 16. Show that the function f : N+ N defined by f(x) = ax + 8, a, b © N is one-one but not onto. Solution. The function f is one-one. Reason: Let x; x, € N be such that f(x,) = f(x,) ae N,soa20) Flt) = x, = x, = fis one-one, The function f is not onto. Reason: Consider any b¢ N (codomain off) and if there exist some x € N (domain of f) such that fle) = b, then ax +b =B SIGE Niece: (0 N,soae0) But Oe N, therefore, thee does not exist any x € N (domain of) such that x)=. Sof =i Go; is not onto. Example 17. Prove that the function f : N— N defined by f(x) Solution. The function f is one-one. _ Reason: Let x, %, € N be such that f(x,) = f(x) SB oxptytiaattn stort xe — > (-mytmtD=0 +x + Tis one-one but not onto. = yr mTO Cray mH eN, aya wie 6 80 Schack 1s 0) 5 ‘Thus, fla) =f) 241 = 2 = fis one-one, @ scanned with OKEN ScannerRELATIONS AND FUNCTIONS 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 2 Pere ata ter-0axes 120 = ¥x=0,-1but0,-1¢ N. Thus, the element 1 of domain of f has no pre-image = fis not onto. Example 18, Show that the function f : N > N defined by f(x) = x is injective but not surjective Solution. The function f is injective. Reason: Let xy x, € N be such that f(x,) ~ fz) = xPexsoxiexs = Go GP+yxytx)=0 => y-y=0 (5 ay ty © N80 x2 + 4 % + 22 > 0) = x= Xp Thus, f(x) = fl) = x = x; = fis one-one ie, 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 (2) = 2 ie. x = 2. So, fis not onto ie. fis not surjective Example 19. Show that the function f : R > R defined by f(x) = 2x° - 7 for all x € R is bijective. Solution. The function f is one-one (injective) Reason : Let x,, x, € R be such that f(x,) = f(x) = wi-7-28-7 = wf-28 2 dod 28 a ae xP xP =0 S&P + y+ = a 2 = 4-4) =0 or xf tax, + d=0 = =m orm=m=0 2 Toes xPtmyt de (a +d) + Sx} > 0 for all xy x) © R except when x; = Thus, f(x) =f) 3% = % = fis one-one. The function f is onto (surjective). Reason : Consider any y € R (codomain of f). — +7 +79 Then fa)=y 2 w-7=y aoe to x=(47) eR ‘Thus, for all y € R (codomain of f), there exists z @ R (domain of f) such that poor) (Ae) teers = every element in codomain of fhas its pre-image in the domain of f (eZ = fis onto. Hence, the given function f is bijective. Gq \ @ scanned with OKEN Scanneroa Seeger rey A B defined by flO = 55 I Example 20. Let A = R — (3] and B = R (1). Show that the furrction f (CERT Eerley is bijective. Solution, The function f is one-one, Reason: Let x, x, € A be such that f(xy) = /(%) 4-2-2 a2 eee aes ny + 6 = ayy — 2x, - Sey + = yr -3y 2x, ~ 3x, 9 x) = = ~3x, - 2, (13) => x, = x2 = fis one-one. Thus, f(a,) = The function is onto. Reason: Consider any y € B (codomain of f) ie. y€ Re y #1. Let > ay- Asye Rand y#1, so 34) 3y-2 by- Also Sp #3 because YP =3 = 3y-2 = 3y-3 = 1=0, which is impossible. Thus, x = a © A (domain of f) such that a for-s $5) = Seat oy a = _ every element in the codomain of fhas presimage in the domain of f = fisonto. Hence, the function f is bijective. Example 21 Show thatthe exponential function f: > Ry* defined by f(x) = eis bijective, where Rt is the set of all positive real numbers, Solution. The function f is one-one. Reason: Let x, x, € R be such that f(x,) = flx,) Thus, f(x,) = f(,) = x, = x, = fis one-one, The function f is onto. Reason: Consider any y € Ry* (codomain of f) Let f(x) = y= ey > x= logy. As ye R,*, logye R. Thus, x = log y © R (domain off) such that f(y) = y = _ every element in the codomain f has pre-image in the domain of f = fis onto. Hence, the given exponential function is bijective, @ scanned with OKEN Scannerore a | Example 22. Show that the logarithmic function f : Ry* > R defined by f(x) = log, x (@ > 0, a # 1) is 4 bijection, where Ry* is the set of all positive real numbers. Solution, The function f is one-one, Reason: Let x, x3 © Ry* be such that f(t) > 108, x) = log, x = x, Thus, £6) The function fl) = x; = fis one-one. Reason: Consider any y € R (codomain of f). Let fQ) = y= log, sy = r= at AS YER we Ry Thus, x = a¥ © Ret (codomain of f) such that f(x) = y = every element in the codomain of f has pre-image in the domain of f = fis onto. Hence, the given logarithmic function is bijective. Example 23. Show that the function f : W— W defined by ‘ey fee if nis even n-1, ifnisodd Solution. The function f is one-one. Let n, m & W be such that f(n) = f(m). Three cases arise : Case I. When n and m are both even. f(r) = fon) = n+1=m+1 an=m. Case II. When m and m are both odd. f(a) = fm) =n m-1 sn=m, Case III. When one of n, m is odd and the other is even. Let m be odd and m be even. Then f(n) = fn) = n-1=m+1 => even integer = odd integer, which is wrong. It follows that when 1 is odd and m is even, f(n) # fn). Similarly, when n is even and m is odd, then f(n) = f(m) > n+1=m-1 => odd integer = even integer, which is wrong. It follows that when m is even and m is odd, f(n) # f(im). ‘On combining all three cases, it follows that f is one-one. The function fis onto Consider any ne W. Two cases aris Case J. When » is odd, then n ~ 1 is even and it belongs to W such that fn 1)= (0-1) #1 Case II. When 1 is even, then 1 + 1 is odd and it belongs to W such that fla + =e D-1en Thus, in both cases we find that every element domain of f = fis onto. Hence, the given function is bijective. Example 24, Show that the function f: N-» N defined by f(a) = n~ (1), for all m © N, isa bijection. n= (1), for all ne N. If n is odd, then f(n) = 1 = under =n (I) =n + 1; If mis even, then f() = m ~ (-1}sver nate number = yp — 1, is bijective. CERT the codomain of f has its pre-image in the @ scanned with OKEN Scanneret Thus, f() (a ifm isodd n-1, ifniseven Fis one-one Let n, mt € N be such that f(1) = f(m) Three cases arise : Case I. When n, m are both odd. fo) =f(n) n+ 1=m+lonem Case II. When fv) = fm) = n-1=m-13n=m. Case ITI. When one of 11, m is odd and the other is even. Let n be odd and m be even, then. oa ig F(2) = fm) = n+ 1 =m ~1 = even integer = odd integer, which is wrong: It follows that when n is odd and m is even, f (n) # f(m)- Similarly, when 1 is even and m is odd, then | f(x) = fm) = n-1 =m +1 = odd integer = even integer, which is wrong. It follows that when 1 is even and m is odd, f(n) # f(m). On combining all the three cases, it follows that f is one-one. fis onto Consider any n © N. Two cases arise n, m are both even. Case I. If n is odd, then 1 + 1 is even and it belongs to N such that f+ 1)=(n+1)-1=n, Case I. If m is even, then 1 ~ 1 is odd and it belongs to N such that fr-1)= (1-1) +1 =n. Thus, in both cases we find that ever domain of f = fis onto. Hence, the function f is bijective. ry element in the codomain of f has its pre-image in th Example 25. Let A and B be two non-empty sets. Show that the function f: Ax B+ Bx A defined b (la, b) = (b, a) is bijective. f i en Solution. The function f is one-one. Let (ay by), (ty by) © A’ B be such that f(a, by)) = f((ay b,)) = (by 4) = bby @) 2b, = = (a,b) = yb). Thus, f(a, b,)) = flay b)) > (ay The function f is onto Consider any element (b, a) € Bx A, then b ¢ Bandae A = (a, de AXB. Thus, for any (b, a) € Bx A, there exists (a, = fis onto. Hence, the given function f is bijective. 1p and a, = a, 4) = (a b,) = fis one-one, 5) © AXB such that f(a, dD) =@ a) Example 26, Show that a one-one function f 0, 2,3) - (1, 2,3} must be onto gee ‘4 tion. Since the function fis one-one, three elements of (1 (NCER Solatiorent elements ofthe codomain 1,2 5} Thereone ic, aoe usb ake onto, @ scanned with OKEN ScannerRELATIONS AND FUNCTIONS & ‘ample 27. Show that an onto function LE 1L 2,3) > (I, 2, 3) must be one-one, (NCERT) Solution. Suppose r ‘Fis not one-one, Then there exist (wo elements say 1 and 2 in the domain of Fwhose image in the codomain is the same clement. Also the image of 3 under fis only one clement. Therefore, the range of fcan have almost two elements of the codomain (1, 2, 3} of J Ut follows that the function is not onto, a contradiction Hence, the function f has to be one-one, REMARK, ‘The results mention i we in Examples 26 and 27 are true for any arbiteary finite set X. Let X be a finite set and f: X — X be a function, we have (0 iCFis one-one, then it must be onto, and Gi) HEF is onto, then it must be one-one. In general, let X an : nd Y be finite sets such that n(X) = n(¥) and f: X — Y be a function, we have (} i€ fis one-one, then it must be onto, and (i) if Fis onto, then it must be one-one, Example 28. Find the sumber of all one-one functions from set A = (a, b,c} to itself Solution. A one-one function from (a,b, | to itself is simply @ permutation on three symbols 4b, ¢. Therefore, the total number of one-one functions from {a,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. Example 29. Consider the identity function Iy : N—> N defined as Iy (x) = x for all x € N. Show that Ty 8 onto but Iy + ly: N+ N defined as (ly + Iy) (8) = ly (x) + Iy(2) = x + x = 2x iS not onto, (NCERT) Solution. Identity function ly is onto, Renson: Consider any y € N (codomain of ly) Let fQ)=ysx As ye N,xe N (domain of ly) such that f(x) = y => every element in the codomain of Iy has pre-image in the domain of ly >, = lyis onto. Iy + ly #8 not onto. Renson: (ly + ly) (@) = hy) + hy G) = 2 4 x= 2x for all © N, As 1€ N (codomain of ly + Iy) and there does not exist x € N (domain of ly + Iy) such that (ly + Ty) @) = Vie. 2x = 1 = ly + ly is not onto. = i in x and a function g :{ Example 30. Consider a fucton f bo a] given by f(x) = sin x and a function g iven by glx) = cos x. Show that both f and g are one-one but f+ g is not onewone. (CERT) ‘ a 5) a 5 Solution. Since for any two distin element xy 1 € [0,4], sin x sin x and cos # 68 % fe) # f) and g (x) # g (x), both fand g are one-one. But (f+ g) (0) = f(0) + g(0) = te fx sin 0 + cos0=0+1=1and (f+) (3)-7(8) +8 (8) in Ft cos 5 =1+0=1. Thus, z = in |0, © | of the function f+ ¢ which there exist two different elements 0 and © inthe domain [o, 2] ofthe function f+ § have same image 1, therefore, f + is not one-one, y @ scanned with OKEN Scanner