Selective independence
Abstract
Let i denote the minimal cardinality of a maximal independent family and let aT denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of 2<ω. Using a countable support iteration of proper, ωω-bounding posets of length ω2 over a model of CH, we show that consistently i<aT. Moreover, we show that the inequality can be witnessed by a co-analytic maximal independent family of size 1 in the presence of a 13 definable well-order of the reals. The main result of the paper can be viewed as a partial answer towards the well-known open problem of the consistency of i<a.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.