几乎所有Collatz映射的轨道都达到近似有界的值
Almost all orbits of the Collatz map attain almost bounded values
AI总结:
本文证明了对于任何趋向于正无穷的函数,几乎所有Collatz轨道的最小值都小于该函数,从而在对数密度意义上强化了Collatz猜想的结论。
摘要:
定义Collatz映射Col:N+1→N+1,其中N+1={1,2,3,…}为正整数集,当N为奇数时,Col(N)等于3N+1,当N为偶数时,Col(N)等于N/2。令Col_min(N):=inf_{n∈N}Col^n(N),表示Collatz轨道N,Col(N),Col^2(N),…的最小元素。著名的Collatz猜想断言对于所有N∈N+1,Col_min(N)=1。此前,Korec证明对于任何θ>log3/log4≈0.7924,几乎所有N∈N+1满足Col_min(N)≤N^θ(在自然密度意义上)。在本文中,我们证明对于任何函数f:N+1→R,当lim_{N→∞}f(N)=+∞时,几乎所有N∈N+1满足Col_min(N)≤f(N)(在对数密度意义上)。我们的证明通过建立与Collatz迭代(或更确切地说,与紧密相关的Syracuse迭代)相关的某个首次通过随机变量的近似传输性质,该性质又源于对某个与给定频率相关的三角形集合相关的特定二维再生素过程的特征函数的估计。此估计通过研究该二维再生素过程如何与相关三角形集合相互作用来实现。
英文摘要:
Define the \emph{Collatz map} $\mathrm{Col} : \mathbb{N}+1 \to \mathbb{N}+1$ on the positive integers $\mathbb{N}+1 = \{1,2,3,\dots\}$ by setting $\mathrm{Col}(N)$ equal to $3N+1$ when $N$ is odd and $N/2$ when $N$ is even, and let $\mathrm{Col}_{\min}(N) := \inf_{n \in \mathbb{N}} \mathrm{Col}^n(N)$ denote the minimal element of the Collatz orbit $N, \mathrm{Col}(N), \mathrm{Col}^2(N), \dots$. The infamous \emph{Collatz conjecture} asserts that $\mathrm{Col}_{\min}(N)=1$ for all $N \in \mathbb{N}+1$. Previously, it was shown by Korec that for any $θ> \frac{\log 3}{\log 4} \approx 0.7924$, one has $\mathrm{Col}_{\min}(N) \leq N^θ$ for almost all $N \in \mathbb{N}+1$ (in the sense of natural density). In this paper we show that for \emph{any} function $f : \mathbb{N}+1 \to \mathbb{R}$ with $\lim_{N \to \infty} f(N)=+\infty$, one has $\mathrm{Col}_{\min}(N) \leq f(N)$ for almost all $N \in \mathbb{N}+1$ (in the sense of logarithmic density). Our proof proceeds by establishing an approximate transport property for a certain first passage random variable associated with the Collatz iteration (or more precisely, the closely related Syracuse iteration), which in turn follows from estimation of the characteristic function of a certain skew random walk on a $3$-adic cyclic group at high frequencies. This estimation is achieved by studying how a certain two-dimensional renewal process interacts with a union of triangles associated to a given frequency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。