Abstract
In this paper we prove several results concerning the complexity of a set relative to compact sets. We prove that for any Polish space X and Borel set B ⊆ X, if B is not , then there exists a compact zero-dimensional P ⊆ X such that p ∩ X is not . We also show that it is consistent with ZFC that, for any A ⊆ ωω, if for all compact K ⊆ ωωA ∩ K is , then A is . This generalizes to in place of assuming the consistency of some hypotheses involving determinacy. We give an alternative proof of the following theorem of Saint-Raymond. Suppose X and Y are compact metric spaces and f is a continuous surjection of X onto Y. Then, for any A ⊆ Y, A is in Y iff f−1(A) is in X. The non-trivial part of this result is to show that taking pre-images cannot reduce the Borel complexity of a set. The techniques we use are the definability of forcing and Wadge games.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematical Proceedings of the Cambridge Philosophical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
