Cartesian Products and Relations

Transcription

1 Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special attention: The Cartesian product of two sets is a set, and the elements of that set are ordered pairs. In each ordered pair, the first component is an element of A, and the second component is an element of B. Example (Cartesian product) If A = {{1, 2}, {3}} and B = {(a, b), (c, d)}, then A B = {({1, 2}, (a, b)), ({1, 2}, (c, d)), ({3}, (a, b)), ({3}, (c, d))}. Determining A B. If A and B are finite sets, then A B = A B because there are A choices for the first component of each ordered pair and, for each of these, B choices for the second component of the ordered pair. Cartesian Product is not commutative For the sets A and B one paragraph above, B A = {((a, b), {1, 2}), ((a, b), {3}), ((c, d), {1, 2}), ((c, d), {3})}. This example shows that, in general, A B B A. The underlying reason is that if A and B are non-empty and one set, say A, contains an element x which is not in B, then A B contains an ordered pair with first component equal to x, but B A contains no such ordered pair. The condition that A and B are non-empty is required because of the following Proposition. Proposition CPR1. IfA is a set, then A = and A =. We argue by contradiction using the definition of Cartesian product: Suppose A and consider (x, y) A. Then, by definition of Cartesian product, y,a contradiction. Therefore, the set A must be empty. The proof that A = is similar, and is left as an exercise. Proposition CPR2. IfA and B are sets, A B = B A if and only if A = B, ora =, or B =. ( ) IfA = B then substituting B for A gives A B = A A = B A. IfA = or B =, then by Proposition CP1, A B = = B A. ( ) Suppose that A and B are non-empty sets and A B = B A. Let x A. Since B, there exists an element y B, so that (x, y) A B. Since A B = B A, we have that (x, y) B A (too). By the definition of Cartesian product, x B. Therefore, A B. Similarly B A. Thus, A = B. It is sometimes true that the Cartesian product distributes over other set operations similarly to the distributive law of multiplication over addition. 1

2 Proposition CPR3. Let A, B and C be sets. Then, (a) A (B C) =(A B) (A C); (b) A (B C) =(A B) (A C); (c) (A B) C =(A C) (B C); (d) (A B) C =(A C) (B C). We prove part (b) and leave the proofs of the remaining parts as an exercise. We have (x, y) A (B C) x A and y B C (x A) and (y B or y C) [(x A) and (y B)] or [(x A) and (y C)] (by a distributive law of logic) [(x, y) A B] or[(x, y) A C] (x, y) (A B) (A C). Exercise. Investigate, and prove or disprove as appropriate, similar statements involving the set operations relative complement (A B), and symmetric difference. Definition (relation). A relation from a set A to a set B is a subset of A B. A(binary) relation on A is a subset of A A. It is important to remember that a relation is a set or ordered pairs. There need be no relationship between the components of the ordered pairs; any set of ordered pairs is a relation. Usually, however, we choose which ordered pairs belong to the relation so that components are related in some way, so we think of the relation as somehow representing the connection. For example, if A = {Gary, Jing, Keika} and B = {7447, 7448, 7455}, then R = {(Gary, 7448), (Jing, 7447), (Keika, 7455)} is a relation from A to B that pairs each UVic Math instructor in set A and her/his UVic telephone extension in set B. Counting relations. Since any subset of A B is a relation from A to B, it follows that if A and B are finite sets then the number of relations from A to B is 2 A B =2 A B. One way to see this is as the number of subsets of A B. A direct way to count is the same way one counts subsets: observe that for each of the A B = A B ordered pairs in A B there are two possibilities, either the ordered pair belongs to the relation or it doesn t, so by the rule of product the number of relations from A to B is ( A B twos). Similarly, if A is a finite set then the number of relations on A is 2 A A. Let A = {1, 2,...10}. By the above, there are relations on A. The number of these that contain the pairs (1, 1), (2, 2),...,(10, 10) is =2 90 : each of the 10 specified pairs must be in the relation (1 way to do this), and there are two possibilities in or not for each of the remaining 90 pairs. Similar reasoning shows that the number of relations on A that contain none of (1, 2), (3, 4), (5, 6) is The number of relations on A that contain (2, 5) or (7, 9) is (total minus the number that contain neither ordered pair). A different way of counting these gives the equivalent expression (the number that contain (2, 5) plus number that contain (7, 9) minus the number that contain both). Finally, the number of relations on A that contain either (2, 5) or (7, 9) but not both is (the number that contain (2, 5) and not (7, 9) plus the number that contain (7, 9) and not (2, 5)). 2

