On a converse to Banach's Fixed Point Theorem
M\'arton Elekes

TL;DR
This paper investigates the properties of metric spaces with the Banach Fixed Point Property (BFPP), demonstrating that certain open or simple sets with BFPP must be closed, and providing minimal examples of non-closed sets with BFPP.
Contribution
It proves that open or certain definable subsets of 2^n with BFPP are necessarily closed, and constructs the simplest non-closed examples in 2 with BFPP, including non-measurable sets.
Findings
Open or 2_ ext{si} 2_ ext{de} sets with BFPP are closed.
Existence of 2_ ext{si} and 2_ ext{de} non-closed sets with BFPP in 2.
Non-measurable sets can have the BFPP.
Abstract
We say that a metric space possesses the \emph{Banach Fixed Point Property (BFPP)} if every contraction has a fixed point. The Banach Fixed Point Theorem says that every complete metric space has the BFPP. However, E. Behrends pointed out \cite{Be1} that the converse implication does not hold; that is, the BFPP does not imply completeness, in particular, there is a non-closed subset of possessing the BFPP. He also asked \cite{Be2} if there is even an open example in , and whether there is a 'nice' example in . In this note we answer the first question in the negative, the second one in the affirmative, and determine the simplest such examples in the sense of descriptive set theoretic complexity. Specifically, first we prove that if is open or is simultaneously and and has the BFPP then is closed. Then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Complexity and Algorithms in Graphs
