
Joel H. Shapiro 

Abstract:
Notes for a lecture I gave at the Portland State University Analysis Seminar during the Spring term 2015. They present a proof of the Brouwer FixedPoint Theorem using a remarkable combinatorial lemma due to Emanuel Sperner. The method works in R^{N} for all N, but for simplicity the discussion is restricted to N=2.

Download .pdf file (1.6 MB) 