2000 character limit reached
HL ideals and Sacks indestructible ultrafilters
Published 15 Oct 2021 in math.LO | (2110.07945v1)
Abstract: We study ultrafilters on countable sets and reaping families which are indestructible by Sacks forcing. We deal with the combinatorial characterization of such families and we prove that every reaping family of size smaller than the continuum is Sacks indestructible. We prove that complements of many definable ideals are Sacks reaping indestructible, with one notable exception, the complement of the ideal $\mathcal Z$ of sets of asymptotic density zero. We investigate the existence of Sacks indestructible ultrafilters and prove that every Sacks indestructible ultrafilter is a $\mathcal Z$-ultrafilter.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.