# SETS, RELATIONS, AND FUNCTIONS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 September 27, 2009

2 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 letters a, b, c, and d is a set, which we may name L: L = {a, b, c, d} objects comprising a set elements or members. b is an element of the set L; b is in L; L contains b: b L z is not an element of L: z / L

3 and notations Common Universal Subset and Power Set Cardinality Operations In a set we do NOT distinguish repetitions or orders of the elements. {red, blue, red} equals to {red, blue} {3, 1, 9}, {9, 3, 1}, and {1, 3, 9} are the same set Two sets are equal (that is, the same) if and only if (iff) they have the same elements. The elements of a set need not be related in any way. {3, red, {d, blue}} is a set with three elements A set may have only one element a singleton. {1} is a singleton. {1} and 1 are quite different.

4 Notations and notations Common Universal Subset and Power Set Cardinality Operations list all the elements, separated by commas and included in braces: S = {a, b, c, d} brace notation with ellipses: using the three dots and your intuition in place of an infinitely long list: N = {0, 1, 2, 3,...} the natural numbers. S = {..., 3, 2, 1} the negative integers. refer to other sets and to properties that elements may or may not have: if a set A has been defined, and P is a property that elements of A may or may not have, then we can define a new set: B = {x : x A and x has property P} O = {x : x N and x is not divisible by 2} the odd natural numbers.

5 Common Universal and notations Common Universal Subset and Power Set Cardinality Operations R = reals N = natural numbers = {0, 1, 2, 3,...}, the counting numbers Z = integers = {.., 3, 2, 1, 0, 1, 2, 3, 4,..} Q = rationals = m/n, where m, n Z, n 0 = empty set = void set =null set = a set with no element at all there can be only one such set. the assertion x is always false. Note already that some sets are infinite...

6 Subsets and notations Common Universal Subset and Power Set Cardinality Operations A set A is a subset of a set B, if each element of A is also an element of B. Definition: The set A is a subset of the set B, denoted A B, iff x : x A x B Note: is a subset of every set. A set is always a subset of itself. Definition: If A B but A B then we say A is a proper subset of B, denoted A B. Question: How to prove that two sets A and B are equal? A B and B A A = B

7 and notations Common Universal Subset and Power Set Cardinality Operations Power Definition: The set of all subsets of a set A, denoted (A), is called the power set of A. Example: If A = {a, b} then: including and A itself. (A) = {, {a}, {b}, {a, b}}

8 Cardinality and notations Common Universal Subset and Power Set Cardinality Operations Definition: The number of (distinct) elements in A, denoted A, is called the cardinality of A. Example: A = {a, b} {a, b} = 2 ({a, b}) = 4 Useful Fact: A = n implies (A) = 2 n If the cardinality is a natural number (in N), then the set is called finite, otherwise it is infinite. Note: A is finite and so is (A). N is infinite since N is not a natural number. It is called a transfinite cardinal number. denumerable (countably infinite) sets.

9 Operations on and notations Common Universal Subset and Power Set Cardinality Operations Union: A B = {x : x A x B} Example: A = {a, b, c}, B = {c, d, e}, A B = {a, b, c, d, e} Intersection: A B = {x : x A x B} Example: A = {a, b, c}, B = {c, d, e}, A B = {c} Difference: A B = {x : x A x / B} Example: A = {a, b, c}, B = {c, d, e}, A B = {a, b} Symmetric Difference: A B = (A B) (B A) Example: A = {a, b, c}, B = {c, d, e}, A B = {a, b, d, e} Note: are disjoint if A B =.

10 Pairs Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition How can we express relations between objects in the language of sets? {4, 7} is the same thing as {7, 4}, no order information. Ordered Pair: x, y is the ordered pair of x and y, denoted (x, y) in some texts. Note: x, y {x, y} as the latter is unordered. Example: 4, 7, 9, 9, m, n Definition: The Cartesian product of A with B, denoted A B, is the set of ordered pairs {<a, b > a A b B}. Example: A = {a, b}, B = {1, 2, 3} A B = {<a, 1>, <a, 2>, <a, 3>, <b, 1>, <b, 2>, <b, 3>} Question 1: What is B A? Question 2: If A = m and B = n, what is A B?

