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
Pseudofinite abelian groups and asymptotic classes of finite abelian groups
Carlos Cordoba-Caycedo, Dario Garcia
Spectral Theory and Descriptive Combinatorics for Non-Regular Borel pmp Graphs
Cecelia Higgins, Pieter Spaas, Sofia Torelli
The strength of the minimum principle in constructive reverse mathematics
Tatsuji Kawai
Independence of premise for intuitionistic Zermelo-Fraenkel set theory
Patrick Uftring
Condensed Whitehead Problem
Spencer Unger, Jerry Wei
Points and their multiples on curves in powers of simple abelian varieties
David J. Smith