SearcharxivSearch

arXiv · 2106.05602

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 $\cup_{x\in [0,1]}(x-\Psi(x), x+\Psi(x))$ for arbitrary $\Psi:[0,1]\rightarrow \mathbb{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 $\leftrightarrow$ [WHBU$^{+}$+HBC$_{0}$ + WKL$_0]$ where WHBU$^{+}$ is a strengthening of Vitali's covering theorem and where HBC$_{0}$ is the Heine-Borel theorem for countable collections (and \textbf{not sequences}) of basic open intervals, as formulated by Borel himself in 1898.

Explore related subjects

Keep this discovery

BibTeXRIS

Sam Sanders. 2021-06-10. Splittings and robustness for the Heine-Borel theorem. https://arxiv.org/abs/2106.05602

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO