Preprint
Article

This version is not peer-reviewed.

Same Shadows, Different Forests: Cycles and Basin Densities of Collatz-Type Maps

Submitted:

17 November 2026

Posted:

19 November 2026

You are already at the latest version

Abstract
We study why Collatz-type maps with similar local predecessor statistics can have different global cycles and basin shares. The maps 3\( x \) + 1 and 3\( x \) - 1 have corresponding local branching and cotree statistics, yet the latter has three known positive cycles. The classical parity-word divisibility criterion gives an exhaustive census of 1097 primitive cycles for 3\( x \) + \( c \) with \( |c|\le1000 \) and parity-word length at most 40. Using first-passage estimates of Gonçalves, Greenfeld and Madrid, we prove that every completely invariant set of the accelerated map \( T_{3,c} \), for odd \( c\ge-1 \), has a logarithmic density. In particular, basin and predecessor-set densities exist in this sense. Conditionally on a recent natural-density transport of Allikvere, which carries over to all these maps, they are natural densities. The resulting predecessor potential \( h(a) \) satisfies an exact conservation law across the backward levels of a cycle. Gcd classes and multiplicative cosets give further invariant sets of exactly computable density, but do not by themselves determine individual basin densities. We also prove a residue-class lower bound for the means of \( a\,h(a) \) in terms of the Syracuse law; a matching upper bound and the proposed exact profile remain conjectural. An appendix reduces part of the missing upper bound, conditionally on the coupling estimates of that proof, to uniform integrability of the stopped predecessor potential of the odd targets; large-scale predecessor counts are consistent with this but cannot decide it. Numerically, a parameter-free harmonic backward-mass model predicts 410 measured basin shares with approximately 3% median relative error. Additional conclusions for \( 3x\pm1 \) use recent predecessor-density preprints of Mazur and El Jaouhari. Lean 4 checks the elementary finite statements; the density and Syracuse statements are not machine-certified.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.