Telgarsky's conjecture may fail

DOI10.1007/S11856-021-2137-XMaRDI QIDQ6330616arXivWikidataFDO

Authors W. R. Brian, Alan Dow, David Milovich, Lynne Yengulalp

Publication date 6 December 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11856-021-2137-X

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Consistency and independence results in general topology (54A35) Games involving topology, set theory, or logic (91A44)

arXiv classification

math.GNmath.LO

Abstract: Telg'arsky's conjecture states that for each $kinmathbbN$, there is a topological space $X_k$ such that in the Banach-Mazur game on $X_k$, the player {scriptsize NONEMPTY} has a winning $(k+1)$-tactic but no winning $k$-tactic. We prove that this statement is consistently false. More specifically, we prove, assuming $mathsfGCH+square$, that if {scriptsize NONEMPTY} has a winning strategy for the Banach-Mazur game on a $T_3$ space $X$, then she has a winning $2$-tactic. The proof uses a coding argument due to Galvin, whereby if $X$ has a $pi$-base with certain nice properties, then {scriptsize NONEMPTY} is able to encode, in each consecutive pair of her opponent's moves, all essential information about the play of the game before the current move. Our proof shows that under $mathsfGCH+square$, every $T_3$ space has a sufficiently nice $pi$-base that enables this coding strategy. Translated into the language of partially ordered sets, what we really show is that $mathsfGCH+square$ implies the following statement, which is equivalent to the existence of the "nice $pi$-bases mentioned above: emph{Every separative poset $mathbbP$ with the $kappa$-cc contains a dense sub-poset $mathbbD$ such that $|qinmathbbD,:,pextextendsq|<kappa$ for every $pinmathbbP$.} We prove that this statement is independent of $mathsfZFC$: while it holds under $mathsfGCH+square$, it is false even for ccc posets if $mathfrakb>alep{h}_1$. We also show that if $|mathbbP|<alep{h}_{o}mega$, then axiom-for-$mathbbP$ is a consequence of $mathsfGCH$ holding below $|mathbbP|$.

This page was built for publication: Telgarsky's conjecture may fail

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