d=ω1 implies a=ω1
José de Jesús Pelayo Gómez
Abstract
We prove in ZFC that d=ω1 implies a=ω1, settling a question of Roitman from the 1970s. Here d is the least size of a family that eventually dominates every function in ωω, and a is the least size of an infinite maximal almost disjoint (MAD) family of infinite subsets of ω. Consequently, a≤ d whenever the continuum c=20 is at most ω2. This answers negatively Shelah's question whether d< a is consistent with c=ω2, and shows that his model of d=ω2< a= c=ω3 has the least possible values of d, a and c among models of d< a. The proof also gives a preservation theorem: from any dominating family of size ω1, we construct a MAD family of size ω1 that remains maximal in every outer model in which the given family is still dominating. Thus, under d=ω1, some MAD family is indestructible by every ωω-bounding forcing; it can moreover be chosen almost strongly separable, hence Cohen-indestructible. These results give negative answers, under d=ω1, to two questions of Hrušák and to one of Brendle, Guzmán, Hrušák and Raghavan.
Create a lesson
Related papers
Cone Avoidance and the No-Least-Join Theorem
Patrizio Cintioli
Tense Logic via Truth Degrees: An Algebraic Completeness Result for Kashima's Calculus
Martín Figallo, Jonathan Sarmiento, Luis Pezzini
Closure Semantics for Weak Modal Logics: Completeness and Representations
Yuki Nishimura
A Note on Narrow Systems
William Adkisson
PAC fields and difference fields with generic automorphisms
Özlem Beyarslan, Piotr Kowalski
Lattice of 456 semigroup varieties from equations of order up to 4
Bruno Le Floch