Banach-Mazur Games

Origin. Banach and Mazur (1930s), Oxtoby (1957). Infinite games on topological spaces. Players choose nested sets. Winning = nonempty intersection. Foundation for descriptive set theory.

Models. Two players: I and II. Play decreasing sequence of sets. Player II wins if intersection meets target. Characterizes Baire category.

Formalism.

Game G(X, A): X: topological space. A ⊆ X: target set. Players alternate choosing open sets.

Play: Round n: player I chooses Uₙ, player II chooses Vₙ. Constraint: U₁ ⊇ V₁ ⊇ U₂ ⊇ V₂ ⊇ ... All Uₙ, Vₙ open and nonempty.

Winning: Player II wins iff ∩ₙ Vₙ ∩ A ≠ ∅. (Intersection meets target A.)

Banach-Mazur theorem: A is comeager (residual) iff player II has winning strategy. A is meager iff player I has winning strategy.

Determined: One player has winning strategy. Borel games are determined.

Strategies: σ: (U₁,...,Uₙ) → Vₙ (for player II) Winning: guarantees win against all opponent plays.

Variants: Strong Choquet game. Gruenhage game. Point-picking games.

Symbols.

Symbol	Unicode	Name	Meaning
G(X,A)	—	Game	On X with target A
∩	U+2229	Intersection	Nested sets
σ	U+03C3	Strategy	Winning strategy
⊇	U+2287	Superset	Nesting

Metatheory. Baire category characterization. Determinacy for Borel. Topological games. Descriptive complexity.

Applies to. Baire category theory. Descriptive set theory. Topological dynamics. Analysis. Game-theoretic topology.

Limitations. Topological setting. Infinite games. Abstract. Limited direct applications.