Papers
Topics
Authors
Recent
Search
2000 character limit reached

Selective independence

Published 21 Dec 2019 in math.LO | (1912.10332v1)

Abstract: 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 $\Delta1_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}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.