Donald Byrd rev. 28 November 2012

Slides:



Advertisements
Similar presentations
Georg Cantor
Advertisements

Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
Cantor’s Infinities Raymond Flood Gresham Professor of Geometry.
Beyond Counting Infinity and the Theory of Sets Nate Jones & Chelsea Landis.
Theory of Computation 1 Theory of Computation Peer Instruction Lecture Slides by Dr. Cynthia Lee, UCSD are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike.
04/23/13 Countability Discrete Structures (CS 173) Derek Hoiem, University of Illinois 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.
Infinity and the Limits of Mathematics Manchester High School for Girls Friday 30 th September 2011 Dr Richard Elwes, University of Leeds.
EE1J2 – Discrete Maths Lecture 9
Introduction to Computability Theory
The Halting Problem Sipser 4.2 (pages ). CS 311 Mount Holyoke College 2 Taking stock All languages Turing-recognizable Turing-decidable Context-free.
The Halting Problem Sipser 4.2 (pages ).
Courtesy Costas Busch - RPI1 A Universal Turing Machine.
Great Theoretical Ideas in Computer Science.
∞Exploring Infinity ∞ By Christopher Imm Johnson County Community College.
2, , and Beyond Debra S. Carney Mathematics Department University of Denver April 11, 2008 Sonya Kovalevsky Day - CCA.
CHAPTER 4 Decidability Contents Decidable Languages
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
CS 310 – Fall 2006 Pacific University CS310 The Halting Problem Section 4.2 November 15, 2006.
Lecture ,3.3 Sequences & Summations Proof by Induction.
A Very Practical Series 1 What if we also save a fixed amount (d) every year?
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.
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.
Implications of Cantorian Transfinite Set Theory on Creation.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Problem: Can 5 test tubes be spun simultaneously in a 12-hole centrifuge? What does “balanced” mean? Why are 3 test tubes balanced? Symmetry! Can you merge.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Paradoxes of the Infinite Kline XXV Pre-May Seminar March 14, 2011.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
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”
Copyright © 2014 Curt Hill Cardinality of Infinite Sets There be monsters here! At least serious weirdness!
Relations, Functions, and Countability
Section 3.1 Beyond Numbers What Does Infinity Mean?
COMPSCI 102 Introduction to Discrete Mathematics.
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module.
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.
CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.
Great Theoretical Ideas in Computer Science.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
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.
CS 285- Discrete Mathematics
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.
22C:19 Discrete Structures Sequence and Sums Fall 2014 Sukumar Ghosh.
Infinity and Beyond! A prelude to Infinite Sequences and Series (Chp 10)
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Great Theoretical Ideas In Computer Science
Raymond Flood Gresham Professor of Geometry
Discrete Mathematics CS 2610
CS 461 – Nov. 2 Sets Prepare for ATM finite vs. infinite Infinite sets
What is Mathematics? The science (or art?) that deals with numbers, quantities, shapes, patterns and measurement An abstract symbolic communication system.
CS 2210:0001 Discrete Structures Sets and Functions
2.6 Infinite Sets By the end of the class you will be able calculate the cardinality of infinite sets.
Cardinality of Sets Section 2.5.
Discrete Structures for Computer Science
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Discrete Mathematics and its Applications
Discrete Math for CS CMPSC 360 LECTURE 43 Last time: Variance
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Chapter 2 The Basic Concepts of Set Theory
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.
Presentation transcript:

Donald Byrd rev. 28 November 2012 Cantor’s Diagonal Proof and Uncountable Numbers: To Infinity and Beyond! Donald Byrd rev. 28 November 2012

Hilbert’s Hotel and Infinite Sets Explanation of infinite sets by David Hilbert Hotel with finite rooms, all occupied Can’t accommodate a new guest Hotel with infinite rooms, all occupied Can accommodate a new guest Move each guest from room n to n+1 Can accommodate infinite no. of new guests! How? 28 Nov. 2012

One-to-One Correspondence How can you compare size of collections of things if there are too many to count? …for example, infinite collections Georg Cantor (1891): Put items in each set (collection) in a list Try one-to-one correspondence There are infinitely many integers, but… Cantor proved there are more real nos.! 28 Nov. 2012

