Tutorial Mathematics | Foundations: Functions and Mathematical induction Dr. Dennis Clemens oes er MATHEMATICS November 4th 2022 weFunctions Definition (Function/map) Let non-empty sets X,Y be given An assignment f that assigns every element of X to exactly one element of Y is called function (or: map) from X to Y. The set X is called domain. The set Y is called codomain. Notation: f:X 3Y ory The y to which an element a is mapped under f is called the image of x under f', and for short we write f(x).Graph of a function Definition (Graph of a function) Let f : X + Y bea function. The set Graph(f) = {(, f(x): «€ X} is called the graph of f. In the case when X,Y CR, the graph of f is often represented by a set of points in a coordinate systems. Example: f:[-3,3) >RImage and preimage Definition (Bild und Urbild) Let f : X + Y bea function. For every set A CX we define F(A) = {Ff (2): x € A} and call it the image of A under f. Moreover, we set Image(f) := f(X). For every set B C Y we define f-\(B) = {ee X: f(x) € BY and call it the preimage of B under f. x y x y aExample Machine : {1,2,....15} { Chocolate, Gummy bears, Liquorice, } Chewing gum, Crisps z+ Product assigned to number z Machine({1,8,9}) = Lonocdabe) Comy 4 ar years Caewil Machine({5, 10, 15}) -| Gay Loe, i Cases Machine=!({Crisps}) =), 42, 4344 la a i Machine" ({Liquorice, Chocolate}) = {4,236,294 Herocatate —— Derisps Ecummy bears Bchewing gumExample T: {1,2,...,10} 3 N n++ number of divisors of n TEL248) =Ma3yy TW = {23,595 2.5.7) = {24 Tfeezizz= OB Say.Example f: (0,10) +R xrt2, for « <6 x —2zx + 20, forx>6 J-4((0,2)) = £40}, 6 403 Pea) = pute) ,Exercise Consider the function f:RoR ZL ODnA rea? —de+3. Determine (i) F({1,2,3}) (ii) F((1,4)) iit) FB) = 44 SdA03 ®... sh i CO)= 8 x Uv eB SB x-Uy =O x(x -W\=0 gy mo xeInjectivity, surjectivity, bijectivity Definition (injectivity, surjectivity, bijectivity) A function f : X — Y is called > injective if every y € Y has at most one preimage x € X, > surjective if every y € Y has at least one preimage x € X, > bijective if every y € Y has exactly one preimage x € X. A function is bijective if and only if it is injective and surjective.Injectivity, surjectivity, bijectivity Injectivity A function f : X — Y is called injective if every y € Y has at most one preimage x € X. ae injektiv in pictures: Each element in the codomain (Y) is reached by at most ‘one arrow. alternative: For every y € Y the equation f(a) = y has at most one solution. alternative: Vrj,72 © X: f(x) = f(#2) > 21 = 22Injectivity, surjectivity, bijectivity Surjectivity A function f : X — Y is called surjective if every y € Y has at least one preimage x € X. xX He surjektiv in pictures: Each element in the codomain (Y) is reached by at least ‘one arrow. alternative: For every y € Y the equation f(a) = y has at least one solution.Injectivity, surjectivity, bijectivity Bijectivity A function f : X — Y is called bijective if every y € Y has exactly one preimage x € X. xX He bijektiv el in pictures: Each element in the codomain (Y) is reached by exactly one arrow. alternative: For every y € Y the equation f(x) = y has exactly one solution.Examples: injective, surjective, bijective? Machine : {1,2,...,15} > { Chocolate, Gummy bon Chewing gum, Crisps 2+ Product assigned to number = © Wot Wnjechve : became e.g. Macliien (A) = Mechise (2) 4 rv ~~ a S A «not Sutvechve ) ecasse LA eg vet Ligeti ye Heunmy tears Hcteng sumExamples: injective, surjective, bijective? T: {1,2,...,10} 3 N n+ number of divisors of n Ta bn not invective wot Surjechve,Examples: injective, surjective, bijective? f: (0,10) rt+2, for « <6 -2x+20, fora >6 y “Nok neck La~ C8.5) * Sogyective © pot GijectiveExamples: injective, surjective, bijective? g: [0,10] + (0, 8] a fora <4 ao 0.5042, fora >4 y Inyeetye not suectve, onExercise Check whether the following functions are (i) injective, (ii) surjective and (iii) bijective: x fora <2 (2) fi: 04+ 6 oo fF for « >2 fla HEM w+ cos(2) QQ » biectve w : bijechveComposition Definition (Composition) Let f : X + Yj and g: Y2 > Z be functions with f(X) C Y2. Applying both function one after another leads to a new function go f as follows: gof: X+Z with (go f)(«) = g(f(a)) . The function go f is called composition of g and f. gofComposition Definition (Composition) Let f :X + Y, and g : Y2 + Z be functions with f(X) C Yo. Applying both function one after another leads to a new function go f as follows: gof: X+Z with (go f)(x) = g(f(2)) - The function go f is called composition of g and f. Example: q 4 : z > (= xt qu cos) Hae (\el do ff g CR) ) i g(x") = cos (x4) rrck Pal Some, fal Ce SQ\= C ( 4) 7 £ (costx)) = costs)A proof... Claim: | IR + R are injective functions) then the composition ho g is injective: Proof: We need bo prove ~ Vaarri (hog ilal= (heglerd =) x2 x2" Coleulehon guec aa) PAB > 360) 4 9 Gay i atx)Mathematical induction An immortal human is standing in front of an infinite stairway. What do we need to know in order to be sure that this human can reach every level of this stairway? 6 {NX ® read level [4 Vea dres care G nM reaches level yn => ye val ntA =Mathematical induction Mathematical induction A statement A(n) for all m € N can be proven as follows: > Induction base/start: Prove that A(1) is true. > |Induction step; Prove that the statement A(n) implies the statement A(n + 1). (for every n € N) (short:" A(n) A(n +1)") Notes: m bnduseton ice Way fobecis claim ty y SX Put wExamples Example: For every n € N we can pro \ndunchow * eduction lace Casa) cae Va VY enadey ~O = AoA a w) Carat belts for n=/ * whschow seg Go ner) 2 an We ze caloulechow: a 3 Sv aK ee k IDGETD = S ora M+) MFI" aa a ledmcton lease! “For wel have laura 2 9A aA, oa 4 i) 3 bet cee, (Ocoee lee WA 4 nts (Ci ie [sleacecrali|itl exes weed fo pro C by Ussing, (H cakiwtaton =, - = memes _ me ATE tA) cre Ent (enen(tarv ea oo 4 ~ ward) 47 ~ OV Ratay aed Ur (2+ (Zax3) (2A (2D Govieeray ~ 20+3