11 Binary relations Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition Any subset R of A B is a binary relation between A and B. Given a binary relation R, we can associate with it a predicate R(x, y) which is true iff x, y R. {< 1, 6 >, < 1, c >, < c, d >, < 9, d >} is a binary relation on {1, 3, 9} and {b, c, d}. {< i, j >: i, j N and i < j} (the less-than relation) is a subset of N N. Given a binary relation R A B, the inverse relation of R is defined as R 1 = { y, x : x, y R}. Obviously (R 1 ) 1 = R.

12 n-tuples and n-ary relations Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition Extending pairs to n-tuples is straightforward. x 1... x n is a sequence of ordered n-tuples. Ordered 2-tuples are the same as the ordered pairs. ordered 3-, 4-, 5-, and 6-tuples ordered triples, quadruples, quintuples, and sextuples. The Cartesian product of n sets A 1... A n is defined as A 1 A 2... A n = { a 1, a 2... a n : (a 1 A 1 ) (a 2 A 2 )... (a n A n ). Any subset R of A 1 A 2... A n is an n-ary relation between the n sets A 1... A n. Given an n-ary relation R, we can associate with it a predicate R(x 1... x n ) which is true iff x 1... x n R. 1-, 2-, and 3-ary relations unary, binary, and ternary relations.

13 Functions Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition A function is an association of each object of one kind with a unique object of another kind. A function (mapping, map) f from set A to set B is denoted by f : A B. f associates with each x in A one and only one y in B. (special type of binary relations) A is called the domain and B is called the codomain. The range of f, denoted by f (A), is the set of all images of points in A under f. If f : A 1 A 2... A n B, and f (a 1,..., a n ) = b, where a i A i for i = 1,..., n and b B: a1,..., a n are called arguments of f b is called the corresponding value of f

14 Injections, Surjections and Bijections Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition Let f be a function from A to B. Definition: f is one-to-one (denoted 1-1) or injective if a b implies f (a) f (b). Definition: f is onto or surjective if f (A) = B. Definition: f is bijective if it is surjective and injective (one-to-one and onto). Example: if S is the set of countries in the world, C is the set of cities in the world, C 0 is the set of capital cities in the world, and function g : S C x is specified by g(s) = the capital of country s g is one-to-one from S to C. g is bijective between S and C0.

15 Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition Inverse functions A binary relation R always admits a unique inverse relation R 1 while only the injective functions admit an inverse function. A function f : A B may fail to have an inverse if there is some element b B such that f (a) b for all a A. Definition: Let f be a bijection from A to B. Then the inverse of f, denoted f 1, is the function from B to A defined as f 1 (y) = x iff f (x) = y.

16 Composition Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition Definition: Let f : B C, g : A B. The composition of f with g, denoted f g, is the function from A to C defined by f g(x) = f (g(x)). Example: If f is the function that assigns to each dog its owner and g assigns to each person his or her age, then f g assigns to each dog the age of its owner.

17 Countable Countable Uncountable How to compare the size(cardinality) of sets that are infinitive? Two sets have the same cardinal number if and only if there is a bijection between them. If A = N, the set A is countably infinite or denumerable. The (transfinite) cardinal number of the set N is aleph null = ℵ 0. Definition: If a set has the same cardinality as a subset of the natural numbers N, then the set is called countable. A set is countable if it is finite or countably infinite. The union of any finite number of countably infinite sets is countably infinite. The union of a countably infinite collection of countably infinite sets is countably infinite.

18 Uncountable Countable Uncountable If a set is not countable we say it is uncountable. The following sets are uncountable (we show later): The real numbers in [0, 1] (N), the power set of N The set of functions from N to N Note: With infinite sets proper subsets can have the same cardinality. This cannot happen with finite sets. carries with it the implication that there is a listing or enumeration of the elements of the set.

19 Theorem: A B if there is an injection from A to B Example: if A is a subset of B then A B Proof: the function f (x) = x is an injection from A to B Theorem: A = B iff there is is a bijection from A to B Example: E = N, where E is the set of even integers (even though E is a proper subset of N ) Proof: Let f (x) = 2x. Then f is a bijection from N to E:

20 and notations Common Universal Subset and Power Set Cardinality Operations Pairs and Binary Relations n-tuples and n-ary relations Functions Injections, Surjections and Bijections Inverse functions and Composition Countable Uncountable

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

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

### 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

### 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

### 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,

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

### 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

### 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, 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

### 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

### 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

### 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.

### 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

### 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

### 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,

### 2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

### 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

### f(x) is a singleton set for all x A. If f is a function and f(x) = {y}, we normally write

Math 525 Chapter 1 Stuff If A and B are sets, then A B = {(x,y) x A, y B} denotes the product set. If S A B, then S is called a relation from A to B or a relation between A and B. If B = A, S A A is called

### 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

### 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,

### 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

### Sets and Subsets. Countable and Uncountable

Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788-792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There

### 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.

### Basic Concepts of Set Theory, Functions and Relations

March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2 1.3. Identity and cardinality...3

### 4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

### Notes. Sets. Notes. Introduction II. Notes. Definition. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.

Sets Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction

### 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

### 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»

### CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

### 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

### CHAPTER 1. Basic Ideas

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

### 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.

### 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

### 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

### Chapter 10. Abstract algebra

Chapter 10. Abstract algebra C.O.S. Sorzano Biomedical Engineering December 17, 2013 10. Abstract algebra December 17, 2013 1 / 62 Outline 10 Abstract algebra Sets Relations and functions Partitions and

### 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

### REAL ANALYSIS I HOMEWORK 2

REAL ANALYSIS I HOMEWORK 2 CİHAN BAHRAN The questions are from Stein and Shakarchi s text, Chapter 1. 1. Prove that the Cantor set C constructed in the text is totally disconnected and perfect. In other

### (Refer Slide Time: 1:41)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 10 Sets Today we shall learn about sets. You must

### 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

### 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,

### RELATIONS AND FUNCTIONS

Chapter 1 RELATIONS AND FUNCTIONS 1.1 Overview 1.1.1 Relation A relation R from a non-empty set A to a non empty set B is a subset of the Cartesian product A B. The set of all first elements of the ordered

### A set is an unordered collection of objects.

Section 2.1 Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the elements, or members of the set. A set is said to contain

### Discrete Mathematics Set Operations

Discrete Mathematics 1-3. Set Operations Introduction to Set Theory A setis a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects.

### 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

### This chapter is all about cardinality of sets. At first this looks like a

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 },

