Infinite asymptotic games (Q734600)

This paper uses descriptive set theory techniques to carefully study certain two player games played on Banach spaces, characterizing when I or II has a winning strategy. These games have been used to establish certain embedding results [see \textit{E.\,W.\thinspace Odell} and \textit{T.\,Schlumprecht}, ``Embedding into Banach spaces with finite dimensional decompositions'', RACSAM, Rev.\ R.\ Acad.\ Cienc.\ Exactas Fís.\ Nat., Ser.\,A Math.\ 100, No.\,1--2, 295--323 (2006; Zbl 1118.46018)] in Banach space theory. Let \(E\) be a vector space with a basis \((e_i)\). The infinite asymptotic game (IAG) on \(E\) is between two players I and II. I plays first and chooses \(n_0 \in\mathbb N\). II chooses \(0\neq x_0 > n_0\), i.e., \(x_0\in \text{span}(e_i)_{i>n_0}\). I chooses \(n_1 \in \mathbb N\) and II chooses \(0\neq x_1 >n_1\) and so on. The block sequence \((x_n)_{n\in\mathbb N}\) is the outcome of the game. The author defines a second game, the subsequence game (SG) on \(E\) as follows. II begins by choosing \(0\neq x_0\in \text{span}(e_i)\) and \(I\) chooses \(\varepsilon_0 \in \{0,1\}\). Plays alternate thusly. The outcome is \((x_n)_{n\in A}\) where \(n\in A \Leftrightarrow \varepsilon_n=1\). It is proved (Theorem~2.1) that for any \(\mathbb A \subseteq E^\infty\), I (resp.,~II) has a winning strategy to force the outcome to lie in \(\mathbb A\) in the IAG iff I (resp.,~II) has a winning strategy to force the outcome to lie in \(\mathbb A\) in SG. The IAG and SG are also considered when \(E\) is a Banach space with Schauder basis \((e_i)\) and II is required to select normalized vectors. The above equivalence still holds. It is proved in Theorem~2.2 that if \(\mathbb A \subseteq bb(e_i)\), the normalized block bases of \((e_i)\), is analytic then for all \(\Delta >0\), II has a winning strategy in (IAG) to force the outcome to line in \(\mathbb A_\Delta \Leftrightarrow\) for all \(\Delta >0\) there exists a block tree \(T\) with \([T] \subseteq \mathbb A_\Delta\). Here, \(\Delta = (\delta_i)\) is a null sequence in \(\mathbb R^+\) and \[ \mathbb A_\Delta = \{(y_i) \in bb(e_i) : \exists\;(x_i) \in \mathbb A\;,\;\|x_i-y_i\| < \delta_i \;\forall\;i\}\;. \] \([T]\) is the set of branches of \(T\). More results of this type are given and then applications are presented. In particular, we have Corollary~4.5 which gives precise conditions for when I has a winning strategy in the IA \(\Delta\)-Game for \(\text{int}_\Delta(\mathbb B)\) where \(\mathbb B\subseteq S_E^\infty\) is coanalytic. This game is suitable for applications to subspaces of spaces with an FDD where precise block sequences cannot be chosen. An application given is that, if \(E\) is a separable reflexive Banach space and any weakly null tree in \(S_E\) has a branch \((x_i)\) which is subsymmetric (even in the conditional sense), then \(E\) embeds into an \(\ell_p\)-sum of finite-dimensional spaces for some \(1<p<\infty\). This extends results of [\textit{E.\,W.\thinspace Odell} and \textit{T.\,Schlumprecht}, ``Trees and branches in Banach spaces'', Trans.\ Am.\ Math.\ Soc.\ 354, No.\,10, 4085--4108 (2002; Zbl 1023.46014)], for which the relevant game is closed.