3 Example (less than or equal to relation) The relation R on the set A = {1, 2, 3} given by R = {(1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 3)} is the set of all ordered pairs (a, b) of elements of A such that a b and we can think of the set R as representing the less than or equal to relation. Infix notation for relations. If R is a relation on A and (a, b) R, we sometimes use the infix notation arb and say a is related to b (under R). If a is not related to b under R, we sometimes use the infix notation with a slash through the R. Example (subset relation, infix notation). Let B = {a, b, c} and let S be the relation on P(B) (the power set of B, i.e. the set of all subsets of B) defined by X S Y X Y. That is, a subset X of B is related to a subset Y of B under S exactly when X is a subset of Y. The symbol S can be regarded as a synonym for the symbol or, alternatively, the symbol could be regarded as the name of the set of all ordered pairs (X, Y ) where X, Y P(B) and X is a subset of Y. Example (recursively defined relations). Relations are sets (of ordered pairs), and thus can sometimes be defined recursively. For example, let D be the relation on Z + (the positive integers) defined by: BASIS: 1 R 5; RECURSION: For all x, y Z +,ifxry then (x +1)R (y + 5). After generating a few terms, it is not difficuly to guess and prove that R = {(a, b) Z + Z + : b =5a}. The statement to be proved is P (a): An ordered pair (a, b) belongs to R if and only if b =5a. We first prove by induction on a that if a Z + and b =5a, then (a, b) R: BASIS (a = 1): (1, 5) R by definition of R. Thus, the statement is true for a =1. INDUCTION HYPOTHESIS: For some k 1, suppose that if n =5k then (k, n) R. INDUCTION STEP: Suppose m =5(k + 1). Then m 5=5k, so by the induction hypothesis (k, m 5) R. By the definition of R, (k, m 5) R (k +1,m 5+5) R. Thus, if m =5(k + 1), then (k +1,m) R. Therefore, by induction, for all a Z +,ifa Z + and b =5a, then (a, b) R. To complete the proof, we show by induction on a that if (a, b) R then b =5a: BASIS (a = 1): By definition of R, the only ordered pair in R with first component equal to1is(1, 5). Since 5 = 5 1, the statement is true for a =1. INDUCTION HYPOTHESIS: For some k 1, suppose that if (k, n) R, then n =5k. INDUCTION STEP: Suppose (k +1,m) R. By definition of R, this can happen only if (k, m 5) R. By the induction hypothesis, m 5=5k. Hence m =5k +5=5(k + 1). Thus, if (k +1,m) R, then m =5(k + 1). Therefore, by induction, for all a Z +,if(a, b) R then b =5a. For a more difficult example, consider the relation S on Z + defined by: BASIS: (1, 2), (1, 3) S; RECURSION: For all x, y Z +,if(x, y) S then (x +1,y+2), (x +1,y+3) S. Exercise: Prove by induction that S = {(k, n) Z + Z + :2k n 3k}. 3

4 Functions Definition (function). A function from a set A to a set B is a relation f from A to B with the property that for every element a A there exists one and only one element b B such that (a, b) f. Definition (image, value, preimage). Iff is a function from A to B, then we use the notation f : A B. From the definition of a function if f : A B, then f can be viewed as an assignment, to each element a A, of a unique element b in B. If(a, b) f, then we denote the assignment of b to a by writing b = f(a) and calling b the image of a under f, or the value of f at (a); the element a is called a preimage of b. (Note that it is a preimage rather than the preimage; more than one element of A could map to b.) It is common usage to say f maps A to B. This expression arises from the usual arrow diagram where each element of A is joined by an arrow to the element of B assigned to it. Unfortunately, this tends to lead to the confusion that the elements of A are somehow assigned to the elements of B, which is backwards! It is the elements of B that are assigned to the elements of A. It is important to keep the following facts straight. Every element of A has some element of B assigned to it. No element of A is assigned more than one element of B, each is assigned exactly one. There is no guarantee that different elements of A are assigned different elements of B. When we say that each element of A is assigned a unique element of B, we mean that each element of A is assigned one and only one elemnt of B. This does not mean that if a 1 a 2, then f(a 1 ) f(a 2 ); it is quite possible that f(a 1 )=f(a 2 )(We have a special name for functions with the property that a 1 a 2 implies f(a 1 ) f(a 2 ): 1-1.) There is no guarantee that any particular element of B is assigned to any element of A. (We have a special name for functions with the property that every element of B is the image of at least one element of A: onto.) Definition (domain, inputs, codomain, range). Before we can talk about functions, we need names for the objects we want to talk about: The set A is called the domain, and the elements of A are called inputs to f (so the domain is where the inputs live). The set B is called the codomain. The subset of B consisting of the elements which are values of f (i.e., are assigned to some element in A) is called the range of f. (Think: the values of f range over the elements in this set.) The range of f is the set f(a) ={b : b B and b = f(a) for some a A}. Example (function, domain, codomain, range, image, preimage). Let A be the set of all faculty and students at UVic, and let B be the set of all amounts of money in dollars and cents. Let f be the relation from A to B where (a, b) f person a A owes amount b to the library. Since for every person a A there is a unique amount of money that s/he owes to the library (possibly $0), f is a function. The domain of f is A, its codomain is B, and its range is the set of all amounts of money that are owed (each by at least one person). If (Gary, $1.59) f, then f(gary) = $1.59, the image of Gary 4

