Copyright © 2014 Curt Hill Cardinality of Infinite Sets There be monsters here! At least serious weirdness!

Slides:



Advertisements
Similar presentations
Lecture ,3.3 Sequences & Summations Proof by Induction.
Advertisements

2.1 Sets ‒Sets ‒Common Universal Sets ‒Subsets 2.2 Set Operations 2.3 Functions 2.4 Sequences and Summations 1.
1 Diagonalization Fact: Many books exist. Fact: Some books contain the titles of other books within them. Fact: Some books contain their own titles within.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 10 Cardinality Uncountability of the real numbers.
Introduction to Computability Theory
Courtesy Costas Busch - RPI1 A Universal Turing Machine.
Great Theoretical Ideas in Computer Science.
2, , and Beyond Debra S. Carney Mathematics Department University of Denver April 11, 2008 Sonya Kovalevsky Day - CCA.
Pigeonhole.
Sequence A list of objects arranged in a particular order.
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
Lecture ,3.3 Sequences & Summations Proof by Induction.
A Very Practical Series 1 What if we also save a fixed amount (d) every year?
1 Introduction to Computability Theory Lecture11: The Halting Problem Prof. Amos Israeli.
1 Lecture 6 Topics –Proof of the existence of unsolvable problems Problems/languages not in REC Proof Technique –There are more problems/languages than.
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
Great Theoretical Ideas in Computer Science.
Cantor’s Legacy: Infinity And Diagonalization Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 25Apr 13, 2004Carnegie.
Cardinality of Sets Section 2.5.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
1 How Big Is Infinity? Some Mathematical Surprises Roger House Scientific Buzz Café French Garden Restaurant & Bistro Sebastopol, CA 2013 July 25 Copyright.
2.4 Sequences and Summations
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Cantor and Countability: A look at measuring infinities How BIG is big? = a Googol 10 googol = a Googolplex = one Tremilliomilliotrecentrecentre.
Ch. 11: Cantor’s Infinity!. N = {1, 2, 3, 4, 5, 6, …} “the natural numbers” Z = {…, –3, –2, –1, 0, 1, 2, 3, …} “the integers” Q = {all quotients “a/b”
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.1 and 7.2.
Mathematical Induction
Copyright © 2014 Curt Hill Sets Introduction to Set Theory.
Discrete Structure Sets. 2 Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element.
A Universal Turing Machine
Relations, Functions, and Countability
CS201: Data Structures and Discrete Mathematics I
COMPSCI 102 Introduction to Discrete Mathematics.
Aim: How can the word ‘infinite’ define a collection of elements?
INFIINITE SETS CSC 172 SPRING 2002 LECTURE 23. Cardinality and Counting The cardinality of a set is the number of elements in the set Two sets are equipotent.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.
Cardinality with Applications to Computability Lecture 33 Section 7.5 Wed, Apr 12, 2006.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
I dare you not to get excited when you read Cantor’s Diagonal Proof: Georg Cantor was the most important mathematician no one has ever heard of. He did.
Great Theoretical Ideas in Computer Science.
CompSci 102 Discrete Math for Computer Science February 7, 2012 Prof. Rodger Slides modified from Rosen.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
Section 3.2: Sequences and Summations. Def: A sequence is a function from a subset of the set of integers (usually the set of natural numbers) to a set.
CS 285- Discrete Mathematics
CSE 311: Foundations of Computing Fall 2014 Lecture 27: Cardinality.
Great Theoretical Ideas in Computer Science about AWESOME Some Generating Functions Probability.
To Infinity And Beyond! CS Lecture 11 The Ideal Computer: no bound on amount of memory Whenever you run out of memory, the computer contacts the.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
1 A Universal Turing Machine. 2 Turing Machines are “hardwired” they execute only one program A limitation of Turing Machines: Real Computers are re-programmable.
Sequences Lecture 11. L62 Sequences Sequences are a way of ordering lists of objects. Java arrays are a type of sequence of finite size. Usually, mathematical.
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Making Sense of Rational and Irrational Numbers
Great Theoretical Ideas In Computer Science
Discrete Mathematics CS 2610
CS 2210:0001 Discrete Structures Sets and Functions
Counting Sets.
Cardinality of Sets Section 2.5.
Diagonalization Fact: Many books exist.
Discrete Structures for Computer Science
Formal Languages, Automata and Models of Computation
Cardinality 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 one-to-one correspondence.
Everything is an Integer Countable and Uncountable Sets
Presentation transcript:

Copyright © 2014 Curt Hill Cardinality of Infinite Sets There be monsters here! At least serious weirdness!

Cardinality Recall that the cardinality of a set is merely the number of members in a set This makes perfect sense for finite sets, but what about infinite sets? We may compare the sizes of such infinite sets by attempting a one to one correspondence between the two It gets a little weird here and our intuition does not always help Copyright © 2014 Curt Hill

Some Definitions Sets A and B have the same cardinality iff there is a one to one correspondence between their members Finite sets are obviously countable The notation for cardinality is the same as absolute value If A = {1, 3, 4, 5, 9} then |A|=5 Copyright © 2014 Curt Hill

Infinite Countable Sets Copyright © 2014 Curt Hill

Counter Intuitive We would normally think that: –If A  B then |A|< |B| This is true for finite sets but not necessarily for infinite sets Consider the positive even integers It is a subset of the positive integers Yet it is one to one with the positive integers –Thus is a countably infinite set and has the similar cardinality Copyright © 2014 Curt Hill

Countable Copyright © 2014 Curt Hill

Hilbert’s Grand Hotel This paradox is attributed to David Hilbert There is a hotel with infinite rooms Even when the hotel is “full” we can always add one more guest –They take room 1 and everyone else moves down one room This boils down to the notion that adding one to infinity does not change infinity:  +1 =  –Recall that infinity is not a real number Copyright © 2014 Curt Hill

Another Countable The rationals are countable as well Use a matrix of integers –One axis is the numerator –The other the denominator –Duplicate values ignored In a diagonal way enumerate each rational –That is set them in one to one with positive integers Copyright © 2014 Curt Hill

Count ‘em Copyright © 2014 Curt Hill /1 2/1 3/1 4/1 5/1 2 1/2 2/2 3/2 4/2 5/2 3 1/3 2/3 3/3 4/3 5/3 4 1/4 2/4 3/4 4/4 5/4 5 1/5 2/5 3/5 4/5 5/5 Start at 1/1 and diagonally count each non-duplicate. 1/1 is 1, 2/1 is 2, 1/2 is 3, 1/3 is 4, 3/1 is 5 …

Very Interesting! Copyright © 2014 Curt Hill

Uncountable Sets Copyright © 2014 Curt Hill

Reals Uncountable 0 There exists a theorem that states … is the same as 1.0 –The idea of the proof is that as the 9s go to infinity the limit of the difference is zero –In other words however small you want the difference between two distinct reals to be we can make the difference between these two less An uncountable set cannot be a subset of a countable set Copyright © 2014 Curt Hill

Reals Uncountable 1 Assume that the reals between 0 and 1 are countable Then there is a sequence r 1, r 2, r 3, … This sequence must have the property that r i < r i+1 Each r n has a decimal expansion that looks like this: 0.d 1 d 2 d 3 d 4 d 5 … where each d is a digit Copyright © 2014 Curt Hill

Reals Uncountable 2 Next look at any adjacent pair of reals, r n and r n+1 These two must be different at some d i –If they are not we have numbered identicals –We also disallow that the lower one is followed by infinite 9s and the higher one by infinite zeros which would be two representions of the same number Copyright © 2014 Curt Hill

Reals Uncountable 3 Now r n must have a non-nine following d i call it d j –Otherwise we violated the no identicals rule Create a new real r k that is r n with d j incremented by 1 We now have r n < r k < r n+1 which contradicts our original assertion In fact we can insert an infinity of such numbers by incrementing the digits after d j Copyright © 2014 Curt Hill

Reals Uncountable Addendum In the last screen there was the argument that there must be a non- nine in the sequence The symmetrical argument is that there must be a non zero following the r n+1 Since we disallowed a …9999… followed by …0000… we can shift the argument to the second rather than first Copyright © 2014 Curt Hill

Results Copyright © 2014 Curt Hill

Exercises 2.5 –1, 3, 5, 17, 23 Copyright © 2014 Curt Hill