Comments by "B" (@user-pr6ed3ri2k) on "How An Infinite Hotel Ran Out Of Room" video.

  1. 57
  2. 11
  3. 6
  4. 5
  5. 4
  6. 4
  7. 4
  8. 4
  9. 4
  10. 4
  11. 3
  12. 3
  13. 3
  14. 3
  15. 3
  16. 3
  17. 3
  18. 3
  19. 3
  20. 3
  21. 3
  22. 3
  23. 3
  24. 3
  25. 3
  26. 2
  27. 2
  28. 2
  29. 2
  30.  @robotnoir5299  also, the axioms were designed to be as reasonable as possible. I can list them here in oversimplified form: 1. 2 sets are equal iff (if and only if) they have the same elements (axiom of extensionality) 2. a set doesn't have infinite nested sets. (axiom of foundation) 3. set builder only used to define a certain subset of a set. if you don't have this, you'll get that weird error when you make the set of all sets that don't contain themselves and the set of everything. (axiom schema of restricted comprehension)(axiom 2 also prevents paradoxes)(schema because set builder can have many different predicates an inputs) 4. if you have 2 sets, x and y, the set that contains both x and y exists. (axiom of pairing) 5. the set you get from grouping all the members of the members of a set (this set has only sets as members and those sets have sets)(basically a nested set) exists. (axiom of union) 6. the set of all outputs of a function f(x) that you can define exists. (axiom schema of replacement)(schema because there are many different kinds of f(x) (obviously)) 7. there exists a set X with infinitely many unique members (example: {1, 2, 3, ...}) (axiom of infinity) 8. the powerset of a set exists. (take a set, make a set of all sets that are like the original set except missing or not missing some of the elements)(the party bus in the video is equivalent to the numbers between zero and 1 in size which is equivalent to the powerset of naturals (the room numbers; {1, 2, 3, ...}) in size. ) (axiom of powerset) thats standard 8 in zf zfc has a ninth one 9. for all sets R, there is some binary relation X (like a < x, only compares 2 elements) that well-orders R. (well-ordering theorem)
    2
  31. 2
  32. 2
  33. 2
  34. 2
  35. 2
  36. 2
  37. 2
  38. 2
  39. 2
  40. 2
  41. 2
  42. 2
  43. 2
  44. 2
  45. 2
  46. 2
  47. 2
  48. 2
  49. 2
  50. 2
  51. 2
  52. 2
  53. 2
  54. 2
  55. 2
  56. 2
  57. 2
  58. 2
  59. 2
  60. 2
  61. 2
  62. 2
  63. 2
  64. 2
  65. 2
  66. 2
  67. 2
  68. 2
  69. 2
  70. 2
  71. 2
  72. 2
  73. 2
  74. 2
  75. 2
  76. 2
  77. 2
  78. 2
  79. 2
  80. 2
  81. 2
  82. 2
  83. 2
  84. 2
  85. 2
  86. 2
  87. 2
  88. 2
  89. 2
  90. 2
  91. 2
  92. 2
  93. 2
  94. 2
  95. 2
  96. 2
  97. 2
  98. 2
  99. 2
  100. 2
  101. 2
  102. 1
  103. 1
  104. 1
  105. 1
  106. 1
  107. 1
  108. 1
  109.  @fall4sleepfall4sleep26  i choose the reals, and i will now prove why the reals are more numerous. lets first state that the size of the naturals is a cardinal number, called aleph 0, or N_0 for short. next, try to show a 1 to 1 correspondence with the naturals (N_0) and the reals between 0 and 1. 1. 0.92848287373727... 2. 0.838274991873848... 3. 0.848479292841910... 4. 0.928391938488288... 5. 0.828478283838828... ... I can order the reals between 0 and 1 any way i like, because there is no way to find the next number in the reals. next, take the first digit of the first number, which is in this case 9,and add 1 unless it's 9, which it is, so subtract 1, and make a new decimal starting with that number (0.8). next, get the 2nd of the 2nd number (3) and add 1 and put it in the new string of numbers. (0.83) repeat. (0.83948...). there we go, a new number that's guaranteed to be different to ALL the numbers on the list, because we defined it to be different. as you can see, I just proved that the numbers 0<number<1 is bigger than the naturals. next, lets prove all of the reals. first notice that the reals will be the exact same form as the numbers between 0 and 1, except you put a natural at the start. (after all, the numbers between 0 and 1 are all the decimals possible, all numbers of the form 0.something) since the size of the naturals is N_0 by definition, we can multiply N_0 and the size of the numbers between 0 and 1, and by the rules of cardinal math, big infinity will absorb small infinity, and since i just proved that (size of numbers between 0 and 1) > (size of your set, the naturals), i have just proven that the size of the set R, the reals, is bigger than the size of N, the naturals. any complaints?
    1
  110. 1
  111. 1
  112. 1
  113. 1
  114. 1
  115. 1
  116. 1
  117. 1
  118. 1
  119. 1
  120. 1
  121. 1
  122. 1
  123. 1
  124. 1
  125. 1
  126. 1
  127. 1
  128. 1
  129. 1
  130. 1
  131. 1
  132. 1
  133. 1
  134. 1
  135. 1
  136. 1
  137. 1
  138. 1
  139. 1
  140. 1
  141. 1
  142. 1
  143. 1
  144. 1
  145. 1
  146. 1
  147. 1
  148. 1
  149. 1
  150. 1
  151. 1
  152. 1
  153. 1
  154. 1
  155. 1
  156. 1