Splittings and robustness for the Heine-Borel theorem
Abstract
The Heine-Borel theorem for uncountable coverings has recently emerged as an interesting and central principle in higher-order Reverse Mathematics and computability theory, formulated as follows: HBU is the Heine-Borel theorem for uncountable coverings given as x∈ [0,1](x-(x), x+(x)) for arbitrary :[0,1]→ R+, i.e. the original formulation going back to Cousin (1895) and Lindel\"of (1903). In this paper, we show that HBU is equivalent to its restriction to functions continuous almost everywhere, an elegant robustness result. We also obtain a nice splitting HBU [WHBU++HBC0 + WKL0] where WHBU+ is a strengthening of Vitali's covering theorem and where HBC0 is the Heine-Borel theorem for countable collections (and not sequences) of basic open intervals, as formulated by Borel himself in 1898.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.