Some applications of the point-open subbase game

D. Guerrero Sánchez; Vladimir Vladimirovich Tkachuk

Commentationes Mathematicae Universitatis Carolinae (2017)

  • Volume: 58, Issue: 3, page 383-395
  • ISSN: 0010-2628

Abstract

top
Given a subbase 𝒮 of a space X , the game P O ( 𝒮 , X ) is defined for two players P and O who respectively pick, at the n -th move, a point x n X and a set U n 𝒮 such that x n U n . The game stops after the moves { x n , U n : n ø } have been made and the player P wins if n ø U n = X ; otherwise O is the winner. Since P O ( 𝒮 , X ) is an evident modification of the well-known point-open game P O ( X ) , the primary line of research is to describe the relationship between P O ( X ) and P O ( 𝒮 , X ) for a given subbase 𝒮 . It turns out that, for any subbase 𝒮 , the player P has a winning strategy in P O ( 𝒮 , X ) if and only if he has one in P O ( X ) . However, these games are not equivalent for the player O : there exists even a discrete space X with a subbase 𝒮 such that neither P nor O has a winning strategy in the game P O ( 𝒮 , X ) . Given a compact space X , we show that the games P O ( 𝒮 , X ) and P O ( X ) are equivalent for any subbase 𝒮 of the space X .

How to cite

top

Sánchez, D. Guerrero, and Tkachuk, Vladimir Vladimirovich. "Some applications of the point-open subbase game." Commentationes Mathematicae Universitatis Carolinae 58.3 (2017): 383-395. <http://eudml.org/doc/294080>.

@article{Sánchez2017,
abstract = {Given a subbase $\mathcal \{S\}$ of a space $X$, the game $PO(\mathcal \{S\},X)$ is defined for two players $P$ and $O$ who respectively pick, at the $n$-th move, a point $x_n\in X$ and a set $U_n\in \mathcal \{S\}$ such that $x_n\in U_n$. The game stops after the moves $\lbrace x_n,U_n: n\in ø\rbrace $ have been made and the player $P$ wins if $\bigcup _\{n\in ø\}U_n=X$; otherwise $O$ is the winner. Since $PO(\mathcal \{S\},X)$ is an evident modification of the well-known point-open game $PO(X)$, the primary line of research is to describe the relationship between $PO(X)$ and $PO(\mathcal \{S\},X)$ for a given subbase $\mathcal \{S\}$. It turns out that, for any subbase $\mathcal \{S\}$, the player $P$ has a winning strategy in $PO(\mathcal \{S\},X)$ if and only if he has one in $PO(X)$. However, these games are not equivalent for the player $O$: there exists even a discrete space $X$ with a subbase $\mathcal \{S\}$ such that neither $P$ nor $O$ has a winning strategy in the game $PO(\mathcal \{S\},X)$. Given a compact space $X$, we show that the games $PO(\mathcal \{S\},X)$ and $PO(X)$ are equivalent for any subbase $\mathcal \{S\}$ of the space $X$.},
author = {Sánchez, D. Guerrero, Tkachuk, Vladimir Vladimirovich},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {point-open game; subbase; winning strategy; players; discrete space; compact space; scattered space; measurable cardinal},
language = {eng},
number = {3},
pages = {383-395},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Some applications of the point-open subbase game},
url = {http://eudml.org/doc/294080},
volume = {58},
year = {2017},
}

TY - JOUR
AU - Sánchez, D. Guerrero
AU - Tkachuk, Vladimir Vladimirovich
TI - Some applications of the point-open subbase game
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 2017
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 58
IS - 3
SP - 383
EP - 395
AB - Given a subbase $\mathcal {S}$ of a space $X$, the game $PO(\mathcal {S},X)$ is defined for two players $P$ and $O$ who respectively pick, at the $n$-th move, a point $x_n\in X$ and a set $U_n\in \mathcal {S}$ such that $x_n\in U_n$. The game stops after the moves $\lbrace x_n,U_n: n\in ø\rbrace $ have been made and the player $P$ wins if $\bigcup _{n\in ø}U_n=X$; otherwise $O$ is the winner. Since $PO(\mathcal {S},X)$ is an evident modification of the well-known point-open game $PO(X)$, the primary line of research is to describe the relationship between $PO(X)$ and $PO(\mathcal {S},X)$ for a given subbase $\mathcal {S}$. It turns out that, for any subbase $\mathcal {S}$, the player $P$ has a winning strategy in $PO(\mathcal {S},X)$ if and only if he has one in $PO(X)$. However, these games are not equivalent for the player $O$: there exists even a discrete space $X$ with a subbase $\mathcal {S}$ such that neither $P$ nor $O$ has a winning strategy in the game $PO(\mathcal {S},X)$. Given a compact space $X$, we show that the games $PO(\mathcal {S},X)$ and $PO(X)$ are equivalent for any subbase $\mathcal {S}$ of the space $X$.
LA - eng
KW - point-open game; subbase; winning strategy; players; discrete space; compact space; scattered space; measurable cardinal
UR - http://eudml.org/doc/294080
ER -

References

top
  1. Baldwin S., 10.1016/0166-8641(91)90087-3, Topology Appl. 38 (1991), 219–223. Zbl0719.54003MR1098902DOI10.1016/0166-8641(91)90087-3
  2. Daniels P., Gruenhage G., 10.1016/0166-8641(90)90014-S, Topology Appl. 37 (1990), no. 1, 53–64. MR1075373DOI10.1016/0166-8641(90)90014-S
  3. Engelking R., General Topology, PWN, Warszawa, 1977. Zbl0684.54001MR0500780
  4. Galvin F., Indeterminacy of point-open games, Bull. Acad. Polon. Sci. Sér. Math. 26 (1978), no. 5, 445–449. Zbl0392.90101MR0493925
  5. Kuratowski K., Topology, Volume 1, Academic Press, New York, 1966. MR0217751
  6. Laver R., 10.1007/BF02392416, Acta Math. 137 (1976), 151–169. Zbl0357.28003MR0422027DOI10.1007/BF02392416
  7. Pawlikowski J., Undetermined sets of point-open games, Fund. Math. 144 (1994), 279–285. Zbl0853.54033MR1279482
  8. Telgársky R., 10.4064/fm-88-3-193-223, Fund. Math. 88 (1975), 193–223. MR0380708DOI10.4064/fm-88-3-193-223
  9. Telgársky R., 10.4064/fm-116-3-189-207, Fund. Math. 116 (1983), no. 3, 189–207. Zbl0558.54029MR0716219DOI10.4064/fm-116-3-189-207

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.