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

连续测度的有效随机性

Effective Randomness for Continuous Measures

Jan Reimann, Theodore A. Slaman

摘要:

我们研究哪些无限二进制序列(实数)相对于某些连续(即,非原子的)概率测度。我们证明,对于每一个n,但可数许多实数是n-随机的这样一个措施,其中n表示允许的马丁-洛夫测试的算术复杂性。证明是基于一个博雷尔确定性参数,并假定存在无穷多个迭代的幂集的自然数。在论文的第二部分中,我们提出了一个元数学分析,表明这个假设确实是必要的。更确切地说,存在一个可计算函数G,使得对于任何n,“除了可数个实数之外,所有实数对于连续概率测度都是G(n)-随机的”这一陈述在$ZFC^-_n$中无法证明。这里$ZFC^-_n$代表Zermelo-Fraenkel集合论与选择公理,其中幂集公理被替换为自然数的幂集的n次迭代的存在。后一个事实的证明依赖于对随机性的一个非常普遍的障碍,即内部可定义性结构的存在。

英文摘要:

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure, where n indicates the arithmetical complexity of the Martin-Löf tests allowed. The proof is based on a Borel determinacy argument and presupposes the existence of infinitely many iterates of the power set of the natural numbers. In the second part of the paper we present a metamathematical analysis showing that this assumption is indeed necessary. More precisely, there exists a computable function G such that, for any n, the statement `All but countably many reals are G(n)-random with respect to a continuous probability measure' cannot be proved in $ZFC^-_n$. Here $ZFC^-_n$ stands for Zermelo-Fraenkel set theory with the Axiom of Choice, where the Power Set Axiom is replaced by the existence of n-many iterates of the power set of the natural numbers. The proof of the latter fact rests on a very general obstruction to randomness, namely the presence of an internal definability structure.

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

↑