On the Uniform Computational Content of Ramsey’s Theorem

Abstract

We study the uniform computational content of Ramsey's theorem in the Weihrauch lattice. Our central results provide information on how Ramsey's theorem behaves under product, parallelization and jumps. From these results we can derive a number of important properties of Ramsey's theorem. For one, the parallelization of Ramsey's theorem for cardinality n ≥ 1 and an arbitrary finite number of colors k ≥ 2 is equivalent to the n-th jump of weak Kőnig's lemma. In particular, Ramsey's theorem for cardinality n ≥ 1 is Σ 0 n+2 -measurable in the effective Borel hierarchy, but not Σ 0 n+1 -measurable. Secondly, we obtain interesting lower bounds, for instance the n-th jump of weak Kőnig's lemma is Weihrauch reducible to (the stable version of) Ramsey's theorem of cardinality n+2 for n ≥ 2. We prove that with strictly increasing numbers of colors Ramsey's theorem forms a strictly increasing chain in the Weihrauch lattice. Our study of jumps also shows that certain uniform variants of Ramsey's theorem that are indistinguishable from a non-uniform perspective play an important role. For instance, the colored version of Ramsey's theorem explicitly includes the color of the homogeneous set as output information, and the jump of this problem (but not the uncolored variant) is equivalent to the stable version of Ramsey's theorem of the next greater cardinality. Finally, we briefly discuss the particular case of Ramsey's theorem for pairs, and we provide some new separation techniques for problems that involve jumps in this context. In particular, we study uniform results regarding the relation of boundedness and induction problems to Ramsey's theorem, and we show that there are some significant differences with the nonuniform situation in reverse mathematics.

Ramsey’s theorem and products in the Weihrauch degrees

“…We show below that the right-hand side is optimal. Our results extend a number of similar investigations, including by Dorais, Dzhafarov, Hirst, Mileti, and Shafer [13], Hirschfeldt and Jockusch [22], Patey [32], and Brattka and Rakotoniaina [10].…”

“…It is obvious that D 2 k . An independent proof can be found in [10,Corollary 6.12]. Note that if j < k then the version of each of the above principles for j-colorings is strongly Weihrauch reducible to the version for k-colorings.…”

Π10-Encodability and Omniscient Reductions

“…Among them, reverse mathematics study their logical consequences [21]. More recently, various notions of effective reductions have been proposed to compare mathematical problems, namely, Weihrauch reductions [1,3], computable reductions [11], computable entailment [20], among others. A problem P is computably reducible to another problem Q (written P ≤ c Q) if every P-instance I computes a Q-instance J such that every solution to J computes relative to I a solution to I. P is Weihrauch reducible to Q (written P ≤ W Q) if moreover this computable reduction is witnessed by two fixed Turing functionals.…”

The uniform content of partial and linear orders

“…(1) Either there is an infinite sequence F 0 < F 1 < · · · of ascending blobs contained in X, and the ascending Seetapun tree generated by this sequence is finite, or there is an infinite set Y ⊆ X that contains no ascending blob. (2) Either there is an infinite sequence F 0 < F 1 < · · · of descending blobs contained in X, and the descending Seetapun tree generated by this sequence is finite, or there is an infinite set Y ⊆ X that contains no descending blob.…”