arXiv Analytics

Sign in

arXiv:math/9911122 [math.LO]AbstractReferencesReviewsResources

A new combinatorial characterization of the minimal cardinality of a subset of R which is not of first category

Apoloniusz Tyszka

Published 1999-11-17, updated 1999-11-30Version 2

Let M denote the ideal of first category subsets of R. We prove that min{card X: X \subseteq R, X \not\in M} is the smallest cardinality of a family S \subseteq {0,1}^\omega with the property that for each f: \omega -> \bigcup_{n \in \omega}{0,1}^n there exists a sequence {a_n}_{n \in \omega} belonging to S such that for infinitely many i \in \omega the infinite sequence {a_{i+n}}_{n \in \omega} extends the finite sequence f(i). We inform that S \subseteq {0,1}^\omega is not of first category if and only if for each f: \omega -> \bigcup_{n \in \omega}{0,1}^n there exists a sequence {a_n}_{n \in \omega} belonging to S such that for infinitely many i \in \omega the infinite sequence {a_{i+n}}_{n \in \omega} extends the finite sequence f(i).

Comments: 4 pages, LaTeX 209, a new theorem added (see Abstract and Note on p.2)
Categories: math.LO
Subjects: 03E05, 54A25, 26A03
Related articles: Most relevant | Search more
arXiv:math/9907090 [math.LO] (Published 1999-07-14, updated 1999-09-27)
On the minimal cardinality of a subset of R which is not of first category
arXiv:math/9912056 [math.LO] (Published 1999-12-07, updated 2000-01-28)
A combinatorial characterization of second category subsets of X^ω
arXiv:1912.10332 [math.LO] (Published 2019-12-21)
Selective independence