5 is $1.59, a pre-image of $1.59 is Gary, and the amount $1.59 belongs to the range of f. (Note: any person who owes $1.59 to the library is also a pre-image of $1.59.) The above example demonstrates a function which can not be defined by giving a formula for f(a). In the definition of function A and B are just sets there don t have to be any numbers anywhere so it may be very difficult to give a formula. Example (function, domain, codomain, range, image, preimage). Let f : R R defined by f(x) =2 x. (Recall that, for a real number x, the ceiling of x, denoted x is the smallest integer which is greater than or equal to x. Hence f is a function.) The domain of f is the set R of real numbers. The codomain is also the set of real numbers. The range of f is the set of even integers: since x is an integer, f(x) =2 x is an even integer. Thus, the range is a subset of the even integers. To see that every even integer 2t, (t Z) is a value of f, observe that for t Z, f(t) =2 t =2t. Exercises. We leave as an exercise for the reader to determine the range of the function g : R R defined by g(x) = x 2. (Recall that for a real number x, the floor of x, denoted x is the largest integer which is less than or equal to x.) For more exercises, find the range of h : R R defined by h(x) = 2x, and show that the range of l : Z Z defined by l(n) =n 2 +4n +4is{k 2 : k N} = {0 2, 1 2, 2 2,...}. Counting functions. Let A and B be finite sets, say A = {a 1,a 2,...,a m } and B = {b 1,b 2,...,b n }. We count the number of functions from A to B. By the definition of function, for each a A there is exactly one b B such that (a, b) f. Thus, there are n choices for the element to be paired with a 1, n choices for the element to be paired with a 2, and so on. In general, for each choice for a there are n = B choices for the element b such that (a, b) f. By the rule of product, the number of functions from A to B is therefore n n n (m terms, all equal to n), which equals n m (or B A ). Definition (image of a set, preimage of a set). The notions of image and preimage can be generalized to sets. Suppose f : A B is a function. If A 1 A, then the image of A 1 under f is the set f(a 1 )={b B : b = f(a) for some a A 1 }. That is, f(a 1 ) is the set whose elements are the images under f of the elements in A 1.If B 1 B, then the preimage of B 1 under f is the set f 1 (B 1 )={a A : f(a) B 1 }. That is, f 1 (B 1 ) is the set of elements in A whose image under f is in B 1. Example (image of a set, preimage of a set). Let A = {1, 2, 3, 4, 5},B = {a, b, c, d} and f : A B be given by f = {(1,d), (2,a), (3,c), (4,a), (5,c)}. Then f({1, 2, 3}) ={d, a, c}, and f 1 ({d, a, c}) ={1, 2, 3, 4, 5}. Notice that this shows that if f(a 1 )=B 1 then it need not be the case that f 1 (B 1 )=A 1 ; it is however, true that if f(a 1 )=B 1, then f 1 (B 1 ) A 1. (To see this, let y B 1. then y = f(x) for some x A 1. Hence x f 1 (B 1 ).) We leave it as an exercise to prove that equality occurs, that is f 1 (f(a 1 )) = A 1, if and only if there is no element a A A 1 such that f(a) f(a 1 ). As a further exercise, prove that for B 1 B we have f(f 1 (B 1 )) B 1, 5

