The Resolution of the Collatz Conjecture: A Unified Arithmetic and Dynamical Framework

This paper presents a complete arithmetic and dynamical resolution of the Collatz Conjecture. The approach unifies the residue-class structure of the reverse Collatz function with the forward dynamical behavior of the standard map, establishing a fully deterministic system on the odd integers.

A canonical decomposition, 3m + 1 = 2^s(6t + a) with a in {1, 5}, partitions all odd integers into two infinite families of anchor-derived ladders, each generated recursively from the fixed anchors 1 and 5. These ladders are shown to be complete, disjoint, and closed under both forward and reverse Collatz iteration.

By defining a lexicographically ordered rank function rho(m) = (s, t), the forward odd-to-odd map T*(m) = (3m + 1) / 2^{v2(3m + 1)} is proven to be strictly rank-decreasing, ensuring that every trajectory terminates at the minimal element m = 1. This monotone descent excludes all nontrivial cycles and guarantees finite convergence for every integer.

The framework also demonstrates that the dyadic sieve and the recursive ladder hierarchy are equivalent views of the same process: the complete and non-overlapping coverage of all odd integers. Together these results provide a closed and verifiable model of the Collatz dynamics, unifying its arithmetic structure, recursive completeness, and forward convergence within a single deterministic theory.