Equivalence of Brouwers fixed point theorem and Sperner's lemma

810 Views Asked by At

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!