Abstract
Existence theorems are among the most frequently invoked theorems of mathematics since they assure that a solution to some equation exists. Some of the celebrated examples are the fundamental theorem of algebra, the fixed point theorems of Banach, Brouwer, Leray & Schauder, and Kakutani. With the exception of the Banach fixed point theorem, the classical statements of the above theorems merely assert the existence of a fixed point or a zero point of a map, but their traditional proofs in general do not offer any means of actually obtaining the fixed point or zero point. Many of the classical proofs of fixed point theorems can be given via the concept of the Brouwer degree. We will not need this concept in our subsequent discussions. However, for readers wishing to read up on degree theory we can suggest the books of Amann (1974), Berger (1977), Cronin (1964), Deimling (1974) or Schwartz (1969).
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
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Allower, E.L., Georg, K. (1990). Numerically Implementable Existence Proofs. In: Numerical Continuation Methods. Springer Series in Computational Mathematics, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61257-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-61257-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64764-2
Online ISBN: 978-3-642-61257-2
eBook Packages: Springer Book Archive