Higher random indestructibility of MAD families
Thomas Baumhauer

TL;DR
This paper characterizes when maximal almost disjoint families at a weakly compact cardinal are indestructible under higher random forcing, linking combinatorial properties to forcing indestructibility and set-theoretic invariants.
Contribution
It provides a combinatorial criterion for indestructibility of MAD families under higher random forcing at weakly compact cardinals, extending classical results.
Findings
Characterization of indestructibility using combinatorial properties
Equivalence of certain set-theoretic invariants in this context
Existence of indestructible MAD families under specific conditions
Abstract
We give a combinatorial characterization of when a maximal almost disjoint family of a weakly compact cardinal is indestructible by the higher random forcing . We then use this characterisation to show that implies the existence -indestructible family. The results and proofs presented here are parallel to those for classical random forcing.
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
Higher random indestructibility of MAD families
Thomas Baumhauer The author was supported by the Austrian Science Fund through grant FWF P29575. TU Wien, Institute of Discrete Mathematics and Geometry
Wiedner Hauptstraße 8–10, 1040 Wien, Austria
Abstract
We give a combinatorial characterization of when a maximal almost disjoint family of a weakly compact cardinal is indestructible by the higher random forcing . We then use this characterisation to show that implies the existence -indestructible family. The results and proofs presented here are parallel to those for classical random forcing.
1 Introduction
In this paper refers to a weakly compact cardinal. A family is called almost disjoint if for all distinct we have . An almost disjoint family is called maximal if for no almost disjoint family we have .
The following way of constructing a maximal almost disjoint family of suggests itself. Identify with and for let . Using the Teichmüller-Tukey lemma we can extend to a maximal almost disjoint family .
Let be a forcing notion. We say that a maximal almost disjoint family is -indestructible if remains maximal in any -generic extension. It is easy to see that any forcing notion adding a real destroys the family from above, if satisfies Mostowski’s absoluteness.111 A forcing notion satisfies Mostowski’s absoluteness if formulas are absolute between and . Any -strategically closed forcing has this property, see e.g. [\citeauthoryearFriedman, Khomskii, and KulikovFriedman et al.2016, Lemma 2.7] or [\citeauthoryearBaumhauerBaumhauer2019, Lemma 4.2.1]
This leads to the question: Given a forcing notion , does there exist a maximal almost disjoint family such that is -indestructible? For the classical case [\citeauthoryearKunenKunen1980] shows that assuming CH there exists a Cohen-indestructible maximal almost disjoint family. [\citeauthoryearHrušákHrušák2001] and [\citeauthoryearKurilićKurilić2001] provide a combinatorial characterization of Cohen-indestructibility and [\citeauthoryearHrušákHrušák2001] also investigates Sacks and Miller forcing. [\citeauthoryearBrendle and YatabeBrendle and Yatabe2005] continue this line of research, investigating several classical forcing notions and in particular provide a combinatorial characterization of indestructibility for the classical random forcing.
We shall deal with -indestructibility, where is the higher random forcing from [\citeauthoryearShelahShelah2017]. In Theorem 4.1 we give a combinatorial characterization of -indestructibility, parallel to the one in [\citeauthoryearBrendle and YatabeBrendle and Yatabe2005, Theorem 2.4.9.] for the classical random forcing. In Theorem 4.2 we use this characterization to show that
[TABLE]
implies the existence of a -indestructible maximal almost disjoint family of . Here denotes the higher null ideal from [\citeauthoryearShelahShelah2017] (there referred to as and denotes the size of . This result is again parallel to [\citeauthoryearBrendle and YatabeBrendle and Yatabe2005, Theorem 3.6.1.] where it is shown that implies the existence of a random indestructible maximal almost disjoint family.
Clearly implies ( ‣ 1). However this assumption is not necessary, as the Amoeba model in [\citeauthoryearBaumhauer, Goldstern, and ShelahBaumhauer et al.2018, Section 6] shows (assuming supercompact) that
[TABLE]
is consistent. Compared to the classical case we need the additional assumption , as the consistency of is an open problem.
2 Notation and Conventions
We use the following conventions. If is a function, and , then and . For let For we write if . For let .
For define the -closure
[TABLE]
(Note that if is downward closed (i.e. a tree), is a closed set.)
On we use the topology generated by the basic clopen sets for . The -Borel sets are the smallest family containing all basic clopen sets which is closed under complements and unions/intersections of at most -many sets.
3 Higher Random Forcing
The higher random forcing for a (strongly) inaccessible cardinal was introduced by Saharon Shelah in [\citeauthoryearShelahShelah2017]. Recall that is a tree forcing on with the following properties:
- (a)
satisfies the -chain condition. 2. (b)
is strategically -closed. 3. (c)
If is weakly compact, then is -bounding.
The higher null ideal consists of all sets such that there exists a family of -many maximal antichains of such that
[TABLE]
If is a -generic filter then we call the -generic real or random real, where is the trunk of . Throughout the paper will denote a name for the canonical generic real added by .
Fact 3.1**.**
Let . The following are equivalent:
- (i)
are compatible. 2. (ii)
. 3. (iii)
. ∎
Lemma 3.2**.**
Let . Then:
- (i)
If , then 2. (ii)
If , then
Proof.
- (i)
Let “” and towards contradiction assume . According to Fact 3.1 (iii) there are three cases:
- (1)
2. (2)
3. (3)
.
As an example consider case (2). For every we have . But clearly “”. Contradiction to “”.
Work similarly for case (1) and (3). 2. (ii)
Similarly.∎
Fact 3.3**.**
Let . Then:
[TABLE]
This is shown in [\citeauthoryearShelahShelah2017, Claim 3.2] by induction on the Borel rank of .
Fact 3.4**.**
For any we have . This is a simple consequence of the observation that “” and Fact 3.3.∎
Fact 3.5**.**
Let be weakly compact. If , then there exists a single maximal antichain of such that
[TABLE]
This is shown in [\citeauthoryearBaumhauer, Goldstern, and ShelahBaumhauer et al.2018, Lemma 1.3.3., Lemma 3.1.2]. ∎
Theorem 3.6**.**
Let be weakly compact. Let . Then there exists such that .
In words: every positive Borel set contains a random condition.
Proof.
By Fact 3.3 there exists such that “”. Consider . There are two cases:
- (1)
. By Fact 3.5 there exists a single maximal antichain such that
[TABLE]
Choose compatible with . Then is as required. 2. (2)
. By Fact 3.3 there exists such that So in particular
- (a)
. 2. (b)
.
By (a) and Lemma 3.2(i) we have . But by our choice of we have “”, hence by (b) and cannot be compatible. Contradiction, i.e. this case does not appear.∎
4 Results
Any maximal almost disjoint family canonically defines the ideal of all subsets of that can be covered by -many elements of . Let be a forcing notion. We say is -indestructible if does not add a pseudo-intersection to the dual filter of . Easily is -indestructible iff is -indestructible.
Theorem 4.1**.**
Let be a weakly compact cardinal. Let be a maximal almost disjoint family and let . The following are equivalent:
- (i)
* is -indestructible.* 2. (ii)
. 3. (iii)
.
Proof.
(i) (ii): Assume (ii) fails, i.e. there exist , and such that for all . By Theorem 3.6 there exists such that . Let be a -generic filter containing and let , hence by Fact 3.3 we have for all . Consider
[TABLE]
First note that because we have . Without loss of generality , hence all sets of size less than are contained in , which implies .
Now check that destroys . Assume it does not, i.e. there exists such that . This implies for cofinally many , hence . Contradiction, thus is almost disjoint from all , i.e. “ is destroyed”. So we have shown that (ii) implies (i).
(ii) (iii): Trivial.
(iii) (i): Towards contradiction assume there is and a -name such that
[TABLE]
Furthermore let be a fusion condition as in [\citeauthoryearShelahShelah2017, Claim 1.9.], i.e. such that there exists a cofinal sequence such that for all , the condition decides , where is an increasing enumeration of .
Let and clearly , hence by Fact 3.4. Define such that for we have
[TABLE]
Is is easy to see that is -to-one since our choice of implies
By our assumption there exists such that , hence by Theorem 3.6 there exists such that . Of course , hence , and by Lemma 3.2(ii) this implies .
But “”. Contradiction. ∎
Note that the proof of Theorem 4.1 essentially verifies that satisfies a -version of weak fusion as defined in [\citeauthoryearBrendle and YatabeBrendle and Yatabe2005, Definition 2.2.1] (except there a one-to-one function is required). However, as the definition of weak fusion is fairly technical, doing the proof directly may be more transparent.
Theorem 4.2**.**
Let be a weakly compact cardinal. If , then there exists a -indestructible maximal almost disjoint family of size .
Proof.
Let enumerate all pairs where , and is a -to-one function. Let be a partition of into sets of size . We are inductively going to construct sequence such that for all :
- (1)
. 2. (2)
. 3. (3)
.
If we can carry out this construction, we may find a maximal almost disjoint family using the Teichmüller-Tukey lemma, and is -indestructible by Theorem 4.1.
At stage consider .
Case 1: There exists such that . In this case let be any set satisfying (1) and (2). Remember so this is always possible.
Case 2: For all we have . By Theorem 3.6 there exists such that . By our assumption , hence also
[TABLE]
By Fact 3.5 there exists a maximal antichain of such that
[TABLE]
Let be such that and let . Clearly .
Now the plan is as follows: is a candidate for satisfying (1) and (3). So we want to thin out to some satisfying (2) and still satisfying (1) and (3). We use a combinatorial argument from [\citeauthoryearHrušákHrušák2001] to finish the proof.
Let enumerate . For inductively try to choose distinct such that
[TABLE]
If this construction fails at stage note that
[TABLE]
hence
[TABLE]
and easily
[TABLE]
is as required, i.e. is almost disjoint from for all and , hence by Fact 3.4.
So assume the construction succeeded and for define by
[TABLE]
Remember and find such that for all . Now for every choose
[TABLE]
Let . By construction is almost disjoint from for all and , hence by Fact 3.4. ∎
Acknowledgements
I thank Martin Goldstern, who read this manuscript and provided valuable comments, suggestions and corrections.
I thank Vera Fischer, who during the defense of my thesis asked the question of the existence of a higher random indestructible maximal almost disjoint family, and who thus inspired this paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ \citeauthoryear Baumhauer Baumhauer 2019] Baumhauer, T. (2019). The Higher Cichon Diagram. Thesis .
- 2[ \citeauthoryear Baumhauer, Goldstern, and Shelah Baumhauer et al.2018] Baumhauer, T., M. Goldstern, and S. Shelah (2018). The Higher Cichon Diagram. Ar Xiv e-prints . ar Xiv:1806.08583, Bh Go Sh:1144.
- 3[ \citeauthoryear Brendle and Yatabe Brendle and Yatabe 2005] Brendle, J. and S. Yatabe (2005). Forcing indestructibility of MAD families. Ann. Pure Appl. Logic 132 (2-3), 271–312.
- 4[ \citeauthoryear Friedman, Khomskii, and Kulikov Friedman et al.2016] Friedman, S. D., Y. Khomskii, and V. Kulikov (2016). Regularity properties on the generalized reals. Ann. Pure Appl. Logic 167 (4), 408–430.
- 5[ \citeauthoryear Hrušák Hrušák 2001] Hrušák, M. (2001). MAD families and the rationals. Comment. Math. Univ. Carolin. 42 (2), 345–352.
- 6[ \citeauthoryear Kunen Kunen 1980] Kunen, K. (1980). Set Theory: An Introduction to Independence Proofs. North-Holland.
- 7[ \citeauthoryear KurilićKurilić2001] Kurilić, M. S. (2001). Cohen-stable families of subsets of integers. J. Symbolic Logic 66 (1), 257–270.
- 8[ \citeauthoryear Shelah Shelah 2017] Shelah, S. (2017). A parallel to the null ideal for inaccessible λ 𝜆 \lambda . Archive for Mathematical Logic 56 , 319–383. arxiv:1202.5799, Sh:1004.
