Resolvability and monotone normality

Abstract: A space

X

is said to be

k a p p a

-resolvable (resp. almost

k a p p a

-resolvable) if it contains

k a p p a

dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets).

X

is maximally resolvable iff it is

D e l t a (X)

-resolvable, where

D e l t a (X) = m i n | G | : G e e m p t y s e t o p e n .

We show that every crowded monotonically normal (in short: MN) space is

o m e g a

-resolvable and almost

m u

-resolvable, where

m u = m i n 2^{o m e g a}, o m e g a_{2}

. On the other hand, if

k a p p a

is a measurable cardinal then there is a MN space

X

with

D e l t a (X) = k a p p a

such that no subspace of

X

is

o m e g a_{1}

-resolvable. Any MN space of cardinality

< a l e p h_{o} m e g a

is maximally resolvable. But from a supercompact cardinal we obtain the consistency of the existence of a MN space

X

with

| X | = D e l t a (X) = a l e p h_{o m e g a}

such that no subspace of

X

is

o m e g a_{2}

-resolvable.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Resolvability and monotone normality