Infinity and the Limits of Mathematics Manchester High School for Girls Friday 30 th September 2011 Dr Richard Elwes, University of Leeds.

Slides:



Advertisements
Similar presentations
Cantor’s Infinities Raymond Flood Gresham Professor of Geometry.
Advertisements

Beyond Counting Infinity and the Theory of Sets Nate Jones & Chelsea Landis.
04/23/13 Countability Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1.
EE1J2 – Discrete Maths Lecture 9
Great Theoretical Ideas in Computer Science.
2, , and Beyond Debra S. Carney Mathematics Department University of Denver April 11, 2008 Sonya Kovalevsky Day - CCA.
CHAPTER 4 Decidability Contents Decidable Languages
CS 310 – Fall 2006 Pacific University CS310 The Halting Problem Section 4.2 November 15, 2006.
Lecture ,3.3 Sequences & Summations Proof by Induction.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
The Real Number System. The natural numbers are the counting numbers, without _______. Whole numbers include the natural numbers and ____________. Integers.
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.
Classification of Numbers
Cardinality of Sets Section 2.5.
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
Real Numbers Week 1 Topic 1. Real Numbers  Irrational Numbers  Numbers that cannot be written as a fraction  √2, π  Rational Numbers  Numbers that.
1 How Big Is Infinity? Some Mathematical Surprises Roger House Scientific Buzz Café French Garden Restaurant & Bistro Sebastopol, CA 2013 July 25 Copyright.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
The Language of Sets MATH 102 Contemporary Math S. Rook.
1 Undecidability Reading: Chapter 8 & 9. 2 Decidability vs. Undecidability There are two types of TMs (based on halting): (Recursive) TMs that always.
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”
Relations, Functions, and Countability
Section 3.1 Beyond Numbers What Does Infinity Mean?
MATH 224 – Discrete Mathematics
The Real Number System. Whole numbers Whole numbers Rational numbers Whole numbers Natural numbers Integers / ¾ 18% π √2√2 − ….
Donald Byrd rev. 28 November 2012
COMPSCI 102 Introduction to Discrete Mathematics.
Aim: How can the word ‘infinite’ define a collection of elements?
Activity 1-17: Infinity.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Stupid questions? Are there more integers than even integers?
11/10/2015.  Copy these definitions into your notes: 1. Rational number: Any number that can be put into the form of a fraction. 2. Irrational number:
If this is a number line, where would we put counting numbers?
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.
Medina  Natural : Medina2 Any number that can be located somewhere on a number line Counting Number Counting numbers including the.
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 I Lecture 25 Pattern Matching, Cardinality, Computability Spring
CSE 311: Foundations of Computing Fall 2013 Lecture 26: Pattern matching, cardinality.
CSE 311: Foundations of Computing Fall 2014 Lecture 27: Cardinality.
1 Proof of the Day: Some students claimed to prove that 2 k = 2 k+1 – 1. Try to prove by induction that: 2 k = 2 k+1 – 1. Where does the proof go off-track?
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.
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
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.
How Our Number System Grew Up Friday, April 1, 2016.
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.
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
The Acceptance Problem for TMs
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.
This statement is false.
2.4 Sequences and Summations
Section 1.4 The Real Number System
Discrete Structures for Computer Science
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Discrete Mathematics and its Applications
Applied Discrete Mathematics Week 2: Proofs
Discrete Math for CS CMPSC 360 LECTURE 43 Last time: Variance
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Computability and Undecidability
Presentation transcript:

Infinity and the Limits of Mathematics Manchester High School for Girls Friday 30 th September 2011 Dr Richard Elwes, University of Leeds

Counting with Cantor How many letters are there in ‘CANTOR’? ↕↕↕↕↕↕ CANTOR

Counting with Cantor So, two sets are the same size if there is a one-to-one correspondence between them. In the late 19 th century Georg Cantor had an amazing thought. What would happen if he applied this idea to infinite sets?

