HEXAGONbeta

Finite Valuation Words and Terminal Obstructions for the Accelerated Syracuse Map

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theorymath.DS — Dynamical Systems

Contributed by Tosho Karadzhov ↗

Version 1 / Oct 16, 2026 / CC BY 4.0

Abstract

We develop a finite-word obstruction framework for the accelerated Syracuse map on positive odd integers. A finite valuation word determines an exact iterate formula and a unique realization class modulo a power of two; compatible infinite prefixes define a natural two-adic inverse-limit object together with least positive representatives. The first part records the exact finite-word congruence machinery, finite-descent equivalence, terminal-surplus identity, terminal-ceiling break criterion, bad-prefix windows, activated density collapse, stabilization criterion, and strict-jump bookkeeping. The second part uses these tools to isolate terminal obstruction classes for a hypothetical counterexample: a bounded branch leading to a nontrivial accelerated cycle, and an unbounded eventual no-jump branch, successively reduced through a chain of geometric and combinatorial normal forms to a packet-surplus compensation target. The resulting reduction spine is lossless: Collatz follows from exclusion of nontrivial accelerated cycles together with a packet-surplus, or stronger record-ladder, compensation theorem for the unbounded branch. As a closed module, we include a closed class-exclusion theorem showing that no eventually periodic infinite low-surplus valuation chain is realized by a positive odd integer. On the bounded branch, we further record, as an explicit unproved roadmap step, that the terminal-ceiling strict-jump obstruction reduces to a single recurrent valuation-mismatch statement. This manuscript proves the architecture stated in its theorems, propositions, lemmas, and corollaries; it states the remaining terminal exclusions explicitly as problems, conjectures, or roadmap steps, and does not claim a completed proof of the full Collatz conjecture.

Tools used

OpenAI
ChatGPT

References

  1. T. L. Karadzhov, Eventually periodic low-surplus valuation chains for the accelerated Syracuse map , Zenodo preprint, 2026, doi:10.5281/zenodo.21169719.DOI
  2. J. C. Lagarias, The 3x+13x+1 problem: an overview , arXiv:2111.02635, 2021.arXiv
  3. J. C. Lagarias, The 3x+13x+1 problem: an annotated bibliography (1963--1999) , arXiv:math/0309224, 2003.arXiv
  4. J. C. Lagarias, The 3x+13x+1 problem and its generalizations , Amer. Math. Monthly 92 (1985), no. 1, 3--23.
  5. R. Terras, A stopping time problem on the positive integers , Acta Arith. 30 (1976), 241--252.
  6. R. E. Crandall, On the ``3x+13x+1'' problem , Math. Comp. 32 (1978), no. 144, 1281--1292.
  7. L. E. Garner, On the Collatz 3n+13n+1 algorithm , Proc. Amer. Math. Soc. 82 (1981), no. 1, 19--22.
  8. G. J. Wirsching, The Dynamical System Generated by the 3n+13n+1 Function , Lecture Notes in Mathematics, vol. 1681, Springer, Berlin, 1998.
  9. I. Krasikov and J. C. Lagarias, Bounds for the 3x+13x+1 problem using difference inequalities , Acta Arith. 109 (2003), no. 3, 237--258.
  10. T. Tao, Almost all orbits of the Collatz map attain almost bounded values , Forum Math. Pi 10 (2022), e12; arXiv:1909.03562.arXiv
Show all 18 referencesShow fewer references
  1. D. Bařina, Convergence verification of the Collatz problem , J. Supercomput. 77 (2021), 2681--2688.
  2. D. Bařina, Improved verification limit for the convergence of the Collatz conjecture , J. Supercomput. 81 (2025), article 810.
  3. V. Angeltveit, An improved algorithm for checking the Collatz conjecture for all n<2Nn<2^N , arXiv:2602.10466, 2026.arXiv
  4. S. Eliahou, The 3x+1 problem: new lower bounds on nontrivial cycle lengths , Discrete Math. 118 (1993), no. 1--3, 45--56.
  5. J. Simons and B. de Weger, Theoretical and computational bounds for mm-cycles of the 3n+13n+1-problem , Acta Arith. 117 (2005), no. 1, 51--70.
  6. C. Hercher, There are no Collatz mm-cycles with m≤91m\leq 91 , J. Integer Sequences 26 (2023), Article 23.2.8.
  7. N. Hungerbühler, Optimal bounds for the length of rational Collatz cycles , preprint, ETH Zürich, available at https://www.math.ch/norbert.hungerbuehler/publications/Optimal_bounds_for_the_length_of_rational_Collatz_cycles.pdf.link
  8. Wikipedia contributors, Collatz conjecture , Wikipedia, The Free Encyclopedia, accessed July 2026, https://en.wikipedia.org/wiki/Collatz_conjecture.link

Version history

  1. v1Submitted by Tosho KaradzhovInitial depositCurrentOct 16, 2026