PRH | Aux | 4.3 • A Lyapunov Certificate for the Accelerated Collatz Map
Authors/Creators
Description
We present a finite Lyapunov certificate for the accelerated Collatz map that remains valid under an explicit "blur" budget. Fix $k \geq 1$ and let $S=\left\{1,3, \ldots, 2^k-1\right\}$ be the odd residues modulo $2^k\left(|S|=2^{k-1}\right)$. Define $F_k(r) \equiv \operatorname{odd}(3 r+1)\left(\bmod 2^k\right)$. We exhibit a function $\phi: S \rightarrow \mathbb{R}$ and parameters $\delta>0, \rho \geq 0$ with $\rho+\delta<\log (4 / 3)$ such that the $2^{k-1}$ difference constraints
$$
\log 3-\mathrm{v}_2(3 r+1) \log 2+\rho+\phi\left(F_k(r)\right) \leq \phi(r)-\delta \quad\left(\forall r \in S \backslash\left\{r^*\right\}\right),
$$
and
$$
\log 3-k \log 2+\rho+\phi\left(F_k\left(r^*\right)\right) \leq \phi\left(r^*\right)-\delta
$$
hold, where $r^*$ is the unique odd class with $3 r^*+1 \equiv 0\left(\bmod 2^k\right)$. For the integer trajectory $N \mapsto F^{\sharp}(N)=\operatorname{odd}(3 N+1)$, this yields the drift inequality
$$
\log N_{\iota+1}+\phi\left(\operatorname{odd}\left(N_{\iota+1}\right) \bmod 2^k\right) \leq \log N_\iota+\phi\left(\operatorname{odd}\left(N_\iota\right) \bmod 2^k\right)-\left(\delta+\rho-\varepsilon\left(N_\iota\right)\right)
$$
with $\varepsilon\left(N_\iota\right)=\log \left(1+1 /\left(3 N_\iota\right)\right)$. Telescoping drives odd values below a scale threshold; in general a finite bottom-range check then suffices to force a hit to 1 . For our verified instance, the per-step drift is already positive for every odd $N \geq 3$, so no bottom-range check is needed. Verification is by interval arithmetic in two equivalent ways: (i) a conservative policy at the exceptional class $r^*$ using the weight $a\left(r^*\right)=\log 3-k \log 2$ and its canonical successor $F_k\left(r^*\right) \equiv 1\left(\bmod 2^k\right)$; and (ii) a single-edge refinement that lifts only $r^*$ to modulus $2^{k+1}$, checks both odd lifts, projects back to $2^k$, and enforces the same conservative weight. Both verifications pass on the supplied certificate.
Files
Additional details
Additional titles
- Subtitle
- Backward Spectra with Blur
Related works
- Is required by
- Preprint: 10.5281/zenodo.17219735 (DOI)
References
- R. Bellman, Dynamic Programming, Princeton Univ. Press, 1957.
- R. M. Karp, "A characterization of the minimum cycle mean in a digraph," Discrete Math. 23 (1978), 309–311.
- J. C. Lagarias, "The 3x+1 problem and its generalizations," Amer. Math. Monthly 92 (1985), 3–23.
- S. Asmussen and P. W. Glynn, Stochastic Simulation: Algorithms and Analysis, Springer, 2007.
- F. L. Baccelli, G. Cohen, G.-J. Olsder, and J.-P. Quadrat, Synchronization and Linearity: An Algebra for Discrete Event Systems, Wiley, 1992.
- A. Bensoussan, J.-L. Lions, and G. Papanicolaou, Asymptotic Analysis for Periodic Struc- tures, AMS, 2011 (reprint of the 1978 edition).
- P. Butkovič, Max-Linear Systems: Theory and Algorithms, Springer, 2010.
- A. Dasdan and R. K. Gupta, Faster maximum cycle mean algorithm for performance analysis, in Proceedings of DAC, 1997, 37–40.
- R. de la Llave, J. M. Marco, and R. Moriyón, Canonical Perturbation Theory of Anosov Systems, Birkhäuser, 1986.
- P. W. Glynn and S. P. Meyn, A Liapounov bound for solutions of the Poisson equation, Ann. Probab. 24 (1996), 916–931.
- I. Kontoyiannis and S. P. Meyn, Spectral theory and limit theorems for geometrically ergodic Markov processes, Ann. Appl. Probab. 13 (2003), 304–362.
- S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, 2nd ed., Cambridge Univ. Press, 2009.
- W. Parry and M. Pollicott, Zeta Functions and the Periodic Orbit Structure of Hyperbolic Dynamics, Astérisque 187–188 (1990).
- G. A. Pavliotis and A. M. Stuart, Multiscale Methods: Averaging and Homogenization, Springer, 2008.
- A. Perišić, Collatz Proof Verification: Isabelle/HOL, Zenodo, 2025. doi:10.5281/zenodo.17308278