7 Definition (equality of functions). Two functions f : A B and g : A B are equal if f(x) =g(x) for every x A. Iff and g are equal, we write f = g. There is a subtle point hidden in the definition of equality of functions. For two functions to be equal, they must have the same domain, the same codomain, and give the same value for the same input. Thus, technically, the function f : Z Z defined by f(x) = x is not equal to the function g : Z N defined by g(x) = x because these two functions do not have the same codomain. Definition (restriction of a function, extension of a function). Let f : A B be a function. For X A, the restriction of f to X is the function f X : X B defined by f X (x) =f(x) for all x X. IfA A, an extension of f to A is any function g : A B for which g(x) =f(x) for every x A. The restriction of a function f : A B is the new function obtained by retricting the allowed inputs for f to a subset of its domain A. An extension of f is any function that is identical to f on the inputs in A, and is also defined for the inputs in A A. Observe that f can, and probably does, have more than one extension. This is why we sa an extension, rather than the extension. Observe that if g is an extension of f, then g A = f. Example (restriction). Let f : R Z be defined by f(x) =2 x x. The restriction f Z of f to the integers is the function f Z : Z Z where f Z (n) =n for all n Z (because if n is an integer then x = n = n). Counting restrictions and extensions. Let A = {1, 2, 3, 4, 5}, B= {s, t, u, v, w, x, y, z} and f : A B be f = {(1,t), (2,x), (3,x), (4,s), (5,t)}. The number of extensions of f to a function from {1, 2,...,9} to B is 8 4, since there are 8 choices for the image of each of 6, 7, 8 and 9 (in an extension the images of 1, 2, 3, 4 and 5 must be the same as for f). The range of f is R = {s, t, x}, and the number of subets A A such that f A also has range R is 1 3 3, since A : must contain 4 (since f 1 ({s}) ={4}), must contain at least one of 1 and 5 (since f 1 ({t} = {1, 5}) must contain at least one of 2 and 3(since f 1 ({x}) ={2, 3}). Definition (converse of a relation). Let R be a relation from A to B. The converse of R is the relation R c from B to A defined by R c = {(b, a) :(a, b) R}. (This is the relation obtained by reversing the components of each ordered pair in R.) Motivating question. Suppose f : A B is a function. Then, by definition, f is relation from A to B. It is natural to wonder when the converse relation, f c, is a function (from B to A). Example (f c not a function). Let A = {1, 2, 3}, B= {a, b, c, d}, and f = {(1,a), (2,b), (3,c)}. Then, f c = {(a, 1), (b, 2), (c, 3)} is not a function because it contains no ordered pair with first component equal to d. (Equivalently, the preimage of some 1-element subset of B is the empty set.) The same situation will arise for any function f from a set A to a set B where the range is a proper subset of the codomain. Hence, for f c to have a chance at being a function, it must be true that f(a) =B. (These are called onto functions.) 7

8 Example (f c not a function). Let A = {1, 2, 3}, B= {a, b}, and f = {(1,a), (2,b), (3,b)}. Then, f c = {(a, 1), (b, 2), (b, 3)} is not a function because it contains two ordered pairs with first component equal to b. The same situation will arise for any function f from a set A to a set B where some two elements of A have the same image. (That is, there exist a 1,a 2 A where a 1 a 2 but f(a 1 )=f(a 2 )). Equivalently, the preimage of some 1-element subset of B contains two or more elements.) Hence, for f c to have a chance at being a function, it must be true that if a 1,a 2 A and a 1 a 2, then f(a 1 ) f(a 2 ). (These are called 1-1 functions.) We will develop some results about the functions with the properties suggested by the two examples above, and after that we will return to the question of when the converse of a function from A to B is a function from B to A. Definition (1-1 function). A function f : A B is called one-to-one (1-1, or injective, or an injection) if f(x) =f(y) implies x = y, for all x, y A. ( That is, f is 1-1 if and only if different elements of A have different images in B. Equivalently, f is 1-1 if and only if every element of B is the image under f of at most one element of A.) Proposition F2. If A and B are finite sets and f : A B is a 1-1 function, then A B. Suppose A = m. If no two elements of A have the same image under f, then the range of f contains exactly m elements. Since the range of f is a subset of B, wehave A = m B. Proving 1-1. To prove a function f is 1-1, start with Assume f(x) =f(y). and then argue, using what you are given about f, that x = y (the last clause is... x = y. Therefore f is 1-1.) Equivalently, you could prove the contrapositive: start with Assume x y. and argue until you can conclude with Then f(x) f(y).. Example (proving a function is 1-1). Let f : Z N be defined by f(x) =5x 7. We prove f is 1-1. Assume f(x) =f(y). Then 5x 7=5y 7. In turn, this implies 5x =5x and x = y. Therefore f is 1-1. Disproving 1-1. To prove that a function f is not 1-1, find distinct elements x and y in the domain so that f(x) =f(y). By doing this, you have demonstrated that the implication (f(x) =f(y)) (x = y) is False, and so f(x) =f(y) implies x = y, for all x, y A, is False. Example (proving a function is not 1-1). Let f : Z + Z + be defined by f(1)=1, and for n 2, f(n) is the largest prime factor of n. Computing a few values of f yields f(2) = 2, f(3) = 3, and f(4) = 2. Since f(4) = f(2) and 4 2, the function f is not 1-1. Advice about investigating functions re: 1-1. If it is not possible to easily identify elements x and y in the domain so that f(x) =f(y), then start trying to prove that f is 1-1. If f isn t 1-1, then the proof will break down at some point, and this will lead to the required x elements. For example, let f : R R be f(x) =x 2 14x +57=(x 7) Now, f(x) =f(y) (x 7) 2 +8=(y 7) 2 +8 (x 7) 2 =(y 7) 2. To prove f is 8

