Abstract
The research presented in this paper was motivated by our aim to study a problem due to J. Bourgain [3]. The problem in question concerns the uniform boundedness of the classical separation rank of the elements of a separable compact set of the first Baire class. In the sequel we shall refer to these sets (separable or non-separable) as Rosenthal compacta and we shall denote by ∝(f) the separation rank of a real-valued functionfinB1(X), withXa Polish space. Notice that in [3], Bourgain has provided a positive answer to this problem in the case ofKsatisfyingwithXa compact metric space. The key ingredient in Bourgain's approach is that whenever a sequence of continuous functions pointwise converges to a functionf, then the possible discontinuities of the limit function reflect a local ℓ1-structure to the sequence (fn)n. More precisely the complexity of this ℓ1-structure increases as the complexity of the discontinuities offdoes. This fruitful idea was extensively studied by several authors (c.f. [5], [7], [8]) and for an exposition of the related results we refer to [1]. It is worth mentioning that A.S. Kechris and A. Louveau have invented the rank rND(f) which permits the link between thec0-structure of a sequence (fn)nof uniformly bounded continuous functions and the discontinuities of its pointwise limit. Rosenthal'sc0-theorem [11] and thec0-index theorem [2] are consequences of this interaction.Passing to the case where either (fn)nare not continuous orXis a non-compact Polish space, this nice interaction is completely lost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.