Finite and Infinite Sets

Similar documents
CSE 20 DISCRETE MATH. Fall

Cardinality revisited

Cardinality and Bijections

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12

Cardinality. Hebrew alphabet). We write S = ℵ 0 and say that S has cardinality aleph null.

DVA325 Formal Languages, Automata and Models of Computation (FABER)

1. Functions and set sizes 2. Infinite set sizes. ! Let X,Y be finite sets, f:x!y a function. ! Theorem: If f is injective then X Y.

Class 8 - Sets (Lecture Notes)

1. The empty set is a proper subset of every set. Not true because the empty set is not a proper subset of itself! is the power set of A.

Final exam. Question Points Score. Total: 150

The Cauchy Criterion

Cardinality of Accumulation Points of Infinite Sets

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)

29. Army Housing (a) (b) (c) (d) (e) (f ) Totals Totals (a) (b) (c) (d) (e) (f) Basketball Positions 32. Guard Forward Center

Independence of Path and Conservative Vector Fields

Introduction to Computational Manifolds and Applications

Outline. Sets of Gluing Data. Constructing Manifolds. Lecture 3 - February 3, PM

Grade 7/8 Math Circles February 21 st /22 nd, Sets

SETS OBJECTIVES EXPECTED BACKGROUND KNOWLEDGE 1.1 SOME STANDARD NOTATIONS. Sets. MODULE - I Sets, Relations and Functions

1) 1) 2) 2) 3) 3) 4) 4) 5) 5) 6) 6) 7) 7) 8) 8) 9) 9) 10) 10) 11) 11) 12) 12)

Göttlers Proof of the Collatz Conjecture

Sets. Definition A set is an unordered collection of objects called elements or members of the set.

Counting integral solutions

Chapter 1 Math Set: a collection of objects. For example, the set of whole numbers is W = {0, 1, 2, 3, }

Chapter 1. Set Theory

Classes of permutations avoiding 231 or 321

On first and second countable spaces and the axiom of choice

Beyond Infinity? Joel Feinstein. School of Mathematical Sciences University of Nottingham

Reading 14 : Counting

Math 127: Equivalence Relations

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

Hausdorff dimension in groups acting on trees

Sets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set

Algebra. Recap: Elements of Set Theory.

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

It is important that you show your work. The total value of this test is 220 points.

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:

Goldbach Conjecture (7 th june 1742)

ACHS Math Team Lecture: Introduction to Set Theory Peter S. Simon

Pattern Avoidance in Unimodal and V-unimodal Permutations

ON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)

Sample Spaces, Events, Probability

Restricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers

Introductory Probability

CITS2211 Discrete Structures Turing Machines

Counting and Probability Math 2320

Slide 1 Math 1520, Lecture 13

Name Date. Goal: Understand sets and set notation.

Introductory Probability

INDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2

Chapter 1 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.

The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following:

An elementary study of Goldbach Conjecture

Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions

Examples of highly transitive permutation groups

8.2 Union, Intersection, and Complement of Events; Odds

Introduction to Fractions

Primitive permutation groups with finite stabilizers

Rosa Parks Middle School. Summer Math Packet C2.0 Algebra Student Name: Teacher Name: Date:

QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES

On uniquely k-determined permutations

The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes

The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability

CSE 355: Human-aware Robo.cs Introduction to Theoretical Computer Science

Axiomatic Probability

Strings. A string is a list of symbols in a particular order.

ESE 372 / Spring 2011 / Lecture 19 Common Base Biased by current source

Grade 7/8 Math Circles February 25/26, Probability

Solution: This is sampling without repetition and order matters. Therefore

3 The Mathematics of Sharing

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1

4. Let U = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, X = {2, 3, 4}, Y = {1, 4, 5}, Z = {2, 5, 7}. Find a) (X Y) b) X Y c) X (Y Z) d) (X Y) Z

Finite homomorphism-homogeneous permutations via edge colourings of chains

Solitaire Games. MATH 171 Freshman Seminar for Mathematics Majors. J. Robert Buchanan. Department of Mathematics. Fall 2010

Math 1330 Precalculus Electronic Homework (EHW 6) Sections 5.1 and 5.2.

and problem sheet 7

MATH 225: Foundations of Higher Matheamatics. Dr. Morton. Chapter 2: Logic (This is where we begin setting the stage for proofs!)

Review. Natural Numbers: Whole Numbers: Integers: Rational Numbers: Outline Sec Comparing Rational Numbers

Discrete mathematics

CSE21 - Math for Algorithm and Systems Analysis

Applied Statistics I