### 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

### Discrete Mathematics: Solutions to Homework (12%) For each of the following sets, determine whether {2} is an element of that set.

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

### 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

### Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

### 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

### What is a set? Sets. Specifying a Set. Notes. The Universal Set. Specifying a Set 10/29/13

What is a set? Sets CS 231 Dianna Xu set is a group of objects People: {lice, ob, Clara} Colors of a rainbow: {red, orange, yellow, green, blue, purple} States in the S: {labama, laska, Virginia, } ll

### 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

### RELATIONS AND FUNCTIONS

Chapter 1 RELATIONS AND FUNCTIONS There is no permanent place in the world for ugly mathematics.... It may be very hard to define mathematical beauty but that is just as true of beauty of any kind, we

### 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

### Structure of Measurable Sets

Structure of Measurable Sets In these notes we discuss the structure of Lebesgue measurable subsets of R from several different points of view. Along the way, we will see several alternative characterizations

### CHAPTER 3. Mapping Concepts and Mapping Problems for. Scalar Valued Functions of a Scalar Variable

A SERIES OF CLASS NOTES TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS REMEDIAL CLASS NOTES A COLLECTION OF HANDOUTS FOR REMEDIATION IN FUNDAMENTAL CONCEPTS

### Sequences and Summations. Niloufar Shafiei

