计算可计算动力系统中遍历平均的收敛速度和伪随机点
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
AI总结:
本文通过给出一个更简单的证明,展示了在可计算动力系统中遍历平均的有效收敛性,并由此得出当不变测度可计算时伪随机点在支撑集上稠密。
摘要:
在可计算度量空间上的遍历动力系统中,伪随机点是一个可计算点,但其动力学行为与系统的典型点具有相同的统计特性。在[Avigad et al. 2010, Local stability of ergodic averages]中证明了,在动力学可计算的系统中,可计算观测量的遍历平均有效收敛。我们给出了这个结果的另一种更简单的证明。这意味着如果不变测度也是可计算的,那么伪随机点集在不变测度的支撑集上是稠密的(因此非空)。
英文摘要:
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [Avigad et al. 2010, Local stability of ergodic averages] that in a system whose dynamics is computable the ergodic averages of computable observables converge effectively. We give an alternative, simpler proof of this result. This implies that if also the invariant measure is computable then the pseudorandom points are a set which is dense (hence nonempty) on the support of the invariant measure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。