离散数学课件----Function.ppt

* * * * * * * * * * * * * * * * * * * * * * * Permutation as Product of Cycles = (1 5 7) (4 8) =(1 2 3 5) (4 8 7 6) = (1 7) (1 5) (4 8) = (1 5) (1 3) (1 2) (4 8) (4 7) (4 6) Odd Even Home Assignment pp.176: 6,8, 10,14,24,32 pp.187: 2,12,16,20,24 pp.195: 2,6,10,16,22,24,28,38 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * f g A B C Composition is a Injection t1 t2 Identity Function on a Set 1A is the identity function on A：1A(x)=x for all x?A. For any f :A?B，f=1B?f = f ?1A Sketch of proof: Proving that the set f is equal to the set f ?1A and 1B?f Note: if x,y?f, then x,y?f and x,x?1A if x,y? f ?1A，则t,y? f , 且x,t?1A， 则t=x, 所以x,y?f . Invertible Function The inverse relation of f :A?B is not necessarily a function, even though f is. Examples: (Let A={a,b,c}, B={1,2,3}) f = {a,1, b,2, c,1} is a function, but f-1={1,a, 2,b, 1,c} is not a function. f :A?B is called an invertible function, if its inverse relation, f -1:B?A is also a function. Example: f : N?N?N, f (i,j)=2i(2j+1)-1 is a bijection f -1(2i(2j+1)-1)=i,j Invertible Function f :A?B is an invertible function if and only if f is a bijection. Sketch of proof: ? If f is not a injection, then there must be y,x1, y,x2? f -1, and x1?x2. On the other hand, if f is not a surjection, then there is at least one element in B, which has not an image in A under f -1. Both cases are contradict to “f :A?B is invertible”. ? If f –1 is not a function, then，either there exist y,x1, y,x2? f -1, and x1?x2，then f is not a injection, or there must be at least on element in B, which has not an image in A under f –1. Both cases are contradict to “f is a bijection”. Hashing: the Idea Index distribution Collision handling E[0] E[1] E[h-1] In feasible size Key Space Very large, but only a small part is used in an application x A calculated array index for the key Hash Function H(x)=k The division method: h(k)=k mod m The multiplic