Cantor’s Infinities Raymond Flood Gresham Professor of Geometry.

Slides:



Advertisements
Similar presentations
Beyond Counting Infinity and the Theory of Sets Nate Jones & Chelsea Landis.
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
04/23/13 Countability Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1.
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
Infinity and the Limits of Mathematics Manchester High School for Girls Friday 30 th September 2011 Dr Richard Elwes, University of Leeds.
Great Theoretical Ideas in Computer Science.
Logic and Set Theory.
Chapter 2 The Basic Concepts of Set Theory
Lecture ,3.3 Sequences & Summations Proof by Induction.
Number systems TWSSP Tuesday.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
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.
Rational and Irrational Numbers. Rational Number.
Cantor’s Legacy: Infinity And Diagonalization Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 25Apr 13, 2004Carnegie.
Set of Real Numbers.
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,
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
In mathematics, a rational number is any number that can be expressed as the quotient or fraction p/q of two integers, with the denominator q not equal.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
Paradoxes of the Infinite Kline XXV Pre-May Seminar March 14, 2011.
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”
Basic Structures: Sets, Functions, Sequences, and Sums CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Functions Section 2.3. Section Summary Definition of a Function. – Domain, Cdomain – Image, Preimage Injection, Surjection, Bijection Inverse Function.
Relations, Functions, and Countability
Section 3.1 Beyond Numbers What Does Infinity Mean?
CS201: Data Structures and Discrete Mathematics I
CompSci 102 Discrete Math for Computer Science
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Donald Byrd rev. 28 November 2012
COMPSCI 102 Introduction to Discrete Mathematics.
Chapter 2 Section 2.5 Infinite Sets. Sets and One-to-One Correspondences An important tool the mathematicians use to compare the size of sets is called.
Aim: How can the word ‘infinite’ define a collection of elements?
Slide Section 2-1 Symbols and Terminology. SYMBOLS AND TERMINOLOGY Designating Sets Sets of Numbers and Cardinality Finite and Infinite Sets Equality.
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.
Chapter 2 With Question/Answer Animations. Section 2.1.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
Cardinality with Applications to Computability Lecture 33 Section 7.5 Wed, Apr 12, 2006.
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.
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.
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.
One of Cantor's basic concepts was the notion of the size or cardinality of a set M, denoted by |M|  M - finite sets M is an n-set or has size n, if.
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
The Basic Concepts of Set Theory
2.4 Sequences and Summations
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.
Algebra 1 Section 1.1.
The Basic Concepts of Set Theory
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Discrete Mathematics and its Applications
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:

Cantor’s Infinities Raymond Flood Gresham Professor of Geometry

Georg Cantor 1845 – 1918 Cantor’s infinities Bronze monument to Cantor in Halle-Neustadt

Georg Cantor 1845 – 1918 Sets One-to-one correspondence Countable Uncountable Infinite number of infinite sets of different sizes Continuum hypothesis Reception of Cantor’s ideas Cantor’s infinities

Set: any collection into a whole M of definite and separate objects m of our intuition or of our thought Broadly speaking a set is a collection of objects Example: {1, 3, 4, 6, 8} Example: {1, 2, 3, …, 66} or {2, 4, 6, 8, …} Example: {x : x is an even positive integer} which we read as: the set of x such that x is an even positive integer Example: {x : x is a prime number less than a million} which we read as: The set of x such that x is a prime number less than a million

One-to-one correspondence Two sets M and N are equivalent … if it is possible to put them, by some law, in such a relation to one another that to every element of each one of them corresponds one and only one element of the other. If M and N are equivalent we often say that they have they have the same cardinality or the same power If M and N are finite this means they have the same number of elements But what about the case when M and N are infinite?

Countable N = {1, 2, 3, …} the set of natural numbers E = {2, 4, 6, …} the set of even natural numbers

Countable N = {1, 2, 3, …} the set of natural numbers E = {2, 4, 6, …} the set of even natural numbers A set is infinite if it can be put into one-to-one correspondence with a proper subset of itself. A proper subset does not contain all the elements of the set.

Countable N = {1, 2, 3, …} the set of natural numbers E = {2, 4, 6, …} the set of even natural numbers Z = {… -3, -2, -1, 0, 1, 2, 3, …} the set of all integers

Any set that could be put into one-to-one correspondence with N is called countably infinite or denumerable The symbol he chose to denote the size of a countable set was ℵ 0 which is read as aleph-nought or aleph-null. It is named after the first letter of the Hebrew alphabet. Cardinality of E = cardinality of Z = cardinality of N = ℵ 0

Hilbert’s Grand Hotel Image Credit: MathCS.orgMathCS.org One new arrival

Hilbert’s Grand Hotel One new arrival everybody moves up a room New arrival put in room 1 Done! 1 + ℵ 0 = ℵ 0

Hilbert’s Grand Hotel and 66 new arrivals 66 new arrivals

Hilbert’s Grand Hotel and 66 new arrivals 66 new arrivals everybody moves up 66 rooms So if they are in room n they move to room n + 66 New arrivals put in rooms 1 to 66 Done! Works for any finite number of new arrivals ℵ 0 = ℵ 0

Hilbert’s Grand Hotel and an infinite number of new arrivals

Everybody moves to the room with number twice that of their current room. All the odd numbered rooms are now free and he uses them to accommodate the infinite number of people on the bus ℵ 0 + ℵ 0 = ℵ 0

Countably infinite number of buses each with countably infinite passengers

ℵ 0 times ℵ 0 = ℵ 0

I see what might be going on – we can do this because these infinite sets are discrete, have gaps, and this is what allows the method to work because we can somehow interleave them and this is why we always end up with ℵ 0.

