离散数学课件(英文版)----Function.pptVIP

Functions Definition of Function Definition: Let A and B be nonempty sets. A function f from A to B, which is denoted f:A?B, is a relation from A to B such that for all a?A, f(a) contains just one element of B. A special kind of binary relation Under f, each element in the domain of f has a unique image. Note: the domain of ?:A?B is A，but the range is not necessarily equal to B. Image and counterimage Let f:A?B, A’?A, then ?(A’)={y|y=f(x)，x?A’} is called the image of A’ under f. An element in Dom(f) corresponds a value A subset of Dom(f) corresponds an image Let B’?B, then f-1(B’)={x|x?A, f(x)?B’} is called the counterimage of B’ under f. What is f -1(f(A’)) ? A’? f -1(f(A’)) ? f -1(f(A’)) ? A’? Image and Counterimage Special Types of Functions Surjection ?:A?B is a surjection or “onto” iff. Ran(?)=B, iff. ?y?B, ?x?A, such that f(x)=y Injection (one-to-one) ?:A?B is one-to-one iff. ?y?Ran(f), there is at most one x?A, such that f(x)=y iff. ?x1,x2?A, if x1?x2，then ?(x1) ??(x2) iff. ?x1,x2?A, if ?(x1) =?(x2)，then x1=x2 Bijection(one-to-one correspondence) surjection plus injection If A,B are nonempty sets how many different functions from A to B are there? |B||A| how many Injection from A to B are there? If |A||B| then 0 else |A|!*|A|C|B| how many Bijection from A to B are there? If |A|= |B| = m then M! else 0 Special Types of Functions: Examples ?:Z+?R, ?(x)= ln x, one-to-one ?:R?Z, ?(x)= ?x?, onto ?:R?R, ?(x)= 2x-1，bijection ?:R?R?R?R, ?(x,y) = x+y, x-y, bijection Try to prove it What is ?({x,y|x,y?R, y=x+1})? R?{-1} ?:N?N?N, ?(x,y) = | x2-y2| ?(N?{0}) ={ n2|n?N}, ?-1({0}) ={n,n|n?N} Characteristic Function of Set Let U be the universal set, for any A?U, the characteristic function of A, fA:U?{0,1} is defined as fA(x)=1 iff. x?A Natural Function R is an equivalence relation on set A, g : A?A/R, for all a?A, g(a)=R(a), then G is called a natural function on A Natural function is surjection For any R(a)?A/R, there exists some x?A，such that g(x)=R(x)