Abstract
Probably the most famous fixed-point theorem states that a continuous function from a closed n-cell to itself leaves at least one point fixed. The Dutch mathematician L. E. J. Brouwer proved this result in 1912 [5] using degree theory. An equivalent theorem in the case of differentiable functions was proved earlier by Bohl [4], who used Green’s theorem. Our concern is more with the computation of fixed points than their existence; we will follow a later approach based on the purely combinatorial lemma of Sperner [62]. This approach is closest to the algorithms we shall develop, and the machinery will be of value later. However, to avoid some of the cumbersome details, we will give only an intuitive idea of the notions of simplex and triangulation. A rigorous treatment appears in Chapter III.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Todd, M.J. (1976). Brouwer’s Theorem. In: The Computation of Fixed Points and Applications. Lecture Notes in Economics and Mathematical Systems, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50327-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-50327-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07685-8
Online ISBN: 978-3-642-50327-6
eBook Packages: Springer Book Archive