One-to-One Correspondence between Infinite Sets (1) Even N Numbers Integers --- ------------ ----------- 0 0 0 1 2 -1 2 4 1 3 6 -2 4 8 2 5 10 -3 6 12 3 8 14 -4 9 16 4 etc. etc. etc. 28 Nov. 2012

One-to-One Correspondence between Infinite Sets (2) Even Positive N Numbers Integers Squares Rationals --- ------------ ----------- ---------- ------------ 0 0 0 0 1 1 2 -1 1 1/2 2 4 1 4 2/1 3 6 -2 9 1/3 4 8 2 16 3/1 5 10 -3 25 1/4 6 12 3 36 2/3 8 14 -4 49 3/2 9 16 4 64 4/1 etc. etc. etc. etc. etc. 28 Nov. 2012

“Complete List of Real Numbers”? 1. .14159265358979323846264338327950288419716939937510... 2. .58209749445923078164062862089986280348253421170679... 3. .33333333333333333333333333333333333333333333333333... 4. .71828182845904523536028747135266249775724709369995... 5. .41421356237309504880168872420969807856967187537694... 6. .50000000000000000000000000000000000000000000000000... 7. .82148086513282306647093844609550582231725359408128... 8. .48111745028410270193852110555964462294895493038196... 9. .44288109756659334461284756482337867831652712019091... 10. .45648566923460348610454326648213393607260249141273... 11. .72458700660631558817488152092096282925409171536436... .78925903600113305305488204665213841469519415116094... etc., etc. 28 Nov. 2012

“Complete List of Real Numbers”? Just real numbers between 0 and 1 is enough. List might start like this: 1. .1415926535... 2. .5820974944... 3. .3333333333... 4. .7182818284... 5. .4142135623... 6. .5000000000... 7. .8214808651... 28 Nov. 2012

No “Complete List of Real Numbers”! 1. .1415926535... 2. .5820974944... 3. .3333333333... 4. .7182818284... 5. .4142135623... 6. .5000000000... .8214808651... etc. Make a new number: 1. .0415926535... 2. .5720974944... 3. .3323333333... 4. .7181818284... 5. .4142035623... 6. .5000090000... .8214807651... etc. • New Number = 0.0721097… isn’t in the list! • How do we know? 28 Nov. 2012

Different Sizes of Infinity Proof by contradiction Cantor’s conclusion: there are more reals between 0 and 1 than there are integers! Integers are countable …also even nos., rational nos., etc. Reals (and larger infinities) are uncountable No. of integers = aleph-0; of reals, aleph-1 Amazed mathematicians Led to set theory, new branch of math 28 Nov. 2012

Conclusion: Let’s Sing! (1) Some versions of A Hundred Bottles of Beer for really long car trips  Cf. http://www.informatics.indiana.edu/donbyrd/Teach/Math/InfiniteBottlesOfBeer_FullVer.pdf Basic transfinite version 1   Infinite bottles of beer on the wall, infinite bottles of beer; If one of those bottles should happen to fall, infinite bottles of beer on the wall.   (etc.) 28 Nov. 2012

Conclusion: Let’s Sing! (2) Basic transfinite version 2 (generalization of ver. 1)   Infinite bottles of beer on the wall, infinite bottles of beer; If finite bottles should happen to fall, infinite bottles of beer on the wall.   (etc.) 28 Nov. 2012

Conclusion: Let’s Sing! (3) Larger-infinity version   Uncountable bottles of beer on the wall, uncountable bottles of beer; If countable bottles should happen to fall, uncountable bottles of beer on the wall. (etc.) 28 Nov. 2012

Conclusion: Let’s Sing! (4) General transfinite version   Aleph-n bottles of beer on the wall, aleph-n bottles of beer; If, where m < n, aleph-m bottles should happen to fall, aleph-n bottles of beer on the wall. (etc.) Transfinite and indeterminate version (by Richard Byrd) Infinite bottles of beer on the wall, infinite bottles of beer; If infinite bottles should happen to fall, indeterminate bottles of beer on the wall. (The End) 28 Nov. 2012