A Finite-State Symbolic Automaton Model for the Collatz Map and Its Convergence Properties
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909995953553408 |
|---|---|
| author | Brauer, Leonard Ben Aurel |
| author_facet | Brauer, Leonard Ben Aurel |
| contents | We present a finite-state, deterministic automaton that emulates the Collatz function through digitwise transitions on base-10 representations. Each digit is represented as a symbolic triplet (r, p, c) encoding its value, the parity of the next digit, and an incoming carry propagated from the lower digit. This yields exactly 60 possible local states. The automaton applies local, parity-aware rules that collectively reconstruct the global arithmetic of the Collatz map. We show that all symbolic trajectories converge in finitely many steps to a unique terminal cycle (4, 0, 0) -> (2, 0, 0) -> (1, 0, 0), with all higher digit positions degenerating to the absorbing state (0, 0, 0). This collapse reveals a canonical symbolic normal form of Collatz dynamics.
In parallel, a binary view explains the dynamics as alternating bit-length growth and contraction, aligning with known heuristics for Collatz convergence. This structural perspective is further reinforced by a symbolic drift function and a ranking potential that together explain and formalize the convergence process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_21728 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Finite-State Symbolic Automaton Model for the Collatz Map and Its Convergence Properties Brauer, Leonard Ben Aurel General Mathematics Formal Languages and Automata Theory We present a finite-state, deterministic automaton that emulates the Collatz function through digitwise transitions on base-10 representations. Each digit is represented as a symbolic triplet (r, p, c) encoding its value, the parity of the next digit, and an incoming carry propagated from the lower digit. This yields exactly 60 possible local states. The automaton applies local, parity-aware rules that collectively reconstruct the global arithmetic of the Collatz map. We show that all symbolic trajectories converge in finitely many steps to a unique terminal cycle (4, 0, 0) -> (2, 0, 0) -> (1, 0, 0), with all higher digit positions degenerating to the absorbing state (0, 0, 0). This collapse reveals a canonical symbolic normal form of Collatz dynamics. In parallel, a binary view explains the dynamics as alternating bit-length growth and contraction, aligning with known heuristics for Collatz convergence. This structural perspective is further reinforced by a symbolic drift function and a ranking potential that together explain and formalize the convergence process. |
| title | A Finite-State Symbolic Automaton Model for the Collatz Map and Its Convergence Properties |
| topic | General Mathematics Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2506.21728 |