On the strength of weak compactness

DOI10.3233/COM-12010zbMATH Open1270.03128arXiv1106.5124OpenAlexW3104977456MaRDI QIDQ4904465FDOQ4904465

Authors: Alexander P. Kreuzer 

Publication date: 30 January 2013

Published in: Computability (Search for Journal in Brave)

Abstract: We study the logical and computational strength of weak compactness in the separable Hilbert space ell_2. Let weak-BW be the statement the every bounded sequence in ell_2 has a weak cluster point. It is known that weak-BW is equivalent to ACA_0 over RCA_0 and thus that it is equivalent to (nested uses of) the usual Bolzano-Weierstra{ss} principle BW. We show that weak-BW is instance-wise equivalent to the Pi^0_2-CA. This means that for each Pi^0_2 sentence A(n) there is a sequence (x_i) in ell_2, such that one can define the comprehension functions for A(n) recursively in a cluster point of (x_i). As consequence we obtain that the Turing degrees d > 0" are exactly those degrees that contain a weak cluster point of any computable, bounded sequence in ell_2. Since a cluster point of any sequence in the unit interval [0,1] can be computed in a degree low over 0', this show also that instances of weak-BW are strictly stronger than instances of BW. We also comment on the strength of weak-BW in the context of abstract Hilbert spaces in the sense of Kohlenbach and show that his construction of a solution for the functional interpretation of weak compactness is optimal.

Full work available at URL: https://arxiv.org/abs/1106.5124

Recommendations

• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• On the removal of weak compactness arguments in proof mining
• From Bolzano‐Weierstraß to Arzelà‐Ascoli
• Weihrauch degrees, omniscience principles and weak computability
• scientific article; zbMATH DE number 2236626

zbMATH Keywords

Turing degreeweak sequential compactnessabstract Hilbert spaceWeihrauch latticeBolzano-Weierstrass principle

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)

Cited In (14)

• Title not available (Why is that?)
• From Bolzano‐Weierstraß to Arzelà‐Ascoli
• Weak compactness of the set of \(\varepsilon\)-extensions
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• On the non-extendibility of strongness and supercompactness through strong compactness
• Weak compactness in constructive spaces
• Title not available (Why is that?)
• The weakly compact reflection principle need not imply a high order of weak compactness
• Weakly absolute retracts for bicompacts
• Title not available (Why is that?)
• On the uniform computational content of computability theory
• On strong lifting compactness for the weak\(^*\) topology
• (Strong) weak exhaustiveness and (strong uniform) continuity
• Title not available (Why is that?)

This page was built for publication: On the strength of weak compactness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904465)