Comments by "eggynack" (@eggynack) on "TED-Ed"
channel.
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
Again, you can't just subtract infinity from infinity. This subtraction has an infinity of results, and thus no singular result. The guests can indeed be paired up one to one with the hotel rooms. There is the same quantity of each. However, it is 100% provably the case, and I literally just proved it was the case in that post, that the guests can be paired up with hotel rooms such that there is one hotel room left over. There are different sizes of infinity, yes. However, any two countably infinite sets, for example the set of natural numbers and the set of natural numbers plus or minus some number of elements, will be exactly the same size every time. They are different sets, but one is in no way bigger than the other.
1
-
We do not know that the result will be 0. We know only that the result can be zero. Again, the result can be any number of things, zero included. As for your other statement, set B isn't just set A with all the elements added to. Set B is set A with the element zero added in. In other words, you had infinite objects, and then you added another object.
This situation is identical to the hotel scenario. You had infinite guests, and then you add a guest, and you have the same number of guests. In fact, we could just label the new guest 0, and all the old guests as natural numbers, and the proof I presented would show that the number of guests hasn't changed. Infinity doesn't always equal infinity, but every countable infinity, definitionally, does equal every other countable infinity. I can prove this for any two countable sets you care to name, but, given that the definition of countable infinity is the existence of a bijection to the natural numbers, it feels unnecessary.
1
-
1
-
1
-
Okay, start with the hotel full of guests. Guest in every single room. We can take all the guests out of all the rooms, and then put every single one of them back into only odd rooms without leaving any guests over. I'ma change it to even rooms for convenience's sake. Label each guest with the room they're in. Now, take those guests and put them in room 2n, where n is their label. So, guest one goes to room two, guest two goes to room four, room three goes to room six, and so on. Exact same rooms, exact same guests, but now our "subtraction" yields infinity.
As for the two sets, it's really pretty straightforward. Set A is the integers from one upwards. Set B is the integers from zero upwards. Set B thus has one more element than A does. Now, we will pair each element of set A with each element of set B. One from set A pairs to zero from set B, two from set A pairs to one from set B, and, in general, n from set A pairs to n-1 from set B. Thus, every single element of A is mapped to exactly one element of B. So, the sets are the same size.
1
-
Infinity isn't switching size. infinity=infinity/2=infinity-1. The reason using algebra doesn't work here is because changing a thing into x doesn't magically change its functioning. Infinity has a set of properties. Finite numbers have a different set of properties. You find those properties somewhat unintuitive, but what I've been presenting is a set of totally accurate proofs. Skip x entirely. If you want to say infinity, say infinity, because infinity is the thing you're working with. In using x, you're trying to generalize something that can't be generalized, and then making it specific to a set it doesn't work for.
Straightforwardly, by saying that x/2=x, you're saying something that hasn't been proved, because you only know this to be the case for infinity. X is a thing you solve for, not a thing you put stuff into such that it's true. If x/2=x, then x is 0, or infinity. The reason this doesn't work is the exact reason it doesn't work to say that x/2=4, and then conclude that, because we can replace x with anything, 16/2=4.
As for the sets, yes, there is an element in B that is not in A. That's the whole point. In spite of this, it is provably, and I've proved it for you, the case that the sets are the same size. The natural numbers are also the same size as the integers, and the rationals, and the primes. These are different sets, some proper subsets of others, but they are all the exact same size.
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
@anonygent No, no one is taking up the odd numbered rooms. The situation is that the hotel is full, then the buses arrive, and then the initial guests are moved to the even rooms, and then the buses are moved to the other rooms. Based on my stated mapping. This weird middle step where guests take up the odd rooms is arbitrary and irrelevant. If it occurs then the hotel is full and then you can just run my mapping from the beginning.
Moving people to p^n is in no regard a more permanent solution than mine. After you're done, and new infinite buses arrive, you still have to move guests around to accommodate the new guests. It's not all that much harder to calculate either. You just have to sort by size the numbers with the stated quality. So you have, say, 11, and 11^2, and 11*13, and 11^2*13 and so on.
1
-
@anonygent No, no one is taking up the odd numbered rooms. The situation is that the hotel is full, then the buses arrive, and then the initial guests are moved to the even rooms, and then the buses are moved to the other rooms. Based on my stated mapping. This weird middle step where guests take up the odd rooms is arbitrary and irrelevant. If it occurs then the hotel is full and then you can just run my mapping from the beginning.
Moving people to p^n is in no regard a more permanent solution than mine. After you're done, and new infinite buses arrive, you still have to move guests around to accommodate the new guests. It's not all that much harder to calculate either. You just have to sort by size the numbers with the stated quality. So you have, say, 11, and 11^2, and 11*13, and 11^2*13 and so on.
1
-
1
-
1
-
1
-
1
-
1
-
1
-
All the buses have the same amount of guests as one bus, but you still need to determine where any given person goes. You say you're just sending all the bus folk to odd numbered rooms. Where do you put the fifth person from the third bus? You can't associate people in the first bus with odd rooms in sequence, because then the second bus would have no odds left. Similarly, you can't associate the first person in each bus with the odd rooms in sequence, because then no one else on each bus would get a room.
Personally, I'm not a big fan of the method in the video. The rest of the video makes a big deal of keeping the hotel fully occupied, and then they ditch that for the infinite buses. My preferred mapping is that people in bus n go to rooms where the n+1st prime is the smallest prime factor, and the hotel folk go to even numbers. Or, the first guest goes to room one, and then they fill up evens, so every room gets filled. So, the fifth bus would have its guests go to rooms that are divisible by 13, but not by 2, 3, 5, 7, or 11. This method should assign every guest to a room and every room to a guest.
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
If you're not doing something that involves high level math on at least some level, then you're unlikely to require this kinda knowledge. Still, I'd hesitate to call it totally pointless. Math forms the underpinnings for physics, frequently with infinity involved somewhere, and physics dictates the mechanics of everything in existence. Similarly, I'd think that people in these non-mathy careers may take some interest in the theoretically infinitely rough structure of a fractal, which is a concept that arises in most natural constructs.
In short, infinity helps us understand reality, and basically anything you do is going to touch upon that reality on some level. So, I dunno, it might come up.
1
-
1
-
1
-
1
-
It's not really clear how, exactly, you're filling these rooms that aren't straight up powers. Where does, say, bus three seat five go? That's really the goal here, to get some explicit mapping of people to rooms.
That said, it is possible to fill all the rooms. My method is that bus m seat n goes to the nth number where m is the least prime factor. So bus one goes to numbers divisible by 2 (2, 4, 6, 8...), bus two goes to numbers divisible by 3 but not 2 (3, 9, 15, 21...), bus three goes to rooms divisible by 5 but not 2 or 3 (5, 25, 35, 55...) and so on.
The only caveats are that we call the hotel bus one, the first bus bus two, and so on, and that we start bus one with room one and then continue the sequence from there. This method creates a one to one mapping between guests and rooms.
1
-
1