Ekeland's variational principle in weak and strong systems of arithmetic
Abstract
We analyze Ekeland's variational principle in the context of reverse mathematics. We find that that the full variational principle is equivalent to 11- CA0, a strong theory of second-order arithmetic, while natural restrictions (e.g.~to compact spaces or continuous functions) yield statements equivalent to weak K\"onig's lemma ( WKL0) and to arithmetical comprehension ( ACA0). We also find that the localized version of Ekeland's variational principle is equivalent to 11- CA0 even when restricting to continuous functions. This is a rare example of a statement about continuous functions having great logical strength.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.