Sets, Functions and Relations
|
|
- Owen Potter
- 5 years ago
- Views:
Transcription
1 Chapter 2 Sets, Functions and Relations A set is any collection of distinct objects. Here is some notation for some special sets of numbers: Z denotes the set of integers (whole numbers), that is, Z = {0, 1, 1, 2, 2,...} ; N denotes the set of positive integers, that is, N = {1, 2, 3,...} ; Q denotes the set of rational numbers, that is the set of numbers which can be expressed in the form m n, where m, n are integers and n 0 ; R denotes the set of real numbers ; and C denotes the set of all complex numbers, that is, numbers of the form x + iy, where x, y are real. Notation x X means that x is an element of the set X (and x X means that x is not an element of the set X). Write A B to mean that A is a subset of B, that is, every element of A is an element of B. Thus N Z Q R C. Suppose that X has only finitely many elements, for example suppose the elements of X are the numbers 2, 3, 5, 7, 9. Then we may write X = {2, 3, 5, 7, 9}. More generally we write X = {x 1, x 2,..., x n } (where n is some positive integer) to indicate that the elements of X are x 1, x 2,..., x n. We allow repeats, for example, {2, 3, 5, 3, 7} = {2, 3, 5, 7} and what is more we don t mind in which order the elements are listed, so {2, 3, 5, 7} = {5, 2, 7, 3}. We often specify a subset of some given set by some defining property, for example A = {x Z : x is even} (which can also be written A = {x Z x is even}). 1
2 Let A and B be subsets of a set X. Standard notations: A B = {x X : x A and x B} (intersection) A B = {x X : x A or x B} (union) X \ A = A = {x X : x / A} (complement) = (empty set) RESULTS (seen in the course Geometry I ) (i) The commutative law for : X Y = Y X for all sets X, Y. (ii) The associative law for :(X Y ) Z = X (Y Z) for all sets X, Y, Z. (iii) The commutative law for : X Y = Y X for all sets X, Y. (iv) The associative law for : (X Y ) Z = X (Y Z) for all sets X, Y, Z. (v) The distributive laws for and : For all sets X, Y, Z, X (Y Z) = (X Y ) (X Z) and X (Y Z) = (X Y ) (X Z). (vi) De Morgan s Laws: If X and Y are subsets of a set U then (X Y ) = X Y and (X Y ) = X Y. We can also do operations on more than two sets at a time. Given subsets A 1, A 2,..., A n of a set X we define A 1 A 2 A n to be the set of elements of X which lie in at least one of the sets A 1, A 2,... A n. We define A 1 A 2 A n to be the set of elements which lie in all of the sets A 1, A 2,... A n. Example Let X = Z and take A 1 = {2, 3, 5, 7}, A 2 = {3, 5, 7} and A 3 = {7, 11, 13} then A 1 A 2 A 3 = {7} and A 1 A 2 A 3 = {2, 3, 5, 7, 11, 13}. Products of Sets Suppose X, Y are sets. We write X Y for the set of all pairs (x, y), with x X and y Y. Thus X Y = {(x, y) x X, y Y }. Elements (x, y) and (x, y ) of X Y are equal if and only if we have both x = x and y = y. Example A = {1, 2, 3}, B = {6, 7, 8}. Then A B = {(1, 6), (1, 7), (1, 8), (2, 6), (2, 7), (2, 8), (3, 6), (3, 7), (3, 8)}. 2
3 For a finite set X we write X for the number of elements in X. This number is called the cardinality of the set X. For example the set X = {2, 3, 5} has cardinality X = 3. Lemma 2.1 If X, Y are finite sets then X Y = X. Y. If we have sets X 1, X 2,..., X n we write X 1 X 2 X n for the set of all sequences (x 1, x 2,..., x n ), with x 1 X 1, x 2 X 2,..., x n X n. The order is important : we have (x 1, x 2,..., x n ) = (x 1, x 2,..., x n) if and only if we have x 1 = x 1 and x 2 = x 2,..., and x n = x n. For example if X 1 = X 2 = X 3 = R then the elements (1, 4, 7), (4, 7, 1), (7, 1, 4), (7, 4, 1), (1, 7, 4), (4, 1, 7), of X 1 X 2 X 3 are all different. Remark Products of sets are an important construction. For example, starting with R we can construct the plane R R (usually written R 2 ), we can construct 3-space R R R (usually written R 3 ) etc. Paradoxes Most of the sets we deal with in this course will be subsets of some set of numbers (N, Q, Z, R,...) or else they will be products of such subsets etc. If we allow more general collections of objects, we can get into logical difficulties. For example Bertrand Russell ( ) considered (in 1901) the set: S = {all sets which are not elements of themselves} Many sets lie in S (for example the set of all pianos is not itself a piano and therefore this set is an element of S). But Russell asked: Is S itself an element of S? If S is an element of S, then S must satisfy the defining property for S, that is to say S / S. But if S is not an element of S, then S S. So S S S / S. This is a modern version of the Ancient Greek paradox concerning Epimenides, from Crete, who is reputed to have said All Cretans are liars. The courses Logic I and Logic II will have more to say about such conundrums. Functions A function consists of two sets together with a rule which assigns an element of the second set to each element of the first set. If we call the sets S and T, a function f from S to T consists of the two sets S and T together with a rule which assigns an element f(s) T to each element s S. A function is also often called a map or a mapping. 3
4 Examples (i) S = T = Z, f(x) = 2x + 3. (ii) S = R, T = R, f(x) = sin x + 2 cos x. (iii) S = Z, T = Q, f(x) = x/2. (iv) f : R C, f(x) = x + i0 (this map f : R C is called the inclusion map). Definitions codomain of f : S T. Given a function f : S T the set S is called the domain and the set T is called the In example (i) the domain and codomain of f are both Z. In example (ii) the domain and codomain of f are both R. In example (iii) the domain of f is Z and the codomain is Q. In example (iv) the domain is R and the codomain is C. Functions f : S T and g : U V are equal if S = U and T = V and f(x) = g(x) for all x S (= U). For example consider the map f : Z R given by the formula f(x) = 2x 3 and the map g : Z Q given by the formula g(x) = 2x 3. The maps f and g are different (because the codomain of f is not equal to the codomain of g). Definition The image of a function f : S T is the subset {f(x) x S} of T. We write Im(f) for the image of f. We call f onto (or surjective) if Im(f) = T, i.e. if the image of f is the whole of the codomain of f. The condition for an element t of T to be in the image of f is that there is some element s S such that t = f(s). Thus f is onto if (and only if) for each t T there exists some element s S such that t = f(s). S T 3 f In this picture the function f is not onto, since there are elements t T which are not in the image of f. Examples 1. Is the function f : R R, given by f(x) = x 2, onto? Note that f(x) = x 2 0 for every x R, so that 1 is not in the image of f. Hence Im(f) R and so f is not onto. (In fact Im(f) = {y R y 0}.) 4
5 2. Is the function f : C C, given by the formula f(z) = z 2, onto? Let ω be any element of C and write ω in polar form ω = re iθ (with r real and r 0 and θ real). Then ω = ( re iθ/2 ) 2 = f(z), where z = re iθ/2. So every element ω C lies in the image of f and hence f is onto. 3. Consider f : Z Z given by { x/2, if x is even; f(x) = 3x + 1, if x is odd. Is f onto? Yes - as we now demonstrate. If y Z then y = f(2y), in particular y has the form f(x) for some x Z, so y Im(f). Hence every element of Z is in the image of f, so Im(f) = Z and f is onto. Notation Suppose that f : S T and g : T U are functions. (Note that the codomain of f is equal to the domain of g.) The composite function h : S U is the function defined by the formula h(x) = g(f(x)), for x S. We often denote the composite function by g f, but sometimes we just write gf. Lemma 2.2 Suppose that S, T, U are sets and f : S T, g : T U are functions. If f and g are onto then so is the composite g f. Definition We call a function f : S T a one to one (1 1) function (or an injective function) if for each pair of different elements s 1, s 2 of S the elements f(s 1 ), f(s 2 ) of T are distinct (i.e. different). There are various other ways of expressing this condition. One is that f is 1 1 if whenever f(s 1 ) = f(s 2 ), for elements s 1, s 2 S, then we necessarily have s 1 = s 2. In other words the condition f(s 1 ) = f(s 2 ) implies that s 1 = s 2. Another way of stating the 1 1 condition is that for each t T there exists at most one element s S mapping to t. Examples 1. Consider the function f : R R given by f(x) = x 2. We have f(1) = f( 1) so that different elements of R map to the same element under f, so f is not Consider the function f : R R given by f(x) = x. We claim that f is 1 1. We must check that f(x 1 ) = f(x 2 ) implies that x 1 = x 2. But if f(x 1 ) = f(x 2 ) then x 1 = x 2 giving x 1 = x 2, so f is f : N N given by { x/2, if x is even; f(x) = 3x + 1, if x is odd. 5
6 If we can t see the answer directly we can draw up a table to examine a few values to see if this will help us But now we can stop because we see that two distinct element map to the same element under f, i.e. f(1) = f(8) = 4 so that f is not 1 1. We now have the counterpart of Lemma 2.2 for the 1 1 property. Lemma 2.3 Suppose S, T, U are sets and f : S T, g : T U are maps. If f and g are both 1 1 then the composite g f is 1 1. Definition A map f : S T is called a bijection if it is 1 1 and onto. Definition Let f : S T be a map. A map g : T S such that g(f(s)) = s, for all s S, and f(g(t)) = t, for all t T, is called an inverse of f. One also says that f and g are inverse maps. Remark For any set X we have the map ι : X X given by ι(x) = x, for all x X. The map ι is called the identity map on X. Sometimes one writes ι X for this map, to stress that it is defined on the set X. The conditions for f and g to be inverse maps can now be expressed g f = ι S and f g = ι T. Example Let f : R R be given by f(x) = 2x + 3. Show that f has an inverse. We have to find a map g : R R which satisfies f(g(x)) = x (and g(f(x)) = x) for all x R. Now f(g(x)) = 2g(x) + 3 so we get 2g(x) + 3 = x and hence g(x) = (x 3)/2. So we define g : R R by the formula g(x) = (x 3)/2 and check that g is an inverse of f. Remark There is at most one inverse to a given map f : S T. Assume that g : T S is an inverse and that h : T S is too. Then we get h(t) = h(f(g(t))) = h(f(s)) (where s = g(t)) so that h(t) = h(f(s)) = s = g(t). So h(t) = g(t) for all t T and hence h = g. So from now on when an inverse g exists to a map f we call g the inverse of f. Proposition 2.4 A map f : S T is a bijection if and only if f has an inverse. 6
7 The Power Set Let X be a set. We write P (X) for the set whose elements are the subsets of X. The set P (X) is called the power set of X. Examples 1. Let X = {2, 3, 5}. Then P (X) is the set whose elements are, {2}, {3}, {5}, {2, 3}, {2, 5}, {3, 5}, {2, 3, 5}. In other words we have P (X) = {, {2}, {3}, {5}, {2, 3}, {2, 5}, {3, 5}, {2, 3, 5}}. 2. The power set P (C) has elements N,Z,Q,R (and lots more). 3. If X = {x} (X has one element) then P (X) = {, X}. Lemma 2.5 Suppose that X is a finite set and X = n. Then P (X) = 2 n. Relations Given a statement that applies to pairs of elements of a set X we say that x is related to y (and write x y) if this statement is true. Examples 1. Take X to be the set of all people and the statement to be x is the mother of y, so we write x y if x is the mother of y, for example we have Barbara Bush George W Bush Barbara Bush Jeb Bush. 2. Take X = Z and the relation to be x y is even. Then 1 3, 5 17, 2 8 but it is not true that Take X = R and the relation to be x is less than y, so 1 3, 2 5 etc. It is often useful to decide whether a relation on a set X has the following important properties. Reflexive Call reflexive if x x for every x X. Symmetric Call symmetric if whenever x y then y x. 7
8 Transitive Call transitive if whenever x y and y z then x z. Examples 1. Let X = Z and the relation x y if x y is even. Reflexive We have x x since x x = 0 which is even, for every x X, so is reflexive. Symmetric If x y then x y is even, hence y x (which is (x y)) is even and so y x. So the relation is reflexive. Transitive If x y and y z then x y and y z are even. Hence x z = (x y) + (y z) is even and x z. So if x y and y z then x z and so is a transitive relation. 2. Now take X to be the set of all people and x y if x is the mother of y. This relation fails all properties spectacularly. Reflexive - No. A person is not his or her own mother. Symmetric - No. If x is the mother of y then y is not the mother of x (in fact y is the son or daughter of x). Transitive - No. If x is the mother of y and y is the mother of z then x is not the mother of z (in fact x is the grandmother of z). 3. Take X = Z and x y meaning that 3 divides x + y. Reflexive - No. It is not true that 1 1 (3 does not divide = 2). Symmetric - Yes. If x y then 3 divides x + y, so 3 divides y + x, so y x. Transitive - No. For example 1 2 and 2 4 but it is not true that 1 4. Definition A relation is called an equivalence relation if it is reflexive, symmetric and transitive. Example Let f : S T be any function. Let be the relation on S given by x y if f(x) = f(y). We check that is an equivalence relation. Reflexive - Yes. x x because f(x) = f(x). Symmetric - Yes. If x y then f(x) = f(y) so f(y) = f(x), in other words y x. Transitive - Yes. If x y and y z then f(x) = f(y) and f(y) = f(z) so that f(x) = f(z) and hence x z. Definition Let be an equivalence relation on a set X. For x X we define E x = {y X x y}. We call E x the equivalence class defined by x. 8
9 Example Take X = Z and x y if x y is even. If x is even the E x = {..., 4, 2, 0, 2, 4, 6,...} and if x is odd then E x = {..., 5, 3, 1, 1, 3, 5,...}. Notation Let f : S T be a map and let V be a subset of T. We define a subset f 1 V of S by f 1 V = {x S f(x) V }. Thus an element x of S belongs to f 1 V if and only if f(x) belongs to V. Example Let f : Z Z be the map f(x) = x. Let V be the set of non-negative integers. Then f 1 V is the set of all x Z such that f(x) = x is non-negative. Hence f 1 V is the set of all non-positive integers. Example Let f : S T be an onto map and let be the relation x y if f(x) = f(y). The sets E x defined above are exactly the subsets of S of the form f 1 {t}, for some t T. We prove this. Consider E x. Put t = f(x). If y E x then f(y) = f(x) = t, i.e. y f 1 {t}. This shows that E x f 1 {t}. Conversely if s S is any element of f 1 {t} then f(s) = t = f(x) so that x s and s E x. This shows that f 1 {t} E x and hence E x = f 1 {t}. So every E x has the claimed form. Now let t be any element of T and consider the set f 1 {t}. Pick x S such that f(x) = t (we can do this because f is onto). Then as above we get E x = f 1 {t} and so every set of the form f 1 {t} is equal to E x for some x S. This completes the proof. Definition Subsets A, B of a set X are called disjoint if A B =. Theorem 2.6 Let X be a set and let be an equivalence relation on X. Then: (i) x E x (for each x X). (ii) For x, y X the sets E x, E y are either equal or disjoint (i.e. either E x = E y or E x E y = ). (iii) E x = E y if and only if x y. Given an equivalence on a set X we often write [x] for the equivalence class E x of x, in other words [x] = {y X x y}. Example Let X = Z and fix a positive integer m. Define x y to mean that x y is a multiple of m (i.e. x y = mr for some r Z). Then is an equivalence relation. Here the equivalence class of any given element x Z is: [x] = {..., x 2m, x m, x, x + m, x + 2m,...}. For a concrete example take m = 4. In this case: [0] = all multiples of 4 = {..., 8, 4, 0, 4, 8,...} 9
10 [1] = all integers which have remainder 1 on division by 4 = {..., 7, 3, 1, 5, 9,...} [2] = {..., 2, 2, 6, 10,...} [3] = {..., 5, 1, 3, 7, 11,...} and every element of Z is in just one of these four equivalence classes (as asserted by Theorem 2.6(ii)). There is another way of viewing equivalence relations. Definition Let X be a set. A partition of X is a set P of non-empty subsets of X such that each element of X belongs to one and only one set in P. Note that P is a subset of P (X). Example Take X = {1, 2, 3, 4, 5}. (a) The subsets {1, 3}, {2, 4, 5} form a partition of X, in other words P = {{1, 3}, {2, 4, 5}} is a partition of X. (b) The subsets {1}, {5}, {2, 4, 3} form a partition of X, i.e. P = {{1}, {5}, {2, 4, 3}} is a partition of X. (c) The subsets {1, 4}, {2}, {3, 5} form a partition of X (i.e. P = {{1, 4}, {2}, {3, 5}} is a partition of X). (d) There are lots more! If there are n sets in the partition of X we can picture the partition as : X 1 X 2 X 4 X 3 X 5 Here n = 5. We can restate Theorem 2.6 as follows. 10
11 Theorem 2.7 Suppose that is an equivalence relation on X. Then the equivalence classes {E x x X} form a partition of X. On the other hand starting with a partition P of a set X we can make an equivalence relation by defining x y to mean that the elements x and y belong to the same set in this partition. The equivalence classes for this equivalence relation are then the sets which make up the partition P. This gives a correspondence between equivalence relations and partitions on a set X. Equivalence Relations and subsets of X X Since the idea of an equivalence relation is so important we give one more way of thinking about them. Suppose that is any relation (not necessarily an equivalence relation) on a set X. We define a subset R of X X by R = {(x, y) x y}. On the other hand if we start with a subset R of X X we then make a relation by defining x y if (x, y) R. We can now state the conditions for an equivalence relation in terms of the subset R of X X. Lemma 2.8 is an equivalence relation if and only if R has the following properties: (i) (x, x) R for all x X; (ii) whenever (x, y) R then (y, x) R; (iii) whenever (x, y) R and (y, z) R then (x, z) R. Example Suppose X = {2, 3, 5} and R = {(2, 2), (2, 3), (2, 5), (3, 3), (5, 5)}. The relation defined by R (that is x y if (x, y) R) is not an equivalence relation because (2, 3) R but (3, 2) is not in R (so that (ii) fails, and so symmetry fails for ). Graphs of functions The mathematical way to describe the graph of a function is as a subset of the product of the domain and codomain. Let f : S T be a map. Then the graph of f is the subset {(x, f(x)) x S} of S T. Even if S = T the graph of a function from S to T does not usually satisfy the properties listed in Lemma 2.8. In fact for any given domain S there is just one function f : S S which satisfies these properties. (Exercise: Which function is this?) Example Take S = T = R and f(x) = x 2. Then the graph of f is the set of points {(x, x 2 ) x R}, which we draw in the plane as the set of all points (x, y) having y = x 2. 11
Foundations Revision Notes
oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationREVIEW FOR THIRD 3200 MIDTERM
REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationNotes. Functions. Introduction. Notes. Notes. Definition Function. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y.
Functions Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Section 2.3 of Rosen cse235@cse.unl.edu Introduction
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More information0 Logical Background. 0.1 Sets
0 Logical Background 0.1 Sets In this course we will use the term set to simply mean a collection of things which have a common property such as the totality of positive integers or the collection of points
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationIntroduction to Proofs
Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More informationSection 4.4 Functions. CS 130 Discrete Structures
Section 4.4 Functions CS 130 Discrete Structures Function Definitions Let S and T be sets. A function f from S to T, f: S T, is a subset of S x T where each member of S appears exactly once as the first
More information18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)
18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating
More informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to
More informationLecture Notes on Discrete Mathematics. October 15, 2018 DRAFT
Lecture Notes on Discrete Mathematics October 15, 2018 2 Contents 1 Basic Set Theory 5 1.1 Basic Set Theory....................................... 5 1.1.1 Union and Intersection of Sets...........................
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationChapter 0. Introduction: Prerequisites and Preliminaries
Chapter 0. Sections 0.1 to 0.5 1 Chapter 0. Introduction: Prerequisites and Preliminaries Note. The content of Sections 0.1 through 0.6 should be very familiar to you. However, in order to keep these notes
More informationSets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth
Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended
More informationBackground for Discrete Mathematics
Background for Discrete Mathematics Huck Bennett Northwestern University These notes give a terse summary of basic notation and definitions related to three topics in discrete mathematics: logic, sets,
More informationReading 11 : Relations and Functions
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Reading 11 : Relations and Functions Instructor: Beck Hasti and Gautam Prakriya In reading 3, we described a correspondence between predicates
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Spring
c Dr Oksana Shatalov, Spring 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationSelected Solutions to Even Problems, Part 3
Selected Solutions to Even Problems, Part 3 March 14, 005 Page 77 6. If one selects 101 integers from among {1,,..., 00}, then at least two of these numbers must be consecutive, and therefore coprime (which
More information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More information1. To be a grandfather. Objects of our consideration are people; a person a is associated with a person b if a is a grandfather of b.
20 [161016-1020 ] 3.3 Binary relations In mathematics, as in everyday situations, we often speak about a relationship between objects, which means an idea of two objects being related or associated one
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationFunctions Functions and Modeling A UTeach/TNT Course
Definition of a Function DEFINITION: Let A and B be sets. A function between A and B is a subset of A B with the property that if (a, b 1 )and(a, b 2 ) are both in the subset, then b 1 = b 2. The domain
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationB 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.
Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationMathematics Review for Business PhD Students Lecture Notes
Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More information1. Decide for each of the following expressions: Is it a function? If so, f is a function. (i) Domain: R. Codomain: R. Range: R. (iii) Yes surjective.
Homework 2 2/14/2018 SOLUTIONS Exercise 6. 1. Decide for each of the following expressions: Is it a function? If so, (i) what is its domain, codomain, and image? (iii) is it surjective? (ii) is it injective?
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Sets and Functions The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Define the
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More information9/19/2018. Cartesian Product. Cartesian Product. Partitions
Cartesian Product The ordered n-tuple (a 1, a 2, a 3,, a n ) is an ordered collection of objects. Two ordered n-tuples (a 1, a 2, a 3,, a n ) and (b 1, b 2, b 3,, b n ) are equal if and only if they contain
More informationFunctions as Relations
Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The
More informationScott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:
Equivalence MA Relations 274 and Partitions Scott Taylor 1. EQUIVALENCE RELATIONS Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: (1) is reflexive. That is, (2) is
More informationPRELIMINARIES FOR GENERAL TOPOLOGY. Contents
PRELIMINARIES FOR GENERAL TOPOLOGY DAVID G.L. WANG Contents 1. Sets 2 2. Operations on sets 3 3. Maps 5 4. Countability of sets 7 5. Others a mathematician knows 8 6. Remarks 9 Date: April 26, 2018. 2
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationChapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60
MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
More information1.2 Functions What is a Function? 1.2. FUNCTIONS 11
1.2. FUNCTIONS 11 1.2 Functions 1.2.1 What is a Function? In this section, we only consider functions of one variable. Loosely speaking, a function is a special relation which exists between two variables.
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
More informationFOUNDATIONS & PROOF LECTURE NOTES by Dr Lynne Walling
FOUNDATIONS & PROOF LECTURE NOTES by Dr Lynne Walling Note: You are expected to spend 3-4 hours per week working on this course outside of the lectures and tutorials. In this time you are expected to review
More informationSolutions to Tutorial for Week 4
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial for Week 4 MATH191/1931: Calculus of One Variable (Advanced) Semester 1, 018 Web Page: sydneyeduau/science/maths/u/ug/jm/math191/
More informationNumbers, sets, and functions
Chapter 1 Numbers, sets, and functions 1.1. The natural numbers, integers, and rational numbers We assume that you are familiar with the set of natural numbers the set of integers and the set of rational
More informationCOM S 330 Homework 05 Solutions. Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.
Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem. Problem 1. [5pts] Consider our definitions of Z, Q, R, and C. Recall that A B means A is a subset
More informationName (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)
MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationCartesian Products and Relations
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
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationSolutions to Homework Problems
Solutions to Homework Problems November 11, 2017 1 Problems II: Sets and Functions (Page 117-118) 11. Give a proof or a counterexample of the following statements: (vi) x R, y R, xy 0; (x) ( x R, y R,
More informationDiscrete Mathematics
Discrete Mathematics Dr. Thomas Baird January 7, 2013 Contents 1 Logic 2 1.1 Statements.................................... 2 1.1.1 And, Or, Not.............................. 2 1.1.2 Implication...............................
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationFinite and Infinite Sets
Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following
More information4.1 Real-valued functions of a real variable
Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with co-ordinates in the x-y plane. Instead of coming from R, the first component of an ordered pair comes from
More informationSolutions for Chapter Solutions for Chapter 17. Section 17.1 Exercises
Solutions for Chapter 17 403 17.6 Solutions for Chapter 17 Section 17.1 Exercises 1. Suppose A = {0,1,2,3,4}, B = {2,3,4,5} and f = {(0,3),(1,3),(2,4),(3,2),(4,2)}. State the domain and range of f. Find
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 1 Fall 2014 I. Foundational material I.1 : Basic set theory Problems from Munkres, 9, p. 64 2. (a (c For each of the first three parts, choose a 1 1 correspondence
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationMath 127 Homework. Mary Radcliffe. Due 29 March Complete the following problems. Fully justify each response.
Math 17 Homework Mary Radcliffe Due 9 March 018 Complete the following problems Fully justify each response NOTE: due to the Spring Break, this homework set is a bit longer than is typical You only need
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationHL Topic. Sets, relations and groups. (Further Mathematics SL Topic 3) Sets Ordered pairs Functions Binary operations Groups Further groups
HL Topic (Further Mathematics SL Topic 3) 9 This topic explores the fundamental nature of algebraic structures and the relationships between them. Included is an extension of the work covered in the Core
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 10/10/2018 at 23:28:03 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationDiscrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams
Contents : basic definitions and notation A set is an unordered collection of its elements (or members). The set is fully specified by its elements. Usually capital letters are used to name sets and lowercase
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationRELATIONS AND FUNCTIONS
For more important questions visit : www.4ono.com CHAPTER 1 RELATIONS AND FUNCTIONS IMPORTANT POINTS TO REMEMBER Relation R from a set A to a set B is subset of A B. A B = {(a, b) : a A, b B}. If n(a)
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More informationCSCE 222 Discrete Structures for Computing
CSCE 222 Discrete Structures for Computing Sets and Functions Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sets Sets are the most fundamental discrete structure on which all other discrete
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationABSTRACT INTEGRATION CHAPTER ONE
CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed
More informationGeneral Notation. Exercises and Problems
Exercises and Problems The text contains both Exercises and Problems. The exercises are incorporated into the development of the theory in each section. Additional Problems appear at the end of most sections.
More informationA Logician s Toolbox
A Logician s Toolbox 461: An Introduction to Mathematical Logic Spring 2009 We recast/introduce notions which arise everywhere in mathematics. All proofs are left as exercises. 0 Notations from set theory
More information