The Carry Ratchet: Why the Collatz Map Always Descends

We identify the mechanism by which the Collatz map drives every trajectory to 1. The map T(n) = 3n+1 (odd) or n/2 (even) has a single active operation: 3n+1, which simultaneously escalates magnitude and injects harmony. Escalation is uniform (log_2(3) bits per step). Harmony injection is variable: the +1 fires a carry chain through trailing bits, creating trailing zeros whose count depends on the binary geometry of n. We prove the Carry Ratchet: when the carry hits a 0-bit, it stops and the loss is bounded at exactly -1; when it hits a 1-bit, it converts it to 0 and continues — gains cascade without bound. Losses are fixed while gains compound. Working modulo 8, we identify four states: two that escalate (States 3, 7, creating 1 trailing zero each) and two that harmonise (States 1, 5, creating 2 and 4 trailing zeros respectively). State 5, whose binary signature 101 contains a gap that amplifies the carry cascade, is the engine of convergence: its expected harmony (4 zeros per step) single-handedly tips the average above the escalation threshold. Without State 5, the map diverges. We prove that State 5 cannot be avoided (spectral radius of the avoidance sub-matrix is exactly 3/4) and that the carry ratchet creates a structural asymmetry — bounded losses, cascading gains — that forces net descent. The result recovers the Lagarias ergodic mean E[k] = 2 from first principles via the decomposition E[k] = (1+1+2+4)/4 and identifies the geometric reason it exceeds log_2(3).