That channel just released a video on the same topic.
If anything it looks like it fails precisely because the space is not homologically trivial, but I'm a bit unsure how to make that precise. A similar set up with just [0,1]^n as preference space works perfectly fine just by averaging all the scores for each candidate.
I kind of sense that requiring a function X^k -> X to exist is somehow hard if X is not 'simple', but I'm not yet sure what the obstruction is.
> While this applies to discrete rankings and voter preferences, one might wonder if it’s a unique property of its discrete nature in how candidates are only ranked by ordering. Unfortunately, a similarly flavored result holds even in the continuous setting! It seems there’s no getting around the fact that voting is pretty hard to get right.
I don’t follow any of this paragraph.