Determinacy of Banach games

From MaRDI portal





For any \(A\subseteq {\mathbb{R}}\), the Banach game B(A) is the infinite game on reals where players I and II alternately play positive real numbers \(a_ 1,a_ 2,a_ 3,a_ 4,..\). such that \(a_ n<a_{n-1}\). Player I wins iff \(\sum^{\infty}_{i=1}\) \(a_ i\) exists and is in A. The game B(A) is said to be determined if one of the players has a winning strategy. If neither A nor \({\mathbb{R}}\setminus A\) has a perfect subset, then it is known that B(A) is not determined, so assuming the axiom of choice, not every Banach game is determined. Let ADB (the axiom of determinacy for Banach games) be the statement that every Banach game is determined. The main result of this paper is to show, in ZF, that AD\(\Rightarrow ADB\), so that (using a result of Martin), AD and ADB are equivalent (where AD is the usual axiom of determinacy). The paper includes a number of remarks on determinacy of definable Banach games.











This page was built for publication: Determinacy of Banach games

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