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

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).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…