Raymond Flood Gresham Professor of Geometry

Slides:



Advertisements
Similar presentations
Chapter 2 The Basic Concepts of Set Theory
Advertisements

Cantor’s Infinities Raymond Flood Gresham Professor of Geometry.
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.
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.
Great Theoretical Ideas in Computer Science.
Logic and Set Theory.
Chapter 2 The Basic Concepts of Set Theory
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.
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.
The Real Number System. Real Numbers The set of all rational and the set of all irrational numbers together make up the set of real numbers. Any and all.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
Paradoxes of the Infinite Kline XXV Pre-May Seminar March 14, 2011.
P.1 Real Numbers. 2 What You Should Learn Represent and classify real numbers. Order real numbers and use inequalities. Find the absolute values of real.
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.
Functions Section 2.3. Section Summary Definition of a Function. – Domain, Cdomain – Image, Preimage Injection, Surjection, Bijection Inverse Function.
Relations, Functions, and Countability
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.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
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.
Introductory Algebra Glossary The Language of Math.
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
Cardinality with Applications to Computability
1.1 Subsets of Real Numbers
Discrete Mathematics CS 2610
1.1: Objectives Properties of Real Numbers
The Basic Concepts of Set Theory
CS 2210:0001 Discrete Structures Sets and Functions
What is Probability? Quantification of uncertainty.
MATH 224 – Discrete Mathematics
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.
Countable or Uncountable…That is the question!
Algebra 1 Section 1.1.
The Basic Concepts of Set Theory
Chapter 1 Section 1.
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Discrete Mathematics and its Applications
Chapter 2 The Basic Concepts of Set Theory
Applied Discrete Mathematics Week 2: Proofs
Copyright © Cengage Learning. All rights reserved.
Chapter 2 The Basic Concepts of Set Theory
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Chapter 2 The Basic Concepts of Set Theory
Section 2.6 Infinite Sets.
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.
Computability and Undecidability
Presentation transcript:

Raymond Flood Gresham Professor of Geometry Cantor’s Infinities Raymond Flood Gresham Professor of Geometry

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

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

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

It is named after the first letter of the Hebrew alphabet. 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 One new arrival Image Credit: MathCS.org

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

Hilbert’s Grand Hotel and 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. 66 + ℵ0 = ℵ0

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

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

Countably infinite number of buses each with countably infinite passengers

Countably infinite number of buses each with countably infinite passengers

Countably infinite number of buses each with countably infinite passengers

Countably infinite number of buses each with countably infinite passengers

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.

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  x1 = 0.256173… 2  x2 = 0.654321… 3  x3 = 0.876241… 4  x4 = 0.60000… 5  x5 = 0.67678… 6  x6 = 0.38751… . . . . n  xn = 0.a1a2a3a4a5 …an …

Construct the number b = 0 Construct the number b = 0.b1b2b3b4b5 … Choose b1 not equal to 2 say 4 b2 not equal to 5 say 7 b3 not equal to 6 say 8 b4 not equal to 0 say 3 b5 not equal to 8 say 7 bn not equal to an 1  x1 = 0.256173… 2  x2 = 0.654321… 3  x3 = 0.876241… 4  x4 = 0.60000… 5  x5 = 0.67678… 6  x6 = 0.38751…   n  xn = 0.a1a2a3a4a5 …an … . . . .

The reals are uncountable! Then b = 0.b1b2b3b4b5 … = 0.47837… is NOT in the list The reals are uncountable! 1  x1 = 0.256173… 2  x2 = 0.654321… 3  x3 = 0.876241… 4  x4 = 0.60000… 5  x5 = 0.67678… 6  x6 = 0.38751…   n  xn = 0.a1a2a3a4a5 …an … . . . . Construct the number b = 0.b1b2b3b4b5 … Choose b1 not equal to 2 say is 4 b2 not equal to 2 say is 7 b3 not equal to 2 say is 8 b4 not equal to 2 say is 3 b5 not equal to 2 say is 7 bn not equal to an

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 = 1.25000000 … 17/7 = 2.428571428571428571 … -133/990 = - 0.134343434… 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.1 remainder 3 then 0.14 remainder 2 then 0.142 remainder 6 then 0.1428 remainder 4 then 0.14285 remainder 5 then 0.142857 remainder 1 which we have had before at the start so process repeats A repeating decimal is a fraction e.g. Consider x = 0.123123123123 … This has a repeating block of length 3 Multiply by 103 to get 1000 x = 123.123123123 … Subtract x x = 0.123123123 … 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 Description Cardinality Natural numbers 1, 2, 3, 4, 5, … ℵ0 Integers …, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, … Rational numbers or fractions All the decimals which terminate or repeat Irrational numbers All the decimals which do not terminate or repeat c Real numbers All decimals

Cardinality of some sets Description Cardinality Real numbers All decimals c Algebraic numbers All solutions of polynomial equations with integer coefficients. All rationals are algebraic as well as many irrationals ℵ0 Transcendental numbers All reals which are not algebraic numbers e.g. 

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 = 23 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 2n subsets. The power set is itself a set

No set can be placed in one-to-one correspondence with its power 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

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 Academic year 2015–16 dates for your diary! Tuesdays 1 pm Museum of London 20 October 2015 17 November 2015 19 January 2016 16 February 2016 15 March 2016 19 April 2016