9 1-1, it is necessary to obtain x = y, but the last equality gives x 7=±(y 7), which leads to x = y or y = x 14. The last of these equations gives the elements x and y required to show f is not 1-1: Choose x = 0 (say) and y = 0 14 = 14. Then x y, and f(x) =57=f(y) (check the arithmetic!), so f is not 1-1. Counting 1-1 functions. Suppose A = m and B = n. We count the number of 1-1 functions from A to B. By Proposition F2, if m>nthere are none. Assume m n. Suppose A = {a 1,,a 2,...,a m }. There are n choices for the image of a 1 and, for each of these there are n 1 choices for the image of a 2, n 2 choices for the image of a 3, and so on until, finally, there are n (m 1) = n m+1 choices for the image of a m. Thus, by the rule of product, the number of 1-1 functions from A to B is n(n 1) (n m+1) = n!/(n m)!. One to one functions allow us to describe a situation when equality holds in theorem F1 (b). Proposition F3. Let f : A B be a 1-1 function and A 1,A 2 A. Then f(a 1 A 2 )=f(a 1 ) f(a 2 ). By Theorem F1 (b), f(a 1 A 2 ) f(a 1 ) f(a 2 ). Thus, it remains to prove the opposite inclusion. Suppose f is 1-1, and let y f(a 1 ) f(a 2 ). Then y = f(x 1 ) for some x 1 A 1 and y = f(x 2 ) for some x 2 A 2. Since f is 1-1, f(x 1 )=f(x 2 ) x 1 = x 2. Hence, y = f(x) for some x A 1 A 2, that is, y f(a 1 A 2 ). Thus, f(a 1 A 2 ) f(a 1 ) f(a 2 ), as required. Compare the part of the argument where the property that f is 1-1 was used to the paragraph following Theorem F1. To see that the converse of Proposition F3is false, consider f : Z Z where f(n) = 0 for all n Z. Definition (onto function). A function f : A B is called onto (or surjective, or a surjection) if for every element b B there is an element a A such that f(a) =b. (That is, f is onto if and only if every element of B is the image under f of some element of A. Equivalently, f is onto if and only if every element of B is the image under f of at least one element of A.) Proposition F4. If A and B are finite sets and f : A B is an onto function, then A B. Suppose f is onto. Then every element of B has at least one preimage. By the definition of function, each element of A is a preimage for a unique element of B. Thus, A = b B f 1 ({b}) b B 1= B. Proving onto. To prove that a function is onto you must argue that for every b B (equivalently, an arbitrarily chosen b B) there is an a A such that f(a) =b. Thus, the first line of the proof is Let b B. We must find a A such that f(a) =b.. What you do next depends on the description of f and of the set B. Usually, you solve f(a) =b for a in terms of b (as written it gives b in terms of a). Then, you verify that what you have is an element of A. Finally, you substitute this back into f and show that it gives b. The last line of the proof is Hence if a =..., then f(a) = = b, and so f is onto.. 9

10 Example (proving onto). We show that the function f : R + R + defined by f(x) = 9 +(x +3) 3 is onto. Let y R +. Then f(x) =y 9+(x +3) 3 = y (x +3) 3 = y +9 x +3=± y + 9. Since x R +, x+3> 0 and we can disregard the negative square root to obtain x = 3+ y + 9. We must verify that this x belongs to the domain. Since y R + we have y +9> 9 and y +9> 3. Therefore 3+ y +9 R +. Hence, if x = 3+ y + 9, then f(x) = 9+(( 3+ y +9)+3) 3 = 9+( y +9) 2 = y, and so f is onto. Disproving onto. To prove that a function is not onto you must find an element b B which is not f(a) for any a A. How you do this depends on f. In general, it is useful to try to prove that f is onto as above. If it isn t onto, then you will reach a point where either you can t solve for a in terms of b, or you will succeed in doing this but the only possibilities you find are not elements of A. In either case you are done. What you are doing is assuming that f is onto and showing that leads to (logically implies) a contradiction. Since only a False statement logically implies a contradiction, it must be that the assumption that f is onto is False. Example (disproving onto). Consider the function f : R R defined by f(x) = (x 2) Let y R. Then f(x) =y (x 2) 2 10 = y (x 2) 2 = y If y is chosen so that y +10< 0 (say y = 11) then there is no real number x so that (x 2) 2 = y + 10 because (x 2) 2 0 for all real numbers x. Thus, there is no x R so that f(x) = 11, so f is not onto. Example (disproving onto). Consider the function f : Z Z defined by f(n) =2n+3. Let y Z. Then f(n) =y 2n +3=y n =(y 3)/3. But (y 3)/2 Z for all y Z: In particular if y = 0 then (y 3)/2 = 3/2. We now have that if f(n) = 0, then n = 3/2. Thus, there is no n Z such that f(n) =0,sof is not onto. Onto depends on the codomain. Observe that the function f in the example above is onto as a function from R to R. Exercise: What about from Q to Q? For finite sets A and B, it has been straightforward to count the number of functions from A to B, and also the number of 1-1 functions from A to B. We do not presently have the techniques necessary to count the number of onto functions from A to B. This will have to wait until we have covered the Principle of Inclusion and Exclusion, later on. However, we state and use the result now. Fact F5. Let A and B be sets with A = m and B = n. Then, the number of onto functons from A to B is n k=0 ( 1)k( n k) (n k) m. Example (counting using onto functions). We count the number of ways that a collection of 5 labelled (distiguishable) containers can hold a collection of 8 labelled (distinguishable) balls, if no container is left empty. This is the same as the number of functions from the set of balls onto the the set of containers (f(b) is the container that holds ball b), which is 5 k=0 ( 1)k( ) 5 k (5 k) 8 = ( ) ( ) ( ) ( ) ( ) ( 5 5) 0 8 = The number of ways in which the first 3containers hold the first 5 balls and the last 2 containers hold the last 3balls (and, still, no container is left empty) equals the number of functions from a set of 5 labelled balls to the a set of 3labelled containers, times the 10

