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.

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

Basic Structures: Functions and Sequences
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.
EE1J2 – Discrete Maths Lecture 9
Introduction to Computability Theory
Great Theoretical Ideas in Computer Science.
CSE115/ENGR160 Discrete Mathematics 02/22/11 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/21/12
Functions f( ) = A B Lecture 15: Nov 4.
CHAPTER 4 Decidability Contents Decidable Languages
Sequence A list of objects arranged in a particular order.
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
CS 310 – Fall 2006 Pacific University CS310 The Halting Problem Section 4.2 November 15, 2006.
A Very Practical Series 1 What if we also save a fixed amount (d) every year?
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.
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.
Functions Section 2.3.
Cardinality of Sets Section 2.5.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Sequences & Summations CS 1050 Rosen 3.2. Sequence A sequence is a discrete structure used to represent an ordered list. A sequence is a function from.
Sequences and Summations
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.
Functions Section 2.3.
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.
Functions Section 2.3. Section Summary Definition of a Function. – Domain, Cdomain – Image, Preimage Injection, Surjection, Bijection Inverse Function.
Relations, Functions, and Countability
COMPSCI 102 Introduction to Discrete Mathematics.
Functions Section 2.3.
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.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Cardinality with Applications to Computability Lecture 33 Section 7.5 Wed, Apr 12, 2006.
Computability Universal Turing Machine. Countability. Halting Problem. Homework: Show that the integers have the same cardinality (size) as the natural.
Great Theoretical Ideas in Computer Science.
CompSci 102 Discrete Math for Computer Science February 7, 2012 Prof. Rodger Slides modified from Rosen.
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
Section Section Summary Definition of a Function. Domain, Codomain Image, Preimage Injection, Surjection, Bijection Inverse Function Function Composition.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.6 Infinite Sets.
Binomial Coefficients and Identities
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.
1 A Universal Turing Machine. 2 Turing Machines are “hardwired” they execute only one program A limitation of Turing Machines: Real Computers are re-programmable.
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.
CSE15 Discrete Mathematics 03/01/17
Great Theoretical Ideas In Computer Science
Cardinality with Applications to Computability
The Acceptance Problem for TMs
Discrete Mathematics CS 2610
2.4 Sequences and Summations
Counting Sets.
Cardinality of Sets Section 2.5.
Countable or Uncountable…That is the question!
Lecture 7 Functions.
Diagonalization Fact: Many books exist.
Discrete Structures for Computer Science
CSE15 Discrete Mathematics 02/27/17
Countable and Countably Infinite Sets
ICS 253: Discrete Structures I
Formal Languages, Automata and Models of Computation
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.
Intro to Theory of Computation
Presentation transcript:

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. A set that is not countable is uncountable. The set of real numbers R is an uncountable set.

Showing that a Set is Countable An infinite set is countable if and only if it is possible to list the elements of the set in a sequence (indexed by the positive integers). The reason for this is that a one-to-one correspondence f from the set of positive integers to a set S can be expressed in terms of a sequence a 1,a 2,…, a n,… where a 1 = f( 1 ), a 2 = f( 2 ),…, a n = f(n),…

Showing that a Set is Countable Example 1 : Show that the set of positive even integers E is countable set. Solution: Let f ( x ) = 2 x … …… Then f is a bijection from N to E since f is both one-to-one and onto. To show that it is one-to-one, suppose that f (n) = f (m). Then 2n = 2m, and so n = m. To see that it is onto, suppose that t is an even positive integer. Then t = 2 k for some positive integer k and f(k) = t.

The Positive Rational Numbers are Countable Constructing the List First list p/q with p + q = 2. Next list p/q with p + q = 3 And so on. First row q = 1. Second row q = 2. etc. 1, ½, 2, 3, 1/3,1/4, 2/3, ….

The Real Numbers are Uncountable Example: Show that the set of real numbers is uncountable. Solution: The method is called the Cantor diagnalization argument, and is a proof by contradiction. 1. Suppose R is countable. Then the real numbers between 0 and 1 are also countable (any subset of a countable set is countable - an exercise in the text). 2. The real numbers between 0 and 1 can be listed in order r 1, r 2, r 3,…. 3. Let the decimal representation of this listing be 4. Form a new real number with the decimal expansion where 5. r is not equal to any of the r 1, r 2, r 3,... Because it differs from r i in its ith position after the decimal point. Therefore there is a real number between 0 and 1 that is not on the list since every real number has a unique decimal expansion. Hence, all the real numbers between 0 and 1 cannot be listed, so the set of real numbers between 0 and 1 is uncountable. 6. Since a set with an uncountable subset is uncountable (an exercise), the set of real numbers is uncountable. Georg Cantor ( )