POLYA'S FOUR STEP PROBLEM SOLVING PROCESS Understand. Devise a Plan. Carry out Plan. Look Back. PROBLEM SOLVING STRATEGIES (exmples) Making a Drawlnq

CS103 Handout 25 Spring 2017 May 5, 2017 Problem Set 5

Discrete Math Class 4 ( )

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

Section Introduction to Sets

4.3 Finding Probability Using Sets

Discrete Structures for Computer Science

Math 3012 Applied Combinatorics Lecture 2

The Art of Counting. Bijections, Double Counting. Peng Shi. September 16, Department of Mathematics Duke University

MATHEMATICS E-102, FALL 2005 SETS, COUNTING, AND PROBABILITY Outline #1 (Probability, Intuition, and Axioms)

Lesson Plans for Christy Dempsey, Tippit Middle School Week of Monday, November 07, 2016 Monday, November 07, 2016 Day 52

SET THEORY AND VENN DIAGRAMS

Two Great Escapes. Jerry Lo, Grade 8 student, Affiliated High School of the Taiwan National Normal University. The Great Amoeba Escape

POKER (AN INTRODUCTION TO COUNTING)

Theory of Probability - Brett Bernstein

A Course in Model Theory I:

Math 152: Applicable Mathematics and Computing

November 6, Chapter 8: Probability: The Mathematics of Chance

Finite Math - Fall 2016

Transcription:

Finite and Infinite Sets MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007

Basic Definitions Definition The empty set has 0 elements. If n N, a set S is said to have n elements if there exists a bijection from the set to N n = {1, 2,..., n} onto S. A set S is said to be finite if it is either empty or it has n elements for some n N. A set S is said to be infinite if it is not finite.

Basic Questions Can a finite set have n elements for more than one value of n? If S is a finite set, then the number of elements in S is a unique number in N. Is the set of natural numbers finite? The set N of natural numbers is an infinite set.

Basic Questions Can a finite set have n elements for more than one value of n? If S is a finite set, then the number of elements in S is a unique number in N. Is the set of natural numbers finite? The set N of natural numbers is an infinite set.

Basic Questions Can a finite set have n elements for more than one value of n? If S is a finite set, then the number of elements in S is a unique number in N. Is the set of natural numbers finite? The set N of natural numbers is an infinite set.

Basic Questions Can a finite set have n elements for more than one value of n? If S is a finite set, then the number of elements in S is a unique number in N. Is the set of natural numbers finite? The set N of natural numbers is an infinite set.

Properties of Sets If A is a set with m elements and B is a set with n elements and if A B =, then A B has m + n elements. If A is a set with m N elements and C A is a set with 1 element, then A\C is a set with m 1 elements. If C is an infinite set and B is a finite set, then C\B is an infinite set.

Properties of Sets If A is a set with m elements and B is a set with n elements and if A B =, then A B has m + n elements. If A is a set with m N elements and C A is a set with 1 element, then A\C is a set with m 1 elements. If C is an infinite set and B is a finite set, then C\B is an infinite set. Suppose S and T are sets and that T S. If S is a finite set, then T is a finite set. If T is an infinite set, then S is an infinite set.

Countable Sets Definition A set S is said to be denumerable (or countably infinite) if there exists a bijection of N onto S. A set S is said to be countable if it is either finite or denumerable. A set S is said to be uncountable if it is not countable.

Countable Sets Definition A set S is said to be denumerable (or countably infinite) if there exists a bijection of N onto S. A set S is said to be countable if it is either finite or denumerable. A set S is said to be uncountable if it is not countable. Examples

Properties of Countable and Uncountable Sets The set N N is denumerable.

Properties of Countable and Uncountable Sets The set N N is denumerable. Suppose S and T are sets and that T S. If S is a countable set, then T is a countable set. If T is an uncountable set, then S is an uncountable set.

Properties of Countable and Uncountable Sets The set N N is denumerable. Suppose S and T are sets and that T S. If S is a countable set, then T is a countable set. If T is an uncountable set, then S is an uncountable set. The following statements are equivalent: 1 S is a countable set. 2 There exists a surjection of N onto S. 3 There exists an injection of S into N.

Rational Numbers The set Q of all rational numbers is denumerable.

Union of Countable Sets If A m is a countable set for each m N, then the union is countable. A = m=1 A m

Cantor s If A is any set, then there is no surjection of A onto the set P(A) of all subsets of A.

Cantor s If A is any set, then there is no surjection of A onto the set P(A) of all subsets of A. Remarks: There is an unending progression of larger and larger sets. P(N) is uncountable.

Homework Read Sec. 1.3. Page 21: 2, 4, 6, 8, 11 Boxed problems should be written up separately and handed in for grading at class time on Friday.