arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.09809math.LO
收藏

两个元素和的Hindman定理的逆数学

The reverse mathematics of Hindman's theorem for sums of exactly two elements

Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch,, Reed Solomon, Linda Brown Westrick

摘要:

Hindman定理(HT)指出,对于$\mathbb N$的每一个具有100多种颜色的着色,存在一个无限集合$H \subseteq \mathbb N$,使得$H$的所有不同元素的非空和具有相同的颜色。近年来,从可计算性理论和逆数学的角度对HT的限制性版本进行研究已成为一条富有成效的研究路线。具体地,HT $^{\leqslant n}_k$是HT限制为至多$n$许多元素的和,允许至多$k$颜色,HT $^{=n}_k$是HT限制为\emph{exactly} $n$许多元素和$k$颜色的和。甚至HT $^{\leqslant 2}_2$似乎也是一个强有力的原则,甚至可能意味着HT本身优于RCA $_0$。相比之下,HT $^{=2}_2$已知严格弱于RCA $_0$上的HT,因为HT $^{=2}_2$直接遵循$2$ -着色对的拉姆齐定理。事实上,HT $^{=2}_2$是否在计算上是正确的,这个问题已经公开了好几年。我们表明,HT $^{=2}_2$和类似的结果与加法取代减法和其他操作是不可证明的RCA $_0$,甚至WKL $_0$。事实上,我们表明,有一个可计算的实例HT $^{=2}_2$,使所有的解决方案可以计算一个函数,是对角不可计算相对于$\emptyset'$。因此,存在HT $^{=2}_2$的可计算实例,而没有$Σ^0_2$解,这是相对于算术层次的最佳可能结果。进一步地,对上述关于解DNC相对于$\emptyset'$的证明结果的仔细分析表明,HT $^{=2}_2$蕴涵RRT $^{=2}_2$,即在RCA $_0$上$2$ -着色对的彩虹拉姆齐定理.在我们构造可计算着色的过程中,最有趣的一点是使用了鲁缅采夫和沈的Lovász局部引理的一个有效版本。

英文摘要:

Hindman's Theorem (HT) states that for every coloring of $\mathbb N$ with finitely many colors, there is an infinite set $H \subseteq \mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation of restricted versions of HT from the computability-theoretic and reverse-mathematical perspectives has been a productive line of research recently. In particular, HT$^{\leqslant n}_k$ is the restriction of HT to sums of at most $n$ many elements, with at most $k$ colors allowed, and HT$^{=n}_k$ is the restriction of HT to sums of \emph{exactly} $n$ many elements and $k$ colors. Even HT$^{\leqslant 2}_2$ appears to be a strong principle, and may even imply HT itself over RCA$_0$. In contrast, HT$^{=2}_2$ is known to be strictly weaker than HT over RCA$_0$, since HT$^{=2}_2$ follows immediately from Ramsey's Theorem for $2$-colorings of pairs. In fact, it was open for several years whether HT$^{=2}_2$ is computably true. We show that HT$^{=2}_2$ and similar results with addition replaced by subtraction and other operations are not provable in RCA$_0$, or even WKL$_0$. In fact, we show that there is a computable instance of HT$^{=2}_2$ such that all solutions can compute a function that is diagonally noncomputable relative to $\emptyset'$. It follows that there is a computable instance of HT$^{=2}_2$ with no $Σ^0_2$ solution, which is the best possible result with respect to the arithmetical hierarchy. Furthermore, a careful analysis of the proof of the result above about solutions DNC relative to $\emptyset'$ shows that HT$^{=2}_2$ implies RRT$^{=2}_2$, the Rainbow Ramsey Theorem for $2$-colorings of pairs, over RCA$_0$. The most interesting aspect of our construction of computable colorings as above is the use of an effective version of the Lovász Local Lemma due to Rumyantsev and Shen.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