Metric fixed point theory and partial impredicativity
David Fern\'andez-Duque, Paul Shafer, Henry Towsner, Keita Yokoyama

TL;DR
This paper explores the logical strength of various fixed point theorems within reverse mathematics, establishing their equivalences to well-known subsystems and principles, and analyzing their proof-theoretic implications.
Contribution
It proves the Priess-Crampe & Ribenboim fixed point theorem in RCA_0 and characterizes Caristi's fixed point theorem's strength via the transfinite leftmost path principle.
Findings
Priess-Crampe & Ribenboim fixed point theorem is provable in RCA_0.
Caristi's fixed point theorem is equivalent to the transfinite leftmost path principle.
Weakenings of Caristi's theorem relate to WKL_0 and ACA_0.
Abstract
We show that the Priess-Crampe & Ribenboim fixed point theorem is provable in . Furthermore, we show that Caristi's fixed point theorem for both Baire and Borel functions is equivalent to the transfinite leftmost path principle, which falls strictly between and . We also exhibit several weakenings of Caristi's theorem that are equivalent to and to .
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 · Mathematical and Theoretical Analysis · Logic, Reasoning, and Knowledge
