Search arXivSearch

arXiv · 2607.12099

Reductions and necessary conditions for tall Borel Ramsey ideals

Abstract

An ideal $\mathcal{I}$ on $ω$ has the Ramsey property if $\mathcal{I}^{+}\to(\mathcal{I}^{+})^2_2$: every $2$-colouring of the pairs of an $\mathcal{I}$-positive set has an $\mathcal{I}$-positive homogeneous subset. Whether a tall Borel ideal can have the Ramsey property is an open question of Hrušák, Meza-Alcántara, Thümmel and Uzcátegui; a coanalytic example exists in ZFC, so a negative answer must use definability essentially. Our main theorem, a synthesis of the results of the paper, states that a tall Borel Ramsey ideal admits no countable local reading. Below every positive set, such an ideal is not a countable intersection of topologically represented (or tall analytic $P$-) ideals, and its quotient has no countable dense subset. Moreover, every quotient name for a new real has uncountable width, the colouring witnessing non-selectivity of the generic ultrafilter is never read continuously on a positive condition, and hereditary tall subfamilies saturate every finite window of barrier dimensions coherently but never all dimensions at once. We prove separately that a weakly selective $q^+$ ideal admits no positive $\mathcal{ED}_{\mathrm{fin}}$-carrier. The converse question -- must Borelness force a properness-like countable reading on some positive condition? -- is stated in three precise forms with proved consequences: two of them would refute tall Borel Ramsey ideals outright, the third the strictly weaker Nash--Williams class. The main question remains open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

José de Jesús Pelayo Gómez. 2026-07-13. Reductions and necessary conditions for tall Borel Ramsey ideals. https://arxiv.org/abs/2607.12099

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