Determinacy of Schmidt's Game and Other Intersection Games

DOI10.1017/JSL.2022.41arXiv1712.01227MaRDI QIDQ6294802FDOQ6294802

Authors: Logan Crone, Lior Fishman, Stephen K. Jackson 

Publication date: 4 December 2017

Abstract: Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the players make moves from a complete separable metric space. The determinacy of these games trivially follows from the axiom of determinacy for real games, $mathsf{AD}_{m}athbbR$, which is a much stronger axiom than that asserting all integer games are determined, $mathsfAD$. One of our main results is a general theorem which under the hypothesis $mathsfAD$ implies the determinacy of intersection games which have a property allowing strategies to be simplified. In particular, we show that Schmidt's $$ game on $mathbbR$ is determined from $mathsfAD$ alone, but on $mathbb{R}^n$ for $ngeq3$ we show that $mathsfAD$ does not imply the determinacy of this game. We also prove several other results specifically related to the determinacy of Schmidt's game. These results highlight the obstacles in obtaining the determinacy of Schmidt's game from $mathsfAD$.

Mathematics Subject Classification ID

Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Determinacy principles (03E60) Connections of number theory and logic (11U99)

This page was built for publication: Determinacy of Schmidt's Game and Other Intersection Games

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