An Analytical Solution to the Collatz Conjecture via Non-Divisive Linear Dynamics and Bit-Boundary Invariance

This paper introduces a novel, purely algebraic formulation of the Collatz Conjecture (3n + 1 problem) that completely bypasses traditional division-by-two operations. By applying the principle of deferred division, the chaotic Collatz mapping is transformed into a monotonically increasing linear sequence where each macro-step multiplies the integer by 3 and adds its lowest non-zero binary bit. We rigorously demonstrate that the system’s global evolution is governed by a dual asymptotic race, where the left (MSB) components grow at a rate of 3^k, while the right (LSB) driving bit scales at 4^k. Since 4^k > 3^k for all $k \ge 1$, the compressive force asymptotically dominates the initial structural entropy. Combined with the invariant property of binary boundaries, we show that the internal bit-space collapses, forcing any arbitrary integer to inevitably reach a pure power of two.