Abstract
A family F⊆ [ω] ω is called Rosenthal if for every Boolean algebra A, bounded sequence 〈μk:k∈ω〉 of measures on A, antichain 〈an:n∈ω〉 in A, and ε> 0 , there exists A∈ F such that ∑ n ∈ A , n ≠ kμ k(a n) < ε for every k∈ A. Well-known and important Rosenthal’s lemma states that [ω] ω is a Rosenthal family. In this paper we provide a necessary condition in terms of antichains in ℘(ω) for a family to be Rosenthal which leads us to a conclusion that no Rosenthal family has cardinality strictly less than cov (M) , the covering of category. We also study ultrafilters on ω which are Rosenthal families—we show that the class of Rosenthal ultrafilters contains all selective ultrafilters (and consistently selective ultrafilters comprise a proper subclass).
| Original language | English |
|---|---|
| Pages (from-to) | 53-69 |
| Number of pages | 17 |
| Journal | Archive for Mathematical Logic |
| Volume | 58 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - 2019 |
Austrian Fields of Science 2012
- 101032 Functional analysis
Keywords
- P-points
- POINTS
- Q-points
- Rosenthal's lemma
- Selective ultrafilters
- ULTRAFILTERS
- Ultrafilters
- Rosenthal’s lemma
Fingerprint
Dive into the research topics of 'Families of sets related to Rosenthal's lemma'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver