arXiv Analytics

Sign in

arXiv:1912.10332 [math.LO]AbstractReferencesReviewsResources

Selective independence

Vera Fischer

Published 2019-12-21Version 1

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support iteration of proper, $^\omega\omega$-bounding posets of length $\omega_2$ over a model of CH, we show that consistently $\mathfrak{i}<\mathfrak{a}_T$. Moreover, we show that the inequality can be witnessed by a co-analytic maximal independent family of size $\aleph_1$ in the presence of a $\Delta^1_3$ 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 $\mathfrak{i}<\mathfrak{a}$.

Related articles: Most relevant | Search more
arXiv:math/0502047 [math.LO] (Published 2005-02-02)
Two preservation theorems
arXiv:2009.06445 [math.LO] (Published 2020-09-14)
Tree forcing and definable maximal independent sets in hypergraphs
arXiv:1808.05930 [math.LO] (Published 2018-08-17)
Free sequences in P(ω)/fin