Abstract
We prove a generalization of Brouwer's famous fixed point theorem to discontinuous maps. The main result shows that for discontinuous functions on a compact convex domainX one can always find a pointx ∈X such that ∥x−f(x)∥ is less than a certain measure of discontinuity. Applications to artificial neural nets, economic equilibria and analysis are given.
Similar content being viewed by others
References
E.L. Allgower and K. Georg, “Predictor-corrector and simplicial methods for approximating fixed points and zero points of nonlinear mappings,” A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Springer, Berlin—Heidelberg—New York, 1983) pp. 15–56.
G. Aumann,Reelle Funktionen (Springer, Berlin—Heidelberg—New York, 1969).
L.J. Cromme and I.E. Dammasch, “Stability and convergence of compensation type algorithms,”Journal of Mathematical Biology 27 (1989) 327–340.
K. Georg, “Zur numerischen Realisierung von Kontinuitätsmethoden mit Prädiktor—Korrektor- oder simplizialen Verfahren, Habilitationsschrift, Universität Bonn (Bonn, 1982).
W. Hildenbrand, D. Schmeidler and S. Zamir, “Existence of approximate equilibria and cores,”Econometrica 41 (1973) 1159–1166.
S. Kakutani, “A generalization of Brouwer's fixed point theorem,”Duke Mathematical Journal 8 (1941) 457–459
A.M. Khan, “Some approximate equilibria,”Journal of Mathematical Economics 2 (1975) 63–86.
G. Sansone and R. Conti,Nonlinear Differential Equations (Pergamon Press, Oxford, 1964).
M. Todd,The Computation of Fixed Points and Applications (Springer, Berlin—Heidelberg—New York, 1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cromme, L.J., Diener, I. Fixed point theorems for discontinuous mapping. Mathematical Programming 51, 257–267 (1991). https://doi.org/10.1007/BF01586937
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01586937