Covering versus partitioning with Polish spaces

Abstract: Given a completely metrizable space

X

, let

m a t h f r a k p a r (X)

denote the smallest possible size of a partition of

X

into Polish spaces, and

m a t h f r a k c o v (X)

the smallest possible size of a covering of

X

with Polish spaces. Observe that

m a t h f r a k c o v (X) l e q m a t h f r a k p a r (X)

for every

X

, because every partition of

X

is also a covering. We prove it is consistent relative to a huge cardinal that the strict inequality

m a t h f r a k c o v (X) < m a t h f r a k p a r (X)

can hold for some completely metrizable space

X

. We also prove that using large cardinals is necessary for obtaining this strict inequality, because if

m a t h f r a k c o v (X) < m a t h f r a k p a r (X)

for any completely metrizable

X

, then

0^{d} a g g e r

exists.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Covering versus partitioning with Polish spaces