The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma

Abstract

We classify the computational content of the Bolzano-Weierstrass Theorem and variants thereof in the Weihrauch lattice. For this purpose we first introduce the concept of a derivative or jump in this lattice and we show that it has some properties similar to the Turing jump. Using this concept we prove that the derivative of closed choice of a computable metric space is the cluster point problem of that space. By specialization to sequences with a relatively compact range we obtain a characterization of the Bolzano-Weierstrass Theorem as the derivative of compact choice. In particular, this shows that the Bolzano-Weierstrass Theorem on real numbers is the jump of Weak König's Lemma. Likewise, the Bolzano-Weierstrass Theorem on the binary space is the jump of the lesser limited principle of omniscience LLPO and the Bolzano-Weierstrass Theorem on natural numbers can be characterized as the jump of the idempotent closure of LLPO. We also introduce the compositional product of two Weihrauch degrees f and g as the supremum of the composition of any two functions below f and g, respectively. We can express the main result such that the Bolzano-Weierstrass Theorem is the compositional product of Weak König's Lemma and the Monotone Convergence Theorem. We also study the class of weakly limit computable functions, which are functions that can be obtained by composition of weakly computable functions with limit computable functions. We prove that the Bolzano-Weierstrass Theorem on real numbers is complete for this class. Likewise, the unique cluster point problem on real numbers is complete for the class of functions that are limit computable with finitely many mind changes. We also prove that the Bolzano-Weierstrass Theorem on real numbers and, more generally, the unbounded cluster point problem on real numbers is uniformly low limit computable. Finally, we also discuss separation techniques.

This version includes an addendum by Andrea Cettolo, Matthias Schröder, and the authors of the original paper. The addendum closes a gap in the proof of Theorem 11.2, which characterizes the computational content of the Bolzano-Weierstraß Theorem for arbitrary computable metric spaces

References in corpus (1)

• Infinite Oracle Queries in Type-2 Machines (Extended Abstract)

Cited by in corpus (45)

• Computability and analysis: the legacy of Alan Turing
• On the algebraic structure of Weihrauch degrees
• Probabilistic Computability and Choice
• The degree structure of Weihrauch-reducibility
• Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
• Non-deterministic computation and the Jayne-Rogers Theorem
• A comparison of concepts from computable analysis and effective descriptive set theory
• Finite choice, convex choice and finding roots
• Connected Choice and the Brouwer Fixed Point Theorem
• On the Uniform Computational Content of Ramsey's Theorem
• On computability and disintegration
• Completion of Choice
• Bounded variation and the strength of Helly's selection theorem
• On the Uniform Computational Content of Computability Theory
• Finding descending sequences through ill-founded linear orders
• Weihrauch goes Brouwerian
• Weihrauch-completeness for layerwise computability
• Many-one reductions and the category of multivalued functions
• Generalized Effective Reducibility
• Algebraic properties of the first-order part of a problem
• The descriptive theory of represented spaces
• A Galois connection between Turing jumps and limits
• On the Uniform Computational Content of the Baire Category Theorem
• Dividing by zero - how bad is it, really?
• Game characterizations and lower cones in the Weihrauch degrees
• The Vitali Covering Theorem in the Weihrauch Lattice
• Computability and Analysis, a Historical Approach
• Projection operators in the Weihrauch lattice
• How constructive is constructing measures?
• A topological view on algebraic computation models
• Inside the Muchnik Degrees I: Discontinuity, Learnability, and Constructivism
• A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract)
• Borel-piecewise continuous reducibility for uniformization problems
• Effectivity and Reducibility with Ordinal Turing Machines
• Ramsey's theorem and products in the Weihrauch degrees
• Inside the Muchnik Degrees II: The Degree Structures induced by the Arithmetical Hierarchy of Countably Continuous Functions
• A semi-potential for finite and infinite sequential games
• Stashing And Parallelization Pentagons
• Universality, optimality, and randomness deficiency
• The Weihrauch lattice at the level of ${\mathbf{\Pi }}_1^1{-\mathsf{CA}}_0$: the Cantor-Bendixson theorem
• A jump operator on the Weihrauch degrees
• There is No Composition in the Computable Reducibility Degrees
• An update on Weihrauch complexity, and some open questions
• Some computability-theoretic reductions between principles around ${\mathsf{ATR}}_0$
• From Bolzano-Weierstraß to Arzelà-Ascoli