Fall 2014 COMP 2300 Discrete Structures for Computation

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

2. 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. Finite and Infinite Sets

3. Let A and B by any sets. A has the same cardinality as B if, and only if, there is an one-to-one correspondencefrom 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. Cardinality of Sets

4. For all sets A,B, and C: • Reflexive property of cardinality: A has the same cardinality as A. • Symmetric property of cardinality: If A has the same cardinality as B, then B has the same cardinality as A. • 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. Properties of Cardinality

5. 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 • H is one-to-one, and • H is onto. Infinite Sets and Proper Subsets with the Same Cardinality

6. Q) Let 2Z be the set of alleven integers. Prove that 2Z and Z have the same cardinality. A) Consider the function defined as follows: • H is one-to-one Infinite Sets and Proper Subsets with the Same Cardinality

7. 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. Infinite Sets and Proper Subsets with the Same Cardinality

8. The set of counting numbers {1, 2, 3, 4, …} is, in asense, 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. Countable Sets

9. Show that the set Z of all integers is countable. 0 Countability of Z, the Set of All Integers

10. Show that the set Z of all integers is countable. 1 Countability of Z, the Set of All Integers

11. Show that the set Z of all integers is countable. 2 Countability of Z, the Set of All Integers

12. Show that the set is countable. Countability of Q , the Set of All Positive Rational Numbers

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 somen. 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) Other Theorems

14. Show that the set of all real numbers has the same cardinality as the set of real numbers between 0 and 1. 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. The Cardinality of the Set of All Real Numbers