关于数字和变化的中心极限定理
A central limit theorem for the variation of the sum of digits
AI总结:
该研究针对底数b≥2的数字和函数变化定义的概率测度,通过拆分r的基b展开为块、借助b进整数上的φ-混合过程,证明了块数趋于无穷时测度经重归一化收敛于标准正态分布,并给出收敛速度估计。
摘要:
我们证明了一类由数字和函数的变化定义的、底数$b\ge2$的概率测度的中心极限定理。对于$r\ge0$和$d\in\mathbb{Z}$,我们将$\mu^{(r)}(d)$定义为满足以下条件的整数$n\in\mathbb{N}$的密度:当$n$加上$r$时,其数字和增加$d$。我们在装备了归一化Haar测度的$b$进整数群构成的概率空间上,给出了$\mu^{(r)}$的概率解释。我们将整数$r$的基$b$展开拆分为所谓的“块”,并研究当块的数量趋于无穷时$\mu^{(r)}$的渐近行为。我们证明,经过重归一化后,随着$r$的块数增长到无穷,$\mu^{(r)}$收敛于标准正态分布,同时给出了收敛速度的估计。该证明尤其依赖于定义在$b$进整数上的一个$\phi$-混合过程。
英文摘要:
We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $μ^{(r)}(d)$ as the density of integers $n\in \mathbb{N}$ for which the sum of digits increases by $d$ when we add $r$ to $n$. We give a probabilistic interpretation of $μ^{(r)}$ on the probability space given by the group of $b$-adic integers equipped with the normalized Haar measure. We split the base-$b$ expansion of the integer $r$ into so-called "blocks", and we consider the asymptotic behaviour of $μ^{(r)}$ as the number of blocks goes to infinity. We show that, up to renormalization, $μ^{(r)}$ converges to the standard normal law as the number of blocks of $r$ grows to infinity. We provide an estimate of the speed of convergence. The proof relies, in particular, on a $ϕ$-mixing process defined on the $b$-adic integers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。