The most familiar infinite set is the set of natural numbers: {0,1,2,3,4,5,6,….} Counting the Infinite We call this set א 0 (“aleph nought”).

How to count Which infinite sets are the same size as א 0 ? 01234…n… ↕↕↕↕↕…↕… 02468…2n… Counting the Infinite The even numbers:

How to count Which infinite sets are the same size as א 0 ? 01234…2n-12n… ↕↕↕↕↕…↕↕… 012-2…n-n… Counting the Infinite The integers, or whole numbers (positive, negative and zero):

How to count Counting the Infinite What about the rational numbers (fractions)? … … … … …

How to count Counting the Infinite The sets of even numbers, prime numbers, whole numbers, and rational numbers are all countably infinite, meaning they are the same size as א 0. So, are there any uncountably infinite sets? Yes!

It is well known that the decimal expansion of π continues forever without ever stopping or getting stuck in a repetitive loop: … The Uncountably Infinite How many other such numbers are there? Infinitely many, of course, but…

The Uncountably Infinite A real number is an infinite decimal string. We’ll just focus on the ones between 0 and 1, which all begin ‘ 0. ’ Georg Cantor proved that this set is uncountable, meaning bigger than א 0. The Uncountably Infinite He provided a famous proof, called Cantor’s diagonal argument.

The Uncountably Infinite Imagine that there is a correspondence between א 0 and the real numbers between 0 and 1. The Uncountably Infinite 1↔ … 2↔ … 3↔ … 4↔ … 5↔ … 6↔ … It might look like this:

The Uncountably Infinite In general, a correspondence will look like this: The Uncountably Infinite 1↔0.a1a1 a2a2 a3a3 a4a4 a5a5 … 2↔ b1b1 b2b2 b3b3 b4b4 b5b5 … 3↔ c1c1 c2c2 c3c3 c4c4 c5c5 … 4↔ d1d1 d2d2 d3d3 d4d4 d5d5 … 5↔ e1e1 e2e2 e3e3 e4e4 e5e5 … Every real number between 0 and 1 must be somewhere on this list…. which was missed out, it can’t have been a genuine correspondence after all. …so if Cantor could find just one number

The Uncountably Infinite To find a new number not on the list… The Uncountably Infinite 1↔0.a1a1 a2a2 a3a3 a4a4 a5a5 … 2↔ b1b1 b2b2 b3b3 b4b4 b5b5 … 3↔ c1c1 c2c2 c3c3 c4c4 c5c5 … 4↔ d1d1 d2d2 d3d3 d4d4 d5d5 … 5↔ e1e1 e2e2 e3e3 e4e4 e5e5 … …Cantor specified every one of its decimal places… …and made sure that it disagreed with a 1, b 2, c 3, d 4, and so on.

Cantor defined a new real number x = 0. x 1 x 2 x 3 x 4 x 5 …. with this rule: if a 1 =3, then x 1 =7 if a 1 ≠3, then x 1 =3(This guarantees x≠a.) if b 2 =3, then x 2 =7 if b 2 ≠3, then x 2 =3(This guarantees x≠b.) And so on. The Uncountably Infinite

Cantor’s diagonal argument proved that the set of real numbers is bigger than א 0. This set is known as the continuum, or 2 א 0. Cantor wanted to know whether there was a level between א 0 and the continuum. He thought there wasn’t... …but he couldn’t prove it. This became known as the continuum hypothesis 2 א 0 = א 1 ? The Continuum Hypothesis

In 1963, Paul Cohen resolved the continuum hypothesis… …sort of. He constructed two mathematical universes. Almost everything looks the same in each. But in one, the continuum hypothesis is true… …and in the other, it isn’t! The continuum hypothesis is formally undecidable from the usual laws of maths. The Continuum Hypothesis

Is there any way to tell which the ‘correct’ mathematical universe is? And whether the continuum hypothesis can really be said to be ‘true’ or not? Some people think so. E.g. Hugh Woodin. Others think not. E.g. Joel Hamkins. What do you think? Thank You! Beyond the Continuum Hypothesis