|
Organizers |
On the Cech number of Cp(X)
by
Oleg Okunev
Facultad de Ciencias, UNAM
Coauthors: Angel Tamariz Mascarúa (Facultad de Ciencias, UNAM)
It is well known that the space Cp(X) is Cech-complete if and only if X is countable and discrete, and it is easy to prove that Cp(X, [0, 1]) is Cech complete if and only if X is discrete. It appears natural to ask: given a space X, how many open sets in RX (or [0, 1]X) are necessary to intersect to obtain Cp(X) (respectively, Cp(X, [0, 1]))? We discuss some result and open problems related to this question.
Date received: February 9, 2001
Copyright © 2001 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 # cagh-79.