Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T19:35:47.418Z Has data issue: false hasContentIssue false

DISTINGUISHING PERFECT SET PROPERTIES IN SEPARABLE METRIZABLE SPACES

Published online by Cambridge University Press:  22 January 2016

ANDREA MEDINI*
Affiliation:
KURT GÖDEL RESEARCH CENTER FOR MATHEMATICAL LOGIC UNIVERSITY OF VIENNA WÄHRINGER STRASSE 25 A-1090 WIEN, AUSTRIAE-mail: andrea.medini@univie.ac.atURL: http://www.logic.univie.ac.at/∼medinia2/
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

All spaces are assumed to be separable and metrizable. Our main result is that the statement “For every space X, every closed subset of X has the perfect set property if and only if every analytic subset of X has the perfect set property” is equivalent to b > ω1 (hence, in particular, it is independent of ZFC). This, together with a theorem of Solecki and an example of Miller, will allow us to determine the status of the statement “For every space X, if every Γ subset of X has the perfect set property then every Γ′ subset of X has the perfect set property” as Γ, Γ′ range over all pointclasses of complexity at most analytic or coanalytic.

Along the way, we define and investigate a property of independent interest. We will say that a subset W of 2ω has the Grinzing property if it is uncountable and for every uncountable Y ⊆ W there exists an uncountable collection consisting of uncountable subsets of Y with pairwise disjoint closures in 2ω. The following theorems hold.

  1. (1) There exists a subset of 2ω with the Grinzing property.

  2. (2) Assume MA + ¬CH. Then 2ω has the Grinzing property.

  3. (3) Assume CH. Then 2ω does not have the Grinzing property.

The first result was obtained by Miller using a theorem of Todorčević, and is needed in the proof of our main result.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2016