浙江大学离散数学讲义.pptVIP

DEFINITION 1. 1.2.2 函数 Functions /Mapping 映射 DEFINITION 1. Let A and B be sets. A function f from A to B is an assignment of exactly one element of B to each element of A. We write f(a) = b if b is the unique element of B assigned by the function f to the element a of A. If f is a function from A to B, we write f : A→B. DEFINITION 2. If f is a function from A to B, we say that A is the domain of f and B is the codomain of f. If f (a) = b , we say that b is the image of a and a is a pre-image of b. The range of f is the set of all images of elements of A. Also, if f is a function from A to B, we say that f maps A to B. DEFINITION 3. Let f1 and f2 be function from A to R. Then f1 + f2 and f1 f2 are also functions from A to R defined by (f1 + f2 )(x) = f1(x) + f2(x), (f1 f2)(x) = f1(x) f2(x). DEFINITION 4. Let f be a function from the set A to the set B and let S be a subset of A. The image of S is the subset of B that consists of the images of the elements of S. We denote the image of S by f (S), so that f (S) = { f (s)∣s∈S}. DEFINITION 11. Let f be a function from the set A to the set B. The graph of the function f is the set of ordered pairs {(a, b)∣a∈A and f (a) = b}. EXAMPLE 20 Display the graph of the function f(x) = x2 from the set of integers to the set of integers. DEFINITION 1. 函数的分类 DEFINITION 5. A function f is said to be one-to-one, or injective, if and only f (x) = f (y) implies that x = y for all x and y in the domain of f. A function is said to be an injection if it is one-to-one. EXAMPLE 6 Determine whether the function f from {a, b, c, d} to (1, 2, 3, 4, 5) with f(a) = 4, f(b) = 5, f(c) = 1, and f(d) = 3 is one-to-one. DEFINITION 6. A function f whose domain and codomain are subsets of the set of real numbers is called strictly increasing if f(x) f(y) whenever x y and x and y are in the domain of f. Similarly, f is called strictly decreasing if f (x) f (y) whenever x