Huan Long Shanghai Jiao Tong University

Similar documents
Cantor and sets: La diagonale du fou

Huan Long Shanghai Jiao Tong University

MATH 3300 Test 1. Name: Student Id:

Section 7.5: Cardinality

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Introduction to Proofs

CSCI3390-Lecture 6: An Undecidable Problem

Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction

Theory of Computation CS3102 Spring 2014

Sets and Infinity. James Emery. Edited: 2/25/ Cardinal Numbers 1. 2 Ordinal Numbers 6. 3 The Peano Postulates for the Natural Numbers 7

Sec$on Summary. Definition of sets Describing Sets

Set Theory History. Martin Bunder. September 2015


A Logician s Toolbox

The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)

INTRODUCTION TO CARDINAL NUMBERS

CHAPTER 6. Copyright Cengage Learning. All rights reserved.

Let us first solve the midterm problem 4 before we bring up the related issues.

Set Theory and the Foundation of Mathematics. June 19, 2018

The Limit of Humanly Knowable Mathematical Truth

The Search for the Perfect Language

INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

Sets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University

This section will take the very naive point of view that a set is a collection of objects, the collection being regarded as a single object.

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability

Comparing Infinite Sets

Unsolvable problems, the Continuum Hypothesis, and the nature of infinity

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Zermelo-Fraenkel Set Theory

14 Uncountable Sets(Denial of Self Recursion)

SETS AND FUNCTIONS JOSHUA BALLEW

One-to-one functions and onto functions

Initial Ordinals. Proposition 57 For every ordinal α there is an initial ordinal κ such that κ α and α κ.

Chapter 2 Sets, Relations and Functions

COMP Intro to Logic for Computer Scientists. Lecture 15

A Primer on Intuitive Set Theory

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality.

Part II Logic and Set Theory

DO FIVE OUT OF SIX ON EACH SET PROBLEM SET

Essential Background for Real Analysis I (MATH 5210)

CITS2211 Discrete Structures (2017) Cardinality and Countability

Gödel s Proof. Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College. Kurt Gödel

With Question/Answer Animations. Chapter 2

Chapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability

Set Theory. CSE 215, Foundations of Computer Science Stony Brook University

Philosophy of Religion. Notes on Infinity

Math 455 Some notes on Cardinality and Transfinite Induction

Diagonalize This. Iian Smythe. Department of Mathematics Cornell University. Olivetti Club November 26, 2013

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Formalizing objective mathematics

Axiomatic set theory. Chapter Why axiomatic set theory?

University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics

WHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST?

Trees and generic absoluteness

CSE 20 DISCRETE MATH. Fall

FOUNDATIONS & PROOF LECTURE NOTES by Dr Lynne Walling

Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma

X = { X f X i A i : (œx, y 0 X)[x /= y œi[ x i /= y i ]]}.

Economics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017

Understanding Computation

CSI30. Chapter 2. Basic Structures: Sets, Functions, Sequences, Sums. 2.1 Sets and subsets 2.2 Sets of sets

CSE 311: Foundations of Computing. Lecture 26: Cardinality

COMP Logic for Computer Scientists. Lecture 16

A Readable Introduction to Real Mathematics

CS2742 midterm test 2 study sheet. Boolean circuits: Predicate logic:

VI I : The Axiom of Choice and related properties

Equations and Infinite Colorings Exposition by Stephen Fenner and William Gasarch

6 CARDINALITY OF SETS

Hilbert s problems, Gödel, and the limits of computation

Undecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK

In N we can do addition, but in order to do subtraction we need to extend N to the integers

ORDER AND ARITHMETIC OF CARDINALITIES

Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets

Finite and Infinite Sets

Products, Relations and Functions

Philosophy of Set Theory

5 Set Operations, Functions, and Counting

Unit 3: Definitions, Theorems and Proofs

CHAPTER 1. Basic Ideas

Chapter 0. Introduction: Prerequisites and Preliminaries

