{"entities":{"Q734600":{"pageid":736449,"ns":120,"title":"Item:Q734600","lastrevid":63935052,"modified":"2026-04-11T16:31:57Z","type":"item","id":"Q734600","labels":{"en":{"language":"en","value":"Infinite asymptotic games"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5614562"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q734600$EF40C0E6-04AE-44AC-A224-867962CDB9E1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"68665d02a929a9bfb29e34cf6a4a17b0e987a197","datavalue":{"value":{"text":"Infinite asymptotic games","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q734600$40469D0A-922D-487F-88DC-82E6CEF9A314","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"328fd7216095d61ee94ee80a59f44a9dab6a3e7f","datavalue":{"value":"1187.46006","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q734600$DA1EE185-BBA4-4AE3-B367-71F52503599A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"47ac26fce67b5c78d6c840508475612e5ef73adc","datavalue":{"value":{"entity-type":"item","numeric-id":413210,"id":"Q413210"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q734600$9B0E0620-1A65-4B90-81F6-FDE3D8C03742","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bab90c779ff65c7caf29736de6b2408aa76bd2ff","datavalue":{"value":{"time":"+2009-10-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q734600$D00145A9-C055-4606-8758-AB63E76BCE63","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"14adc17009e51c45370fc979ce1871b16442a650","datavalue":{"value":"https://arxiv.org/abs/math/0608616","type":"string"},"datatype":"url"},"type":"statement","id":"Q734600$B60A80C1-8898-4FE1-9715-94F7873E44A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"1f8b7d7dc33529d52c835d8b6612b8bfba4b2c91","datavalue":{"value":"http://www.numdam.org/item?id=AIF_2009__59_4_1359_0/","type":"string"},"datatype":"url"},"type":"statement","id":"Q734600$086EC0B1-EAEC-42AB-A36B-7DC336C39BBE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"c155cdf3723a9f59cd61ca9395cbeab45d07a83f","datavalue":{"value":"https://eudml.org/doc/10431","type":"string"},"datatype":"url"},"type":"statement","id":"Q734600$F3153688-9684-4175-83E4-D7BB28E2FD1A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9c597c2f1188696178f9d6dd530b5de261e83129","datavalue":{"value":"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\u00eds.\\ 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