Skip to main content
added 6 characters in body
Source Link
Joel David Hamkins
  • 236.5k
  • 44
  • 777
  • 1.4k

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial order version of the question.

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial version of the question.

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial order version of the question.

http -> https
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial version of the question.

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial version of the question.

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial version of the question.

changed link to a search to the direct link to the review
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet reviewMathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial version of the question.

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial version of the question.

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985:

The paper is in French, but here is the MathScinet review:

A Banach-Mazur game on a topological space is a two-person infinite game in which a move of each player is to choose an open set contained in that previously picked by the opponent. The first player wins if the resulting descending sequence of open sets has empty intersection. Otherwise the second player wins. It is proved that if the second player has a winning strategy depending on the entire sequence of previous moves of both players then [they also have] a winning strategy depending on the last two moves played ([their] own last move and [their] opponent's). This was independently discovered by F. Galvin and R. Telgarskybut the author proves it for a more general class of games. The second result is the construction of a completely regular space on which the second player has a winning strategy depending on the last two moves of the opponent but does not have a winning strategy depending only on the opponent's last move.

Reviewed by Andrzej Pelc

As Will Brian mentions in the comments, however, this does not quite settle the partial version of the question.

Update in light of Will Brian's comment.
Source Link
Joel David Hamkins
  • 236.5k
  • 44
  • 777
  • 1.4k
Loading
changed to inclusive pronouns
Source Link
Greg Martin
  • 12.8k
  • 1
  • 48
  • 72
Loading
deleted 9 characters in body
Source Link
Joel David Hamkins
  • 236.5k
  • 44
  • 777
  • 1.4k
Loading
Source Link
Joel David Hamkins
  • 236.5k
  • 44
  • 777
  • 1.4k
Loading