Axiom of Choice, 13 Essence of Set Theory

[@wilderuhl3450]

Underrated channel. Thanks for the great videos.

[@feelmehish8506]

These videos are super well made

[@hugoballroom5510]

Thank you for this series. I have been looking for a video that explicates the motivation this Axiom. Yours is the only one i can find. The animation and narration are so clear and concise. So glad to have found your channel. I also follow 3b1b and agree with you that style is a great model for such videos.

[@StratosFair]

Thank you for these videos, I learn a lot and it's a lot of fun with your wonderful animations

[@lior_shiboli]

This deserves so many more views It's really interesting

[@whyre69]

true

[@dsagman]

this video should have many thousands more views

[@AntonParamonov-e2d]

Thank you for the wonderful playlist! By the way, the problem about hats and prisoners can be solved more “optimally”, namely with only one prisoner having a chance to guess his hat wrong. The strategy is the first prisoner encoding the parity of a distance from a sequence he is seeing to the class representative (that is correct since the distance is finite). Knowing this information the second prisoner can guess his hat for sure, knowing the parity and the second prisoners guess the third prisoner can guess his color and so on.

[@procdalsinazev]

True, but that is a different hat problem. In the hat problem in the video, the prisoners have no information from the others.

[@GiovannaIwishyou]

Thank you! Your channel is a real gem.

[@y0n1n1x]

THANK YOU SO MUCH

[@jakeaustria5445]

Thanks

[@ostihpem]

Too complicated. Here is an easy example. We have a set x with non-empty sets, disjunctive to each other, but we do not know anything about the elements of these sets of x. So we cannot use the axiom of separation or replacement or whatnot because we couldn‘t even formulate the rules to apply. But AC guarantees us a set with exactly one element of the sets of x as its elements.