Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Slides:



Advertisements
Similar presentations
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Advertisements

Chapter 2 The Basic Concepts of Set Theory
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.
Introduction to Computability Theory
The Halting Problem Sipser 4.2 (pages ).
Courtesy Costas Busch - RPI1 A Universal Turing Machine.
CSE115/ENGR160 Discrete Mathematics 02/22/11 Ming-Hsuan Yang UC Merced 1.
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.
Lecture ,3.3 Sequences & Summations Proof by Induction.
A Very Practical Series 1 What if we also save a fixed amount (d) every year?
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.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
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.
1 CMSC 250 Chapter 7, Functions. 2 CMSC 250 Function terminology l A relationship between elements of two sets such that no element of the first set is.
Cardinality of Sets Section 2.5.
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Fall 2015 COMP 2300 Discrete Structures for Computation
Foundations of Discrete Mathematics Chapter 3 By Dr. Dalia M. Gil, Ph.D.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
MAT 3749 Introduction to Analysis Section 1.3 Part I Countable Sets
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
A Universal Turing Machine
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations, Functions, and Countability
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Donald Byrd rev. 28 November 2012
Aim: How can the word ‘infinite’ define a collection of elements?
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.
1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.
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.
CompSci 102 Discrete Math for Computer Science February 7, 2012 Prof. Rodger Slides modified from Rosen.
Discrete Mathematics Set.
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.
Spring 2016 COMP 2300 Discrete Structures for Computation
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
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
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.6 Infinite Sets.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.
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.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
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.
22C:19 Discrete Structures Sequence and Sums Fall 2014 Sukumar Ghosh.
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Discrete Mathematics CS 2610
A Universal Turing Machine
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Discrete Structures for Computer Science
Countable and Countably Infinite Sets
ICS 253: Discrete Structures I
Formal Languages, Automata and Models of Computation
Discrete Mathematics CS 2610
Chapter 2 The Basic Concepts of Set Theory
Presentation transcript:

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 7.4 Cardinality of Sets

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Finite and Infinite Sets Historically, the term cardinal number was introduced to describe the size of a set. A finite set is one that has no element at all or that can be put into one-to-one correspondence with {1, 2, …, n } for some positive integer n. An infinite set is a nonempty set that cannot be put into one-to-one correspondence with {1, 2, …, n } for any positive integer n. 2

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Cardinality of Sets Let A and B by any sets. A has the same cardinality as B if, and only if, there is an one-to-one correspondence from A to B. In other words, A has the same cardinality as B if, and only if, there is a function f from A to B that is one-to- one and onto. 3

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Properties of Cardinality For all sets A, B, and C : a.Reflexive property of cardinality: A has the same cardinality as A. b.Symmetric property of cardinality: If A has the same cardinality as B, then B has the same cardinality as A. c.Transitive property of cardinality: If A has the same cardinality as B and B has the same cardinality as C, then A has the same cardinality as C. By b, A and B have the same cardinality if, and only if, A has the same cardinality as B or B has the same cardinality as A. 4

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Infinite Sets and Proper Subsets with the Same Cardinality Q) Let 2Z be the set of all even integers. Prove that 2Z and Z have the same cardinality. A) Consider the function defined as follows: Now, to prove the theorem, we need to show that 1.H is one-to-one, and 2.H is onto. 5

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Infinite Sets and Proper Subsets with the Same Cardinality Q) Let 2Z be the set of all even integers. Prove that 2Z and Z have the same cardinality. A) Consider the function defined as follows: 1.H is one-to-one 6

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Infinite Sets and Proper Subsets with the Same Cardinality Q) Let 2Z be the set of all even integers. Prove that 2Z and Z have the same cardinality. A) Consider the function defined as follows: 2. H is onto. 7

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Countable Sets 8 The set of counting numbers {1, 2, 3, 4, …} is, in a sense, the most basic of all infinite sets. A set A having the same cardinality as this set is called countably infinite. A set is called countable if and only if, it is finite or countably infinite. A set that is not countable is called uncountable.

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Countability of Z, the Set of All Integers 9 Show that the set Z of all integers is countable. 0

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Countability of Z, the Set of All Integers 10 Show that the set Z of all integers is countable. 1

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Countability of Z, the Set of All Integers 11 Show that the set Z of all integers is countable. 2

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Countability of Q, the Set of All Positive Rational Numbers 12 Show that the set is countable.

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Other Theorems 13 The set of real numbers, R, is uncountable. Proof (by contradiction) Suppose there is an one-to-one correspondence f which sends the set of real numbers in [0,1] to {1, …, n } for some n. Then, given any fixed number n is, you can find a set of real numbers C in [0,1] such that | C | > n. No one-to-one function can be defined over the domain with size larger than n and co-domain with size n. Any subset of any countable set is countable. Corollary: Any set with an uncountable subset is uncountable. (contrapositvie)

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University The Cardinality of the Set of All Real Numbers 14 Show that the set of all real numbers has the same cardinality as the set of real numbers between 0 and 1.

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University The Cardinality of the Set of All Real Numbers 15 Show that the set of all real numbers has the same cardinality as the set of real numbers between 0 and 1.