Telgarsky's separation conjecture for Banach–Mazur k-tactics
Statement
Let be a positive integer. A winning -tactic for TWO is a strategy in which TWO's move depends only on the most recent moves of ONE. For a topological space , let denote the Banach–Mazur game in which the players choose nonempty open sets satisfying
Telgarsky's conjecture. For each positive integer there is a topological space such that TWO does not have a winning -tactic, but does have a winning -tactic in the game . This conjecture asks whether the hierarchy of finite-memory tactics in the Banach–Mazur game is strict at every level. The paper notes that known examples do not settle the conjecture; in particular, its results eliminate one candidate example by showing that TWO has a winning -tactic there.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.