1 How Big Is Infinity? Some Mathematical Surprises Roger House Scientific Buzz Café French Garden Restaurant & Bistro Sebastopol, CA 2013 July 25 Copyright.

Slides:



Advertisements
Similar presentations
Georg Cantor
Advertisements

Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
Copyright © Cengage Learning. All rights reserved.
Cantor’s Infinities Raymond Flood Gresham Professor of Geometry.
Ch. 10: What is a number?. MAIN DEFINITION OF THE COURSE: A symmetry of an object (in the plane or space) means a rigid motion (of the plane or space)
Beyond Counting Infinity and the Theory of Sets Nate Jones & Chelsea Landis.
1 COMP 382: Reasoning about algorithms Unit 9: Undecidability [Slides adapted from Amos Israeli’s]
Week 7 - Wednesday.  What did we talk about last time?  Set proofs and disproofs  Russell’s paradox.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Section 1.6: Sets Sets are the most basic of discrete structures and also the most general. Several of the discrete structures we will study are built.
Induction and recursion
EE1J2 – Discrete Maths Lecture 9
Introduction to Computability Theory
Great Theoretical Ideas in Computer Science.
∞Exploring Infinity ∞ By Christopher Imm Johnson County Community College.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
2, , and Beyond Debra S. Carney Mathematics Department University of Denver April 11, 2008 Sonya Kovalevsky Day - CCA.
CHAPTER 4 Decidability Contents Decidable Languages
Lecture ,3.3 Sequences & Summations Proof by Induction.
1 Introduction to Computability Theory Lecture11: The Halting Problem Prof. Amos Israeli.
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.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
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.
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
Implications of Cantorian Transfinite Set Theory on Creation.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
MATH 224 – Discrete Mathematics
“TO INFINITY AND BEYOND” A DEEPER LOOK AND UNDERSTANDING.
2.4 Sequences and Summations
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFunctions.
Cantor and Countability: A look at measuring infinities How BIG is big? = a Googol 10 googol = a Googolplex = one Tremilliomilliotrecentrecentre.
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!
Proofs, Induction and Recursion Basic Proof Techniques Mathematical Induction Recursive Functions and Recurrence Relations.
Section 3.1 Beyond Numbers What Does Infinity Mean?
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.
{ What is a Number? Philosophy of Mathematics.  In philosophy and maths we like our definitions to give necessary and sufficient conditions.  This means.
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.
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.
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
Mathematical Induction
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
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.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
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.
22C:19 Discrete Structures Sequence and Sums Fall 2014 Sukumar Ghosh.
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
Discrete Mathematics CS 2610
Cardinality of Sets Section 2.5.
Lecture 7 Functions.
Discrete Structures for Computer Science
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:

1 How Big Is Infinity? Some Mathematical Surprises Roger House Scientific Buzz Café French Garden Restaurant & Bistro Sebastopol, CA 2013 July 25 Copyright © 2010 Roger House

2 What we're going to talk about Some infinities are bigger than others. Sounds weird, but soon it will make sense. It goes on forever. There is no “biggest” infinity.

3 Georg Cantor ( ) Born in St. Petersburg, Russia. His background: Danish, Catholic, Jewish, Lutheran. At the age of 11 Cantor and his family moved to Germany where he stayed for the rest of his life. His entire career was at the Univ. of Halle. He invented set theory, the basis of math. All the ideas we discuss tonight are his.

4 Finite Sets Infinite sets are too hard to think about, so let's start with finite sets. But, to make it interesting, imagine we don't know how to count. This is not as artificial as it might seem. Charles Seife says this in Zero: The Biography of a Dangerous Idea: “The Siriona Indians of Bolivia and the Brazilian Yanoama people don't have words for anything larger than three; instead, these two tribes use the words for 'many' or 'much.'”

5 Counting Sheep Joe has a herd of sheep which he lets out of a pen each morning into a pasture. Each evening the sheep are returned to the pen. Joe wants to know if all the sheep which left in the morning return in the evening. How can he tell? Count them. But what if Joe is a Siriona and cannot count higher than three?

6 Joe's Solution As each sheep leaves the pen, Joe puts a pebble in a bag. As each sheep returns, Joe removes a pebble from the bag. What are the possible outcomes? – The bag is empty. – There are one or more pebbles in the bag. – Any other possibilities? The bag becomes empty before all the sheep have entered the pen! Joe quickly adds pebbles to the bag.

7 We Can Use Joe's Solution Joe has discovered something very important. He can keep track of the size of his herd without knowing how to count. This is rather astounding; not at all trivial. We may be able to count sheep, but we don't know how to count infinite sets. We're in the same situation as Joe when it comes to infinite sets. So, let's use Joe's idea and apply it to infinite sets to see “how big” they are.

8 One-to-One Correspondence What Joe invented is called a one-to- one correspondence (or a bijection): Given two sets S and T, and a mapping of elements of S to elements of T, we call the mapping a one-to-one correspondence if these conditions hold: – Every element of S is mapped to some element of T. – Distinct elements of S are mapped to distinct elements of T. – Every element of T has some element of S mapped to it.

9 Example of a One-to-One Correspondence S T ABCDABCD

10 The Mapping Is In Both Directions S T ABCDABCD

11 Another Correspondence S: T:

12 Yet Another One S: … T:

13 Perhaps More Interesting S: T:

14 What's This One? S: T:

15 What About This One? S: T:

16 Cardinality Did you notice that we've been looking at correspondences between infinite sets? We're going to use the idea of a one-to- one correspondence to compare the sizes of sets, infinite as well as finite. If a one-to-one correspondence exists between two sets S and T then we say that S and T have the same cardinality, denoted S ~ T. Informally, the cardinality of a set is the size of the set.

17 Cardinality of Finite Sets Do {1, 2, 3, 4} and {A, B, C, D, E} have the same cardinality? What about {1, 2, 3, 4} and {A, B, C}? {1, 2, 3, 4} and {A, B, C, D}? For any finite set, just count the elements to determine the cardinality. If there are 7 elements, then, when you finish counting, you have a one-to-one correspondence between the elements of the set and the elements of {1, 2, 3, 4, 5, 6, 7}.

18 The Natural Numbers Our favorite infinite set is  = {1, 2, 3,...}, the set of natural numbers, also called: — counting numbers — positive whole numbers — positive integers We use the natural numbers to investigate the size of infinite sets. By the way, are we sure that  is infinite?

19 Countable Sets If a set S is finite, or if it has the same size as  (i.e., there is a one-to-one correspondence between S and  ), then the set is said to be countable. In other words, you can count the mem- bers of a countable set. The term denumerable is also used; it means the same as countable.

20 Same-Size Sets So far, we've seen that all the following sets have the same cardinality (i.e., the same “size”) as the natural numbers  : – even natural numbers – odd natural numbers – squares of natural numbers – cubes of natural numbers All of the above are subsets of  ; let's go for something bigger than .

21 N ~ Z What does this correspondence show? … … … This is a one-to-one correspondence between the natural numbers N and the integers Z, so Z is countable.

22 The Rational Numbers Q Consider numbers of the form n/d, where both n and d are integers, i.e., whole numbers. Some examples: — 1/2, 2/3, 4/1, 1001/57, -3/2, /18 — 1/1, 2/1, 3/1, 4/1, 5/1,... These numbers are called rational because they are ratios of integers. Note that  is a subset of Z, and Z is a subset of Q.

23 Counting Numbers Consider the interval [-2, 2]: --| | | | | How many integers are in this interval? How many natural numbers? How many rational numbers?

24 The Rationals Are Dense Consider the interval [0, 1]: --| | How many rationals are in this interval? Lots and lots and lots. The rationals are dense: Between any two of them there is another one.

25 Are the Rationals Countable? Claim: The set of rational numbers is countable. Do you believe this? Any ideas on how to show that it is true or not true? To prove it true, we need to come up with a one-to-one correspondence between the rationals and the natural numbers. Does this mean we need to find a smallest rational number?

26 Any Positive Rationals Missing? : 1/1 ½ 1/3 ¼ 1/5 1/6 1/7... 2: 2/1 2/2 2/3 2/4 2/5 2/6 2/7... 3: 3/1 3/2 3/3 3/4 3/5 3/6 3/7... 4: 4/1 4/2 4/3 4/4 4/5 4/6 4/7... 5: 5/1 5/2 5/3 5/4 5/5 5/6 5/7... 6: 6/1 6/2 6/3 6/4 6/5 6/6 6/7... 7: 7/1 7/2 7/3 7/4 7/5 7/6 7/7 … … … … … … … … … …

27 Which Numbers Are Gone? : 1/1 ½ 1/3 ¼ 1/5 1/6 1/7... 2: 2/1 2/3 2/5 2/7... 3: 3/1 3/2 3/4 3/5 3/7... 4: 4/1 4/3 4/5 4/7... 5: 5/1 5/2 5/3 5/4 5/6 5/7... 6: 6/1 6/5 6/7... 7: 7/1 7/2 7/3 7/4 7/5 7/6 … … … … … … … … … …

28 The Rationals Are Countable : 1/1 ½ 1/3 ¼ 1/5 1/6 1/7... 2: 2/1 2/3 2/5 2/7... 3: 3/1 3/2 3/4 3/5 3/7... 4: 4/1 4/3 4/5 4/7... 5: 5/1 5/2 5/3 5/4 5/6 5/7... 6: 6/1 6/5 6/7... 7: 7/1 7/2 7/3 7/4 7/5 7/6 … … … … … … … … … …

29 The Rationals Are Countable 1 – 1 11 – 1/5 2 – 1/2 12 – 1/6 3 – 2 13 – 2/5 4 – 3 14 – 3/4 5 – 1/3 15 – 4/3 6 – 1/4 16 – 5/2 7 – 2/3 17 – 6 8 – 3/2 18 – 7 9 – 4 19 – 5/3 10 – 5 20 – 3/5

30 The Rationals Are Countable At this point you should be stunned. The rationals are dense; between any two distinct rationals there is another rational. In fact, between any two distinct rationals there are an infinite number of rationals. The rationals seem to completely fill the number line; the integers appear with gaps between them. And yet, there are no more rationals than there are integers.

31 Maybe All Sets Are Countable?  is countable. Every subset of  is countable. The superset  of  is countable. The superset  of  is countable. What else is there? Might a set exist which is “bigger” than  ?

32 The Power Set of  Let S be the set of all subsets of . Technical term: S is the power set of . Note that the members of S are not natural numbers. The members of S are sets of natural numbers. Name a few members of S.

33 Some Members of S The set of even natural numbers. The set of odd natural numbers. The set of squares of natural numbers. The set of cubes of natural numbers. The sets {1}, {2}, {3},..., {n}, … The sets {1,2}, {2,3}, {3,4},..., {n,n+1}, … The sets {1,2,3}, {2,3,4}, {3,4,5}, … {n,n+1,n+2}, … Are there any more?

34 Naming Members of S  : … S1: … S2: … S3: … S4: … S5: … S6: … S7: … S8: …

35 It's all 0's and 1's Note that every sequence of 0's and 1's describes a unique subset of . Note that every subset of  can be described uniquely as a sequence of 0's and 1's. So, what have we got? A one-to-one correspondence between the set of subsets of  and the set of sequences of 0's and 1's.

36 Let's Make an Assumption So, the set of all subsets of  and the set of all sequences of 0's and 1's have the same cardinality; these two sets are the same size. Can these sets be put in a one-to-one correspondence with  ? Assume this is the case, and consider any one-to-one correspondence between  and the set of sequences of 0's and 1's.

37 A 1-to-1 Correspondence 1: … 2: … 3: … 4: … 5: … 6: … … Note that this list goes on forever.

38 So, What Do We Have? For every natural number n we have a unique sequence of 0's and 1's. In principle, we can list all the sequences. Also, there are no sequences of 0's and 1's which are not in the list because we have a one-to-one correspondence. However, there is a little problem...

39 Another Member of S 1: … 2: … 3: … 4: … 5: … 6: … x: …

40 Prelude to a Contradiction Is the sequence x a member of the set of all sequences of 0's and 1's? Of course. Look at it. It's a sequence of 0's and 1's, so it must be in the set of all sequences of 0's and 1's. Is there some natural number n that corresponds to x in the given one-to-one correspondence? There must be, because otherwise we wouldn't have a one-to-one correspondence.

41 A Contradiction We have a little problem here: Which natural number n corresponds to x? We defined x in such a way that it differs from EVERY sequence in the correspondence in at least one place. So we have arrived at a contradiction: x must correspond to some natural number, but x doesn't correspond to any natural number. What's wrong? How did we get into this mess?

42 A Way Out of the Mess We made an assumption, namely that a one-to-one correspondence exists between the set of all sequences of 0's and 1's and the set . This assumption led to a contradiction. Which means the assumption is false. So there does not exist a one-to-one correspondence between  and the set of all sequences of 0's and 1's.

43 The Grand Conclusion Is... There is always at least one sequence of 0's and 1's which does not correspond to any natural number. So the set of sequences of 0's and 1's is bigger than . Recall that the set of all 0's and 1's is the same size as S, the set of all subsets of . So S is bigger than .

44 Are You Stunned Yet? If you weren't stunned to see that the rational numbers are countable, it's now time to be stunned. What you have just seen is a proof that some infinities are bigger than others. There are more sets of natural numbers than there are natural numbers. In fact, the cardinality of S is *way* bigger than the cardinality of .

45 Don't Stop Now Let T be the set of all subsets of S. Remember that members of S are subsets of . A member of T: – { {odd numbers}, {square numbers} } Another member of T: – { {1}, {2, 10}, {primes} } How does the size of T compare to the size of S?

46 , S, T, U,... The size of T is way bigger than the size of S. Remember that the size of S is way bigger than the size of . So, T is way, way bigger than . Now let U be the set of all subsets of T. What is your guess about the size of U compared to the size of T?

47 It Just Keeps Going On and On and On... You guessed right: The size of U is bigger than the size of T. Here's the scary part: It goes on forever. Given any set X, let Y be the set of all subsets of X. Then Y is a bigger set than X. There is no largest infinity. Given any infinite set we can easily construct a larger infinite set. It just keeps going on and on and on...

48 What we have seen The two main points of this talk: — Some infinities are bigger than others. — There is no biggest infinity. Don't feel bad if these results leave you with an uneasy feeling. Here is what Cantor had to say about one of his own results: — "I see it, but I don't believe it!" Mathematics is full of surprises.

49 David Hilbert On Cantor's Work David Hilbert ( ) on Cantor's work on set theory: "The finest product of mathematical genius and one of the supreme achievements of purely intellectual human activity." “No one will expel us from this paradise Cantor has created for us.”