The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space

Abstract: Given a space

X

we investigate the descriptive complexity class

G_{X}

of the set

F F_{0} (X)

of all its closed zero-dimensional subsets, viewed as a subset of the hyperspace

F F (X)

of all closed subsets of

X

. We prove that

m a x G_{X}; X e x t a n a l y t i c = p c a

and

for any countable ordinal

x i g e q 1

. In particular we prove that there exists a one-dimensional Polish subpace of

2^{w} o i m e s R^{2}

for which

F F_{0} (X)

is not in the smallest non trivial pointclass closed under complementation and the Souslin operation

m a t h c a l A,

.

This page was built for publication: The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space