Dice Question Streamline Icon: https://streamlinehq.com

Strength of the effectively Hausdorff-to-effectively discrete subspace principle

Determine the reverse-mathematical strength of the statement that every infinite effectively Hausdorff countable second-countable (CSC) space has an infinite effectively discrete subspace; identify over which subsystems of second-order arithmetic (e.g., RCA0, WKL0, ACA0) this principle is provable.

Information Square Streamline Icon: https://streamlinehq.com

Background

Earlier sections prove that every infinite Hausdorff CSC space has an infinite discrete subspace (Theorem 5.2) and that every infinite effectively Hausdorff CSC space which is not discrete has an infinite effectively discrete subspace (Theorem 5.3). They also construct a computable effectively Hausdorff CSC space that is discrete but has no infinite computable effectively discrete subspace (Theorem 5.4), and an ω-model where the stronger statement fails (Corollary 5.5).

Despite these results, the precise strength of the universally quantified principle for effectively Hausdorff CSC spaces remains undetermined within the reverse mathematics hierarchy.

References

Our investigation leaves several questions unanswered, and raises some new ones. The first of these concerns the one case of the Ginsburg–Sands theorem for Hausdorff spaces we were not able to fully characterize. Question 8.1. What is the strength of the statement that every infinite effectively Hausdorff CSC space has an infinite effectively discrete subspace?

The Ginsburg--Sands theorem and computability theory (2402.05990 - Benham et al., 8 Feb 2024) in Section 8, Question 8.1