countable sets
play

Countable Sets Bernd Schr oder logo1 Bernd Schr oder Louisiana - PowerPoint PPT Presentation

Feb 22, 2024 •209 likes •1.77k views

Finite vs. Infinite Countability Examples Countable Sets Bernd Schr oder logo1 Bernd Schr oder Louisiana Tech University, College of Engineering and Science Countable Sets Finite vs. Infinite Countability Examples Introduction

  1. Finite vs. Infinite Countability Examples Theorem. N is equivalent to Z . � n − 1 2 ; if n is odd , Proof. The function f ( n ) : = if n is even , is bijective. − n 2 ; (Good exercise.) Definition. A set C is called countably infinite iff there is a bijective function f : N → C. A set C is called countable iff C is finite or countably infinite. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  2. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  3. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  4. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  5. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  6. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  7. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  8. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  9. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  10. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  11. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). Suppose for a contradiction that g is not surjective. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  12. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). Suppose for a contradiction that g is not surjective. Let b : = min f − 1 � � S \ g [ N ] logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  13. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). Suppose for a contradiction that g is not surjective. Let � � b : = min f − 1 � � f − 1 [ S ] ∩{ 1 ,..., b − 1 } � S \ g [ N ] and let k : = � . � � logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  14. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). Suppose for a contradiction that g is not surjective. Let � � b : = min f − 1 � � f − 1 [ S ] ∩{ 1 ,..., b − 1 } � S \ g [ N ] and let k : = � . � � Then f − 1 [ S ] ∩{ 1 ,..., b − 1 } = { n 1 ,..., n k } logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  15. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). Suppose for a contradiction that g is not surjective. Let � � b : = min f − 1 � � f − 1 [ S ] ∩{ 1 ,..., b − 1 } � S \ g [ N ] and let k : = � . � � Then f − 1 [ S ] ∩{ 1 ,..., b − 1 } = { n 1 ,..., n k } and � � f − 1 [ S ] \{ n 1 ,..., n k } b = min . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  16. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). Suppose for a contradiction that g is not surjective. Let � � b : = min f − 1 � � f − 1 [ S ] ∩{ 1 ,..., b − 1 } � S \ g [ N ] and let k : = � . � � Then f − 1 [ S ] ∩{ 1 ,..., b − 1 } = { n 1 ,..., n k } and � � f − 1 [ S ] \{ n 1 ,..., n k } b = min . But then b = n k + 1 , contradiction. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  17. Finite vs. Infinite Countability Examples Theorem. If C is countable and S ⊆ C, then S is countable. Proof. WLOG let S be infinite. Let f : N → C be bijective and let n 1 : = min f − 1 [ S ] . For k ∈ N , define n k + 1 recursively. Once � � f − 1 [ S ] \{ n 1 ,..., n k } n 1 ,..., n k are chosen, let n k + 1 : = min . Define g : N → S by g ( k ) : = f ( n k ) . Then g is injective (and it really maps into S ). Suppose for a contradiction that g is not surjective. Let � � b : = min f − 1 � � f − 1 [ S ] ∩{ 1 ,..., b − 1 } � S \ g [ N ] and let k : = � . � � Then f − 1 [ S ] ∩{ 1 ,..., b − 1 } = { n 1 ,..., n k } and � � f − 1 [ S ] \{ n 1 ,..., n k } b = min . But then b = n k + 1 , contradiction. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  18. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  19. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ ✲ m logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  20. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  21. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ 4 3 2 1 ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  22. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ 4 r r r r 3 r r r r 2 r r r r 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  23. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) 4 r r r r ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 3 r r r r ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 2 r r r r ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  24. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ . ··· . . ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) 4 r r r r ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 3 r r r r ··· ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 2 r r r r ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  25. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ . ··· . . ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) 4 r r r r ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 3 r r r r ··· first one ■ ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 2 r r r r ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  26. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ . ··· . . ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) 4 r r r r next two ■ ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 3 r r r r ··· first one ■ ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 2 r r r r ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  27. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n ✻ . ··· . . next three ■ ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) 4 r r r r next two ■ ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 3 r r r r ··· first one ■ ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 2 r r r r ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  28. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable n next four ✻ ■ . ··· . . next three ■ ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) 4 r r r r next two ■ ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 3 r r r r ··· first one ■ ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 2 r r r r ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  29. Finite vs. Infinite Countability Examples Theorem. The set N × N is countable f ( m , n ) : = 1 2 ( m + n − 1 )( m + n − 2 )+ n n next four ✻ ■ . ··· . . next three ■ ( 1 , 4 ) ( 2 , 4 ) ( 3 , 4 ) ( 4 , 4 ) 4 r r r r next two ■ ( 1 , 3 ) ( 2 , 3 ) ( 3 , 3 ) ( 4 , 3 ) 3 r r r r ··· first one ■ ( 1 , 2 ) ( 2 , 2 ) ( 3 , 2 ) ( 4 , 2 ) 2 r r r r ( 1 , 1 ) ( 2 , 1 ) ( 3 , 1 ) ( 4 , 1 ) 1 r r r r ✲ m 1 2 3 4 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  30. Finite vs. Infinite Countability Examples Proof. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  31. Finite vs. Infinite Countability Examples Proof. We claim that the function f : N × N → N defined by f ( m , n ) : = 1 2 ( m + n − 1 )( m + n − 2 )+ n is bijective. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  32. Finite vs. Infinite Countability Examples Proof. We claim that the function f : N × N → N defined by f ( m , n ) : = 1 2 ( m + n − 1 )( m + n − 2 )+ n is bijective. First, an auxiliary equation. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  33. Finite vs. Infinite Countability Examples Proof. We claim that the function f : N × N → N defined by f ( m , n ) : = 1 2 ( m + n − 1 )( m + n − 2 )+ n is bijective. First, an auxiliary equation. f ( m − 1 , n + 1 ) logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  34. Finite vs. Infinite Countability Examples Proof. We claim that the function f : N × N → N defined by f ( m , n ) : = 1 2 ( m + n − 1 )( m + n − 2 )+ n is bijective. First, an auxiliary equation. f ( m − 1 , n + 1 ) 1 � �� � = ( m − 1 )+( n + 1 ) − 1 ( m − 1 )+( n + 1 ) − 2 + n + 1 2 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  35. Finite vs. Infinite Countability Examples Proof. We claim that the function f : N × N → N defined by f ( m , n ) : = 1 2 ( m + n − 1 )( m + n − 2 )+ n is bijective. First, an auxiliary equation. f ( m − 1 , n + 1 ) 1 � �� � = ( m − 1 )+( n + 1 ) − 1 ( m − 1 )+( n + 1 ) − 2 + n + 1 2 1 = 2 ( m + n − 1 )( m + n − 2 )+ n + 1 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  36. Finite vs. Infinite Countability Examples Proof. We claim that the function f : N × N → N defined by f ( m , n ) : = 1 2 ( m + n − 1 )( m + n − 2 )+ n is bijective. First, an auxiliary equation. f ( m − 1 , n + 1 ) 1 � �� � = ( m − 1 )+( n + 1 ) − 1 ( m − 1 )+( n + 1 ) − 2 + n + 1 2 1 = 2 ( m + n − 1 )( m + n − 2 )+ n + 1 = f ( m , n )+ 1 . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  37. Finite vs. Infinite Countability Examples Proof (injectivity). logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  38. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  39. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . Base step, m = 1: logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  40. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . Base step, m = 1: Let f ( 1 , n ) = f ( a , b ) . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  41. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . Base step, m = 1: Let f ( 1 , n ) = f ( a , b ) . Then f ( 1 , n ) = f ( a , b ) logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  42. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . Base step, m = 1: Let f ( 1 , n ) = f ( a , b ) . Then f ( 1 , n ) = f ( a , b ) 1 1 2 ( 1 + n − 1 )( 1 + n − 2 )+ n = 2 ( a + b − 1 )( a + b − 2 )+ b logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  43. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . Base step, m = 1: Let f ( 1 , n ) = f ( a , b ) . Then f ( 1 , n ) = f ( a , b ) 1 1 2 ( 1 + n − 1 )( 1 + n − 2 )+ n = 2 ( a + b − 1 )( a + b − 2 )+ b n ( n − 1 )+ 2 n = ( a + b − 1 )( a + b − 2 )+ 2 b logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  44. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . Base step, m = 1: Let f ( 1 , n ) = f ( a , b ) . Then f ( 1 , n ) = f ( a , b ) 1 1 2 ( 1 + n − 1 )( 1 + n − 2 )+ n = 2 ( a + b − 1 )( a + b − 2 )+ b n ( n − 1 )+ 2 n = ( a + b − 1 )( a + b − 2 )+ 2 b n 2 + n ( a + b − 1 ) 2 − ( a + b − 1 )+ 2 b = logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  45. Finite vs. Infinite Countability Examples Proof (injectivity). We will prove by induction on m that f ( m , n ) = f ( a , b ) implies ( m , n ) = ( a , b ) . Base step, m = 1: Let f ( 1 , n ) = f ( a , b ) . Then f ( 1 , n ) = f ( a , b ) 1 1 2 ( 1 + n − 1 )( 1 + n − 2 )+ n = 2 ( a + b − 1 )( a + b − 2 )+ b n ( n − 1 )+ 2 n = ( a + b − 1 )( a + b − 2 )+ 2 b n 2 + n ( a + b − 1 ) 2 − ( a + b − 1 )+ 2 b = n 2 + n ( a + b − 1 ) 2 +( b − a + 1 ) = logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  46. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  47. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  48. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  49. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  50. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  51. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  52. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  53. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  54. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  55. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  56. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  57. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  58. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  59. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  60. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 ≤ 0 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  61. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 ≤ 0, contradiction. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  62. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 ≤ 0, contradiction. Thus a + b − 1 = n . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  63. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 ≤ 0, contradiction. Thus a + b − 1 = n . Hence b − a + 1 = n logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  64. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 ≤ 0, contradiction. Thus a + b − 1 = n . Hence b − a + 1 = n , and then 2 b = 2 n and a = 1 logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  65. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 ≤ 0, contradiction. Thus a + b − 1 = n . Hence b − a + 1 = n , and then 2 b = 2 n and a = 1, as was to be proved. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  66. Finite vs. Infinite Countability Examples Proof (injectivity, cont.). n 2 + n = ( a + b − 1 ) 2 +( b − a + 1 ) Suppose for a contradiction that a + b − 1 < n . Then b − a + 1 ≤ b < n and ( a + b − 1 ) 2 +( b − a + 1 ) < n 2 + n , contradiction. Thus a + b − 1 ≥ n . Suppose for a contradiction that a + b − 1 = n + k for some k ∈ N . Then ( a + b − 1 ) 2 = ( n + k ) 2 = n 2 + 2 kn + k 2 , so that b − a + 1 = − ( 2 k − 1 ) n − k 2 . Hence n + k − b + 1 = a = ( 2 k − 1 ) n + k 2 + b + 1, which implies that 2 b = ( − 2 k + 2 ) n + k − k 2 ≤ 0, contradiction. Thus a + b − 1 = n . Hence b − a + 1 = n , and then 2 b = 2 n and a = 1, as was to be proved. Hence f ( 1 , n ) = f ( a , b ) implies ( 1 , n ) = ( a , b ) . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  67. Finite vs. Infinite Countability Examples Proof (injectivity, concl.). logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  68. Finite vs. Infinite Countability Examples Proof (injectivity, concl.). Induction step ( m − 1 ) → m : logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  69. Finite vs. Infinite Countability Examples Proof (injectivity, concl.). Induction step ( m − 1 ) → m : Let f ( m , n ) = f ( a , b ) . logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

  70. Finite vs. Infinite Countability Examples Proof (injectivity, concl.). Induction step ( m − 1 ) → m : Let f ( m , n ) = f ( a , b ) . WLOG m , a � = 1. logo1 Bernd Schr¨ oder Louisiana Tech University, College of Engineering and Science Countable Sets

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Countable listed a 0 ,a 1 ,a 2 ,. N same as bij A or A finite Sets so Z , Z countable +

