5 FUNCTIONS Consider A= {1;2;3;4} Redefined on Aby aRb + a+b > 5. Then if we consider {(a;b): ab true} we get the following set of ordered pairs {(1; 4) ; (253) ; (254) ; (3:2) ; (8:3) : (8:4) 5 (451) 3 42) (453) (44). ‘Thus we could consider the relation to really be a set of ordered pairs on A x A satisfying aRb. We use this to now define a relation. Note that we also generalize to A x B (although A = B is one possibility for B). Definition 27 (relation): Let A:B be non-empty sets, A relation R between sets A and B is defined as; R={((a;8): a€ Abe BaD true) Remark 47 RCAxB Remark 48 The domain of R (denoted dom R) = {a:a€ A,3€ B3 (a,b) € R} The range of (denoted ran R.) = {b: b€ B,3a € A 5 (a,b) € R} ie, Dom R is the set of all Ist co-ordinates of elements from R. Ran R is the set of all 2nd co-ordinates of elements from R. Remark 49 Note that both dom R and dom R_ are acceptable notations. Example 30 R= {(1;«) ;(2:a) ;(1;6);(2;¢)} is a relation between sets {1;2} and {a,b,c} with Dom R={1;2} Ran R= {a;bsc} Example 81° Let x = (asbjesd} y e = {(a51);(%1)} Then p is a relation between x and y dom p = {a;0} ran p= {1} Remark 50 for a relation R between A and B with RC Ax B; the domain if Ris a subset of A, but need not be the whole of set A. Similarly for the range BC R We now introduce relations which are more specific and we call them functions. Definition 28 (function): Let A;B be non empty sets. A relation RC Ax B is called a function from A to B if and only if the following hold: (1) dom R=A (2) Vac ANE BS (a,B)ER Remark 51 (2) in definition above is important. Bvery element from A is linked to a unique element DEB. This element is called the image of a under R. Remark 52 When is a relation RC A x B not a function from A to B? If either condition (1) or (2) in the definition fail, then R will not be a function i.e. either 3a € A, a is not linked to any b under R or 3 a which is mapped to more then one element from B. Ezample 32 Let: A={1;2;3;4;5} B= (154;6,8:9} AL (15 1) 5 (251) 5 (3; 6) (8:8) ; (458)} Pa (131) 5 (231) 5 (351) (451) 5 (3: } Ps (151) ss); (254) 5 (3 Which of the above are functions from A to BP pi: No: 5€A ond5 not mapped to anything in B for 3¢ A but 3 mapped to both 6 and 8 € B] pa: Isa function. Note ran pp # B. py: No: 1 mapped to both 1 and 4 in BRemark 59 Let «& Ax B be a function with (a;by)s(aiba) Eo ‘Then by = bz (as function: also called a mapping) Now consider a familiar function y = maz + (straight line writing? Let f(x) =y or f : 2+ mz-+ c (better still) Then input 2; output f(z) = mx +e. ‘Thus we really have (2;mx+0) €f CR xR. The beauty of mathematics! Note how dom = B and Vraly(= ma +c) 3 (2:y) = (ama +c) € f. Now returning to a function « from A into B. ‘There are times when Ranxc= B. These functions receive a special name. How does this fit into our new way of Definition 29 (onto): a function f : A~» B is called onto Yb € Bia > (a;b) € f Remark 54 Note [:A— B will mean f C Ax B. Remark 55 Another word often used for onto is surjective. Esample 39 A = {152} B= (3:4) a, =1053):2:3)) 2 = {(153); (1s4)} Ps 3); (234) } Of the above only pg an onto function. Why? p,:4€ B but nothing from A mapped to 4. py not a function as 1 mapped to different elements (or dompy # A). Now consider the following two funetions. Can you find a major difference between the two? A = {a;bse} B= {xyz} pr = A(x): (by) (ou) pe = (ain); (5u):(62)} We note in p; that y € B is mapped to from both b and ¢ € A. (Still a function note). Whereas in py all the range elements are mapped from different elements. Practically we get (which will help with the next definition, a 8 A —— - 4 : & seed fos e et a. <%\o? ieccde : We can see p, is what is called many-to-one whereas py is one-to-one (1-1). We now define the concept formally. Definition $0 (1-1): a function RC Ax Bis 1-145 a #02 € A= R(ax) # R(oa) Remark 56 R(a,) is the image of a, under R ie. (a; R(ax)) € R Remark 57 R is not 11 if 3a; # ap but R(ar) = R(aa) Remark 58 The contrapositive form of 1-1 is: R(a,) = Raa) + a = a2 25Remark 59 This contrapositive form is often used to prove @ function is 1-1. 2 Example $4 R= {(2:y):2,y €R; } is not 1-1 for 16 1 but R(-1) = (-1)?= RQ) Example $5 f = {(x;y):2,y€Ryy = 3041) is 1-1 (Note: the use of the contrapositive form.) Consider the following example. ‘Think of what is really occurring: Example 36 «:Q—{1) > Q_ defined cx (a) Find Ran x (note: Q— {1} és domain for x (1) not defined!) To find Ran oc we want all ¢ © Q = {£:-,y €Z,y £0} which are mapped onto je, we find all q for which 3a € Q ~ {1} with « (a) = g. Thus let q 3 3a with ox (a) = 9+ 2 (now solve for a to see what to exclude) 2a-3 =4(a-1) 2a — ag a(2—4) But then ¢ #2 Hence: ran x= Q~ (2} Note: Say ¢= 4(€ Q— {2}) then what a will map onto q = $? $54 wit work foro (EF Example 87 TestocR—>R; x (r) —4r if (i) onto i) 1-1 (@) Find range of x: pER andr > x (r) =P Pade =p 1 —4r—p=0 but then 16-+4p >0 p >-4 Thus if p <4 then there is no real value for r 30x (r) = p- ran x= [—4}00) thus o not onto 26Let ox (a) =x (6) a@—4a = 4b a? — 0 —da + 4b (a-d)(a +b) —Aa—b) (a-)[a+b—4) thus a—b=0 Thus if b=1 then from weget x (1) =1-4(0 « (3) =9-4@) feo (1) =x (3) but #3 fie ocnot 1-1 Can you think of another way to solve o« (7) =r? —4r for onto and/or 1~ 1? Hint: what type of graph. is r? — dr? Recall from MATA that we defined the composition of functions. We carry over the definition. Definition 31 (a 08): Let 6: A> B, « BC be functions Then 0 08: A C is defined by (x 08)(a) = [8(@)] Remark 60 x 08 is a function for: Let a€ A then f(a) unique (8 a function) and 6(a) € B but then cx (3(a)) unique as x « function. Thus every a € A has a unique image under x 08. Remark 61 if two functions are given: be careful in just forming compositions as they somethimes are not defined. See next example. Example 98 Let f:R—->R — f(e)=2-4 Gi:Rt RK —gl2)=Inz (Remember only take log. of positive # hence R* = domg) Are fog and go f both defined? Fog RR (Fog)(x) = flala))= Flns) =Inz~4 gof:R—+R (go f)(2)=9(f(e)) Beware!: g only defined on R* gf not defined for say « =2 then f(2) = —6 and g(—6) not defined We now investigate composition wrt 1 ~ 1 and onto. ‘Theorem 14: Letoc A+B 8: B—>C bee function. (i) Ifx,8 are onto then Box: AC is onto. (ii) Tfoc,B are 1-1 then fo a: AC is 1-1 Proof. (i) Let ce C Then 3b € B > A(b) =e +8 onto but then 3a € A 50x (a x onto then (Se «)(a) = Ble (a)] = 8(0) = thus Bo oc onto 27(ii) Let (Bo x)(x1) = (Bo %)(aa) Blz(z1)] = 8 [x(z2)] (21) =o (#2) We now investigate the conditions necessary for the inverse of a function to exist (This is important for MATB102 when inverse trigonometric functions are discussed. ) Let R: A+B bea function, Then we want R-!: BA to be a function. We bogin by defining: (b,a) € R~! <> (a,6) € Ra relation, For R-? to be a function we must have every element of B mapped, so we must have R an onto function. ‘And to ensure that every b gets mapped to a unique a € A under R~® we avoid the condition (b,«3), (sa) € Ro! by making R 1-1 (for then a; =a). 80 to summarized: ER ASB then R-1: B— A is a function defined (b,a) € R-* < (a,b) € R. This is important and useful for Inter work. We end off this section on functions by introducing the concept of restrictions which are useful in being able to study inverse trigonometric functions (to be studied in MATBI02). Consider f:R>R defined f(x) =22 Then fis not onto (ran f = 0,00) : check yourself) f not l~1 (Chae A so #71 not defined Howover if we restrict f to: f :[0;00) ~ [0;00) then f is 11 and onto thus f-? exists Note we have reskics We also note the following notation sometimes encountered f({-1;1]) : What interval is the interval {-1;1] mapped onto? Drawing f over this interval Thus f ({-1;1)) = {0;1]: Note that f over this interval is onto if we restrict f : [~1;1] + [0;1] but still not (1-1) 28Example 39 Suggest restrictions on the domain and codomain for the following to be invertible (ie. to have an inverse) oes sine ROR ln) Aton) ‘Then if we restrict pubes d 295.1 Exercise: Functions 1. Given the following relations. Determine whether a function or not. If not give a reason, If a finetion, determine with reason whether (i) onto and (i) 1 ~1 (@) A=(:2;3} B= {3:4} £={(0:3);2;4)) () f:N-R fle) (©) RoR x (y) =10 (@) p:R>R p(x) = In (© RoR h(x) =Inz (g:RoR @® f:NoR (i) f:R>R J@e)=2? ace [22% £51 atin? Mott 3. Given: fs R- {3} — R defined by /(x) = #4. (a) Find Ran f and hence determine whether f is onto or not, (b) Determine whether f is 1-1. +1 A, Define: cc: Zt Z* x(n) B:ZtZ+ A(x) Be (a) Determine o of and 0 x. (b) Determine (with reasons) whether each is 1 — 1 and onto. 5. Let oc: RR defined ax: 2 + 2? — 22. (a) Determine: « ((0;1]) (b) Suggest restrictions on the domain and range to make cc 11 and onto (and hence oc! will exist) 6. Let x: RR be the following functions: Suggest restrictions so that oc? will exist. (a) x(@) =e (b) & (2) = cos 2