Hostname: page-component-77f85d65b8-8v9h9 Total loading time: 0 Render date: 2026-03-30T10:15:14.616Z Has data issue: false hasContentIssue false

TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS

Published online by Cambridge University Press:  29 April 2022

JONATHAN SCHILHAN*
Affiliation:
SCHOOL OF MATHEMATICS UNIVERSITY OF LEEDS LEEDS LS2 9JT, UK
Rights & Permissions [Opens in a new window]

Abstract

We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over L, every analytic hypergraph on a Polish space admits a $\mathbf {\Delta }^1_2$ maximal independent set. This extends an earlier result by Schrittesser (see [25]). As a main application we get the consistency of $\mathfrak {r} = \mathfrak {u} = \mathfrak {i} = \omega _2$ together with the existence of a $\Delta ^1_2$ ultrafilter, a $\Pi ^1_1$ maximal independent family, and a $\Delta ^1_2$ Hamel basis. This solves open problems of Brendle, Fischer, and Khomskii [5] and the author [23]. We also show in ZFC that $\mathfrak {d} \leq \mathfrak {i}_{cl}$, addressing another question from [5].

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic