This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: EECS 501 COUNTABLE VS. UNCOUNTABLE SETS Fall 2001 DEF: A set is finite if it has a finite number of elements. DEF: Two sets A, B are in onetoone correspondence (11) if there exists a 11 mapping between elements of A and elements of B . NOTE: Two finite sets are 11 IFF they have same number of elements. EX: { a, b, c . . . z } and { 101 , 102 . . . 126 } are 11 (26 elements each). NOTE: An infinite set can be 11 with a proper subset of itself: A = { 1 , 2 , 3 , 4 . . . } and B = { 2 , 4 , 6 , 8 . . . } are 11: Mapping b = 2 a . Z = { . . . 2 , 1 , , 1 , 2 . . . } and Y = Z + = { 1 , 2 , 3 . . . } are 11: 11 Mapping: z = y/ 2 if y is even; z = (1 y ) / 2 if y is odd. DEF: A set is countably infinite IFF it is 11 with { integers } . i.e.: You can count the elements of the set (this may take forever!). EX: { even integers } and { odd integers } are countably infinite. DEF: A set is countable IFF it is either finite or countably infinite. NOTE: A set is countable IFF it is 11 with another countable set. THM: The set of lattice points Z 2 = { ( i, j ) : i, j { integers }} is countable....
View
Full
Document
This note was uploaded on 07/22/2011 for the course EECS 370 taught by Professor Lehman during the Spring '10 term at University of Florida.
 Spring '10
 Lehman

Click to edit the document details