Sequences and Summations Niloufar Shafiei Sequences A sequence is a discrete structure used to represent an ordered list. 1 Sequences A sequence is a function from a subset of the set integers (usually

### 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

### 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

### 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......................................

### 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

### Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

### 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

### Section 2.6 Cantor s Theorem and the ZFC Axioms

1 Section 2.6 and the ZFC Axioms Purpose of Section: To state and prove Cantor theorem, which guarantees the existence of infinities larger than the cardinality of the continuum. We also state and discuss

### Notes 2 for Honors Probability and Statistics

Notes 2 for Honors Probability and Statistics Ernie Croot August 24, 2010 1 Examples of σ-algebras and Probability Measures So far, the only examples of σ-algebras we have seen are ones where the sample

### 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 (

### Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets

CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap. 2.3-2.6 Homework 2 due Tuesday Recitation 3 on Friday

Set (mathematics) From Wikipedia, the free encyclopedia A set in mathematics is a collection of well defined and distinct objects, considered as an object in its own right. Sets are one of the most fundamental

### Florida State University Course Notes MAD 2104 Discrete Mathematics I

Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Tallahassee, Florida 32306-4510 Copyright c 2011 Florida State University Written by Dr. John Bryant and Dr.

### Chapter Prove or disprove: A (B C) = (A B) (A C). Ans: True, since

Chapter 2 1. Prove or disprove: A (B C) = (A B) (A C)., since A ( B C) = A B C = A ( B C) = ( A B) ( A C) = ( A B) ( A C). 2. Prove that A B= A B by giving a containment proof (that is, prove that the

### 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

### Set Theory. Pawel Garbacz

Set Theory Pawel Garbacz garbacz@kul.pl http://pracownik.kul.pl/garbacz/dydaktyka October 1, 2012 2 Contents 1 Baby set theory 5 1.1 Introduction.............................. 5 1.2 Further reading............................

### Theory of Computation

Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s

### THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER

THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.

### Polish spaces and standard Borel spaces

APPENDIX A Polish spaces and standard Borel spaces We present here the basic theory of Polish spaces and standard Borel spaces. Standard references for this material are the books [143, 231]. A.1. Polish

### Foundations of mathematics. 2. Set theory (continued)

2.1. Tuples, amilies Foundations o mathematics 2. Set theory (continued) Sylvain Poirier settheory.net A tuple (or n-tuple, or any integer n) is an interpretation o a list o n variables. It is thus a meta-unction

### 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

### Mathematics Review for MS Finance Students

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,

### Foundations of Logic and Mathematics

Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic

### CIS 771: Software Specifications. Lecture 2: Sets and Relations

CIS 771: Software Specifications Lecture 2: Sets and Relations Copyright 2001, Matt Dwyer, John Hatcliff, and Rod Howell. The syllabus and all lectures for this course are copyrighted materials and may

### 2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

### 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.

### 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.

### MATHEMATICS 117/E-217, SPRING 2012 PROBABILITY AND RANDOM PROCESSES WITH ECONOMIC APPLICATIONS Module #5 (Borel Field and Measurable Functions )

MATHEMATICS 117/E-217, SPRING 2012 PROBABILITY AND RANDOM PROCESSES WITH ECONOMIC APPLICATIONS Module #5 (Borel Field and Measurable Functions ) Last modified: May 1, 2012 Reading Dineen, pages 57-67 Proof

### Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

### 1 / Basic Structures: Sets, Functions, Sequences, and Sums - definition of a set, and the use of the intuitive notion that any property whatever there

C H A P T E R Basic Structures: Sets, Functions, Sequences, and Sums.1 Sets. Set Operations.3 Functions.4 Sequences and Summations Much of discrete mathematics is devoted to the study of discrete structures,

### CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

### LECTURE NOTES ON RELATIONS AND FUNCTIONS

LECTURE NOTES ON RELATIONS AND FUNCTIONS PETE L. CLARK Contents 1. Relations 1 1.1. The idea of a relation 1 1.2. The formal definition of a relation 2 1.3. Basic terminology and further examples 2 1.4.

### 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

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS 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 the identity, such that (i) the

### 2.3. Relations. Arrow diagrams. Venn diagrams and arrows can be used for representing

2.3. RELATIONS 32 2.3. Relations 2.3.1. Relations. Assume that we have a set of men M and a set of women W, some of whom are married. We want to express which men in M are married to which women in W.

### Math 563 Measure Theory Project 1 (Funky Functions Group) Luis Zerón, Sergey Dyachenko

Math 563 Measure Theory Project (Funky Functions Group) Luis Zerón, Sergey Dyachenko 34 Let C and C be any two Cantor sets (constructed in Exercise 3) Show that there exists a function F: [,] [,] with

### Introduction to Relations

CHAPTER 7 Introduction to Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition: A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is related

### CS 580: Software Specifications

CS 580: Software Specifications Lecture 2: Sets and Relations Slides originally Copyright 2001, Matt Dwyer, John Hatcliff, and Rod Howell. The syllabus and all lectures for this course are copyrighted

### 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.........................

### Georg Cantor and Set Theory

Georg Cantor and Set Theory. Life Father, Georg Waldemar Cantor, born in Denmark, successful merchant, and stock broker in St Petersburg. Mother, Maria Anna Böhm, was Russian. In 856, because of father

### MEASURE ZERO SETS WITH NON-MEASURABLE SUM

INROADS Real Analysis Exchange Vol. 7(), 001/00, pp. 78 794 Krzysztof Ciesielski, Department of Mathematics, West Virginia University, Morgantown, WV 6506-610, USA. e-mail: K Cies@math.wvu.edu web page:

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

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