GEB class notes Jan 23 Infinite Sets: Cantor, Hilbert, Russell, Gödel

Slides:



Advertisements
Similar presentations
PARADOX Chi-Kwong Li. A ‘ VISUAL ’ PARADOX : I LLUSION.
Advertisements

ON CHANGE Zeno. The Dichotomy Zeno’s arguments about motion which provide trouble for those who try to resolve them are four in number. The first.
Cantor’s Infinities Raymond Flood Gresham Professor of Geometry.
Gödel’s Incompletness Theorem By Njegos Nincic. Overview  Set theory: Background, History Naïve Set Theory  Axiomatic Set Theory  Icompleteness Theorem.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.1 Sets ‒Sets ‒Common Universal Sets ‒Subsets 2.2 Set Operations 2.3 Functions 2.4 Sequences and Summations 1.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
AP CALCULUS 1002 Introduction. Purpose of Mathematics To explain To predict To control.
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.
Zeno’s Paradoxes Can I move?. Zeno The Arrow Paradox Y ou cannot even move. If everything when it occupies an equal space is at rest, and if that which.
EE1J2 – Discrete Maths Lecture 9
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Logic and Set Theory.
Chapter 2 The Basic Concepts of Set Theory
Sequence A list of objects arranged in a particular order.
1 CS1001 Lecture Overview Midterm Midterm OOP Wrap-up OOP Wrap-up Functions, Hilbert’s Hotel Functions, Hilbert’s Hotel.
Lecture 24: Gödel’s Proof CS150: Computer Science
A Very Practical Series 1 What if we also save a fixed amount (d) every year?
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
Cardinality of Sets Section 2.5.
Implications of Cantorian Transfinite Set Theory on Creation.
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
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.
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
2.4 Sequences and Summations
Sequences – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Sequences Reading: Kolman, Section 1.3.
1 Undecidability Reading: Chapter 8 & 9. 2 Decidability vs. Undecidability There are two types of TMs (based on halting): (Recursive) TMs that always.
Algebraic and Transcendental Numbers
Chapter 2: The Basic Concepts of Set Theory. Sets A set is a collection of distinguishable objects (called elements) Can define in words Can list elements.
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”
Section 3.1 Beyond Numbers What Does Infinity Mean?
CompSci 102 Discrete Math for Computer Science
This page intentionally left blank
Donald Byrd rev. 28 November 2012
Great Theoretical Ideas in Computer Science.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Great Theoretical Ideas in Computer Science.
Set Theory Chapter 3. Chapter 3 Set Theory 3.1 Sets and Subsets A well-defined collection of objects (the set of outstanding people, outstanding is very.
Sets 2/10/121. What is a Set? Informally, a collection of objects, determined by its members, treated as a single mathematical object Not a real definition:
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Chapter 2 With Question/Answer Animations. Section 2.1.
CS 461 – Nov. 7 Decidability concepts –Countable = can number the elements  –Uncountable = numbering scheme impossible  –A TM undecidable –Language classes.
CSE 311 Foundations of Computing I Lecture 26 Cardinality, Countability & Computability Autumn 2011 CSE 3111.
CompSci 102 Discrete Math for Computer Science February 7, 2012 Prof. Rodger Slides modified from Rosen.
Making Mountains Out of Molehills The Banach-Tarski Paradox By Bob Kronberger Jay Laporte Paul Miller Brian Sikora Aaron Sinz.
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
Zeno’s Paradox By: Deborah Lowe and Vickie Bledsoe.
Sets and Size Basic Question: Compare the “size” of sets. First distinction finite or infinite. –What is a finite set? –How can one compare finite sets?
Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.
CSC – 332 Data Structures Dr. Curry Guinn. Today Go over Homework 2 Godel, Escher, Bach.
The Goal of Science To create a set of models that describe the measurable universe. These models must – Fit previous verified measurements applicable.
Infinity and Beyond! A prelude to Infinite Sequences and Series (Chp 10)
Chapter 4 Introduction to Set Theory
CIS Automata and Formal Languages – Pei Wang
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Discrete Mathematics for Computer Science
What is Probability? Quantification of uncertainty.
Cardinality of Sets Section 2.5.
Great Theoretical Ideas in Computer Science
Discrete Mathematics and its Applications
Lecture 22: Gödel’s Theorem CS200: Computer Science
Infinity and Beyond! A prelude to Infinite Sequences and Series (Chps 9-10)
Great Theoretical Ideas in 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.
Cpt S 317: Spring 2009 Reading: Chapter 8 & 9
Two's company, three is none.
CIS Automata and Formal Languages – Pei Wang
Presentation transcript:

GEB class notes Jan 23 Infinite Sets: Cantor, Hilbert, Russell, Gödel The Infinite Hotel Infinite Sums and Zeno’s Paradoxes

Cantor and Counting I Two Sets are “kind of the same” if they have the same number of elements. Infinite Sets are “kind of the same” if they can be put into one-to-one correspondence. The Set of Even Integers is “kind of the same as” the Set of All Integers.

Cantor and Counting II Partitioning the Set of Sets Sets having one element Sets having two elements . . . . . . Infinitely many elements In this context, “kind of the same” is “isomorphic as sets”  FANCY!

Cantor and Counting III Cantor --- How do we distinguish the different kinds of infinite sets? (not a weird question!) “Number of even integers = Number of integers” “Number of powers of 2 = Number of integers” ie., {2, 4, 8,16,32,64, …} is kind of the same as {1, 2, 3, 4, 5, 6, …}

The Infinite Hotel If you’re in Room N, move to Room N+1 always room for one more If you’re in Room N, move to Room 2*N room for infinite busload If you’re in Room N, move to Room 2 N room for infinitely many infinite busloads

Cantor and Counting IV “Number of integer fractions = Number of integers” (1873) “Number of points on line segment is uncountable” (1874) “Number of points in square = Number of points on line segment” (1877) I see it, but I don't believe it!

Cantor Hilbert 1845 - 1918 1862 - 1943

Russell Whitehead 1872 - 1970 1861 - 1947

DOUBTS, FIXES, more DOUBTS Cantor: we don’t know how to count and we can’t handle infinite sets. Russell: what about the set of all sets which are not members of themselves? Russell and Whitehead: Theory of Types and Principia Mathematica Hilbert: desire to demonstrate that Principia Mathematica is both consistent and complete. Godel: powerful and consistent implies incomplete. 1870s 1901 1910 - 1913 1922 - 1927 1931

Theory of Types “The Set of Sets” is an illegal concept. Get around “the Set of Sets” by referring to objects, sets of objects, collections of sets of objects, ensembles of collections of sets of objects, … Hierarchy of language, metalanguage (statements about language), e.g.“German sentences at the end verbs have” metametalanguage (statements about statements about language), …

Let’s catch our breath with a blank slide

An Infinite Sum 1 =  +  1   1

1 =  +  +   1   1

1 =  +  +  +    1   1

1 =  +  +  +  + …   1   1

Follow the Bouncing Ball Infinitely many bounces in finite time http://www.pipey.com/freeflash/gravity.asp

Zeno’s Dichotomy Paradox In going from point A to point B, first you must go halfway. But before reach the halfway point, you must get halfway there. But before you get halfway to the halfway point, you must get halfway there … Therefore motion is impossible!

Response to Zeno IT’S JUST NOT SO, ZENO! If A and B are 1 mile apart and you travel at 1 mile per hour, then (even following Zeno’s description) your total elapsed time is … +  +  +  +  = 1 hour A B     ... IT’S JUST NOT SO, ZENO!

The Tortoise and Achilles How did you handle this using ordinary algebra?

Achilles and the Tortoise recursive formulas for Zeno Achilles and the Tortoise recursive formulas for Zeno A n = A n-1 +  (T n-1 - A n-1) t n = t n-1 + (T n-1 - A n-1 ) ÷ (sA) T n = T n-1 + (t n - t n-1 )*sT The nth stage can be computed from the (n -1)th stage.