[Paper Review] Reverse Mathematics of topology: dimension, paracompactness, and splittings

Sam Sanders|arXiv (Cornell University)|Aug 27, 2018

Computability, Logic, AI Algorithms15 references4 citations

TL;DR

This paper investigates the reverse mathematics of topological concepts—dimension, paracompactness, and splittings—within Kohlenbach's higher-order Reverse Mathematics framework. It shows that key results like the paracompactness of the unit interval and the Urysohn identity require full second-order arithmetic, contrasting sharply with their provability in the base theory RCA₀ in second-order RM, highlighting a fundamental divergence between the two frameworks.

ABSTRACT

Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, i.e. non-set-theoretic, mathematics. As suggested by the title, this paper deals with the study of the topological notions of dimension and paracompactness, inside Kohlenbach's higher-order RM. As to splittings, there are some examples in RM of theorems $A, B, C$ such that $A\leftrightarrow(B\wedge C)$, i.e. $A$ can be split into two independent (fairly natural) parts $B$ and $C$, and the aforementioned topological notions give rise to a number of splittings involving highly natural $A, B, C$. Nonetheless, the higher-order picture is markedly different from the second-one: in terms of comprehension axioms, the proof in higher-order RM of e.g. the paracompactness of the unit interval requires full second-order arithmetic, while the second-order/countable version of paracompactness of the unit interval is provable in the base theory of second-order RM. We obtain similarly 'exceptional' results for the Urysohn identity, the Lindelöf lemma, and partitions of unity. We show that our results exhibit a certain robustness, in that they do not depend on the exact definition of cover, even in the absence of the axiom of choice.

Motivation & Objective

• To investigate the logical strength of topological notions—dimension and paracompactness—within higher-order Reverse Mathematics.
• To examine whether natural theorems in topology can be split into independent, meaningful components (splittings) in the higher-order setting.
• To assess the robustness of results across different definitions of cover, especially in the absence of the axiom of choice.
• To compare the proof-theoretic strength of topological theorems in higher-order RM with their counterparts in second-order RM.
• To explore the foundational implications of these differences for the 'Big Five' systems and the Gödel hierarchy.

Proposed method

• Uses Kohlenbach’s higher-order Reverse Mathematics framework, extending second-order arithmetic to include sets of sets, sets of sets of sets, etc.
• Applies the ECF-translation to relate higher-order systems to second-order systems and analyze proof-theoretic strength.
• Employs the neighbourhood function principle as a base theory to ensure robustness and minimality of assumptions.
• Analyzes the provability of key topological theorems—paracompactness of [0,1], Urysohn identity, Lindelöf lemma, partitions of unity—under varying comprehension and choice axioms.
• Assesses independence from the definition of cover by testing multiple formalizations, even without countable choice.
• Uses Figure 1 to visualize the position of key theorems in the Gödel hierarchy, distinguishing between medium-range and strong systems.

Experimental results

Research questions

• RQ1 What is the minimal comprehension strength required to prove the paracompactness of the unit interval in higher-order Reverse Mathematics?
• RQ2 How do the logical strengths of topological theorems like the Urysohn identity and Lindelöf lemma compare between higher-order and second-order RM?
• RQ3 Can natural splittings—where a theorem A is equivalent to B ∧ C with B and C independent—be identified for topological concepts in higher-order RM?
• RQ4 Are the results robust to changes in the definition of a cover, particularly in the absence of the axiom of choice?
• RQ5 To what extent do the results depend on the specific formulation of topological concepts, and how do they align with the standard 'Big Five' systems?

Key findings

• The paracompactness of the unit interval requires full second-order arithmetic in higher-order RM, in contrast to its provability in RCA₀ in second-order RM.
• The Urysohn identity for dimension, when applied to [0,1], also requires comprehension axioms as strong as full second-order arithmetic.
• The Lindelöf lemma and partitions of unity similarly require strong comprehension, placing them in the medium to strong range of the Gödel hierarchy.
• The results are robust: they do not depend on the exact definition of a cover, even when the axiom of choice is absent.
• The higher-order framework reveals a marked divergence from second-order RM, particularly in the proof-theoretic strength of topological theorems.
• The base theory based on the neighbourhood function principle supports the robustness of the results and avoids reliance on weak choice principles.