SMALL COMBINATORIAL CARDINAL CHARACTERISTICS AND THEOREMS OF EGOROV AND BLUMBERG
Author(s) -
Ciesielski,
Pawlikowski
Publication year - 2000
Publication title -
real analysis exchange
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.229
H-Index - 20
eISSN - 1930-1219
pISSN - 0147-1937
DOI - 10.2307/44154089
Subject(s) - mathematics , omega , combinatorics , cardinality (data modeling) , monotone polygon , bounded function , uniform boundedness , discrete mathematics , uniform convergence , mathematical analysis , physics , computer network , geometry , bandwidth (computing) , computer science , data mining , quantum mechanics
We will show that the following set theoretical assumption c = ω2, the dominating number d equals to ω1, and there exists an ω1-generated Ramsey ultrafilter on ω (which is consistent with ZFC) implies that for an arbitrary sequence fn : R → R of uniformly bounded functions there is a set P ⊂ R of cardinality continuum and an infinite W ⊂ ω such that {fn P : n ∈ W} is a monotone uniformly convergent sequence of uniformly continuous functions. Moreover, if functions fn are measurable or have the Baire property then P can be chosen as a perfect set. We will also show that cof(N ) = ω1 implies existence of a magic set and of a function f : R → R such that f D is discontinuous for every D / ∈ N ∩M. Our set theoretic terminology is standard and follows that of [8]. In particular, |X| stands for the cardinality of a set X and c = |R|. We are using
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom