Abstract
It was proved recently that Telgársky’s conjecture, which concerns partial information strategies in the Banach–Mazur game, fails in models of \(\mathsf {GCH}+\square \). The proof introduces a combinatorial principle that is shown to follow from \(\mathsf {GCH}+\square \), namely:
- \(\bigtriangledown \)::
-
Every separative poset \({\mathbb {P}}\) with the \(\kappa \)-cc contains a dense sub-poset \({\mathbb {D}}\) such that \(|\{ q \in {\mathbb {D}} \,:\, p \text { extends } q \}| < \kappa \) for every \(p \in {\mathbb {P}}\).
We prove this principle is independent of \(\mathsf {GCH}\) and \(\mathsf {CH}\), in the sense that \(\bigtriangledown \) does not imply \(\mathsf {CH}\), and \(\mathsf {GCH}\) does not imply \(\bigtriangledown \) assuming the consistency of a huge cardinal. We also consider the more specific question of whether \(\bigtriangledown \) holds with \({\mathbb {P}}\) equal to the weight-\(\aleph _\omega \) measure algebra. We prove, again assuming the consistency of a huge cardinal, that the answer to this question is independent of \(\mathsf {ZFC}+\mathsf {GCH}\).
Similar content being viewed by others
References
Brian, W., Dow, A., Milovich, D., Yengulalp, L.: Telgársky’s conjecture may fail, to appear in Israel J. Math.; preprint available at arxiv.org/abs/1912.03327
Cummings, J., Friedman, S.D.: \(\square \) on the singular cardinals. J. Symb. Log. 73, 1307–1314 (2008)
Davies, R.O.: Covering the plane with denumerably many curves. J. Lond. Math. Soc. 38, 433–438 (1963)
Erdős, P., Tarski, A.: On families of mutually exclusive sets. Ann. Math. 2(44), 315–329 (1943)
Eskew, M., Haiyut, Y.: On the consistency of local and global versions of Chang’s conjecture. Trans. Am. Math. Soc. 370, 2879–2905 (2018)
Foreman, M., Magidor, M.: A very weak square principle. J. Symb. Log. 62, 175–196 (1997)
Fremlin, D.H.: Measure algebras. In: Handbook of Boolean Algebras, vol. 3, pp. 877–980. North Holland, Amsterdam (1989)
Levinski, J.P., Magidor, M., Shelah, S.: Chang’s conjecture for \(\aleph _\omega \). Israel J. Math. 69, 161–172 (1990)
Sharon, A., Vialle, M.: Some consequences of reflection on the approachability ideal. Trans. Am. Math. Soc. 362, 4201–4212 (2009)
Soukup, D., Soukup, L.: Infinite combinatorics plain and simple. J. Symb. Log. 83(3), 1247–1281 (2018)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Brian, W., Dow, A. & Shelah, S. The independence of \(\mathsf {GCH}\) and a combinatorial principle related to Banach–Mazur games. Arch. Math. Logic 61, 1–17 (2022). https://doi.org/10.1007/s00153-021-00770-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-021-00770-x