Resolvability in c.c.c. generic extensions
Lajos Soukup, Adrienne Stanley

TL;DR
This paper explores the conditions under which topological spaces are resolvable in c.c.c. generic extensions, linking resolvability to monotonic functions and set-theoretic assumptions, and characterizing when spaces gain resolvability after forcing.
Contribution
It establishes equivalences for ω₁-resolvability in c.c.c. extensions, characterizes spaces that are monotonically ω₁-resolvable, and examines the impact of set-theoretic assumptions on resolvability.
Findings
ω₁-resolvability is equivalent to monotonic ω₁-resolvability in certain extensions
Certain c.c.c. spaces with specified density and size are monotonically ω₁-resolvable
Existence of non-monotonically ω₁-resolvable spaces under large cardinal assumptions
Abstract
Every crowded space is -resolvable in the c.c.c generic extension of the ground model. We investigate what we can say about -resolvability in c.c.c-generic extensions for ? A topological space is "monotonically -resolvable" if there is a function such that for each . We show that given a space the following statements are equivalent: (1) is -resolvable in some c.c.c-generic extension, (2) is monotonically -resolvable. (3) is -resolvable in the Cohen-generic extension . We investigate which spaces are monotonically -resolvable. We show that if a topological space is c.c.c, and ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Homotopy and Cohomology in Algebraic Topology
Resolvability in c.c.c. generic extensions
Lajos Soukup
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences
and
Adrienne Stanley
Department of Mathematics, University of Northern Iowa
Abstract.
Every crowded space is -resolvable in the c.c.c generic extension of the ground model.
We investigate what we can say about -resolvability in c.c.c-generic extensions for ?
A topological space is monotonically -resolvable if there is a function such that
[TABLE]
for each .
We show that given a space the following statements are equivalent:
- (1)
is -resolvable in some c.c.c-generic extension, 2. (2)
is monotonically -resolvable. 3. (3)
is -resolvable in the Cohen-generic extension .
We investigate which spaces are monotonically -resolvable. We show that if a topological space is c.c.c, and , where , then is monotonically -resolvable.
On the other hand, it is also consistent, modulo the existence of a measurable cardinal, that there is a space with which is not monotonically -resolvable.
The characterization of -resolvability in c.c.c generic extension raises the following question: is it true that crowded spaces from the ground model are -resolvable in ?
We show that (i) if then every crowded c.c.c. space is -resolvable in , (ii) if there is no weakly inaccessible cardinals, then every crowded space is -resolvable in .
On the other hand, it is also consistent, modulo a measurable cardinals, that there is a crowded space with such that remains irresolvable after adding a single Cohen real.
Key words and phrases:
resolvable, monotonically -resolvable, measurable cardinal
2010 Mathematics Subject Classification:
54A35, 03E35, 54A25
The second author was supported by Fulbright Scholar Program.
The preparation of this paper was supported by OTKA grant no. K113047.
1. Introduction
Notion of resolvability was introduced and studied first by E. Hewitt, [4], in 1943. A topological space is -resolvable if it can be partitioned into many dense subspaces. is resolvable iff it is 2-resolvable, and irresolvable otherwise. Irresolvable spaces with many interesting extra properties were constructed, but there are no “absolute” examples for crowded irresolvable spaces, because if is a crowded space, then clearly
[TABLE]
In this paper we investigate what we can say about -resolvability in c.c.c-generic extensions for ?
To characterize spaces which are -resolvable in some c.c.c-generic extension we introduce the notion of monotonically -resolvable.
Definition 1.1**.**
Let be an infinite cardinal. A topological space is *monotonically -resolvable222In [13] a “monotonically -resolvable” space is called “almost--resolvable”. However, in [12] a space is almost--resolvable if it contains a family of dense sets with pairwise nowhere dense intersections.
- if there is a function such that
[TABLE]
for each . We will say that *witnesses * that is monotonically -resolvable.
Clearly a space is monotonically -resolvable iff has a partition of such that
[TABLE]
for all .
Theorem 1.2**.**
Let be a topological space. The following statements are equivalent:
- (1)
* is -resolvable in some c.c.c-generic extension,* 2. (2)
* is monotonically -resolvable,* 3. (3)
* is -resolvable in the Cohen generic extension .*
Which spaces are monotonically -resolvable?
Theorem 1.3**.**
If a topological space is c.c.c, and , then is monotonically -resolvable.
Theorem 1.4**.**
If is a measurable cardinal, then there is a space with which is not monotonically -resolvable.
What about spaces of cardinality ?
Theorem 1.5**.**
It is consistent, modulo the existence of a measurable cardinals, that there is a space with which is not monotonically -resolvable.
Do we really need to add -many Cohen reals to make resolvable?
Theorem 1.6**.**
(1) It is consistent, modulo a measurable cardinal, that there is a crowded space with (so is monotonically -resolvable) such that
[TABLE]
*(2) If , then every crowded space with is monotonically -resolvable, and so it is -resolvable in .
(3) If the cardinality of a crowded c.c.c space is less than the first weakly inaccessible cardinal, then is -resolvable in 444 is not a misprint here.*
The almost resolvability of c.c.c spaces was investigated by Pavlov in [11]: on page 53 Pavlov writes that – mimicked Malykhin’s method by using Ulam matrices – he showed that every crowed ccc space of cardinality is almost resolvable. In [3, Theorem 2.22] a stronger result was proved: a crowded c.c.c. space is almost resolvable, if its cardinality is less than the first weakly inaccessible cardinal. Theorem 1.6(2) is a further improvement of this result because monotonically -resolvability implies almost resolvability.
In [1, 3.12 Problem (2)] the authors ask if every space with countable cellularity and cardinality less than the first inaccessible non-countable cardinal almost--resolvable?. As we will see Theorem 1.6 (3) gives a positive answer to a weakening of this question.
2. Characterization of -resolvability in c.c.c extensions.
Instead of Theorem 1.2 we prove the following stronger result.
Theorem 2.1**.**
Assume that is a crowded topological space and is an infinite cardinal. If {\kappa}=\operatorname{cf}\big{(}\bigl{[}{\kappa}\bigr{]}^{\omega},\subset\big{)} then following statements are equivalent.
- (1)
* is -resolvable in some c.c.c-generic extension,* 2. (2)
there is a function h:X\to\bigl{[}{\kappa}\bigr{]}^{\omega} such that for each non-empty open . 3. (3)
* is -resolvable in the Cohen-generic extension .*
We say that a function witnesses that is -resolvable if
[TABLE]
for each .
Proof.
First we show that . Assume that is a c.c.c. poset such that there is a function witnessing the -resolvability of .
For each define
[TABLE]
Since the conditions are pairwise incomparable and is c.c.c , the set is countable.
We now show that the function defined above satisfies . Fix and an open subset of . We need to show that there exists such that . Since
[TABLE]
it follows that there is such that
[TABLE]
Thus, there exists such that
[TABLE]
Then .
Next we now show that . Let be a cofinal subset of \bigl{[}{\kappa}\bigr{]}^{\omega} with .
Let be an enumeration of , and for each pick
[TABLE]
Then for all non-empty open
[TABLE]
Next we note that forcing with is the same as forcing with . Further, is isomorphic to
[TABLE]
Indeed, for each fix a bijection , and then for define as follows:
- (i)
, and 2. (ii)
for .
Then is clearly an isomorphism between and .
We will proceed using .
Let be a -generic filter, and let . Then and such that .
We claim that witnesses that is -resolvable.
Fix and an open .
Let be arbitrary. Then, by (2), there is such that
[TABLE]
Then , and , so
[TABLE]
and
[TABLE]
Thus, by genericity, there is and such that
[TABLE]
Hence
[TABLE]
Finally is trivial. ∎
Problem 2.2**.**
Can we drop the assumption {\kappa}=\operatorname{cf}(\bigl{[}{\kappa}\bigr{]}^{\omega},\subset) from Theorem 2.1?
3. On monotonically -resolvability of c.c.c spaces
We start with an easy observation.
Lemma 3.1**.**
Let be a topological space and . If every is monotonically -resolvable, then so is . So every space contains a greatest monotonically -resolvable subspace (that subspace can be empty, of course).
Corollary 3.2**.**
Let be a topological space. Let be a dense subset of . If is monotonically -resolvable, then is also monotonically -resolvable.
Before proving Theorem 1.3 we prove the following “stepping-down” theorem.
Theorem 3.3**.**
If is a -c.c., monotonically -resolvable space, then is monotonically -resolvable as well.
The proof uses ideas from [8].
Proof.
Since an open subspace of a -c.c., monotonically -resolvable space is also -c.c. and monotonically -resolvable, by Lemma 3.1 it is enough to show that
every -c.c., monotonically -resolvable space has a monotonically -resolvable non-empty open subset.
Ulam [14] proved that there is a “matrix”
[TABLE]
such that
- (i)
for \{{\alpha},{\beta}\}\in\bigl{[}{{\kappa}^{+}}\bigr{]}^{2} and , 2. (ii)
for and \{{\xi},{\zeta}\}\in\bigl{[}{\kappa}\bigr{]}^{2}, 3. (iii)
and , where for .
Fix a partition witnessing that is monotonically -resolvable.
Let
[TABLE]
for and , and let
[TABLE]
Since , assumption (iii) implies that every is dense in .
Case 1. There is such that for all
[TABLE]
Then witnesses is monotonically -resolvable and so by corollary 3.2 , is also monotonically -resolvable.
Case 2. For all there is and there is an non-empty open set such that
[TABLE]
Then there is a set I\in\bigl{[}{{\kappa}^{+}}\bigr{]}^{{\kappa}^{+}} and there is an ordinal such that for all .
Fix an arbitrary K\in\bigl{[}{I}\bigr{]}^{\kappa}. By (iii) we can find such that
[TABLE]
Let . Then and for all .
Claim. If L\in\bigl{[}{K}\bigr{]}^{\kappa} then
[TABLE]
Proof of the Claim..
Assume on the contrary that . Then for some .
Let . Then . Pick with . Then , so , so by ().
Since , there are {\alpha}\neq{\beta}\in\bigl{[}{L}\bigr{]}^{2} such that . Thus which contradicts (i) because . ∎
Fix an enumeration , and let . Then the sequence is decreasing and
[TABLE]
by the Claim.
Since is -c.c. there is such that for all .
We can assume that . Let
[TABLE]
Then
[TABLE]
thus the partition witnesses that is monotonically -resolvable. ∎
Proof of Theorem 1.3.
Let .
Then is dense in , and every open subset of every is also in . Thus by lemma 3.1 it is enough to prove that a c.c.c. space with is monotonically -resolvable.
Let such that . Clearly, is monotonically -resolvable as . Since is c.c.c. then is -c.c.. By theorem 3.3, is monotonically -resolvable. By continually applying theorem 3.3 we conclude that is monotonically -resolvable. ∎
Problem 3.4**.**
Is it true that every crowded c.c.c space with is monotonically -resolvable?
4. Spaces which are not monotonically -resolvable.
If is a topological space, and , write
[TABLE]
Lemma 4.1**.**
Let be a topological space. Assume that is point-countable for each point-countable family . Then is not contain any monotonically -resolvable subspace .
Proof.
Assume that is a partition of . Let for . Then the family is point-countable. So is also point-countable. So is not dense in for all but countably many . So the partition does not witness that is monotonically -resolvable. ∎
To prove Theorems 1.4 and 1.5 we should recall some definitions and results from [6] and [5].
Definition 4.2** ([6, Definition 3.1]).**
Let be an infinite cardinal, and let be a filter on . Let be the tree . A topology is defined on by
[TABLE]
and the space is denoted by .
Proof of Theorem 1.4.
Let be a -complete non-principal ultrafilter on .
The space is monotonically normal by [6, Theorem 3.1].
An ultrafilter is -descendingly complete if for each decreasing sequence .
A -complete ultrafilter is clearly -descendingly-complete. In the proof of [6, Theorem 3.5] the authors prove Lemma 3.6 which claims that is point-countable for each point-countable family provided that is a -descendingly complete ultrafilter. So is point-countable for each point-countable family , and so is not monotonically -resolvable by Lemma 4.1. ∎
Instead of Theorem 1.5 we prove the following theorem which is a slight improvement of [5, Theorem 5].
Theorem 4.3**.**
If it is consistent that there is a measurable cardinal, then it is also consistent that there is an -resolvable monotonically normal space with such that if a family is point-countable, then the family is also point countable. Hence does not contain any monotonically -resolvable subspace.
Proof.
In [5, page 665] the authors write that ”starting from one measurable, Woodin ([15]) constructed a model in which carries an - descendingly complete uniform ultrafilter. Woodin’s model can be embedded into a bigger ZFC model so that the pair of models with satisfies the two models situation”, i.e.
- (1)
, 2. (2)
there is a countable subset of in such that no of cardinality covers ; 3. (3)
for the filter on defined in by iff is finite, we have .
(the “two model situation” is defined in [5, Theorem 4.5]).
Let and consider the space . As it was observed in [6], spaces obtained as from some filter are monotonically normal and -resolvable.
In [5, Theorem 4.1] Juhász and Magidor showed that the space is actually hereditarily -irresolvable. They proved the following lemma:
Lemma 4.2 from [5]. For any and there is a finite sequence of members of such that .
Using this lemma we show that is point-countable for each point-countable family , and so is not monotonically -resolvable by Lemma 4.1.
Indeed, let be an uncountable family such that . Then, by [5, Lemma 4.3], for each we can pick a finite sequence of members of such that . Since there are only countable many finite sequences of elements of there is such that for uncountably many . Then is in uncountably many elements of , so is not point-countable.
So we proved that no subspace of is monotonically -resolvable. ∎
5. -resolvability after adding a single Cohen reals
Before proving Theorem 1.6 we need some preparation.
The notion of almost resolvability was introduced by Bolstein ([2]) in 1973: a topological space is almost-resolvable if it is a countable union of sets with empty interiors. The notion of monotonically -resolvability was first considered in [13] under the name almost--resolvability.
Clearly almost -resolvable (i.e. monotonically -resolvable) spaces are almost resolvable.
Lemma 5.1**.**
*Let be a crowded topological space.
(1) If is monotonically -resolvable, then is -resolvable in .
(2) If is resolvable in , then is almost-resolvable.*
Proof of Lemma 5.1.
(1) Assume that the function witnesses the monotonically -resolvability of .
If is the -generic filter in , and , then the function witnesses that is -resolvable.
We need to show that is dense in
Indeed, let , . Since witnesses the monotonically -resolvability of there is such that
[TABLE]
Let
[TABLE]
Then and
[TABLE]
So we proved that witnesses that is -resolvable in the generic extension.
(2) Assume
[TABLE]
For all and let
[TABLE]
Then , and we claim that for each , and .
Indeed, fix and and let be an arbitrary non-empty open subset. Then , so there is and such that . Then , so , and so . Thus . Since was arbitrary, we proved . ∎
After this preparation we can prove Theorem 1.6.
Proof of Theorem 1.6.
(1) Kunen [7] proved that it is consistent, modulo a measurable cardinal, that there is a maximal independent family which is also -independent.
In [9, Theorems 3.1 and 3.2] the authors proved that if there is a maximal independent family which is also -independent, then there is a Baire space with such that every open subspace of is irresolvable, i.e. the space is OHI.
It is well-known that a crowded OHI Baire space is not almost resolvable: if , then for some .
Indeed, if , then is dense, so is dense in because every open subset of is irresolvable. Thus because is Baire. However
[TABLE]
which is a contradiction.
Thus is not almost resolvable, so it is not -resolvable in the model by Lemma 5.1(2).
(2) In [10] the authors proved that if , then there are no crowded Baire irresolvable spaces. Hence, by [13], if , then every crowded space is almost--resolvable (i.e. monotonically -resolvable).
So these spaces are -resolvable in the model by Lemma 5.1(1). ∎
Proof of Theorem 1.6(3).
Let be a crowded c.c.c space.
We can assume that .
By induction we define a strictly decreasing sequence of cardinals:
[TABLE]
as follows.
- (i)
, 2. (ii)
if is singular, then , 3. (iii)
if is regular, then (because is below the first weakly inaccessible cardinal,) and let , 4. (iv)
if or , then we stop.
Assume that the construction stopped in the th step.
Then we can prove, by finite induction, then is monotonically -resolvable for all by theorem 3.3. Thus is monotonically -resolvable or monotonically -resolvable, and so either is -resolvable in by by Lemma 5.1(1), or is -resolvable in by Thereon 2.1. ∎
Problem 5.2** ([13, Questions 5.2.]).**
Are almost resolvability and almost--resolvability equivalent in the class of irresolvable spaces?
Problem 5.3**.**
Is there, in ZFC, a crowded topological space which is irresolvable in the Cohen generic extension .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Angoa; M. Ibarra; Angel Tamariz-Mascarúa On ω 𝜔 \omega -resolvable and almost- ω 𝜔 {\omega} -resolvable spaces Commentationes Mathematicae Universitatis Carolinae, Vol. 49 (2008), No. 3, 485–508
- 2[2] Richard Bolstein Sets of Points of Discontinuity Proceedings of the American Mathematical society 38.1 (1973), 193-197
- 3[3] A. Dorantes-Aldama, Baire irresolvable spaces with countable Souslin number , Topology Appl. 188, (2015) 16–26.
- 4[4] Hewitt, E. A problem of set theoretic topology , Duke Math. J. 10 (1943) 309-333.
- 5[5] István Juhász, Menachem Magidor, On the Maximal Resolvability of Monotonically Normal Spaces Israel Journal Of Mathematics 192 (2012), 637–666.
- 6[6] Juhász, István; Soukup, Lajos; Szentmiklóssy, Zoltán Resolvability and monotone normality Israel Journal of Mathematics 166 (2008), 1–16.
- 7[7] Kunen, Kenneth Maximal σ 𝜎 \sigma -independent families. Fund. Math. 117 (1983), no. 1, 75–80.
- 8[8] Kenneth Kunen, Karel Prikry, On descendingly incomplete ultrafilters, The journal of symbolic logic volume 36.4 (1971), pp 650–652.