Countable listed a 0 ,a 1 ,a 2 ,. N same as bij A or A finite Sets so Z , Z countable +

Mathematics for Computer Science Countable Sets MIT 6.042J/18.062J A is countable iff can be Countable listed a 0 ,a 1 ,a 2 ,. N same as bij A or A finite Sets so Z , Z countable + Albert R Meyer, March 4, 2015 Albert R Meyer,

599 views • 3 slides
B2.1 Cardinality of Infinite Sets The cardinality of a finite set is the number of elements it

B2.1 Cardinality of Infinite Sets The cardinality of a finite set is the number of elements it

Discrete Mathematics in Computer Science September 30, 2020 B2. Countable Sets Discrete Mathematics in Computer Science B2.1 Cardinality of Infinite Sets B2. Countable Sets Malte Helmert, Gabriele R oger B2.2 Hilberts Hotel

257 views • 8 slides
Undecidability Everything is an Integer Countable and Uncountable Sets Turing Machines

Undecidability Everything is an Integer Countable and Uncountable Sets Turing Machines

Undecidability Everything is an Integer Countable and Uncountable Sets Turing Machines Recursive and Recursively Enumerable Languages 1 Integers, Strings, and Other Things Data types have become very important as a programming tool.

506 views • 48 slides
Order isomorphisms of countable dense real sets which are universal entire functions (preliminary

Order isomorphisms of countable dense real sets which are universal entire functions (preliminary

Order isomorphisms of countable dense real sets which are universal entire functions (preliminary report) Paul Gauthier (extinguished professor) New Developments in Complex Analysis and Function Theory Heraklion, 2-6 July 2018 1 ORDER An

505 views • 19 slides
Examples Example The countable product R with the uniform topology is an example of a first

Examples Example The countable product R with the uniform topology is an example of a first

Examples Example The countable product R with the uniform topology is an example of a first countable space which is not second countable. Theorem 1 A subspace of a first (second) countable space is first (second) countable. 2 A countable

332 views • 5 slides
Sum-free sets and shift automorphisms Peter J. Cameron p.j.cameron@qmul.ac.uk Workshop on Graphs

Sum-free sets and shift automorphisms Peter J. Cameron p.j.cameron@qmul.ac.uk Workshop on Graphs

Sum-free sets and shift automorphisms Peter J. Cameron p.j.cameron@qmul.ac.uk Workshop on Graphs and Asynchronous Systems, 20 May 2008 Cayley graphs Theorem 1. There is a countable graph R such that, if a random graph X on a fixed countable

1.19k views • 5 slides
Section 2.5 Section Summary ! Cardinality ! Countable Sets ! Computability Cardinality Definition

Section 2.5 Section Summary ! Cardinality ! Countable Sets ! Computability Cardinality Definition

Section 2.5 Section Summary ! Cardinality ! Countable Sets ! Computability 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 ( i.e.

388 views • 14 slides
CSE 322, Fall 2010 A set is countable if it is finite or has the same cardinality as the natural

CSE 322, Fall 2010 A set is countable if it is finite or has the same cardinality as the natural

Cardinality Two sets have equal cardinality if there is a bijection (1-to-1 and onto function) between them CSE 322, Fall 2010 A set is countable if it is finite or has the same cardinality as the natural numbers Examples:

451 views • 9 slides
UNCOUNTABLE nouns only have one form; e.g. work, love, food, intelligence, water, information. Most

UNCOUNTABLE nouns only have one form; e.g. work, love, food, intelligence, water, information. Most

What s in a name? More than you imagine... English nouns can be countable or uncountable COUNTABLE nouns have a singular and plural form e.g. one book / three books, one person / three people With countable nouns we can use a/an or some e.g. I

210 views • 18 slides
The countable homogeneous poset Recognising R Peter J Cameron R is the unique countable graph with

The countable homogeneous poset Recognising R Peter J Cameron R is the unique countable graph with

The countable homogeneous poset Recognising R Peter J Cameron R is the unique countable graph with the property School of Mathematical Sciences that, for any finite graphs G and H

203 views • 4 slides
Lecture 8 Fractals and Strange Attractors What is a fractal? Countable and uncountable

Lecture 8 Fractals and Strange Attractors What is a fractal? Countable and uncountable

Lecture 8 Fractals and Strange Attractors What is a fractal? Countable and uncountable sets, examples The Cantor set Fractal dimensions Similarity dimension Box dimension Pointwise and correlation dimension Why

372 views • 19 slides
Above countable products of countable equivalence relations Assaf Shani UCLA European Set

Above countable products of countable equivalence relations Assaf Shani UCLA European Set

Above countable products of countable equivalence relations Assaf Shani UCLA European Set Theory Conference, Vienna July 2019 The -jumps of Clemens and Coskey Definition (Clemens-Coskey) Let E be an equivalence relation on X and a

108 views • 9 slides
Strongly generic sets Ludomir Newelski Instytut Matematyczny Uniwersytet Wroc lawski June

Strongly generic sets Ludomir Newelski Instytut Matematyczny Uniwersytet Wroc lawski June

Strongly generic sets Ludomir Newelski Instytut Matematyczny Uniwersytet Wroc lawski June 2011 Newelski Strongly generic sets Set-up T is a countable complete theory, M is a model of T , G is a group definable in M . We work in a monster

1.66k views • 162 slides
EN ENGL GLISH ISH LAN ANGUAG GUAGE TOPIC 48: GRAMMAR: COUNTABLE AND UNCOUNTABLE NOUNS.

EN ENGL GLISH ISH LAN ANGUAG GUAGE TOPIC 48: GRAMMAR: COUNTABLE AND UNCOUNTABLE NOUNS.

ACADEMIC LYCEUM INTERNATIONAL HOUSE TASHKENT 1 st semester EN ENGL GLISH ISH LAN ANGUAG GUAGE TOPIC 48: GRAMMAR: COUNTABLE AND UNCOUNTABLE NOUNS. COUNTABLE AND UNCOUNTABLE NOUNS In English grammar, countable nouns are individual

210 views • 10 slides
Discrete Mathematics in Computer Science B2. Countable Sets Malte Helmert, Gabriele R oger

Discrete Mathematics in Computer Science B2. Countable Sets Malte Helmert, Gabriele R oger

Discrete Mathematics in Computer Science B2. Countable Sets Malte Helmert, Gabriele R oger University of Basel September 30, 2020 Malte Helmert, Gabriele R oger (University of Basel) Discrete Mathematics in Computer Science September

415 views • 29 slides
Block Products for Algebras over Countable words and Applications to Logic Saptarshi Sarkar, IIT

Block Products for Algebras over Countable words and Applications to Logic Saptarshi Sarkar, IIT

Block Products for Algebras over Countable words and Applications to Logic Saptarshi Sarkar, IIT Bombay Joint work with: Bharat Adsul, IIT Bombay &amp; A.V. Sreejith, IIT Goa LICS 2019 This talk is in the setting of Countable Linear Orderings

1.37k views • 136 slides
Countability and the Uncountable Lecture 21 How do you count infinity? How do you make precise

Countability and the Uncountable Lecture 21 How do you count infinity? How do you make precise

Countability and the Uncountable Lecture 21 How do you count infinity? How do you make precise the intuition that there are more real numbers than integers? Both are infinite... When do we say two infinite sets A &amp; B have the same size?

470 views • 16 slides
CSE 105 THEORY OF COMPUTATION Fall 2016 http://cseweb.ucsd.edu/classes/fa16/cse105-abc/ T

CSE 105 THEORY OF COMPUTATION Fall 2016 http://cseweb.ucsd.edu/classes/fa16/cse105-abc/ T

CSE 105 THEORY OF COMPUTATION Fall 2016 http://cseweb.ucsd.edu/classes/fa16/cse105-abc/ T odays lecture Countable and uncountable sets Diagonalization There are languages not in RE or coRE An interesting undecidable language

554 views • 23 slides
A What is |A|? B Solution: 0 3x+4 1000 iff -4/3 x 996/3 a 1 injection

A What is |A|? B Solution: 0 3x+4 1000 iff -4/3 x 996/3 a 1 injection

Section 2.4: Countability a 1 We can compare the cardinality of two sets. |A| = |B| means there is a bijection b bijection 2 between A and B. c 3 |A| |B| means there is an injection from A to B. d 4 |A| &lt; |B| means |A| |B|

547 views • 15 slides
computability and complexity theory CSE P531 Instructor: Prof. James R. Lee Spring 2016 TA:

computability and complexity theory CSE P531 Instructor: Prof. James R. Lee Spring 2016 TA:

computability and complexity theory CSE P531 Instructor: Prof. James R. Lee Spring 2016 TA: Jeffrey Hon Course web page: http://www.cs.washington.edu/csep531 Sign up for the mailing list! Textbooks: Computational Complexity: A Modern

650 views • 31 slides
Undecidable problems I There quite a few undecidable problems For example, program verification

Undecidable problems I There quite a few undecidable problems For example, program verification

Undecidable problems I There quite a few undecidable problems For example, program verification is in general not solvable We will discuss an undecidable example called the halting problem November 17, 2020 1 / 11 A TM I A TM = { M ,

392 views • 11 slides
The Rado graph and the Urysohn space Theorem 1 (Erd os and R enyi) There is a countable

The Rado graph and the Urysohn space Theorem 1 (Erd os and R enyi) There is a countable

Slide 1 Slide 3 The random graph The Rado graph and the Urysohn space Theorem 1 (Erd os and R enyi) There is a countable graph R with the property that a random countable graph (edges chosen independently with probabil- ity 1 2 ) is

375 views • 4 slides
Section 2.5 1 Cardinality Definition : The cardinality of a set A is equal to the cardinality of

Section 2.5 1 Cardinality Definition : The cardinality of a set A is equal to the cardinality of

Section 2.5 1 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 ( i.e. , a bijection) from A to B . If there is a one-to-one

544 views • 13 slides
CS3102 Theory of Computation www.cs.virginia.edu/~njb2b/cstheory/s2020 Warm up: 1. Why does

CS3102 Theory of Computation www.cs.virginia.edu/~njb2b/cstheory/s2020 Warm up: 1. Why does

CS3102 Theory of Computation www.cs.virginia.edu/~njb2b/cstheory/s2020 Warm up: 1. Why does math consider infinity? 2. Do infinite things exist IBM 1301 disk storage unit (1961) 28MB capacity $2,100 per month ($18,000 today) Logistics

545 views • 20 slides

More recommend