The independence of GCH and a combinatorial principle related to Banach-Mazur games

DOI10.1007/S00153-021-00770-XMaRDI QIDQ6352848arXivFDO

Authors W. R. Brian, Alan Dow, S. Shelah

Publication date 2 November 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00153-021-00770-X

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Other set-theoretic hypotheses and axioms (03E65) Measures on Boolean rings, measure algebras (28A60)

arXiv classification

math.LO

Abstract: It was proved recently that Telg'arsky's conjecture, which concerns partial information strategies in the Banach-Mazur game, fails in models of $mathsfGCH+square$. The proof introduces a combinatorial principle that is shown to follow from $mathsfGCH+square$, namely: $riangledown$: Every separative poset $mathbbP$ with the $kappa$-cc contains a dense sub-poset $mathbbD$ such that $|qinmathbbD,:,pextextendsq|<kappa$ for every $pinmathbbP$. We prove this principle is independent of $mathsfGCH$ and $mathsfCH$, in the sense that $riangledown$ does not imply $mathsfCH$, and $mathsfGCH$ does not imply $riangledown$ assuming the consistency of a huge cardinal. We also consider the more specific question of whether $riangledown$ holds with $mathbbP$ equal to the weight-$alep{h}_{o}mega$ measure algebra. We prove, again assuming the consistency of a huge cardinal, that the answer to this question is independent of $mathsfZFC+mathsfGCH$.

This page was built for publication: The independence of GCH and a combinatorial principle related to Banach-Mazur games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6352848)