I'm looking for a proof that Brouwer's fixed point theorem implies Sperner's lemma. All proof I've found just prove that there must be at least one completely colored n-simplex, not that there must be an odd number of them.
Thanks in advance!
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
3 years ago