Thirteen exact algebraic theorems (T-A through T-N) decompose every Collatz orbit via the Kodama Observable K_k = S_k − A_k·log₂(3), a logarithmic coordinate that separates the dynamics into an exact multiplicative backbone and an additive residual. The framework transforms the Collatz conjecture from a question about integer trajectories into a clearly delimited analytic inequality.

Thirteen exact algebraic theorems (T-A through T-N) decompose every Collatz orbit via the Kodama Observable K_k = S_k − A_k·log₂(3), a logarithmic coordinate that separates the dynamics into an exact multiplicative backbone and an additive residual. The framework transforms the Collatz conjecture from a question about integer trajectories into a clearly delimited analytic inequality. Main Contributions 1. Complete Reduction Chain (Theorems T-A through T-N): Collatz Conjecture ⇔ K_final bounded ⇔ Q universally bounded on primitive orbits ⇔ T-G chain termination (proved finite via 3-adic valuation, Lemma T-G). Every orbit flows back to a primitive (non-T-G-reachable) seed. The remaining open problem—bounding Σk_i across all primitive orbits—is a single, clearly delimited gap logically equivalent to the conjecture itself. 2. T-M Theorem (Generalized Universal Tail): For every odd v appearing in any Collatz orbit, there exist rational coefficients (α_v, β_v) such that Q_final = α_v·Q_v + β_v, obtained by composing the T-J injection formula along the odd chain from v to 1. 3. T-N Theorem (Aggregated k-Bound): Σk_i = S_total − A for every orbit. The inequality Q < 1 is equivalent to Σk_i < A·log₂(3) + log₂(n) + 1. This transforms the problem from orbit simulation into a combinatorial optimization over partitions of S. 4. Boundary k Classification Lemma: For λ = n/3^b, the 2-adic valuation v₂(3λ−1) = j follows an alternating residue pattern: λ ≡ r_j (mod 2ʲ⁺¹) when j is odd, λ ≡ r_j + 2^j (mod 2ʲ⁺¹) when j is even, where r_j = 3^(−1) mod 2^j. This gives the exact distribution P(k=j) = 2^(−(j−1)) for j ≥ 2, verified exhaustively against 200,000+ values. Importantly, this lemma is independent of the Collatz conjecture—it is a pure 2-adic fact about 3λ−1. 5. Three Convergent Frameworks: Two independent contemporaneous works converge to the same structural boundary from different coordinate systems: • Williams (2026, arXiv:2607.01718): crown triangles via 3-smooth factorization a·2^a·3^b • Shakibaei Asli (2026, arXiv:2601.04289): circle rotation formulation with log₆ geometry These are convergent maps of the same territory, not partial proofs—ruling out further algebraic simplification of the boundary problem. 6. Computational Verification: Verified against 100M+ orbits (50M odd orbits, ~5.4B steps), confirming n=993 as the global Q-maximum at Q_max = 0.2531421444... The Q-maximum is determined purely by (S_final, A_final), not by n itself. The Kodama Observable K_final − log₂(n) converges to ≈0.32555 in the statistical limit. Gap Statement This work does NOT claim a proof of the Collatz conjecture. The remaining gap—bounding the Kodama Observable Q below 1 across all primitive orbits beyond 10^8—is clearly delimited and is shown to be equivalent to the conjecture itself through the reduction chain. Three independent frameworks (Kodama, Williams, Shakibaei Asli) converge on the same boundary phenomenon, suggesting the problem is genuinely hard and further algebraic simplification is unlikely. Formalization and Reproducibility 13 theorems formalized as a Lean 4 skeleton (5 files, 558 lines) • 60 automated tests (5 new covering T-N theorem and boundary-k classification) • Full Python codebase for orbit analysis, record scanning, and neural verification • Open source: github.com/joelcanary/kodama-observable • All computational results reproducible via demonstrated scripts