The Aronszajn-null game characterization conjecture

From papers

Let XX be a separable Banach space over cmathbbRcmathbb{R}, let A\toolboxXA\toolbox X be Borel and Aronszajn-null, and let AG\mathcal{A}_{\mathsf{G}} be the game in which player I\mathbf{I} chooses a dense sequence of directions in XX and player II\mathbf{II} responds with Borel sets null on lines parallel to those directions. The notation I̸ ⁣ ⁣AG\mathbf{I}\not\!\uparrow\!\mathcal{A}_{\mathsf{G}} means that player I\mathbf{I} has no winning strategy. The Aronszajn-null game characterization conjecture. If AA is Aronszajn-null, then

I̸ ⁣ ⁣AG\mathbf{I}\not\!\uparrow\!\mathcal{A}_{\mathsf{G}}

The converse to the known implication is open, and this would characterize Aronszajn-null sets through the game.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jakub Duda and Boaz Tsaban, “Games in Banach spaces”, arXiv:math/0601556 (2010).

Solutions 0

No solutions have been posted yet.