A new combinatorial characterization of the minimal cardinality of a subset of R which is not of first category
Apoloniusz Tyszka
Abstract
Let M denote the ideal of first category subsets of R. We prove that mincard X: X ⊂eq R, X ∈ M is the smallest cardinality of a family S ⊂eq 0,1ωwith the property that for each f: ω-> n ∈ ω0,1n there exists a sequence ann ∈ ω belonging to S such that for infinitely many i ∈ ωthe infinite sequence ai+nn ∈ ω extends the finite sequence f(i). We inform that S ⊂eq 0,1ωis not of first category if and only if for each f: ω-> n ∈ ω0,1n there exists a sequence ann ∈ ω belonging to S such that for infinitely many i ∈ ωthe infinite sequence ai+nn ∈ ω extends the finite sequence f(i).
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf