Search arXivSearch

arXiv · 2308.12594

Characterizing existence of certain ultrafilters

Abstract

Following Baumgartner [J. Symb. Log. 60 (1995), no. 2], for an ideal $\mathcal{I}$ on $ω$, we say that an ultrafilter $\mathcal{U}$ on $ω$ is an $\mathcal{I}$-ultrafilter if for every function $f:ω\toω$ there is $A\in \mathcal{U}$ with $f[A]\in \mathcal{I}$. If there is an $\mathcal{I}$-ultrafilter which is not a $\mathcal{J}$-ultrafilter, then $\mathcal{I}$ is not below $\mathcal{J}$ in the Katětov order $\leq_{K}$ (i.e. for every function $f:ω\toω$ there is $A\in \mathcal{I}$ with $f^{-1}[A]\notin \mathcal{J}$). On the other hand, in general $\mathcal{I}\not\leq_{K}\mathcal{J}$ does not imply that existence of an $\mathcal{I}$-ultrafilter which is not a $\mathcal{J}$-ultrafilter is consistent. We provide some sufficient conditions on ideals to obtain the equivalence: $\mathcal{I}\not\leq_{K}\mathcal{J}$ if and only if it is consistent that there exists an $\mathcal{I}$-ultrafilter which is not a $\mathcal{J}$-ultrafilter. In some cases when the Katětov order is not enough for the above equivalence, we provide other conditions for which a similar equivalence holds. We are mainly interested in the cases when the family of all $\mathcal{I}$-ultrafilters or $\mathcal{J}$-ultrafilters coincides with some known family of ultrafilters: P-points, Q-points or selective ultrafilters (a.k.a. Ramsey ultrafilters). In particular, our results provide a characterization of Borel ideals $\mathcal{I}$ which can be used to characterize P-points as $\mathcal{I}$-ultrafilters. Moreover, we introduce a cardinal invariant which is used to obtain a sufficient condition for the existence of an $\mathcal{I}$-ultrafilter which is not a $\mathcal{I}$-ultrafilter. Finally, we prove some new results concerning existence of certain ultrafilters under various set-theoretic assumptions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rafał Filipów, Krzysztof Kowitz, Adam Kwela. 2023-08-24. Characterizing existence of certain ultrafilters. https://doi.org/10.1016/j.apal.2022.103157

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

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, 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 program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. 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

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO