compactness在可计算性理论和非标准分析中的优势
The strength of compactness in Computability Theory and Nonstandard Analysis
摘要:
紧性是分析的核心概念之一:它将局部性质与全局性质联系起来,并使极限表现良好。研究了不可数覆盖下Cantor空间$2^{\mathbb{N}}$的紧性的计算性质。最基本的问题是:从$2^{\mathbb{N}}$的这样一个覆盖中计算一个有限子覆盖有多难?另一个自然的问题是:计算一个覆盖了$2^{\mathbb{N}}$减去从这样一个覆盖中得到的测度零点集的序列有多难?特殊和弱fan泛函分别计算这样的有限子覆盖和序列。在本文中,我们建立了这些新的扇泛函之间的联系,一方面,各种著名的概括公理的另一方面,包括算术理解,超限递归,和Suslin功能。本文还从逆向数学的角度分析了非标准分析中紧性的逻辑强度。也许令人惊讶的是,后者的结果(通常完美地)反映了特殊和弱风扇泛函的计算特性。特别是,我们表明,紧凑性(非标准的或其他)很容易把我们带到外边缘的逆向数学(即$Π_2^1$ -CA $_0$),甚至到施韦伯的高阶框架(即$Σ_{1}^{2}$ -分离)。
英文摘要:
Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers. The most basic question is: how hard is it to compute a finite sub-cover from such a cover of $2^{\mathbb{N}}$? Another natural question is: how hard is it to compute a sequence that covers $2^{\mathbb{N}}$ minus a measure zero set from such a cover? The special and weak fan functionals respectively compute such finite sub-covers and sequences. In this paper, we establish the connection between these new fan functionals on one hand, and various well-known comprehension axioms on the other hand, including arithmetical comprehension, transfinite recursion, and the Suslin functional. In the spirit of Reverse Mathematics, we also analyse the logical strength of compactness in Nonstandard Analysis. Perhaps surprisingly, the results in the latter mirror (often perfectly) the computational properties of the special and weak fan functionals. In particular, we show that compactness (nonstandard or otherwise) readily brings us to the outer edges of Reverse Mathematics (namely $Π_2^1$-CA$_0$), and even into Schweber's higher-order framework (namely $Σ_{1}^{2}$-separation).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。