The Collatz Conjecture: Conquered by a Finite State Machine and Structural Confinement

Abstract

The Collatz Conjecture, a long-standing open problem in number theory, asserts that every positive integer sequence generated by the Collatz function eventually reaches the 4-2-1 cycle. This paper presents a rigorous proof by introducing a structured state-space framework that classifies all positive integers into five mutually exclusive sets: the Cycle, ROM3, Precursor, Immediate Successor, and Reachable sets. This classification fully encapsulates all possible Collatz trajectories, enabling a systematic analysis of their behavior. We establish that all sequences are bounded and, once within this structured state space, follow deterministic transitions that guarantee convergence to the unique attractor, the 4-2-1 cycle. Our approach resolves the conjecture through a combination of structural confinement and finite-state analysis, providing a definitive proof of its validity.