Search arXivSearch

arXiv · 1601.03831

From abstract alpha-Ramsey theory to abstract ultra-Ramsey theory

Abstract

We work within the framework of the Alpha-Theory introduced by Benci and Di Nasso. The Alpha-Theory postulates a few natural properties for an infinite "ideal" number $α$. The formulation provides an elementary axiomatics for the methods of abstract ultra-Ramsey theory. The main results are Theorem 10, Theorem 57, Theorem 67 and Theorem 73. Theorem 10 is an infinite-dimensional extension of the celebrated Ramsey's Theorem. We show that corollaries of this result include the Galvin-Pirky Theorem, the Silver Theorem and the $\vecα$-Ellentuck Theorem. We prove that, under the assumption of the $\mathfrak{c}^{+}$-enlarging property, the $\vecα$-Ellentuck Theorem is equivalent to the Ultra-Ellentuck Theorem of Todorcevic. Theorem 57 is an abstraction of Theorem 10 to the setting of triples $(\mathcal{R},\le,r)$ where $\mathcal{R}\not=\emptyset$, $\le$ is a quasi-order on $\mathcal{R}$ and $r$ is a function with domain $\mathbb{N}\times \mathcal{R}$. We use Theorem 57 to develop the Abstract $\vecα$-Ellentuck Theorem, Theorem 67, and the Abstract Ultra-Ellentuck Theorem, Theorem 73, extending the Abstract Ellentuck Theorem along the same lines as the $\vecα$-Ellentuck Theorem and Ultra-Ellentuck Theorem extend the Ellentuck Theorem, respectively. We conclude with some examples illustrating the theory and an open question related to the local Ramsey theory developed by Di Prisco, Mijares and Nieto.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timothy Trujillo. 2016-01-15. From abstract alpha-Ramsey theory to abstract ultra-Ramsey theory. https://arxiv.org/abs/1601.03831

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

KEEP EXPLORING

Related papers

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO

Scott topologies on meet-continuous domains

We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are $L$-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous $L$-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.

math.LO

Randomized Borel $(2d+1)$-coloring of digraphs

Let $G$ be a Borel digraph with maximum out-degree $d \in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochromatic. This gives a simpler proof of a recent result of Pelayo-Gómez: such a graph $G$ admits a measurable proper $(2d+1)$-coloring with respect to any Borel probability measure on $V(G)$. Our proof is an adaptation of Pelayo-Gómez's proof to the randomized Borel setting.

math.LO