SETS AND FUNCTIONS, MATH 215 FALL 2015 (WHYTE)

Save this PDF as:

Size: px
Start display at page:

Transcription

1 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 - numbers, words, other sets, etc. We use the notation : { } for a set, with the elements listed in the middle. Some examples: {1, 2, 3, 4} {cat, dog, house} {2m +1:m 2 Z} {0, 1, 2, 3,...} The third and fourth sets listed here show two common methods of defining sets. In the third we are taking every number of the form 2m +1 where m is allowed to be any integer. For the fourth we have used... to indicated that the sequence continues in the given pattern indefinitely. This is not completely rigorous, since we have not specified what the pattern is - this notation should not be used if there is any doubt about what is intended. Definition 1.1. Two sets S and T are equal, written S = T, if they have the same elements. In other words, if x 2 S () x 2 T. Definition 1.2. Given sets S and T,wesayS is a subset of T, written S T, if all the elements of S are also elements of T (sox 2 S =) x 2 T ). The following is a common strategy for proving two sets are the same: Proposition 1.3. Given sets S and T, S = T if and only if both S T and T S. We can build new sets out of ones we already have. Definition 1.4. Given a set S, its complement, written S c is defined by x 2 S c () x/2 S Definition 1.5. Given sets S and T, their union, S [ T is defined by x 2 S [ T () (x 2 S or x 2 T ) Definition 1.6. Given sets S and T, their intersection, S \ T is defined by x 2 S \ T () (x 2 S and x 2 T ) One common set is the set which has no elements, called the empty set. We will use the symbol ; for this set. 1

2 2 SETS AND FUNCTIONS, MATH 215 FALL 2015 (WHYTE) Some basic facts about these operations on sets: Proposition 1.7. Let A,B, and C be sets. A [ B = B [ A (A [ B) c =(A c \ B c ) (A [ B) [ C = A [ (B [ C) A \ B = B \ A (A \ B) c =(A c [ B c ) (A \ B) \ C = A \ (B \ C) (A [ B) \ C =(A \ C) [ (B \ C) A \;= ; A [;= A ; A (hint :All of these can be proven in a straightforward way from the definitions, sometimes with the help of Prop 1.3). Sets can have other sets as elements, and this can be confusing. For example: Question 1.8. Let S = {a, b, {x, y}} How many elements does S have? Is x an element of S? Is a an element of S? Is {x, y} an element of S? Is {x, y} a subset of S? Is {a, b} an element of S? Is {a, b} a subset of S? One source of examples of sets with other sets as elements is the power set: Definition 1.9. Let S be a set. The power set of S, written P (S), isthe set of all subsets of S. Sox 2 P (S) () x S. Example If S = {a, b} then P (S) ={;, {a}, {b}, {a, b}} Proposition For any set S, P (S) has at least one element. Proposition If S is a set such that P (S) has only one element then S = ;. Work out examples of the power sets of some (small) sets. In particular, for the example above of S = {a, b}, what is P (P (S))? Problem Suppose S is a set with n elements. Make a conjecture about how many elements P (S) has, then prove your conjecture using induction (hint: the answer is also an explanation for the name power set ).

3 SETS AND FUNCTIONS, MATH 215 FALL 2015 (WHYTE) 3 2. Cartesian Products There is another process that creates a new set out of old ones, called the Cartesian product. You are already familiar with this as the process that builds the Cartesian plane R 2 out of the real numbers R. A point in R 2 is a an ordered pair of real numbers (x, y). Notice that an ordered pair is more than just the set {x, y} since the order matters : the point (2, 3) is not the same as the point (3, 2). Definition 2.1. Let A and B be two sets. An ordered pair with first coordinate from A and second coordinate from B is a pair (x, y) with x 2 A and y 2 B. With this definition in hand, we can define the Cartesian product: Definition 2.2. Let A and B be two sets. Their Cartesian product, written A B is the set of ordered pairs with first coordinate from A and second coordinate from B. Problem 2.3. Write down the Cartesian products, A B, forthefollowing sets: A = {1, 2}, B = {cat} A = {a, b, c}, B = {a, b} A = {a, b}, B = {a, b, c} Notice that the last two examples show that A B is not the same as B A. Proposition 2.4. Let S be any set. Prove that ; S and S ; are both equal to ;. Problem 2.5. If A has n elements and B has m elements, how many elements does A B have? Can you prove it? One of the reasons the Cartesian product construction is important is that it gives a framework for talking about how elements of di erent sets can be related. To define a relationship between elements of A and elements of B we simply indicate all the pairs (a, b) where the relationship holds. More precisely: Definition 2.6. A relation between A and B is a subset R of the product A B. If(a, b) 2 R we say that the relation R holds between a and b. For example, take A as the set of all English words, and B the set of all 26 English letters. Some natural relations between A and B are starts with, ends with, and contains. Example 2.7. As a smaller version of the above, let A = {cat, dog, frog, cow} and let B be the set of letter 26 letters. Write down the sets that correspond to the three relations starts with, ends with, and contains. How many elements are in each relation?

4 4 SETS AND FUNCTIONS, MATH 215 FALL 2015 (WHYTE) There are three special kinds of relations that will be particularly important for us: A relation R between A and B is called a mapping ( or sometimes function ) from A to B is for every element x 2 A there is exactly one y 2 B so that (x, y) 2 R. In this case we usually give the mapping a name (like f) and write y = f(x) for the y that is related to x. The other two kinds occur only when A and B are the same set: A relation R between A and A is called a linear ordering if it satisfies : For all a 1 and a 2 in A, exactly one of the following is true: a 1 = a 2 (a 1,a 2 ) 2 R (a 2,a 1 ) 2 R If (a 1,a 2 ) and (a 2,a 3 ) are in R, thensois(a 1,a 3 ) In this case we usually write a 1 <a 2 instead of (a 1,a 2 ) 2 R A relation R between A and itself is called an equivalence relation if it satisfies : For all a in A, wehave(a, a) 2 R If (a 1,a 2 )isinr then so is (a 2,a 1 ) If (a 1,a 2 ) and (a 2,a 3 ) are in R, thensois(a 1,a 3 ) In this case we usually write a 1 a 2 or a 1 a 2 instead of (a 1,a 2 ) 2 R. Problem 2.8. Suppose A = B = Z. For each of the following relations, decide if they are functions A to B, linear orderings, and/or equivalence relations ( they may be more than one or none ). (1) R = {(n, 0) for all n 2 Z} (2) R = {(0,n) for all n 2 Z} (3) R = {(n, n) for all n 2 Z} (4) R = {(n, n 2 ) for all n 2 Z} (5) R = {(n 2,n) for all n 2 Z} (6) R = {(n, n +3m) for all n, m 2 Z} (7) R = {(n, n + m) for all n 2 Z and m 2 N} (8) R = {(n, n + m) for all n 2 N and m 2 Z} (9) R = {(n, m) such that n + m = 10 and n, m 2 Z} (10) R = {(n, m) such that n 2 + m 2 = 10 and n, m 2 Z} (11) R = {(n, m) such that n 2 = m 2 and n, m 2 Z} Problem 2.9. Is it possible for a relation to be both an equivalence relation and a function? If so how? Problem Is it possible for a relation to be both an equivalence relation and a linear order? If so how? Problem Is it possible for a relation to be both a linear order and a function? If so how?

5 SETS AND FUNCTIONS, MATH 215 FALL 2015 (WHYTE) 5 3. Functions Definition 3.1. Let f be a function from S to T. f is called injective if f(s 1 )=f(s 2 ) implies s 1 = s 2 f is called surjective if for all t 2 T there is s 2 S with f(s) =t f is called bijective if f is both injective and surjective. Problem 3.2. Which of the following functions are injective? surjective? bijective? (1) f(x) =x 2 as a function R! R (2) f(x) =2x +1 as a function Z! Z (3) f(x) =2x +1 as a function R! R (4) For sets A and B, the function f : A B! B A defined by f(a, b) =(b, a) Problem 3.3. Let A and B be sets. Define f : P (A) P (B)! P (A [ B) by f(s, T )=S [ T. (1) Prove that f is surjective. (2) Prove that f is injective if and only if A \ B = ; Problem 3.4. Let S and T be finite sets, and f : S! T a function. Show that if f is injective then S apple T Show that if f is surjective then S T Assume S = T. Showthatf is injective i f is surjective. One important way of building functions is to combine known functions. One way to do this is as follows: given f : A! B and g : B! C we can define the composition, writteng f, as a function from A! C, bythe rule : g f(a) =g(f(a)) It is important to note that this only makes sense when the range of f is the same as the domain of g, so that it is possible to use f(a) as an input value for g. Problem 3.5. Which of the following five functions can be composed, and in what orders? For those that can, work out the compositions. a(x) =x 2 from R! R b(x) =2x +1 from R! R c : {cat, dog, tree}!r, where c(cat) =1, c(dog) =0,andc(tree) = 1 d : R!{cat, dog, tree}, where d(x) =cat for x<0, c(0) = dog, and c(x) =tree for x>0 e : {cat, dog, tree}!{cat, dog, tree} where e(cat) =tree, e(tree) = dog, ande(dog) =dog.

Sets and functions. {x R : x > 0}.

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.

Sets and Cardinality Notes for C. F. Miller

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

Classical Analysis I

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

Cartesian 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

MAT2400 Analysis I. A brief introduction to proofs, sets, and 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

SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

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.

Some Definitions about Sets Definition: Two sets are equal if they contain the same elements. I.e., sets A and B are equal if x[x A x B]. Notation: A = B. Recall: Sets are unordered and we do not distinguish

S(A) X α for all α Λ. Consequently, S(A) X, by the definition of intersection. Therefore, X is inductive.

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.

Math/CSE 1019: Discrete Mathematics for Computer Science Fall Suprakash Datta

Math/CSE 1019: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/1019 1

INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

Sets and set operations: cont. Functions.

CS 441 Discrete Mathematics for CS Lecture 8 Sets and set operations: cont. Functions. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Set Definition: set is a (unordered) collection of objects.

Math 320 Course Notes. Chapter 7: Countable and Uncountable Sets

Math 320 Course Notes Magnhild Lien Chapter 7: Countable and Uncountable Sets Hilbert s Motel: Imagine a motel with in nitely many rooms numbered 1; 2; 3; 4 ; n; : One evening an "in nite" bus full with

Compactness in metric spaces

MATHEMATICS 3103 (Functional Analysis) YEAR 2012 2013, TERM 2 HANDOUT #2: COMPACTNESS OF METRIC SPACES Compactness in metric spaces The closed intervals [a, b] of the real line, and more generally the

The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

Lecture 4 -- Sets, Relations, Functions 1

Lecture 4 Sets, Relations, Functions Pat Place Carnegie Mellon University Models of Software Systems 17-651 Fall 1999 Lecture 4 -- Sets, Relations, Functions 1 The Story So Far Formal Systems > Syntax»

Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

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

Problem Set 1 Solutions Math 109

Problem Set 1 Solutions Math 109 Exercise 1.6 Show that a regular tetrahedron has a total of twenty-four symmetries if reflections and products of reflections are allowed. Identify a symmetry which is

Chapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.

Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to

Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

Sets, Relations and Functions

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

3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

Course 221: Analysis Academic year , First Semester

Course 221: Analysis Academic year 2007-08, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

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

Introduction to Proofs

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

Mathematics for Computer Science

Mathematics for Computer Science Lecture 2: Functions and equinumerous sets Areces, Blackburn and Figueira TALARIS team INRIA Nancy Grand Est Contact: patrick.blackburn@loria.fr Course website: http://www.loria.fr/~blackbur/courses/math

p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

Geometric Transformations

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

MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

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,

In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

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

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

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

Equivalence relations

Equivalence relations A motivating example for equivalence relations is the problem of constructing the rational numbers. A rational number is the same thing as a fraction a/b, a, b Z and b 0, and hence

Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

CHAPTER 2. Set, Whole Numbers, and Numeration

CHAPTER 2 Set, Whole Numbers, and Numeration 2.1. Sets as a Basis for Whole Numbers A set is a collection of objects, called the elements or members of the set. Three common ways to define sets: (1) A

Basic Set Theory. Chapter Set Theory. can be written: A set is a Many that allows itself to be thought of as a One.

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

Introducing Functions

Functions 1 Introducing Functions A function f from a set A to a set B, written f : A B, is a relation f A B such that every element of A is related to one element of B; in logical notation 1. (a, b 1

Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

Discrete Mathematics

Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 16, 2009 2.1 Sets 2.1 Sets 2.1 Sets Basic Notations for Sets For sets, we ll use variables S, T, U,. We can

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,

Lecture 1 (Review of High School Math: Functions and Models) Introduction: Numbers and their properties

Lecture 1 (Review of High School Math: Functions and Models) Introduction: Numbers and their properties Addition: (1) (Associative law) If a, b, and c are any numbers, then ( ) ( ) (2) (Existence of an

A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

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

LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

You know from calculus that functions play a fundamental role in mathematics.

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 6: RATIONAL NUMBERS AND ORDERED FIELDS

CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we construct the set of rational numbers Q using equivalence

Math 117 Chapter 7 Sets and Probability

Math 117 Chapter 7 and Probability Flathead Valley Community College Page 1 of 15 1. A set is a well-defined collection of specific objects. Each item in the set is called an element or a member. Curly

13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

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

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

7 Relations and Functions

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,

Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi

Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the

Math E-301: Homework 4 Notes Due 10/5/09

Math E-301: Homework 4 Notes Due 10/5/09 The notes for homeworks will vary. For some problems, I may give one solution, but there may be other ways to approach the problem. I will try to mention these

The Mathematics Driving License for Computer Science- CS10410

The Mathematics Driving License for Computer Science- CS10410 Venn Diagram, Union, Intersection, Difference, Complement, Disjoint, Subset and Power Set Nitin Naik Department of Computer Science Venn-Euler

Domain Theory: An Introduction

Domain Theory: An Introduction Robert Cartwright Rebecca Parsons Rice University This monograph is an unauthorized revision of Lectures On A Mathematical Theory of Computation by Dana Scott [3]. Scott

Course 214 Section 1: Basic Theorems of Complex Analysis Second Semester 2008

Course 214 Section 1: Basic Theorems of Complex Analysis Second Semester 2008 David R. Wilkins Copyright c David R. Wilkins 1989 2008 Contents 1 Basic Theorems of Complex Analysis 1 1.1 The Complex Plane........................

Absolute Value Equations and Inequalities

Key Concepts: Compound Inequalities Absolute Value Equations and Inequalities Intersections and unions Suppose that A and B are two sets of numbers. The intersection of A and B is the set of all numbers

3. Prime and maximal ideals. 3.1. Definitions and Examples.

COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,

If f is a 1-1 correspondence between A and B then it has an inverse, and f 1 isa 1-1 correspondence between B and A.

Chapter 5 Cardinality of sets 51 1-1 Correspondences A 1-1 correspondence between sets A and B is another name for a function f : A B that is 1-1 and onto If f is a 1-1 correspondence between A and B,

Solutions A ring A is called a Boolean ring if x 2 = x for all x A.

1. A ring A is called a Boolean ring if x 2 = x for all x A. (a) Let E be a set and 2 E its power set. Show that a Boolean ring structure is defined on 2 E by setting AB = A B, and A + B = (A B c ) (B

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 20

CS 70 Discrete Mathematics and Probability Theory Fall 009 Satish Rao, David Tse Note 0 Infinity and Countability Consider a function (or mapping) f that maps elements of a set A (called the domain of

Definition 14 A set is an unordered collection of elements or objects.

Chapter 4 Set Theory Definition 14 A set is an unordered collection of elements or objects. Primitive Notation EXAMPLE {1, 2, 3} is a set containing 3 elements: 1, 2, and 3. EXAMPLE {1, 2, 3} = {3, 2,

NOTES ON MEASURE THEORY. M. Papadimitrakis Department of Mathematics University of Crete. Autumn of 2004

NOTES ON MEASURE THEORY M. Papadimitrakis Department of Mathematics University of Crete Autumn of 2004 2 Contents 1 σ-algebras 7 1.1 σ-algebras............................... 7 1.2 Generated σ-algebras.........................

Finite 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

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

Writing proofs. Tim Hsu, San José State University. Revised February Sets, elements, and the if-then method 11

Writing proofs Tim Hsu, San José State University Revised February 2016 Contents I Fundamentals 5 1 Definitions and theorems 5 2 What is a proof? 5 3 A word about definitions 6 II The structure of proofs

Problems for Advanced Linear Algebra Fall 2012

Problems for Advanced Linear Algebra Fall 2012 Class will be structured around students presenting complete solutions to the problems in this handout. Please only agree to come to the board when you are

Prime Factorization 0.1. Overcoming Math Anxiety

0.1 Prime Factorization 0.1 OBJECTIVES 1. Find the factors of a natural number 2. Determine whether a number is prime, composite, or neither 3. Find the prime factorization for a number 4. Find the GCF

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction.

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have

Discrete Mathematics. Hans Cuypers. October 11, 2007

Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................

POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

Basic Properties of Rings

Basic Properties of Rings A ring is an algebraic structure with an addition operation and a multiplication operation. These operations are required to satisfy many (but not all!) familiar properties. Some

1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

Foundations of Mathematics I Set Theory (only a draft)

Foundations of Mathematics I Set Theory (only a draft) Ali Nesin Mathematics Department Istanbul Bilgi University Kuştepe Şişli Istanbul Turkey anesin@bilgi.edu.tr February 12, 2004 2 Contents I Naive

Chapter 1. Informal introdution to the axioms of ZF.

Chapter 1. Informal introdution to the axioms of ZF. 1.1. Extension. Our conception of sets comes from set of objects that we know well such as N, Q and R, and subsets we can form from these determined

Review of Fundamental Mathematics

Review of Fundamental Mathematics As explained in the Preface and in Chapter 1 of your textbook, managerial economics applies microeconomic theory to business decision making. The decision-making tools

Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

Sets. A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object.

Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in

Math 223 Abstract Algebra Lecture Notes

Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course

Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

Mathematics Course 111: Algebra I Part IV: Vector Spaces

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

Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

Math 3000 Running Glossary

Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (

Week 5: Binary Relations

1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method

vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

CS 341 Homework 9 Languages That Are and Are Not Regular

CS 341 Homework 9 Languages That Are and Are Not Regular 1. Show that the following are not regular. (a) L = {ww R : w {a, b}*} (b) L = {ww : w {a, b}*} (c) L = {ww' : w {a, b}*}, where w' stands for w

Exercise implies that V(I) = V(F ) for any generating set F of the ideal I. In the opposite direction we have a map

44 4. ALGEBRA-GEOMETRY CORRESPONDENCE 4.1. Ideal-variety correspondence The correspondence between algebra and geometry about to be discussed is the core of the area called algebraic geometry, which uses

Multiplicity. Chapter 6

Chapter 6 Multiplicity The fundamental theorem of algebra says that any polynomial of degree n 0 has exactly n roots in the complex numbers if we count with multiplicity. The zeros of a polynomial are

7 - Linear Transformations

7 - Linear Transformations Mathematics has as its objects of study sets with various structures. These sets include sets of numbers (such as the integers, rationals, reals, and complexes) whose structure

Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers

Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers Amnon Yekutieli Department of Mathematics Ben Gurion University email: amyekut@math.bgu.ac.il Notes available at http://www.math.bgu.ac.il/~amyekut/lectures

(b) Prove that there is NO ordered basis γ of V s.t. Solution: (a) We have

Advanced Linear Algebra, Fall 2011. Solutions to midterm #1. 1. Let V = P 2 (R), the vector space of polynomials of degree 2 over R. Let T : V V be the differentiation map, that is, T (f(x)) = f (x). (a)