Search arXiv⌕ Search

arXiv · 2610.00639

$\mathfrak{d}=ω_1$ implies $\mathfrak{a}=ω_1$

Abstract

We prove in ZFC that $\mathfrak d=ω_1$ implies $\mathfrak a=ω_1$, settling a question of Roitman from the 1970s. Here $\mathfrak d$ is the least size of a family that eventually dominates every function in $ω^ω$, and $\mathfrak a$ is the least size of an infinite maximal almost disjoint (MAD) family of infinite subsets of $ω$. Consequently, $\mathfrak a\leq\mathfrak d$ whenever the continuum $\mathfrak c=2^{\aleph_0}$ is at most $ω_2$. This answers negatively Shelah's question whether $\mathfrak d<\mathfrak a$ is consistent with $\mathfrak c=ω_2$, and shows that his model of $\mathfrak d=ω_2<\mathfrak a=\mathfrak c=ω_3$ has the least possible values of $\mathfrak d$, $\mathfrak a$ and $\mathfrak c$ among models of $\mathfrak d<\mathfrak 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 $\mathfrak 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 $\mathfrak d=ω_1$, to two questions of Hrušák and to one of Brendle, Guzmán, Hrušák and Raghavan.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

José de Jesús Pelayo Gómez. 2026-09-30. $\mathfrak{d}=ω_1$ implies $\mathfrak{a}=ω_1$. https://arxiv.org/abs/2610.00639

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Proof Theory for Profinite Modal Algebras

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be presented as Lindenbaum algebras for propositional theories in infinitary versions of propositional modal calculi. In this paper we identify such calculi as modal enrichments of Maehara-Takeuti's infinitary extension of the sequent calculus $\mathbf{LK}$. We also investigate correspondences between syntactic properties of the calculi and regularity/exactness properties of the opposite category of profinite $L$-algebras.

math.LO↗

The Q-Calculus: A Quaternion-Based Laws of Form System

This paper introduces a Laws of Form version of the Quaternions. We call this the Q-Calculus, a 16-valued extension of Laws of Form (LoF) which is closely related to the BF Calculus (where we have a single square root of the mark) and the concept of the square root of negation (related to the the square root of minus one). We construct Q as a system of LoF mark operators acting on 4-tuples, and prove that the set of eight operators in Q is isomorphic to the quaternion group, which is non-commutative. We give a novel proof of several of Q's distribution laws using non-commutative logic gates. We indicate how to represent Q as braids by associating elementary braids to square roots of negation. This results in a very concise representation of Q as LoF braids. We end the paper with an indication of how we can represent the Artin braid group in LoF and how we can generalize our work with the quaternions to Clifford algebras.

math.LO↗

Pointwise provable equality and the failure of composition

In their studies of pathologies in recursion categories, Montagna (1989) and Di Paola--Montagna (1991) introduce the algebraic systems $S'$ and $S'_T$, respectively, and claim that they are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two unary programs whose partial functions are provably equal in $T$, separately at each standard input. Composing each after a program that searches for a $T$-proof of contradiction and returns its code yields programs that are not equivalent in this sense. An alternative proof uses the productivity of the complement of the diagonal halting set. Montagna's $S'$ is the case $T=\mathrm{PA}$. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