Violating the Singular Cardinals Hypothesis Without Large Cardinals

Most General computer?

Chapter 20. Countability The rationals and the reals. This chapter covers infinite sets and countability.

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.

Gödel s Theorem: Limits of logic and computation

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009

Sets, Structures, Numbers

Logic and Mathematics:

INFINITY: CARDINAL NUMBERS

Ordinals. Mustafa Elsheikh elsheimm at mcmaster dot ca. Wed 18 Nov 2008

Philosophies of Mathematics. The Search for Foundations

The Legacy of Hilbert, Gödel, Gentzen and Turing

MAGIC Set theory. lecture 1

In N we can do addition, but in order to do subtraction we need to extend N to the integers

CSE 311: Foundations of Computing. Lecture 26: More on Limits of FSMs, Cardinality

1 Partitions and Equivalence Relations

COMP Logic for Computer Scientists. Lecture 16

Gödel in class. Achim Feldmeier Brno - Oct 2010

Extended Essay - Mathematics

Transcription:

Huan Long Shanghai Jiao Tong University

Paradox Equinumerosity Cardinal Numbers Infinite Cardinals Paradox and ZFC Equinumerosity Ordering Countable sets

Paradox Axiomatic set theory Modern set theory Naive set theory

Russell`s paradox(1902) Bertrand Russell(1872-1970) British philosopher, logician, mathematician, historian, and social critic. In 1950 Russell was awarded the Nobel Prize in Literature, "in recognition of his varied and significant writings in which he champions humanitarian ideals and freedom of thought." What I have lived for? Three passions, simple but overwhelmingly strong, have governed my life: the longing for love, the search for knowledge, and unbearable pity for the suffering of mankind.

Barber Paradox Suppose there is a town with just one male barber. The barber shaves all and only those men in town who do not shave themselves. Question: Does the barber shave himself? If the barber does NOT shave himself, then he MUST abide by the rule and shave himself. If he DOES shave himself, according to the rule he will NOT shave himself.

Formal Proof Theorem There is no set to which every set belongs. [Russell, 1902] Proof: Let A be a set; we will construct a set not belonging to A. Let B={x A x x} We claim that B A. we have, by the construction of B. If B A, then this reduces to B B iff B A and B B B B iff B B, Which is impossible, since one side must be true and the other false. Hence B A

Natural Numbers in Set Theory Constructing the natural numbers in terms of sets is part of the process of Embedding mathematics in set theory

John von Neumann December 28, 1903 February 8, 1957. Hungarian American mathematician who made major contributions to a vast range of fields: Logic and set theory Quantum mechanics Economics and game theory Mathematical statistics and econometrics Nuclear weapons Computer science

Natural numbers By von Neumann: Each natural number is the set of all smaller natural numbers. 0= 1={0}={ } 2={0,1}={, { }} 3={0,1,2}={, { }, {, { }}}

Some properties from the first four natural numbers 0= 1={0}={ } 2={0,1}={, { }} 3={0,1,2}={, { }, {, { }}} 0 1 2 3 0 1 2 3

Paradox Equinumerosity Cardinal Numbers Infinite Cardinals Paradox and ZFC Equinumerosity Ordering Countable sets

Motivation To discuss the size of sets. Given two sets A and B, we want to consider such questions as: Do A and B have the same size? Does A have more elements than B?

Example

Equinumerosity Definition A set A is equinumerous to a set B (written A B) iff there is a one-to-one function from A onto B. A one-to-one function from A onto B is called a oneto-one correspondence between A and B.

Example: ω ω ω The set ω ω is equinumerous to ω. There is a function J mapping ω ω one-to-one onto ω. J(m,n)=((m+n) 2 +3m+n)/2

Example: ω Q f: ω Q

Example: (0,1) R (0,1)={x R 0<x<1}, then (0,1) R f(x)= tan(π(2x-1)/2)

Examples (0,1) (n,m) Proof: f(x) = (n-m)x+m (0,1) {x x ω x>0} =(0,+ ) Proof: f(x)=1/x -1 [0,1] [0,1) Proof: f(x)=x if 0 x<1 and x 1/(2 n ), n ω f(x)=1/(2 n+1 ) if x=1/(2 n ), n ω [0,1) (0,1) Proof: f(x)=x if 0<x<1 and x 1/(2 n ), n ω f(0)=1/2 x=0 f(x)=1/(2 n+1 ) if x=1/(2 n ), n ω [0,1] (0,1)

Example: (A) A 2 For any set AA, we have PP AA AA 2. Proof: Define a function HH from PP(AA) onto AA 2 as: For any subset BB of AA, HH(BB) is the characteristic function of BB: 1 if xx BB ff BB xx = 0 if xx AA BB HH is one-to-one and onto.

Theorem For any sets A, B and C: A A If A B then B A If A B and B C then A C. Proof:

Theorem(Cantor 1873) The set ω is not equinumerous to the set R of real numbers. No set is equinumerous to its power set.

The set ω is not equinumerous to the set R of real numbers. Proof: show that for any functon f: ω R, there is a real number z not belonging to ran f f(0) =32.4345, f(1) =-43.334, f(2) = 0.12418, z: the integer part is 0, and the (n+1) st decimal place of z is 7 unless the (n+1) st decimal place of f(n) is 7, in which case the (n+1) st decimal place of z is 6. Then z is a real number not in ran f.

No set is equinumerous to its power set. Proof: Let g: A (A); we will construct a subset B of A that is not in ran g. Specifically, let B={x A x g(x)} Then B A, but for each x A Hence B g(x). x B iff x g(x)

Paradox Equinumerosity Cardinal Numbers Infinite Cardinals Paradox and ZFC Equinumerosity Ordering Countable sets

Ordering Cardinal Numbers Definition A set A is dominated by a set B (written A B) iff there is a one-to-one function from A into B.

Examples Any set dominates itself. If A B, then A is dominated by B. A B iff A is equinumerous to some subset of B. A F B B

Schröder-Bernstein Theorem If A B and B A, then A B.

Proof: ff: AA BB, gg: BB AA. Define CC nn by recursion: CC 0 = AA rrrrrr gg and CC + nn = gg ff CC nn h xx = ff(xx) if xx CC nn for some nn, g 1 x otherwise h(xx) is one-to-one and onto.

Application of the Schröder- Example Bernstein Theorem If A B C and A C, then all three sets are equinumerous. The set R of real numbers is equinumerous to the closed unit interval [0,1].

ℵ 0 is the least infinite cardinal. i.e. ω A for any infinite A. ℵ 0 2 ℵ 0 =? 2 ℵ 0 ℵ 0 2 ℵ 0 2 ℵ 0 2 ℵ 0 =2 ℵ 0

Paradox Equinumerosity Cardinal Numbers Infinite Cardinals Paradox and ZFC Equinumerosity Ordering Countable sets

Countable Sets Definition A set A is countable iff A ω, Intuitively speaking, the elements in a countable set can be counted by means of the natural numbers. An equivalent definition: A set A is countable iff either A is finite or A ω.

Example ω is countable, as is Z and Q R is uncountable A, B are countable sets C A, C is countable A B is countable A B is countable For any infinite set A, (A) is uncountable.

Continuum Hypothesis Are there any sets with cardinality between ℵ 0 and 2 ℵ 0? Continuum hypothesis (Cantor): No. i.e., there is no λ with ℵ 0 < λ < 2 ℵ 0. Or, equivalently, it says: Every uncountable set of real numbers is equinumerous to the set of all real numbers. GENERAL VERSION: for any infinite cardinal κ, there is no cardinal number between κ and 2 κ. HISTORY Georg Cantor: 1878, proposed the conjecture David Hilbert: 1900, the first of Hilbert s 23 problems. Kurt Gödel: 1939, ZFC CH. Paul Cohen: 1963, ZFC CH.