11 number ( 3 of functions from a set of 3labelled balls to the a set of 2 labelled containers. This is k=0 ( 1)k( ) 3 k (3 k) 5)( 2 k=0 ( 1)k( ) 2 k (2 k) 3) = 864. Corollary F6. Let A and B be finite sets. If f : A B is both 1-1 and onto, then A = B. Since f is 1-1, we have A B by Proposition F2. Since f is onto, we have A B by Proposition F4. The result now follows. Definition (1-1 correspondence). A function f : A B is called a 1-1 correspondence (or bijective, or a bijection) if it is both 1-1 and onto. By the definitions of 1-1 and onto, a function f is a 1-1 correspondence if and only if every element of B is the image of exactly one element of A under f. To determine if a function is a 1-1 correspondence, use the methods discussed above to check whether it is 1-1 and onto. (Of course, you can stop once it fails to have one of these properties.) Corollary F6 is an important counting principle. It says that if two finite collections of objects can be put into 1-1 correspondence, then there are the same number of objects in each collection. For example, there is a 1-1 correspondence between the subsets of A = {a 1,a 2,...,a n } and the set B of binary sequences b 1 b 2...b n of length n: It is given by the function f : P(A) B defined by f(x) is the binary sequence b 1 b 2...b n where for i =1, 2,...,n, { 1 if ai X b i = 0 if a i X. To see that f is 1-1, note that if f(x) =f(y ) then the definition of f implies that X and Y contain exactly the same elements. To see that f is onto, let b 1 b 2...b n B and construct X P(A) by the rule a i X b i = 1. If follows from the definition of f that f(x) =b 1 b 2...b n. Hence, the number of subsets of A equals the number of binary sequences of length n, which equals 2 n (two choices for each position). Exercises. Suppose that A = B. Prove: (a) If f : A B is a 1-1 function, then it is a 1-1 correspondence (i.e. f is also onto). (b) If f : A B is an onto function, then it is a 1-1 correspondence (i.e. f is also 1-1). Proposition F7. Let f : A B be a function. (a) If f is 1-1, then any restriction of f to a subset A 1 A is 1-1. (b) If f is onto, then for any A A, any extension of f to a function g : A B is onto. (a): Let x, y A 1 and suppose f(x) =f(y). Since A 1 A, we have x, y A. Since f is 1-1, f(x) =f(y). Therefore f A1 is 1-1. (b): Let b B. Since f is onto, there exists x A such that f(x) =y. Definition (composition of functions). Let A, B and C be sets, and f : A B and g : B C be functions. The composition of f and g (or the composite function) is the function (g f) :A C defined by (g f)(a) =g(f(a)) for every element a in A. 11

12 Function composition is not commutative. In general, order matters. For f and g as above, the composition of f and g is usually not the same as the composition of g and f. For example, let f : Z Z be defined by f(x) =x 2 and g : Z Z be defined by g(x) =x + 3. Then, (g f)(x) =g(f(x)) = g(x 2 )=x 2 +3 and (f g)(x) =f(g(x)) = f(x +3)=(x +3) 2 = x 2 +6x +9. Since (g f)(0) = 3and (f g)(0) = 9, we have g f f g. It is also possible that, depending on the sets A, B and C, the function g f is defined but the function f g is not. We leave it as an exercise to find an example that demonstrates this. Definition (identity function on a set). The identity function on the set X is the function 1 X : X X defined by 1 X (x) =x for every element x of X. The integer 0 is an identity element with respect to addition of real numbers: x +0= 0+x = x for all x R. Similarly, 1 is an identity with respect to multiplication of nonzero real numbers: 1 x = x 1=x for all x R {0}. The identity function on a set acts in a similar way with respect to function composition. Proposition F8. Let A and B be sets and f : A B be a function. Then (a) f 1 A = f, and (b) 1 B f = f. We prove (a) and leave (b) as an exercise. Let x A. Then, f 1 A (x) =f(1 A (x)) = f(x). Hence, f 1 A = f. Even though function composition is not commutative, it is associative. We now prove this. Proposition F9. Let A, B, C, and D be sets and f : A B, g : B C, and h : C D be functions. Then h (g f) =(h g) f. By definition of function composition, both h (g f) and (h g) f are functions from A to D, so they have the same domain and codomain. Let x A. Then, (h (g f))(x) =h((g f)(x)) = h(g(f(x))=(h g)(f(x)) = ((h g) f)(x), as required. Proposition F10. Let A, B and C be sets and g : A B and f : B C be functions. Then, (a) If f and g are 1-1, then g f is 1-1. (b) If f and g are onto, then g f is onto. (c) If f and g are 1-1 correspondences, then g f is a 1-1 correspondence. We prove (a) and leave the proof of (b) for an exercise. Statement (c) is an immediate consequence of (a) and (b). Suppose (g f)(x) =(g f)(y). Then g(f(x)) = g(f(y)). Since g is 1-1, f(x) =f(y). Since f is 1-1, x = y. therefore, g f is

13 Exercises: find examples to demonstrate that the converse of each statement in proposition F10 is false, but the following statement is true: If f g is a 1-1 correspondence, then f is 1-1 and g is onto (but f need not be onto and g need not be 1-1). Also, find an example to demonstrate that the converse of the above implication is False (never mind the part in brackets). We now return to the question of when the converse of a function is itself a function. Proposition F11. Let f : A B be a function. Then f c is a function if and only if f is 1-1 and onto. ( ) Suppose f c is a function. By the definition of function, for every b B f c contains exactly one ordered pair with first component equal to b. Thus, for every b B f contains exactly one ordered pair with second component equal to b. That is, f is 1-1 and onto. ( ) Suppose f is 1-1 and onto. Then, for every b Bfcontains exactly one ordered pair with second component equal to b. This means that for every b Bf c contains exactly one ordered pair with first component equal to b. That is, f c is a function. Suppose f is a 1-1 and onto function. Then, by Proposition F11, f c is a function. Since (f c ) c = f and f is a function, Proposition F11 implies that the function f c is (also) 1-1 and onto. In the arithmetic of real numbers, the inverse of x is x because x +( x) equals the additive identity, zero. For x 0, the multiplicative inverse of x is 1/x because x (1/x) equals the multiplicative identity, one. The inverse of a function is analogous, and is defined below. Definition (invertible function). A function f : A B is called invertible if there exists a function g : B A such that g f =1 A and f g =1 B. Suppose f : A B is a 1-1 correspondence. Then, by Proposition F11, f c is a function. Consider the composite function f c f. Fora A we have (f c f) =f c (f(a)) = a, by definition of converse. Thus, f c f =1 A. Similarly, for b B we have (f f c )(b) = f c (f(b)) = b. Thus, f f c =1 B. Therefore, a 1-1 and onto function is invertible. Proposition F12. Suppose f : A B is invertible. Then the function g such that g f =1 A and f g =1 B is unique. Suppose g : B A and h : B A are functions such that g f =1 A and f g =1 B and h f =1 A and f h =1 B. We need to show g = h. Let b B. Then g(b) =g(1 B (b))=(g 1 B )(b) =(g (f h))(b) =((g f) h)(b) =(1 A h)(b) =1 A (h(b)) = h(b). Thus, g = h. This comepletes the proof. Definition (inverse). Let f : A B be an invertible function. The inverse of f is the unique function g such that g f =1 A and f g =1 B. It is customary to denote the inverse of f by f 1. In the case where f : A B is 1-1 and onto, we have above that f is invertible and f c = f 1. 13

14 Do not confuse the notation for the inverse of a function, (which exists only sometimes) and the notation for the preimage of a subset of the codomain (which always exists). They use the same symbols, but the former of these is a function and the latter is a set. It should be clear from the context which object is under discussion. Proposition F13. Let f : A B be a function. Then, f is invertible if and only if it is 1-1 and onto. ( ) Suppose f is 1-1 and onto. We have noted above that in this case f is invertible and f c = f 1. ( ) Suppose that f is invertible. Then, there is a function f 1 : B A such that f 1 f =1 A and f f 1 =1 B. Suppose f(x) =f(y). Then f 1 (f(x)) = f 1 (f(y)). The LHS of this equation is (f 1 f)(x) =1 A (x) =x and the RHS is (f 1 f)(y) =1 A (y) =y. Thus, x = y, and f is 1-1. Let b B. Since f 1 is a function, there exists a A such that f 1 (b) =a. By definition of inverse function, we have f(a) =f(f 1 (b))=(f f 1 )(b) =1 B (b) =b. Therefore f is onto. This completes the proof. Combining Propositions F12 and F13gives that if f is an invertible function, then f 1 = f c. By definition of converse, this means that f 1 has the property that, for a A and b B, f(a) =b f 1 (b) =a. (Compare this to the last paragraph in the proof of Proposition F13.) Some (inverse) functions are defined in exactly this way for example for x R + and y R, wehavelog 10 (x) =y 10 y = x Proving f is invertible and finding the inverse. There are two ways to prove that a function f : A B is invertible. One way is to write down the right function g : B A and then check that g f =1 A and f g1 B. Another way is to use Proposition F13and check if f is 1-1 and onto. In the proof that f is onto, one starts with Let y B and suppose f(x) = y. and ultimately derives Then x = g(y).. By our discussion in the previous paragraph, g is the inverse function. Thus, a description of the inverse function is a byproduct of the proof that f is onto. Notice that the definition of an invertible function is symmetric in f and g (a.k.a. f 1 ). Thus, if f is invertible, so is f 1 and (f 1 ) 1 = f. Example (proving f is invertible and finding f 1 ). Let f : R + R be defined by f(x) =2ln(x) 7. We show that f is invertible and find f 1. Suppose f(a) =f(b). Then, we have 2ln(a) 7=2ln(b) 7 2ln(a) =2ln(b) ln(a) =ln(b) e ln(a) = e ln(b) a = b, since the exponential and logarithm functions are inverses. Thus, f is 1-1. Now, suppose y R. Then, f(x) =y 2ln(x) 7=y ln(x) =(y +7)/2 x = e (y+7)/2. For y R the quantity e (y+7)/2 R +, the domain of f. Hence, if x = e (y+7)/2 then f(x) =f(e (y+7)/2 )=2ln(e (y+7)/2 ) 7=2(y +7)/2 7=y, sof is onto. Moreover f 1 : R R + is described by f 1 (y) =e (y+7)/2. 14

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

MA 274: Exam 2 Study Guide (1) Know the precise definitions of the terms requested for your journal. (2) Review proofs by induction. (3) Be able to prove that something is or isn t an equivalence relation.

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square

CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential

Classical Analysis I 1 Sets, relations, functions A set is considered to be a collection of objects. The objects of a set A are called elements of A. If x is an element of a set A, we write x A, and if

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

TOPIC 3: CONTINUITY OF FUNCTIONS. Absolute value We work in the field of real numbers, R. For the study of the properties of functions we need the concept of absolute value of a number. Definition.. Let

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

Chapter Basic Set Theory A set is a Many that allows itself to be thought of as a One. - Georg Cantor This chapter introduces set theory, mathematical induction, and formalizes the notion of mathematical

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

SETS AND FUNCTIONS, MATH 215 FALL 2015 (WHYTE) 1. Intro to Sets After some work with numbers, we want to talk about sets. For our purposes, sets are just collections of objects. These objects can be anything

TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known

Definition 3.1 Group Suppose the binary operation p is defined for elements of the set G. Then G is a group with respect to p provided the following four conditions hold: 1. G is closed under p. That is,

7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

CHPTER 1 asic Ideas In the end, all mathematics can be boiled down to logic and set theory. ecause of this, any careful presentation of fundamental mathematical ideas is inevitably couched in the language

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

6.4 Logarithmic Equations and Inequalities 459 6.4 Logarithmic Equations and Inequalities In Section 6.3 we solved equations and inequalities involving exponential functions using one of two basic strategies.

GRE Prep: Precalculus Franklin H.J. Kenter 1 Introduction These are the notes for the Precalculus section for the GRE Prep session held at UCSD in August 2011. These notes are in no way intended to teach

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

Chapter 7 Functions and onto This chapter covers functions, including function composition and what it means for a function to be onto. In the process, we ll see what happens when two dissimilar quantifiers

2.1 J.A.Beachy 1 2.1 Functions from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 21. The Vertical Line Test from calculus says that a curve in the xy-plane

Introduction to mathematical arguments (background handout for courses requiring proofs) by Michael Hutchings A mathematical proof is an argument which convinces other people that something is true. Math

Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted

To ensure the functioning of the site, we use cookies. We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics. For more information, see the Privacy Policy and Google Privacy &amp Terms.
Your consent to our cookies if you continue to use this website.