Countable or Uncountable…That is the question!

Slides:



Advertisements
Similar presentations
Countability. The cardinality of the set A is equal to the cardinality of a set B if there exists a bijection from A to B cardinality? bijection? injection.
Advertisements

1 Diagonalization Fact: Many books exist. Fact: Some books contain the titles of other books within them. Fact: Some books contain their own titles within.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 10 Cardinality Uncountability of the real numbers.
Introduction to Computability Theory
Great Theoretical Ideas in Computer Science.
Module 5 Topics Proof of the existence of unsolvable problems
Functions f( ) = A B Lecture 15: Nov 4.
Sequence A list of objects arranged in a particular order.
1 Lecture 6 Topics –Proof of the existence of unsolvable problems Problems/languages not in REC Proof Technique –There are more problems/languages than.
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.
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.
Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
Cardinality of Sets Section 2.5.
Sequences and Summations
2.4 Sequences and Summations
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
Basic Structures: Sets, Functions, Sequences, and Sums CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Relations, Functions, and Countability
COMPSCI 102 Introduction to Discrete Mathematics.
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.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
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.
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.
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
Great Theoretical Ideas in Computer Science about AWESOME Some Generating Functions Probability.
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.
Infinite sets We say that a set A is infinite if a proper subset B exists of A such that there is a bijection It is easy to see that no set with a finite.
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.
Jessie Zhao Course page: 1.
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.
Existence of Non-measurable Set
Great Theoretical Ideas In Computer Science
Cardinality with Applications to Computability
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Chapter 2 Sets and Functions.
The Acceptance Problem for TMs
Discrete Mathematics CS 2610
A Universal Turing Machine
Chapter 3 The Real Numbers.
CS 2210:0001 Discrete Structures Sets and Functions
Lecture12 The Halting Problem
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
2.4 Sequences and Summations
Existence of Non-measurable Set
Counting Sets.
Cardinality of Sets Section 2.5.
Lecture 7 Functions.
Diagonalization Fact: Many books exist.
Discrete Structures for Computer Science
CSE15 Discrete Mathematics 02/27/17
Lesson 5 Relations, mappings, countable and uncountable sets
Lesson 5 Relations, mappings, countable and uncountable sets
Formal Languages, Automata and Models of Computation
Intro to Theory of Computation
Functions Rosen 2.3, 2.5 f( ) = A B Lecture 5: Oct 1, 2.
CS21 Decidability and Tractability
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
Intro to Theory of Computation
Presentation transcript:

Countable or Uncountable…That is the question!

REVIEW Countable Countably Infinite Uncountable Empty set, finite set or countably infinite Countably Infinite The set is a non-empty, non-finite set, and there exists a bijection between N and the set. Uncountable Not countable

HOMEWORK Solutions (1) Yes (2) Yes The function f(n) = 2n is the desired bijection. (2) Yes The function f(n) = is the desired bijection. -n/2 if n is even (n-1)/2 if n is odd

Are the Rational Numbers Countable? What do we know about rational numbers? - -Dense -N in Z in Q -Def of rational #

VOTING Are the Rational Numbers countable? (A) YES (B) NO (C) UNSURE

What about the interval (0,1) What do we know about this interval? -

VOTING Reals in the interval (0,1) countable? (A) YES (B) NO (C) UNSURE

Let’s prove some things to attack these questions! If A & B are disjoint countably infinite sets then AυB is countable.

Proof Since A is countable there exists a bijection f : N  A such that f (i) = ai Since B is countable there exists a bijection g : N  B such that g (i) = bi Construct a function h (i) that orders the elements of A and B in the following way: a1, b1, a2, b2, a3, b3, . . .

Our function h (i) h (i) = Why is h a bijection? RECORD these observations on your worksheet

Let’s prove some things to attack these questions! If A & B are disjoint countably infinite sets then AυB is countable. If A is a countably infinite set and B is a subset of A then B is countable. DONE

If A is a countably infinite set and B is a subset of A then B is countable. Case I: If B is the empty set or a finite set then B is countable. Case II: B is an infinite set Since A is countable we can write the elements of A in the order a1, a2, a3, . . . If B is a subset of A then an infinite number of elements in the above sequence are elements of B. Thus the elements of B form a subsequence (c1, c2, c3,. . .) of the sequence a1, a2, a3, . . ., thus we may order the elements of B as b1, b2, b3, . . . where bk = ck and the function f (i) = bi is a bijection between N and B

Let’s prove some things to attack these questions! If A & B are disjoint countably infinite sets then AυB is countable. If A is a countably infinite set and B is a subset of A then B is countable. DONE DONE

How does (N x N) relate to Q+ υ {0} in size? . 0,2 1,2 2,2 3,2 . . . 0,1 1,1 2,1 3,1 0,0 1,0 2,0 3,0

Can you find an explicit formula for this mapping? CHALLENGE: . 0,2 1,2 2,2 3,2 . . . 0,1 1,1 2,1 3,1 0,0 1,0 2,0 3,0 f(1) = (0,0) f(2) = (1,0) f(3) = (0,1) f(4) = (0,2) f(5) = (1,1) f(6) = (2,0) f(7) = (3,0) f(8) = (2,1) f(9) = (1,2) .

Prove It! Now that we know that NxN is countable we can show that Q is countable. Use the facts we have deduced to show that Q is countable

Proof that Q is countable We know that Q+ υ {0} can be thought of as a subset of NxN Similarly Q- can be thought of as a subset of NxN Q+ υ {0} and Q- are countable because they are subsets of a countable set. We have shown that the union of two countable sets is also countable so (Q+ υ {0}) υ Q- = Q is countable

Hey! Q is countable! Does this change your mind about the real numbers in the interval (0,1) being countable/uncountable? (A) YES (B) NO (C) UNSURE

Cantor’s Diagonalization Argument Cantor proved that the interval of real numbers (0,1) is… We start by noting that each real number in the interval (0,1) has a unique decimal representation of the form 0.d1d2d3d4… (where each di is a number from 0-9). And where decimals with period 1 cannot repeat with the number 9. UNCOUNTABLE!!!

Proof (by contradiction) Assume that f is a bijection from N  (0,1). Then we may say: f(1) = A = 0.a1a2a3a4… f(2) = B = 0.b1b2b3b4… (Where A,B,C,D are distinct real numbers in (0,1)) f(3) = C = 0.c1c2c3c4… f(4) = D = 0.d1d2d3d4… . Choose a digit from 0 to 8 and we will call this a’1 such that a’1 ≠a1 Similarly choose a digit from 0 to 8 for b’1 such that b’2≠ b2 Similarly choose c’3≠ c3 and d’4≠ d4 . . . Clearly f does not map a natural number to the real number 0.a’1b’2c’3d’4… So f is not a bijection. Contradiction!

This proof show us that the interval (0,1) is actually a larger size of infinity than the natural numbers. HENCE (0,1) is a larger size of infinity than Q as well!

Homework Question #1 Question #2 Today we identified two kinds of infinity: the size of the natural numbers and the size of the interval (0,1). Show that there is a bijection between the interval (0,1) and the set of real numbers. What does the existence of this bijection imply about these two sets? Question #2 Can you find a different size of infinity? That is a set that cannot be put into a bijection with N or the interval (0,1). To help you with this problem research the findings of Paul Cohen.

DONE DONE DONE DONE DONE DONE DONE