Searcharxiv⌕ Search

arXiv · 2611.12505

Projections between Ramsey quasi-orders and topological Ramsey spaces

Abstract

A Ramsey quasi-order is a quasi-order $(\cal{R},\leq)$ such that $\cal{R}$ is a Polish space, $\leq$ is analytic and every analytic subset of $\cal{R}$ is Ramsey. In this paper, we study the transfer of the analytic Ramsey property via monotone quasi-open maps, which are closely related to a family of forcing projections between quasi-orders (ranging from weak projections to strong projections). We apply this framework to the class of topological Ramsey spaces by providing a detailed list of examples of strong projections between topological Ramsey spaces, and show that, for many of these examples, there is no weak projection in the reverse direction. We also exhibit pairs of topological Ramsey spaces that do not weakly project into each other. Finally, partially confirming a conjecture of Dobrinen, we show that every space in a large class of topological Ramsey spaces either strongly projects into the Ellentuck space or contains a dense set of atoms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Spencer Unger, Clement Yung. 2026-11-09. Projections between Ramsey quasi-orders and topological Ramsey spaces. https://searcharxiv.com/abs/2611.12505

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