The strength of compactness in Computability Theory and Nonstandard Analysis
Dag Normann, Sam Sanders

TL;DR
This paper explores the computational complexity of compactness in analysis and nonstandard analysis, linking new fan functionals to well-known logical axioms and revealing the high logical strength of compactness principles.
Contribution
It introduces and analyzes new fan functionals related to compactness, connecting them to classical comprehension axioms and extending the understanding of compactness in reverse mathematics.
Findings
New fan functionals compute finite sub-covers and sequences for uncountable covers.
Compactness principles reach high levels of logical strength, including $ ext{Pi}_2^1$-CA$_0$ and $ ext{Sigma}_1^2$-separation.
Results mirror properties of fan functionals in the context of reverse mathematics and nonstandard analysis.
Abstract
Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space for uncountable covers. The most basic question is: how hard is it to compute a finite sub-cover from such a cover of ? Another natural question is: how hard is it to compute a sequence that covers minus a measure zero set from such a cover? The special and weak fan functionals respectively compute such finite sub-covers and sequences. In this paper, we establish the connection between these new fan functionals on one hand, and various well-known comprehension axioms on the other hand, including arithmetical comprehension, transfinite recursion, and the Suslin functional. In the spirit of Reverse Mathematics, we also analyse the logical…
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
TopicsComputability, Logic, AI Algorithms · Mathematical and Theoretical Analysis · Advanced Topology and Set Theory
