A Cogenetic Proof of the Collatz Relation

A Cogenetic Proof of the Collatz Relation — 2-Adic Valuation, Cogenetic Persistence Selection, and Finite Descent The Collatz conjecture asks whether every positive integer reaches the cycle 1 -> 4 -> 2 -> 1 under the map that halves even numbers and sends odd n to 3n+1. This white paper gives a proof in two complementary orders. In discovery order, the Cogenesis framework identifies a single invariant Collatz generator and distinguishes its causal operators from the selectors and coordinates that an orbit generates internally. In validation order, that relational pattern is translated into exact 2-adic arithmetic, finite descent, and strong induction. For the accelerated odd map, write a(n) for the 2-adic valuation of 3n+1. The all-odd natural-density reference mean of a is exactly 2, independently matching the valuation coordinate a(1) = 2 of the terminal cycle. An odd orbit that never descends below its initial value would instead have to sustain a tail-stable mean of at most log2(10/3) < 2. Every possible carrier of that persistent deficit - orbit-generated congruence selectors, invariant partitions, orbit weightings, projection and bifurcation residuals, continuing differentials - remains an internally generated expression of the unchanged Collatz relation, and none supplies an alternative determinant, transition law, boundary, or normalisation. The deficit therefore cannot validate a distinct stable completion. Finite descent follows, and strong induction recovers the classical conclusion. The paper states its own load-bearing step explicitly rather than burying it: the passage from a property of the relation to a property of every orbit. That step rests on the Cogenesis standing convention that infinity is unbounded continuation rather than a completed totality, together with the carrier-exhaustion argument. A reader assessing the proof should go to that passage first, since everything else is either proved outright or reduces to it. The same machinery yields exact classical results along the way, including a lower bound of 72,057,431,991 odd steps for any nontrivial cycle, derived from the affine block identity and the sign law with no approximation anywhere in the chain. The deposit contains the compiled paper, its LaTeX source and bibliography, a 120-digit orbit-trace certificate with its expanded shortcut sequence, and five independent verification scripts that re-derive the arithmetic claims in exact integer and rational arithmetic - 111 checks in total, requiring only the Python standard library.