Afraid not!

I see what might be going on – we can do this because these infinite sets are discrete, have gaps, and this is what allows the method to work because we can somehow interleave them and this is why we always end up with ℵ 0. Afraid not! A rational number or fraction is any integer divided by any nonzero integer, for example, 5/4, 87/32, -567/981. The rationals don’t have gaps in the sense that between any two rationals there is another rational The rationals are countable

The positive rationals are countable the first row lists the integers, the second row lists the ‘halves’, the third row the thirds the fourth row the quarters and so on. We then ‘snake around’ the diagonals of this array of numbers, deleting any numbers that we have seen before: this gives the list This list contains all the positive fractions, so the positive fractions are countable.

The Reals We will prove that the set of real numbers in the interval from 0 up to 1 is not countable. We use proof by contradiction Suppose they are countable then we can create a list like 1  x 1 = … 2  x 2 = … 3  x 3 = … 4  x 4 = … 5  x 5 = … 6  x 6 = ….... n  x n = 0.a 1 a 2 a 3 a 4 a 5 …a n …....

1  x 1 = … 2  x 2 = … 3  x 3 = … 4  x 4 = … 5  x 5 = … 6  x 6 = … n  x n = 0.a 1 a 2 a 3 a 4 a 5 …a n ….... Construct the number b = 0.b 1 b 2 b 3 b 4 b 5 … Choose b 1 not equal to 2 say 4 b 2 not equal to 5 say 7 b 3 not equal to 6 say 8 b 4 not equal to 0 say 3 b 5 not equal to 8 say 7 b n not equal to a n

1  x 1 = … 2  x 2 = … 3  x 3 = … 4  x 4 = … 5  x 5 = … 6  x 6 = … n  x n = 0.a 1 a 2 a 3 a 4 a 5 …a n ….... Construct the number b = 0.b 1 b 2 b 3 b 4 b 5 … Choose b 1 not equal to 2 say is 4 b 2 not equal to 2 say is 7 b 3 not equal to 2 say is 8 b 4 not equal to 2 say is 3 b 5 not equal to 2 say is 7 b n not equal to a n Then b = 0.b 1 b 2 b 3 b 4 b 5 … = … is NOT in the list The reals are uncountable!

The cardinality of the reals is the same as that of the interval of the reals between 0 and 1 The cardinality of the reals is often denoted by c for the continuum of real numbers.

The rationals can be thought of as precisely the collection of decimals which terminate or repeat e.g. 5/4 = … 17/7 = … -133/990 = … The decimal expansion of a fraction must terminate or repeat because when you divide the bottom integer into the top one there are only a limited number of remainders you can get. 1/7 starts with 0.1remainder 3 then 0.14remainder 2 then 0.142remainder 6 then remainder 4 then remainder 5 then remainder 1 which we have had before at the start so process repeats A repeating decimal is a fraction e.g. Consider x = … This has a repeating block of length 3 Multiply by 10 3 to get 1000 x = … Subtract x x = … 999x = 123 x = 123/999 = 41/333 The irrationals are those real numbers which are not rational So their decimal expansions do not terminate or repeat

Cardinality of some sets SetDescriptionCardinality Natural numbers1, 2, 3, 4, 5, … ℵ0ℵ0 Integers…, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, … ℵ0ℵ0 Rational numbers or fractions All the decimals which terminate or repeat ℵ0ℵ0 Irrational numbers All the decimals which do not terminate or repeat c Real numbersAll decimals c

Cardinality of some sets SetDescriptionCardinality Real numbersAll decimals c Algebraic numbers ℵ0ℵ0 Transcendental numbersAll reals which are not algebraic numbers e.g.  c

Power set of a set Given a set A, the power set of A, denoted by P[A], is the set of all subsets of A. A = {a, b, c} Then A has eight = 2 3 subsets and the power set of A is the set containing these eight subsets. P[A] = { { }, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c} } { } is the empty set and if a set has n elements it has 2 n subsets. The power set is itself a set

No set can be placed in one-to-one correspondence with its power set

B is the set of each and every element of the original set A that is not a member of the subset with which it is matched. B = {a, b, d, f, g, …}

Now B is just a subset of A so must appear somewhere in the right-hand column and so is matched with some element of A say z

Is z an element of B?

Case 1: Suppose z is an element of B Then z satisfies the defining property of B which is that it consists of elements which do not belong to their matching subset so z does not belong to B! Contradiction

Case 2: Suppose z is not an element of B Then z satisfies the defining property of B which is that it consists of elements which do not belong to their matching subset so z does belong to B! Contradiction!

Infinity of infinities Reals have smaller cardinality than the power set of the reals. Which is smaller than the power set of the power set of the reals Which is smaller than the power set of the power set of the power set of the reals etc!

Indeed we can show that the reals have the cardinality of the power set of the natural numbers which is often written as above and this is our last example of transfinite arithmetic!

Continuum hypothesis The Continuum hypothesis states: there is no transfinite cardinal falling strictly between ℵ 0 and c Work of Gödel (1940) and of Cohen (1963) together implied that the continuum hypothesis was independent of the other axioms of set theory

Cantor’s assessment of his theory of the infinite My theory stands as firm as a rock; every arrow directed against it will return quickly to its archer. How do I know this? Because I have studied it from all sides for many years; because I have examined all objections which have ever been made against the infinite numbers; and above all because I have followed its roots, so to speak, to the first infallible cause of all created things. Cantor circa 1870

Academic year 2015–16 dates for your diary! Tuesdays 1 pm Museum of London 20 October November January February March April 2016