A maximal almost disjoint (MAD) family of infinite subsets of is weakly tight if for every countable family of -positive sets there is a member of meeting infinitely many of them infinitely often. Raghavan and Steprāns (2012) constructed weakly tight families of size from the hypothesis , introducing the splitting-type invariant for this purpose, and posed a cluster of open questions. Mildenberger, Raghavan and Steprāns (2014) then proved in ZFC, which closes the invariant questions from the source (Questions 21 and 22 there) and makes a ZFC sufficient condition for weakly tight families. This problem isolates the surviving open core of that question cluster. (1) Can replace : must a weakly tight family exist whenever ? Since the case is settled, the open regime is . (2) Can the regime consistently preclude weakly tight families altogether — conjecturally in a model of — and do weakly tight families exist in the known models of ? (3) Does the same construction technique strengthen to produce a Sacks-indestructible MAD family from ?
Background
Two infinite subsets of are almost disjoint (a.d.) if their intersection is finite; an a.d. family that is maximal under inclusion among a.d. families is a MAD family. For an a.d. family , denotes the ideal on generated by together with the finite sets, and is the family of positive sets. Hrušák and García Ferreira introduced weak tightness through the Katětov order on a.d. families ( iff some function pulls every member of into ): is weakly tight if for every countable there is with for infinitely many . This weakens tightness (also called -MAD or strongly MAD), which demands the same for all at once and is essentially equivalent to Cohen indestructibility of the MAD family. Weakly tight families are automatically MAD, are 'almost maximal' in the Katětov order, and are the existence counterpart of having few partitioners: a partitioner of is a positive set such that every is almost included in or almost disjoint from , and any a.d. family with an infinite pairwise disjoint family of partitioners fails weak tightness. Here is the splitting number (the least size of a family such that every infinite is split by some , meaning both and are infinite), the bounding number (the least size of a family in unbounded under eventual domination), its dual dominating number, the almost disjointness number (the least size of a MAD family), and . A program going back to Erdős and Shelah's 1972 question whether a completely separable MAD family exists ( is completely separable if every set contains a member of ) aims to construct MAD families with strong combinatorial properties in ZFC, whereas nearly all classical constructions need hypotheses of the form . Shelah's breakthrough ('MAD saturated families and SANE player') gave completely separable MAD families by a three-case analysis comparing with : in ZFC, and or under PCF-type hypotheses (statements about that hold below ), yielding ZFC existence when . Raghavan and Steprāns adapted this machinery to weak tightness, comparing with instead. They introduced the invariant : the least such that there is with the property that for every countable some satisfies for infinitely many and for infinitely many — a countable-family strengthening of splitting. They proved in ZFC that a weakly tight family of size exists whenever , showed when , and handled under a PCF-type principle true below , so weakly tight families exist whenever . Mildenberger, Raghavan and Steprāns then proved outright in ZFC, so the hypothesis is now simply with no PCF assumption; the same paper produced completely separable MAD families under . The resulting asymmetry is the subject of this problem: for complete separability both the -side (e.g. ) and the -side () are settled, but for weak tightness only the -side is, and nothing is known in the regime — whose consistency was first established by Shelah (his method is flexible enough to give ) and by Brendle via a c.c.c. iteration for . A cautionary result of Guzmán shows that -side hypotheses do not deliver weak tightness for free: under there is a +-Ramsey MAD family (a Ramsey-type strengthening of the MAD property) that is not weakly tight. Sacks forcing (conditions are perfect subtrees of , ordered by inclusion) adds a new real of minimal degree; a MAD family is Sacks indestructible if it stays maximal after Sacks forcing, and this is the weakest indestructibility notion among forcings adding reals. Known constructions of Sacks indestructible MAD families of size use or (the least number of meager sets covering ; if then every MAD family of size is automatically Sacks indestructible), and whether one exists in ZFC is a well-known open problem of Hrušák. The Raghavan-Steprāns machinery of node ideals on a binary tree — controlling which countable sequences of infinite sets may be associated with each node, so that sets associated with incomparable nodes are automatically a.d. — is the natural candidate for such constructions from hypotheses of the form .
Problem Statement
The problem is the surviving open core of the question cluster posed in Section 4 of Raghavan and Steprāns, 'On weakly tight families' (2012), after the invariant questions from that paper were closed by Mildenberger, Raghavan and Steprāns (2014). Facets A and B concern completing the case analysis for the existence of weakly tight families — deciding whether their existence is governed by , so that is a genuine barrier, or by , which would match the situation for completely separable MAD families — while Facet C asks whether the Raghavan-Steprāns construction technique strengthens from weak tightness to Sacks indestructibility. The source poses these as separate open problems (Question 23 and Conjectures 24-25 of Section 4). The three facets are:
Facet A (Question 23 of the source). Suppose . Since weakly tight families of size are now known to exist in ZFC whenever , the open case is . Must a weakly tight family exist under this hypothesis? Equivalently: can replace in the hypothesis of the Raghavan-Steprāns existence theorem?
Facet B (Conjecture 24 of the source, with the adjacent model questions). Is there a model of in which no weakly tight families exist? More broadly, do weakly tight families exist in the known consistency models of — Shelah's original construction (which can be arranged with ) and Brendle's c.c.c. iteration for — and, if so, of which sizes? (The source notes that from CH a weakly tight family can be made to survive the relevant iteration, but will not have size there, and it is unknown whether any of size exist in that model.)
Facet C (Conjecture 25 of the source). If , is there a Sacks-indestructible MAD family? (The source notes that for proving this conjecture one may assume .)
No restriction on family size, model class, or method is intended beyond what is explicitly stated; in particular, 'weakly tight family' always means the source's definition for a.d. families of infinite subsets of , and any claimed nonexistence result must rule out weakly tight families of every size, not only of size .
References
- Dilip Raghavan and Juris Steprāns, 'On weakly tight families', Canadian Journal of Mathematics 64 (2012), no. 6, 1378-1394. DOI: 10.4153/CJM-2012-017-8; arXiv:1010.1226, https://arxiv.org/abs/1010.1226
- Heike Mildenberger, Dilip Raghavan, and Juris Steprāns, 'Splitting families and complete separability', Canadian Mathematical Bulletin 57 (2014), no. 1, 119-124. DOI: 10.4153/CMB-2013-027-2; arXiv:1204.1810, https://arxiv.org/abs/1204.1810
- Saharon Shelah, 'MAD saturated families and SANE player', Canadian Journal of Mathematics 63 (2011), no. 6, 1416-1435. DOI: 10.4153/CJM-2011-057-1; arXiv:0904.0816, https://arxiv.org/abs/0904.0816
- Saharon Shelah, 'On cardinal invariants of the continuum', in: Axiomatic Set Theory (Boulder, Colo., 1983), Contemporary Mathematics 31, American Mathematical Society, Providence, RI, 1984, pp. 183-207. DOI: 10.1090/conm/031/763901, https://doi.org/10.1090/conm/031/763901
- Jörg Brendle, 'Mob families and mad families', Archive for Mathematical Logic 37 (1998), no. 3, 183-197. DOI: 10.1007/s001530050091, https://doi.org/10.1007/s001530050091
- Michael Hrušák and Salvador García Ferreira, 'Ordering MAD families a la Katětov', Journal of Symbolic Logic 68 (2003), no. 4, 1337-1353. DOI: 10.2178/jsl/1067620190, https://doi.org/10.2178/jsl/1067620190
- Paul Erdős and Saharon Shelah, 'Separability properties of almost-disjoint families of sets', Israel Journal of Mathematics 12 (1972), no. 2, 207-214. DOI: 10.1007/bf02764666, https://doi.org/10.1007/bf02764666
- Osvaldo Guzmán, 'There is a +-Ramsey MAD family', Israel Journal of Mathematics 229 (2019), no. 1, 393-414. DOI: 10.1007/s11856-018-1807-9; arXiv:1810.08763, https://arxiv.org/abs/1810.08763
- Jörg Brendle, Osvaldo Guzmán-González, Michael Hrušák, and Dilip Raghavan, 'Combinatorial properties of MAD families', Canadian Journal of Mathematics, published online 2025, 1-69. DOI: 10.4153/S0008414X25101879; arXiv:2206.14936, https://arxiv.org/abs/2206.14936
- César Corral, Osvaldo Guzmán, and Carlos López-Callejas, 'High-dimensional sequential compactness', Fundamenta Mathematicae 264 (2024), no. 1, 21-54. DOI: 10.4064/fm230606-11-8; arXiv:2302.05388, https://arxiv.org/abs/2302.05388
- César Corral and Vinicius de O. Rodrigues, 'Fin-intersecting MAD families', preprint, 2022. arXiv:2212.01484, https://arxiv.org/abs/2212.01484
- Osvaldo Guzmán, 'Katětov order on MAD families', Journal of Symbolic Logic 89 (2024), no. 2, 794-828. DOI: 10.1017/jsl.2023.25, https://doi.org/10.1017/jsl.2023.25
- Vera Fischer and Lukas Schembecker, 'Universally Sacks-indestructible combinatorial families of reals', Annals of Pure and Applied Logic 176 (2025), no. 6, article 103566. DOI: 10.1016/j.apal.2025.103566; arXiv:2312.10000, https://arxiv.org/abs/2312.10000
- César Corral and Michael Hrušák, 'Fréchet-like properties and almost disjoint families', Topology and its Applications 277 (2020), article 107216. DOI: 10.1016/j.topol.2020.107216, https://doi.org/10.1016/j.topol.2020.107216
- Osvaldo Guzmán-González, Michael Hrušák, Carlos Azarel Martínez-Ranero, and Ulises Ariet Ramos-García, 'Generic existence of MAD families', Journal of Symbolic Logic 82 (2017), no. 1, 303-316. DOI: 10.1017/jsl.2016.54, https://doi.org/10.1017/jsl.2016.54