Atlas home || Conferences | Abstracts | about Atlas

1999 Summer Conference on Topology and its Applications
August 4-7, 1999
C.W. Post Campus of Long Island University
Brookville, NY, USA

Organizers
Sheldon Rothman, Ralph Kopperman

View Abstracts
Conference Homepage

Baire Relations and Winning the Banach-Mazur Game on (X, \tau)
by
Aaron R. Todd
Baruch College, CUNY
Coauthors: M. Henriksen (Harvey Mudd College), R. Kopperman (The City College of New York, CUNY), L. Zsilinszky (U. of North Carolina, Pembroke, NC)

The existence of a winning strategy for \alpha in (a form of) the Banach-Mazur implies that a space is Baire. This property unifies many Baire category theorems and behaves well for topological operations. (Fleissner and Kunen, Fund. Math. 1978, and White, PAMS 1975) However, it is neither simple to state nor easy to use. Galvin and Telgarsky (Top&Appl. 1986) and Debs (Fund. Math. 1985) show that if a winning strategy for \alpha exists, then one exists depending on only the last move of \alpha's opponent and the previous move of \alpha.

We use their result to show that there is a winning strategy if and only if there is a Baire relation: a nonempty set R of pairs of sets with nonempty interiors such that

  1. whenever (A, B) in R, A subset B,
  2. whenever A subset B, have nonempty interiors, there is C subset A with (C, B) in R, and
  3. \cap n Bn =/= \emptyset whenever B0=X, and (Bk+1, Bk) in R for each k.
There is no trace of game theory in this definition, and the talk shows the ease of using it for a variety of results.

Date received: June 14, 1999


Copyright © 1999 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cacl-76.