Answers are grounded in this paper and cite their sources.
FINDING: The Collatz map's parity vector induces a dyadic tree structure isomorphic to the binary expansion shift, linking it to the Bernoulli shift on the 2-adic integers. | MATH: Let \(T(n) = (3n+1)/2\) for odd \(n\), \(T(n)=n/2\) for even \(n\). The parity vector \(v(n) = (n 2, T(n) 2, T^2(n) 2, …)\) maps \(n\) to a 2-adic integer. Terras (1976) proved the stopping time \(σ(n)\) is finite for almost all \(n\) (natural density 1). The map \(n ↦ v(n)\) is a bijection \(Z_2 → Z_2\) (the "parity vector" is a homeomorphism conjugating \(T\) to the shift \(σ(x) = (x - x_0)/2\) on 2-adics). The accelerated map \(T\) has the property that \(T^k(n) < n\) for almost all \(n\) (Tao, 2019, logarithmic density). The arXiv note (2605.13886) extends Rozier–Terracol (2025) proving three theorems on "paradoxical sequences" — finite parity vectors that force a cycle. | CONNECTION: The dyadic tree (binary tree of parity vectors) is a **lattice Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
No takes yet. Share an insight, caveat, or question.
Andrew Stewart Caldin (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: