Scribd
Upload
63 views15 pages

DSGT - Functions

The document discusses the concepts of relations and functions, including definitions, types, and representations. It covers various types of functions such as surjective, injective, and bijective, as well as the composition and inverse of functions. Examples are provided to illustrate these concepts in a mathematical context.

Uploaded by

jatindhakoliya8317
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
63 views15 pages

DSGT - Functions

The document discusses the concepts of relations and functions, including definitions, types, and representations. It covers various types of functions such as surjective, injective, and bijective, as well as the composition and inverse of functions. Examples are provided to illustrate these concepts in a mathematical context.

Uploaded by

jatindhakoliya8317
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 15
yy $0 2020 aaa BSE elton 10019 91000 closure Mg ange » range aia Mp =] flor 10019 o1oor pp 2.16 FUNCTIONS 1 he previous section, we have discus ae Hiscussed relation, [function sa special Pe of ration. Before sty iy ction, let us revise Fe" concepts of relatos, fun Lot A and B be two sets. R bea relation from A to B RCAXB. Domain of Ris st of frst elements in the ode in present in R, Range of R is s pairs present in R cet of second elements in the orient set B is called co-domain. f from set A to set 8 3 the relation i set A, a} cone elemeti TD Definition : A function relation, such that domain of every element in is related to1evacty ted asf: AB tion, the following points can b Its represer As fis arelat - IfGAxB. f exe york age of 0 3 noted. tex, yo fits presented as f — i called an argument and y is called im itis unique. y is also called value of Fat (fl =1Al A function is also called mapping. © example LetA = (1,2,3,4} B= (0,1) bea function from A to B given as follows. od?) f ={, <2,0>, <3,1>, <0?) - sven 4 @ scanned with OKEN Scanner yr g uct svt § Graph Theory (MU Sem 3.Comp) ean ao be epesented as, y =f (=x mod 2 LfQ= FD= 1G) =0 a) 2.17 REPRESENTATION OF Ld FUNCTIONS ac every function is a relation, it can be represented natix and graph, In the previous example we have ws een thle 2 [,<205, <3,1>, <4,0>) ‘This is represented as follows. G sfo 4 1 2\4 ° 2 sjo 4 3 ala ° 4 Fig. 217.1 Itcan be seen that, in matrix representation, every row hos single entry as 1, and other entries are zeros. Thus, we can use a tabular form to represent a function as follow: px2a7a Let A= (0.1,2,3,4) andt Such that f (x) = (x + 1) mod 5. Write the Ce occ using tabular and graphical notation. YZ sotn. f(x) =(x+1) mod 5 f= {, <1,2>, <2,3>, <3,4>, <4,0>) Tobutr form Graphical notation t off oe "0 1 [2 1+ ot aia 20. 02 3 [a 36 23 4 [o ae 4 Fig. P.274 1f the relation is on one set, then we represent the elements in the set as nodes of the graphs, but in case of 2.53 Relations & Functions. function, the elements are represented as if the elements belong to two different sets. ‘Thus, the graphical representation is not recommended as follows 2g Fig. P. 217.1(0) Example Let f and g be two functions from set of real numbers R to set of integers I given as follows. FR f(x)=Lxl where LxJis greatest integer less than or equal to x It is known as floor function, g:Rol g(x) =fx] where [xis smallest integer greater than or equal to x. - It is known as floor function. Ex. £732) = 7.32J=7 (7.9999) = 17.9999] = 2(7.32) = [7.32128 2 (7.9999) = |7.9999J=8 £023) = L-23, 2-23) = [-23 > 2.18 TYPES OF FUNCTIONS ‘There are three different types of functions. This differentiation is as per the number of elements in the sets, and the way the elements are related. If a function is given as f : A —> B, then A is called the domain, B is co-domain, and the range of the function, represented as Ry is the sub set of B with elements that are images of the function Teo Paliations nn Where Authors inspire innovation A SHCHIY SHAH Venture @ scanned with OKEN Scanner Wel oiccrete sirsetues & Graph Theory (MU - Sem 3-Comp) 284 Relations & Function 2 Example Let A= 10,1. 2,3.4,5.6) B= {2.3.4.5) Letf:A>B, Such that £(x) = number of alphabets when x is written in words, {<,4>, <1,35, «23>, <3.5>,
, <54>, <6,3>) Domain = A Co-domain = B Range of function = Ry= (3.4.5) CB. Types of Functions (A) Surjective or Onto Function (B) injective or One-to-One (©) Bijective or One-to-One Onto Fig. 2.1841 : Types of Funetions Syllabus Topic : Surjective Function %S. 2.18.1 Surjective or Onto Function 1D Definition : A function f : A —> B is called onto or| surjective if the range of function f R=. Example Let A ={1, 2, 3, 4, 5) B= (0, 1) and f be a function given as, £: AB, where f (x) = x mod 2. {<1,1>, 2,05, <3,1>, <40>, <5,1>) oRy = (01) CB. 2 fisomto. Note that iff: A Bis onto, then | A121B 1. If a function is not onto, then itis called into. ~~“ Syllabus Topic : Injective Function = Ya_2.18.2 Injective or One-to-One (Definition : A function #: > Bis called one-t- op] or injective, f every element in Ais related to distin clement in 8 ie Vxye Aifxny then fo) #f I= IAL Example Let A = (1,2,3,4,5) and fbe a function Given as, FAN, where f (8) =x" ff = [ch l>, Qd>, B,9>, <4, 16>, <5.255} Ry = (14,9, 16, 25} 2 IRL StAl=5 fis one-to-one. Note that, iff: A —> B is one-to-one, then! AI1B\ Syllabus Topic : Bijective Function YS _—_-2.18.3 Bijective or One-to One Onto Definition : A function f: A > B is called one- tonto or bijective, if fis both onto and one-to-one. on Example Let A = {0, 1,2,3,4) and f be a function, Given as, £:A— A, where f (x) = (x + 1) mod 5 ff = [<0\l>, <1,2>,<2,35, 3,49, <4,0>) R, =(0,1,2.3,4)=A ‘one-to-one onto Note that, if f : A > B is one-to-one onto, tes IAI=IBL Syllabus Tople : Composition of Functions 1 2.19 COMPOSITION OF FUNCTIONS ‘We have seen composition of relations in section 29 composi mn of functions is similar to it, But & representation and order of computation is different. Tech-Neo Publication vn Where Authors inspire innovation ond SACHIN SBA Foe @ scanned with OKEN Scanner example 1 piscrete Structures. & Graph Theory (MU =Sem3-Comp.) 2.55 Relations & Functic gl cre elations & Functions fp, ‘such that, Let: AB, and g: B > C, be wo functions, then | LEW) =y it ty) =x. composition function gof is given by, Note that every function cannot have an inverse gol: C, such that, yxe A.gof(x) =a (f(x). example 2 Let A 0, 1,2, 3,4) B =(1,2.3,4,5) and C= (0, 1,2) Letf: A> B, g: B—> C be two functions given as, x mod 3. £0) = (+1), 260 Find gef. Let us represent the functions in tabular form. At & ol! TTI 1]2 212 213 3\0 3/4 nn 4[5 ie «gf @) =g (FO) = gl gef (1) =g (f(1))= (2) =2 gof (2) = 8 (f(2)) = g3)=0 gef 3) = 8 (FG) = 9(4)=1 gef (4) = 8 (f(4)) = (5) =2 # B0F = {, <1,2>, <20>, <3,1>, <4.2>) In this example, the function f is one-to-one onto ot bijective, the functions g and gef are onto or surjective. Syllabus Tople : Inverse of a Function ye » 2.20 INVERSE OF A FUNCTION In section 2.12.1, we have seen converse of a relation. Definition : As function is also a relation, thus it has its converse A function f : A > B is said to have inverse function f= 1 if its converse is also a function, The inverse fu m. This Ex. 2.20, function if it exists, is given by Teeh-Neo Publications an... Ihere Authors inspire inmoration f:A— Bis given by, Soln. : fis bijective. A function has an inverse function if and only if it is bijective i.e, one-to-one onto, The function which has inverse is called as invertible function, Example Module Let A=(1,2,3,4) B={a,b, c,d) and function f {, <2,b>, <3,c>, <4,d>) funetion is one-to-one onto, ++ Tthas an inverse function. BA, where , , <¢,3: A Let A = {0, 1, 2, 3, 4} and f be a function — Awhere Uaioe Find f~' if it exists thas an inverse function, Given that f(x) = (x + 1) mod $ we can write. F@=1, £()=2, F@=3, 1B)=4, F)=0. M'©=4 F'=0, H'@=1, F'G)=2, fo! @)s3. Ex. 2.20.2 Let A = {0, 1, 2, 3) and f be a function FAA YM son.: f(x) =xmod2. 2 f = {<0,0>, , <2,0>, <3,1>) ‘This is not one-to-one onto, «Inverse function does not exists. A SACHIN SHAH Venture @ scanned with OKEN Scanner Diecrote Structures & Graph YH 2.21 SOLVED EXAMPLES he ect of natural BRIN ane ch of the TiN fnctions are one-to-one, which are onto and : which are one-to-one oto, (a) ENON Mey +2 (b) f:NAN_ fj)ejmod3 {! jisodd (0 f:NIN =] 0 jiseven {1 jisodd (d) f:NA101fD=] 9 jiseven D soin.: (a f:NON (Maj +2 f2 [0,2 hd, 26>, BN ad Every element in N has distinct element fis one-to-one. () NON fG=jmod3 {2 {<0,0>, <1, 13, 2,25, , , <2, 0>, <3, I>, fis neither one-to-one, nor onto. { 1 jisodd “310 jiseven = {<0,0>, <1, 1>,<2,0>, <3, I>, fis onto. (© f:NON (@ f:N3 (0,1) £0) Ex.2.21.2 Let I be the set of integers, I be the set of positive integers and I, = (0, 1, 2, .... p=). Determine which of the following functions are ‘one-to-one, onto or one-to-one onto. a 1,-1><0,0>< Range of f= 1 ' + Fis onto (b) fil,91 fx) = greatest integer s yz (<0, 0> <1, 1>,<2,1><3, 1>-<4, 25, Range of f 2 Fisonto, © f:h91 fx) =3xmod7 13 (0, 0>, 1,9, 2,6, 3,25, <4, 5565.15. o6 84 Fis one-to-one onto. ftw @ fo 3xand 4 f= (<0, 0> , <2, 2> <3, I>] fis one-to-one onto, Ex.221.3 Which ofthe following sets are function, @ (<1, 2.3>,2,3,45, 3.14554 <1, 4>>) (0) (<1, 2,35, 2,3, 45,.3,3,25 © [<1 2,3, 2,3, 45>, <1, 2,455) @ {<1,<2,3>>, 2,2, 35,3, 2, 355) Bison: 4b, d are functions. ¢ is not a function because [i related to both Ex.2.21.4 List all possible functions from X = {a,b.c|b YY (0, 1) and indicate in each case wheter te function is one-to-one, is onto, and is one one onto. © soln. : Functions from X = {a, b, ¢) 10 Y= (0.1) (a) f:1o1 ‘cannot be one-to-one because IX1>1¥ | fa { ja Jiseven =| G-ne — jisodd Following are the possible functions represented wer (b) fr 1+ 1+ f(x) = greatest integer: graphs. Total number of functions = 1 ¥ "= 2° (©) £217 917 f(x) =3x mod7 (@) F214, fix) =3x mod 4 D soin.: . pel i Jiseven @ FIST =) Gay jisodd Tech-Neo Publication oA SHCHIN SHA Ve Where Authors ispie innovation @ scanned with OKEN Scanner Relations & Functions «iy Fig. P.2.214 Ex. 2.21.5 Show that the functions f and g from N x N to N given by f () = x+y and g() = xy are onto but not one-to-one 2 son. : Consider the function f: Nx NN fl)=y +x=x+y=f () f cannot be one-to-one, Let x € N, x can be written as sum of any two numbers, “Teeb-Neo Publications... Where Authors naire innovation Range of f=N Fis omto, ‘Consider the function g : Nx NN g() = ay Now g() = yx=xy=g (ex, y>) cannot be one-to-one. N, x can be written as sum of any two Let xe Module numbers, Range of f= N Fis onto, Consider the function g : Nx NN B(x y>) = xy Now g() = xy Now g («y,x>) = yx=xy=g () "_ g can not be one-to-one. Let x € N, x can be written as product of any two ‘numbers. Though x is prime, x = 1 xx. Range of g=N onto. “8 Ex.2.21,6 Letf:R—> Rand g:R— R, where R is the set of real numbers. Find f ° g and g of where f(x) = x'~2 and g (x) =x +4 State whether these functions are surjective, injective and bijective. © sorn. Given: f:ROR,g:RIR f0) Qeaxt4 Now consider fog. ie. fo g(x) =f(g(x)) =f (x +4)=(x+4)*=2 + 8x 416-2 =x+8x+14 v. For xe R, wehave distinct f° g(x) .. £0 gis injective or one-to-one, Itis not onto as Vx R, x is not an image. Now consider g of (F00) = 800-2) jeg f(x) cA SACHIN SHAM Fenture @ scanned with OKEN Scanner Discrete Structures & Graph Theory (MU - Sem 3-Com ) 2:58 Relations & F, eT oo ea axt-244 ax 42 2 Wxe R,wehave distinct g £() + © fis objective or one-to-one. Itis not onto as ¥ x € Ryn is not an image. Ex. 2217 Iff:x—yandg:¥ — Zand both fand gare onto, show that go is also onto. © son. : Given: f:X9Y.g:Y 9 Z Fand gare onto. i.e. range of f= Y range of g=Z Now consider, gof poh: XZ Consider, ¥ x € X, gof (x)= 2 (f9)) = 8 (Ysex f0) = a(y) where y © Y because fis onto, = xwhere 2 € Z because gis ont. =2, where z€ Z. £ Vaexs BF 0 gofis ont Ex2218 Letf : RR be given by FQ) =x -2 Find f" © soin.: Given :f(x) =x°-3 Let fix) = Yow) ‘This is writing x in terms of f(x) . x = YG@O+3) We know that, if f(x) =y then f'(y)=% iy) VOD ‘The general term will be, example. ® HD soin.: {A function I, :x—> xis known as identity fungi, ty given by, , , <6, €>,
} Ex 2.21.40 ifs a fonction given as, (8) = (x +1, aset A= (0,1,2,3.4) Find fort piss Soln.: 0,1,2,3,4) (<0, 1>, <1, 2) 2,3,3,4><4,0) £! = (<1, 0>, <2, >, 3, 2>, <4, 3>-<0, 49) (<0, O>,<1y 19, 2,2, <3, 34,5} fel, 1>, <2, 2>, <3, 3> <4, 4260, 0) fer! fief Bx 2.21.11 Let X= (1, 2, 34). Define a function £:x X, suc h that f # 1, and is one-to-one. Find we Pate ff! and fof" Can outs another function g : X > X. Such that gel,but gog=h, © son: X = (1,234) fF: X3X f = (<1, 2>,<2,3>, <4, I>} ff =fof={,<2,4><3, ><. d) f sfofi=(, <2, I>, >a) £1! = (<2, I>, 3,2, <4, 3> <1, 4) fof! ={, 2, 2>, <3, 3> <4, 4>) is posibetst ‘A function g #I,. Such that g ° = only if, g 2g = (el, 2% 2 1d, 3, 4 <4, So} eal example for g"'= g. B08 =[[<4 4) 2h fx) =x°-3 fla) =VEFD “Tech-Neo Publications von Where Authors inspire innovation SACHIN SHAH V0 @ scanned with OKEN Scanner g Discrete Structures & Graph Theory (MU-Sem3-Comp) 2-59 Relations & Functions Few more examples could be, Ex. 2.21.14. Given f, g and h are functions on X f= ((1.2),(23)..D) 123) = (<1.3><3, 1>,<2,4> <4, 25) =U. 4, <4, 1>,2,35.3, 259) ‘ B= {(1,2), (21) GDI he (1,1), (2,2), (3,0) = Ulcl I, <4 35 ee n Compute: (i) fog (ii) gef (iii) foreh yw 2.21.1 SOLVED EXAMPLES ON M1 son: FUNCTIONS Given: X ={1,2,3) f =(0,2,2,3,..D) ” Module Ex.221.12 Let the functions f: A 4 B, g: B+ ©, hb: WW Gee eae 8 =((,2.2,0,8,3)) fneions is mine eee h =(0,0,2,2.0.0) (a) onto, (b) inverible. CP CC A f B 9 c h D = {f(2), (1), £3) =(3,2,1) >< p< VS (i) gef = {8(f), 2) 8) LA = (2,82), 80) =(1,3,2) Fig. P.2.21.12 Gif o gon = (f(g (h (1). Fgh 2), fe hE) = {f(g (1), f(g 2), FB) f:ASB, - g:B>C, h:C3D = {F(2), £0), £2) Soln.: Given functions = (3,23) 2145 Given A = {1,2,3,4,5,6,7,8}. Let xRy whenever y is divisible by x. Find and write relation R as a set of ordered pairs. Is R so found reflexive, symmetric or transitive? Is R an equivalence relation or partial ordering? Justify with a valid argument. Soln.: Given : A= (1,2,3,4,5, 6,7, 8) Ex. Fig. P.2.21.12(0) (a) onto functions -h ()_Inventble functions - none of them, x Ry= y is divisible by x. Ex.2.21.13 Fill in the blanks. 1. Number of elements in largest equivalence relation of a finite set A with n elements is R = (<1, 1>, <1, 25,<1, 35, <1, >, <1, Soy <1, 6 <1, 7>, <1, 8>, 2, 2>, 2, 4>, 2, 6, <2, 8, <3, 35, <3, 6>, <4, 4>, <4, >, <5, 5>, <6, 6>, <7, 7>, <8, 8>] 2. A pastial ordering relation is reflexive, Itcan be observed that, —, and transitive. @ Yea xRx «. Ris reflexive Log 2. Antisymmetric (ii) Vavy € A. ifx Ry then y Rx where xy. ‘Teck-Neo Publications —...Where Author inspire inovation ~ A We know that V a € A, there exist exactly one be such that f(a) =b. flo) =a Wa A, we have one b € B, such that, Fi) = ay £7! B— Aisonto. Hence the proof. ss Uex.221.18 POCOMTEED TEE () =x +2, g (8) =x—2, W(X) = 3x, for all xe R fat (@) fogoh (ii) hogof (ii) fofot MZ soin.: Given : f(x) = x-+2, g(x) = x ~ 2, h(x) = 3x, forall xe R To find : (i) fogoh (i) hogof (iil) fofof ‘The composition of functions is given by, fog (x) = f(g(x)) (@ fogoh (x) = f(g (h(x) = £(¢ Gx) £Gx-2)=3x-242 =3x Gihogof (x) =h(g (FO) = hig (x +2) =h(x+2-2)=h@® =3x SUCHIN SH = _ @ scanned with OKEN Scanner is yscsea Structures & Graph Theor (MU - Sem 3-Comp) anfoof OD = FEED) = F142) ef (vt242)= f(x+4) ext4e2 =xt6 — nai oo (ean EOL HERR, FO)= +3 pROR 8TH peROR WG) =dx find got, fo8 foh, hof, gofoh Di sain: Given functions are GRR, FO)=2x43 giRAR, g@)=3x+4 b:ROR, h@)=de To find, gof. fog. foh, hof, gofoh (go) = gO) =8 Ax +3)23Qx4+3)44 =6x+13 i) fogs) = £(@O)=FOx+4)=2Gx 44) +3 x + LL (h@)) =f 4x) =2 4x) #32843 (€@)) sh Ox +3)=4 2x +3) = 8412 (Fh @))= = 2 (24x) +3) = 38x43) 44 ii) foh () (iv) hof (x) ()gofoh (x) x) (8x43) 4x +13 UEx. 2.21.20 DSS Iff: AB and g : B—> C are both one-one and onto, the, een Soin. : Given :f: A+B and g: B+, ae one-to-one and onto, Toprove: (gefy'=f'eg! Proot Given that both f and g are one - to - one and onto. we can write the following 261 Relations & Functions. Letfiy=k gk) =m & O'k) =x, gm) =k Now consider ge f(x) : = e(F x)= e(k)=m stge fy '(m) =x Now consider F'e ieee yom) = Chem) =r eget) = (tog )(m=x (ef! = Fle UEx. 2.21.21 If A= B=C=R where R is set of real number and f : ‘AB, g:B > C are functions defined by f(x) = x + I. x) =x" +2, then find (gf) (x) and (fe g) (2). © son. : Given A =B = C=R, Ris st of real numbers. FAB, g:B3C and fa)=x4l, g@xdex?+2 @ Gof @=eFON=seK+) (te? arte dxe Lede 423 Gi) og) Q=FEQ@) +2) ©@=6+1 7 Uex. 2.21.22 TE If A = B= C = R where R is set of real number and f: AB, g:B— Care functions defined by f(x) =x + 1, a(x) = x? +2, then find (g © f) (x) and (fe g) (2). soins A=(0,-1,1), B=(0,1) f:A—B, f@)=al Given: To find : Whether fis onto (<0, 0>,<-1, I>, <1, >) s. We B, we have at least one a€ A, such that f (a = b) <. Fisonto, TechNeo Plliations oc Where Authors inspire anoration “=A SACHIN SHAH Venture @ scanned with OKEN Scanner UEx. 2.21.23 Lt f ROR (Rev RE RAR gaa th heRRh(y=%-2 Find (i) getheg) ; (i © sotn. : ge(hef) (RoR, fo BeROR, giedy’e WiRR | hayetx-2 Tofind:hegorge (he, hegix) =hig(s)) sha +) 27 (4x? + 1)-2 =28x7 47-2 = 28x +5 gethef =ghO)= sho) 2g (Ix'~2)=4(7x°=2) +1 24 49x" +4—28x°) #1 = 196 x°+ 16 =112x° +1 = 196x°— 1120? + 17 h egofgo(hef) = heg(ge(hef) =28 [196x"— 12x? + 177 +5 =28 [38,416x"" + 12544x° + 289 - 43,904" = 3808x" + 6664x"] +5 = 1075648x'?— 1229312x" + 537824x°— 106624x° +8097 1 To prove Fis bijective ‘Tofind :f Let nj, ngbe two numbers and f(ny)= f(y) 4m-$ _ 4m~5 3n-7 = 3a-7 om em 2 If fin) = flo) then n, Ifis one to one Consider any n € R, such that f(8) =n; where xe R ‘n Forevery n€ R, we have ax € R, such that ft) xp 1. Fis onto. +. fis bijective. Let fx) = 0 " o £'@ UEx. 2.21.24 A function fir-{ 2 n-{} is defined as : Prove that ‘f” is bijective and find the rule for €"' i © soin.: Given: er} on-{3} vex. 221.25 LES Let f: RR, f(a) = x= 1, g (x) = 4x" +2 find G fo(eet @setew © sotn. : Given: FRR, fs) == 1 goed +2 Tofind : (i) fo (gef (iii) g° (Fe 8), fo(gen(x) fee Fig@'-)) =f (7-1 +2) ‘TechsNeo Publiat There Authors inspire innovation cod SACHIN SHAH @ scanned with OKEN Scanner rete Structu & Graph Theo (MU - Sem 3-c¢ afin s =2x)+2) =f (dx! 8x7 +6) = (4x" = 8x7 +6)" = 96x24 48x" lox’ + 64x" + 36 - 6x" = 16x" 64x" + 1124 96x74 35 gin goto) = BEBO) = g(f(4x" +2) = g(x +2"-1) = g(l6x' +4 + 16x71) = g(16x' + 16x" +3) = 4(16 x‘ + 16x" +3)? #2. = 4 (256x" + 256x' +9 + 512x° + 96x? + 96x4) +2 1024x° + 2048x° + 1408x' + 384x" + 38 ex. 2.21.26 EERE EME Define injective, surjective and bijective functions. Ir f:R—> Rand g: RR are defined by the formulas f(s) = x+2 and B(x) = x? Find () f-g.f 5G) gf. FRR, g:ROR fayext2, aQ)=x° Tofind: ()fegef; Gigef-e son. : fegef(x) Given: @ Fig) =F@ +2) = £(x+2)) =for ede) xX H4K +6 Gi) gofogi) Let foo) rp & k . Skx-2k = + Oks = Module ne I r'@ = ns, San Uex.2.21.20 CEE Let fix) = x +2, g(x) = x Zand h(x) = 3x for all x¢ Re (Ris the set of real number) Find () fe go hGiyho ge fii) fe fe f £(K)=x+2, g(x) =x—2, (x) = 3x Dfegeh (hegef ii)fefet () fegeh(x) =f (K@) = FEN) =£Gx-2) =3x-242 =3x (iyheget (x) =n E@) = be K+2) =h(x+2-2)2h(x) = 3x feted (x) =f (H(t) =f (f(x +2) =f(x+2+2) Ex+24242=x46 Ex. 2.21.29 DRO SEEN Iff:ROR, £0) g:ROR, aQyaax+d hiROR, hG)=dx Function fa) = S43}. Find find: (gef — @fog, © soin.: (ii)foh — ivyhof = (@)gefeh i Given: f:ROR, f(x) =2x+3 Gren fa) = 55 e:ROR, g(x)=3x4+4 “Teck-Neo Publications Tere Authors inspire innovation al SUCHIN SHAH Venture @ scanned with OKEN Scanner Relations a, Leen Discrete Structures & Graph Theory (MI hiROR, Tofind: @get Gi) fen © son: Wa et(x) gef(s) =e(f)=e 2x+3) Qx+3ye4 =6x413 h(x) = 4x Wifes, (ivyhef — ()gefeh (iy fog 9) = H19(%)) =fGx+422Gx44)+3 =6x+11 (ili) feb (x) =f (W(X) = f (4x) = 24x) +3 28x43 (ivy ho f (9) = RUE) eh (2x +3)=4(2x+3) 28x12 Ww) gefeghe(x) = g (F(H(x))) =9 (Bx +3) ax +13 =3(8x43)+ Functions f, g, h are defined on a set, X 1,2) 2.3) BD} B= (4.2) Gil) (3.3)) h=(1, D2IED) (i) Find fe g, g 2 fare they equal ? (ii) Find fe ge hand fe he g. @ sotn.: Given : X= (1, 2,3} f, g and h are functions defined on set X. f =(0,2.2,3,@, 0) 2 = (0,220.83) bh =@,0.2,2.6,D) ohog To find : fe 8. feg(x) = f(g (x) fog = (F(g (1). F(g(2)), f(a3))) = (F), FC). £3} = (3.2, 1} = (1,3), (2,2), D) The composite function ean be calculated 4, graphical representation as follows " 1 : 14 1 oo MK 3 3 3 3 3 : ' Fig. P. 2.21.30 fog = ((1,3. 2,2, 0} Gi) ge fis calculated as follows 1 1 1. 1 2 6 PS 3 7 33 3 t a Fig. P. 2.21.30) ger = ((,0,23).G2) «fe gand ge fare not equal ii) 1 1 4 1 14 " 3 3 3 3 3003 h a f Fig, P.2.21.30(b) fogoh = ((1,3.(,2-G.39) ‘Tech-Neo Publica co Mere Authors inspire innovation od SACHIN SHAH Te @ scanned with OKEN Scanner Relations & Functions, Fig. P. 2.21.30(¢) foheg = ((.1).(2,2)..2)} vex. 221.31 atthe function £: RR, fix) = 2x3 pind efeffafefot i soin.: Given: f(x) = 2x-3 )Pafef Gif =fotet Tofind @ fore) =f) =f(x-3) =2(Qx-3)-3=4x-9 (Pate tet (x) =t (tO) =f((2x-3) = f(4x-9) =24x-9)-3 8x-21 ex, 2.21.32 ORES Let f (x) = x + 2, g (&) = x - 2 and h (x) = 3x for xe R, where R= set of real numbers. Find (gef), (fog), (ef), (gee), (Fon), (heg), (hef, (foheg). © sotn. Given: f(x)=x+2, g(x)=x-2 h(x) = 3x xeR () gofO)=g (=e +2)=0#2-2=% Gi) fog (x) =f (g @) =f &-2)=(%-2+2) Gili) fof (x) =F EO) =f +2) =x+4 (iv) gop (x) = g (8 (W) = BK 2)=X-4 (v) fob (x) =f (h (x)) =f (3x) = 3x +2 (vi) hog (x) (gx) =h (x -2 (F(3)) = 0 +2) (vii) hof (x (ili) fohog (x)= Fea(g (xy) = Fh K-29) =FQx-6 3x4. Uex. 2.21.93 ECCT Test whether the following function is one- both, ZZ, fo © sot. : Given function is, ‘one, onto of +ntl fs nya, fix forevery x € 2, we have distinct f(x) Fis one-to-one. Each element y in z may not have a corresponding x inz, Foreg. Let y=f(x)=3 ao extl = 3 oben 2 x Qe 22 noxgn 2. £ (8) is not onto, Vex. 2.21.94 DECRTO RIE SERMIEI Let the functions f, g and h defined as follows : f:ROR, fQ)=2x+3 g:RR, g(x)=3x+4 hiR->R, hQx)=4x Find gef, fog, foh, gofch, @ sotn, Given: F:ROR, f(x)=2x+3 BRR, g(x)=3x+4 hiROR, h(x)=4x gofis given by, gef (%) = BF) =gQx+3) gof:R->R, gof(x) (2x43) 4426x413 6x +13 Teeb-Neo Publications wnnu. Where Authors inpire ianoation wd SACHIN SHAH Venture @ scanned with OKEN Scanner a Discrete Structures & Graph Theory (MU - Sem 9-comp,) 2:68 Relations 4 gok(x) = BF) = 8) Sy (ii) opis givenby, fog) =f(@iay=tx+4) 2Qx+4)43=6x411 fog : ROR, fog(x)=6x+ II (iii) fot is given by, foh (x) =Fch(m)) =f 4X) (ayy 3=8e43 foh : RR, foh (x) =8x+3 Gv) gofeh is given by, gofeh(x) = 8 (Fh) =8 E48) = 92 (4x) +3) =8@x+3) (x+3+4 4x +13 gofsh: RR, gofeh (x) = 24x +13 Se VEX, 2.21.95 Comment whether the function fis one to one or onto, Consider function : f : N > N where N is set of natural numbers including zero. f@ai+2 © son. f@. Wie N, Gis distinct fis one to one. 3x € N, we may not have a j such that ven: f: NON 1 =x Ex: Let £@) =3 j= Ben fis ot ono vex. 2.21.96 I Let f:R — R defined as f (x) =x and g: RR defined as g(x) =4x +1 Find out g of, fe. fos Z sotn.: foo) Given: 20)= (eof isgivenby, (xy + La 4x8 +1 R Ris defined as got (y got ae Gi) fog is given by. x fg) =f EO) =FGX += 4x4 py fog =ROR is defined as fog (x) «(4,2 Gil) Pisgiven by, i: fot =f(F(x) =F (x) =(x)" PP: ROR is defined as f (x) =x? Gv) gisgiven by, gop = 8(E@))= ax! + 32x +5 gf RR is defined as (x) (+ )= x41 xe Vex 2.21.37 MURROW SomEAL METS) B=R, the set of real numbers Let Let f: A B be given by the formula f (x) Letg: BA be given by 3 so) Show that f is a bijection between A and B and 2) bijection between B and A. © son. : n R f: ASB, f(X)=2x"-1 ee EC To prove: fand g ate bijective. Consider k=f (x)= 2x’ 1 Yxe A, k is distinct. fis one-to-one. eiBOA, Now ke B, x is distinct 2+ fis ont. . Fis bijective Similarly we can prove that g i bijective Itcan be noted that f~' = g (Chap a @ scanned with OKEN Scanner

You might also like