Preprint
Concept Paper

This version is not peer-reviewed.

Coincidence of Critical Thresholds for Collatz-Type Maps: Why the Divisor Prime Must Be Two

Submitted:

09 August 2026

Posted:

10 August 2026

You are already at the latest version

Abstract
To a Collatz-type map T_{a,b,q}(n) = (an+b)/q^{v_q(an+b)} one may attach two numerical invariants of opposite character: an archimedean one, the mean logarithmic drift delta = log a - E[v] log q, which governs whether orbits grow or shrink; and a non-archimedean one, the similarity dimension dim_S = H(nu_q)/log a of the invariant measure of an associated iterated function system on the a-adic integers. Each reaches its critical value at a particular multiplier a. We prove that these two critical multipliers coincide precisely when q = 2, and that in general they differ by the exact factor q-1: a_drift = (q-1) a_dim. The proof rests on the pointwise identity -log nu_q(m) = m log q - log(q-1), valid for every m >= 1, which is not a normalisation but a coincidence between the information content of a valuation and its archimedean cost. We show that the condition q = 2 is equivalent to three further properties of the family - the triviality of (Z/qZ)^*, the vanishing of an associated free energy, and the map's being everywhere defined on the units - so that the arithmetic distinguishing the classical 3x+1 map is one condition in four guises. Three complements are proved: the full Renyi spectrum of the invariant measure admits a closed form, of which the similarity dimension is the value at t=1; for q >= 3 there is a nonempty band of multipliers on which the map contracts on average while its invariant measure is singular; and the transfer operator, though quasi-compact on Holder spaces, has no eigenvalue other than 1, its entire remaining spectrum being essential spectrum at the contraction rate. Two further results give the family a sharper shape. First, a purity theorem: mu_{a,b,q} is either purely absolutely continuous or purely singular with respect to Haar measure, never a mixture. Its proof is a direct consequence of the uniqueness of the invariant measure, and we know of no route to it from the probabilistic description of the underlying random variable. Second, a complete classification: among all integer pairs (a,q) with a >= 2, q prime and gcd(a,q) = 1, exactly two - namely (3,2) and (2,3) - lie in the supercritical regime a < a_dim, and for every other pair the invariant measure is unconditionally singular. The first of these is the Collatz map. We are explicit that none of this bears on the Collatz conjecture, and we prove why it cannot.
Keywords: 
;  ;  ;  ;  ;  ;  ;  

1. Introduction

1.1. The Problem

The Collatz, or 3 x + 1 , map admits a standard acceleration. On odd integers set
T ( n ) = 3 n + 1 2 v 2 ( 3 n + 1 ) ,
where v q denotes the q-adic valuation; this is the Syracuse map, and it carries odd integers to odd integers. It sits inside an evident family: for integers a , b and a prime q with q a , put
T a , b , q ( n ) = a n + b q v q ( a n + b ) .
The classical case is ( a , b , q ) = ( 3 , 1 , 2 ) .
Two very different numbers are attached to (1). The first is archimedean and classical. Since a single step multiplies n by roughly a / q v , the mean logarithmic drift is
δ ( a , q ) = log a E [ v ] log q ,
and the sign of δ decides, heuristically, whether typical orbits shrink or grow. For ( 3 , 1 , 2 ) one has E [ v ] = 2 and δ = log 3 2 log 2 = log ( 3 / 4 ) < 0 : the familiar reason to expect the Collatz conjecture to be true.
The second is non-archimedean and, in the form used here, recent. Unrolling (1) and reducing modulo a k annihilates the dependence on the initial value; what survives is the law of a random variable on the a-adic integers Z a , and that law is the invariant measure of a countable affine iterated function system all of whose maps are similarities of ratio 1 / a (Section 3). Such a measure has a similarity dimension
error ( a , q ) = H ( ν q ) log a ,
where ν q is the law of the valuation v = v q ( a n + b ) and H is Shannon entropy; error is an upper bound for the Hausdorff dimension of the measure (Proposition 4), and error = 1 is the threshold separating the regime in which the measure can be absolutely continuous from that in which it is necessarily singular.
Each quantity singles out a critical multiplier. There is a unique a drift > 1 with δ = 0 , and a unique a dim > 1 with error = 1 . For the Collatz prime q = 2 both equal 4. It is natural to ask whether this is an accident of the value q = 2 or a general feature of the family.

1.2. Results

It is not general, and the failure is exact.
Theorem 1.
Let q be a prime and let ν q be the law of the valuation v = v q ( a n + b ) for n ranging, with natural density, over the arithmetic progression on which q a n + b . Then:
(i)
ν q ( m ) = ( q 1 ) q m for m 1 , and
log ν q ( m ) = m log q log ( q 1 ) for every m 1 ;
(ii)
H ( ν q ) = E [ v ] log q log ( q 1 ) ;
(iii)
a drift = ( q 1 ) a dim .
In particular a drift = a dim if and only if q = 2 .
The identity (i) is pointwise, not merely in expectation, and it is the engine of everything else: it says that the archimedean cost m log q of dividing by q m and the information content log ν q ( m ) of observing that division differ by a constant, namely the free energy of the valuation law. When that constant vanishes, cost and information are the same functional, and the two critical multipliers must agree.
The condition q = 2 turns out to be a single condition seen from four sides.
Theorem 2.
For a prime q the following are equivalent.
(a)
q = 2 .
(b)
( Z / q Z ) × = 1 .
(c)
The pressure P ( 1 ) = log m 1 e m log q of the archimedean cost function at inverse temperature one vanishes.
(d)
H ( ν q ) = E [ v ] log q ; equivalently a dim = a drift .
(e)
For some (equivalently, any) a , b with q a and a n + b 0 ( mod q ) solvable at a unit, the map T a , b , q is defined ateveryn prime to q, i.e. a division occurs at every step.
Two complements are proved. The first quantifies what is lost for q 3 .
Theorem 3.
Let q 3 be prime. Then a dim < a drift , and for every real a ( a dim , a drift ) the map (1) has strictly negative drift while its invariant measure has similarity dimension strictly less than 1, hence is singular with respect to Haar measure on Z a . For q = 2 this band is empty.
The second says that the natural operator attached to the system carries no spectral information, which we record because the opposite is easy to assume.
Theorem 4.
Let L be the Markov operator of the system on Z a , let V n be the space of functions constant on balls of radius a n , and for α > 0 let C α ( Z a ) be the corresponding Hölder space. Then
(i)
L ( V n ) V n 1 , and L n f = ( f d μ ) 1 for every f V n ;
(ii)
L f f and [ L f ] α a α [ f ] α , so L is quasi-compact on C α with essential spectral radius at most a α ;
(iii)
the only eigenvalue of L on C α of modulus exceeding a α is 1, which is simple with eigenspace the constants.
Thus L does possess a spectral gap on Hölder spaces, but a degenerate one: apart from the peripheral eigenvalue the spectrum is entirely essential and sits at the contraction rate, so no eigenvalue carries dynamical information, and at any fixed resolution convergence to equilibrium is exact after finitely many steps rather than exponentially fast.
Theorem 5
(Rényi spectrum). For t > 0 , t 1 , set
D t S ( a , q ) = t log ( q 1 ) log ( q t 1 ) ( 1 t ) log a , D 1 S : = error .
Then D t S is continuous at t = 1 , and the Rényi dimensions of μ a , b , q satisfy D t min 1 , D t S for all t > 0 .
The similarity dimension is thus the value at t = 1 of a one-parameter family available in closed form; this is what the free-energy computation of Section 2 buys beyond notation.
The next two results are, in our view, the substance of the paper.
Theorem 6
(Purity). μ a , b , q is either absolutely continuous or singular with respect to Haar measure λ on Z a ; no mixed case occurs. Consequently
μ λ TV ( μ , λ ) < 1 lim n TV ( μ n , λ n ) < 1 .
The proof (Section 5) uses only the uniqueness clause of Proposition 2: the absolutely continuous part of μ is itself a fixed point of the Markov operator, so if it is nonzero its normalisation must be  μ . Uniqueness of a fixed point is a statement about the iterated function system and not about the law of any one random variable; we do not know how to see Theorem 6 from the recursion alone. The corollary matters because it converts total-variation data, which is computable, into a decision procedure in principle for a question—absolute continuity—which is otherwise inaccessible.
Theorem 7
(Classification of the supercritical regime). Let a 2 and q prime with gcd ( a , q ) = 1 . Then a < a dim ( q ) holds for exactly two pairs:
( a , q ) = ( 3 , 2 ) and ( a , q ) = ( 2 , 3 ) .
For every other admissible pair, error μ a , b , q < 1 and μ a , b , q is singular with respect to λ, for every b coprime to a.
The first pair is the Collatz map. Thus, of the entire two-parameter family, precisely two members have an invariant measure whose absolute continuity is not settled by a dimension count, and the classical 3 x + 1 map is one of them.

1.3. Discussion

Theorem 1 is a statement about the family (1) and not about the Collatz conjecture, on which it has no bearing. Its interest, such as it is, lies in isolating what is arithmetically special about the classical parameters. It is often said that the Collatz conjecture is delicate because log 3 / log 2 is close to, but below, 2. Theorem 1 locates the delicacy elsewhere: the constant 4 at which the classical map sits just below threshold is simultaneously the dimensional and the dynamical critical value only because the divisor prime is 2, and for every other prime the two thresholds are separated by the order of the unit group of the residue field.
We have made no attempt to survey the very large literature on generalised Collatz maps; see Lagarias [6,8] for the standard entry points, Conway [1] for the undecidability of the general family, and Tao [10] for the strongest known partial result, in which the 3-adic random variable underlying Section 3 is introduced. Iterated function systems on local fields are treated in the general framework of random affine recursions; see Kesten [5] and Goldie [2] for the archimedean theory and Hutchinson [4] for the contraction principle used in Proposition 2.

2. The Valuation Law

Throughout, q is a prime and a , b are integers with q a . Since a is invertible modulo q, the congruence a n + b 0 ( mod q ) has a unique solution n n 0 ( mod q ) , and we write
P = { n Z : n n 0 ( mod q ) }
for the progression on which a division actually occurs.
Lemma 1.
For n ranging over P with natural density,
ν q ( m ) : = P v q ( a n + b ) = m = ( q 1 ) q m , m 1 .
Consequently ν q is a probability law on Z 1 with E [ v ] = q / ( q 1 ) .
Proof. 
Write n = n 0 + q t with t Z . Then a n + b = ( a n 0 + b ) + a q t = q ( c + a t ) , where c = ( a n 0 + b ) / q Z . Since q a , the map t c + a t is a bijection of Z / q k Z for every k, so c + a t is equidistributed modulo every power of q as t ranges over Z with natural density. For an equidistributed integer u one has P ( v q ( u ) = j ) = ( 1 q 1 ) q j for j 0 . Hence
ν q ( m ) = P v q ( c + a t ) = m 1 = ( 1 q 1 ) q ( m 1 ) = ( q 1 ) q m .
Summing,
m 1 ( q 1 ) q m = ( q 1 ) · q 1 1 q 1 = 1 , E [ v ] = m 1 P ( v m ) = m 1 q ( m 1 ) = q q 1 .
Lemma 2
(Pointwise cost–information identity). For every m 1 ,
log ν q ( m ) = m log q log ( q 1 ) .
Proof. 
Immediate from Lemma 1: log ( q 1 ) q m = m log q log ( q 1 ) . □
Lemma 2 has a thermodynamic reading. Regard E ( m ) = m log q as the energy of the event { v = m } : it is exactly the archimedean cost, log | q m | , of the division performed at that step. The Gibbs state at inverse temperature β = 1 for this energy is Z 1 e E ( m ) = Z 1 q m with partition function Z = m 1 q m = 1 / ( q 1 ) ; that is exactly ν q . The associated pressure is
P ( 1 ) = log Z = log ( q 1 ) .
Proposition 1.
H ( ν q ) = E [ v ] log q log ( q 1 ) , and therefore
H ( ν q ) = E [ v ] log q q = 2 .
Proof. 
Since E [ v ] = q / ( q 1 ) < , Lemma 2 may be integrated against ν q :
H ( ν q ) = E log ν q ( v ) = E v log q log ( q 1 ) = E [ v ] log q log ( q 1 ) .
The difference H ( ν q ) E [ v ] log q equals log ( q 1 ) , which vanishes if and only if q 1 = 1 . □
Remark 1.
Explicitly H ( ν q ) = log q q 1 + log q q 1 . For q = 2 this is 2 log 2 = log 4 ; for q = 3 it is log 3 2 + log 3 2 = 0.954771 , against E [ v ] log q = 3 2 log 3 = 1.647918 , the difference being log 2 as Proposition 1 requires.

3. The associated system on Z a

Fix in addition an integer a 2 with gcd ( a , q ) = 1 and gcd ( a , b ) = 1 . Let Z a = lim Z / a n Z be the ring of a-adic integers, equipped with d ( x , y ) = a sup { n : a n x y } .
Remark 2.
The notation Z a for lim Z / a n Z with a not necessarily prime is not universal; when a = p e p one has Z a p a Z p as rings, but the metric below is the one induced by powers of a, not by any single p, and it is with respect to that metric that the maps f s are similarities of ratio 1 / a . Readers interested only in the classical case may take a = 3 throughout.
Lemma 3.
d is an ultrametric on Z a , the space ( Z a , d ) is compact, balls of radius a n are the residue classes modulo a n and have Haar measure a n , and multiplication by a is a similarity of ratio exactly 1 / a .
Proof. 
If a n x y and a n y z then a n x z , giving the ultrametric inequality; compactness is the inverse limit of finite sets. The ball of radius a n about x is { y : a n x y } , a class modulo a n , and normalised Haar measure assigns each of the a n classes the mass a n . Finally a n x y if and only if a n + 1 a ( x y ) , so d ( a x , a y ) = a 1 d ( x , y ) . □
Definition 1.
TheSyracuse systemof ( a , b , q ) is the pair { f s } s 1 , ν q with
f s : Z a Z a , f s ( x ) = q s ( b + a x ) .
This is well defined because gcd ( q , a ) = 1 makes q a unit of Z a .
Proposition 2.
Every f s is a similarity of ratio 1 / a . There is a unique Borel probability measure μ = μ a , b , q on Z a with
μ = s 1 ν q ( s ) ( f s ) * μ ,
and μ is supported on the units Z a × .
Proof. 
Since q s is a unit, d ( f s x , f s y ) = | q s | d ( a x , a y ) = a 1 d ( x , y ) by Lemma 3.
Let M ρ = s ν q ( s ) ( f s ) * ρ act on the space P ( Z a ) of Borel probability measures, metrised by the Monge–Kantorovich distance W 1 . Given ρ , ρ and an optimal coupling ( X , Y ) , draw s ν q independently and couple M ρ with M ρ through ( f s X , f s Y ) ; then
W 1 ( M ρ , M ρ ) E d ( f s X , f s Y ) = 1 a E d ( X , Y ) = 1 a W 1 ( ρ , ρ ) .
As Z a is compact, ( P ( Z a ) , W 1 ) is a complete metric space, and the Banach fixed point theorem supplies a unique solution of (5).
Finally f s ( x ) q s b ( mod a ) , and gcd ( b , a ) = gcd ( q , a ) = 1 , so every f s takes values in Z a × ; hence so does μ . □
The system is not merely modelled on (1); it is (1), branch by branch.
Proposition 3.
If n lies in the domain of T a , b , q and r = v q ( a n + b ) , then T a , b , q ( n ) = f r ( n ) . Consequently, writing r i = v q a T i ( n ) + b ,
T k ( n ) = f r k 1 f r 0 ( n ) ,
and since this composition has linear coefficient a k q R k with R k = r 0 + + r k 1 , the residue T k ( n ) mod a k does not depend on n.
Proof. 
By definition q r T ( n ) = a n + b , i.e. T ( n ) = q r ( b + a n ) = f r ( n ) ; iterate. A composition of k maps of the form x q s ( b + a x ) is affine with linear coefficient a k q R k , and a k 0 ( mod a k ) . □
Remark 3.
The forward dynamics composes on theleft, whereas the invariant measure of an iterated function system arises from composition on theright. The two agree in law, because the driving sequence is i.i.d. and hence exchangeable; this is why μ and not some other measure is the relevant object. For q = 2 the driving sequence really is i.i.d.: for every word ( r 0 , , r k 1 ) Z 1 k the set of admissible n realising it is a single residue class modulo q R k + 1 , of density q R k , by induction on k using the invertibility of a modulo powers of q. This is Terras’ parity-vector theorem [12] in valuation coordinates.
Proposition 4.
error μ min 1 , error , where error = H ( ν q ) / log a .
Proof. 
The bound by 1 is Lemma 3, since Z a has Hausdorff dimension 1. For the other, let Σ = Z 1 N carry the product measure ν q N and let π : Σ Z a be the coding map π ( w ) = lim k f w 1 f w k ( x 0 ) , which exists and is independent of x 0 by uniform contraction, and satisfies π * ν q N = μ . Each f w 1 w k has ratio a k , so f w 1 w k ( Z a ) is precisely the ball B ( π ( w ) , a k ) ; hence
μ B ( π ( w ) , a k ) ν q ( w 1 ) ν q ( w k ) .
By the Shannon–McMillan–Breiman theorem, for ν q N -almost every w one has 1 k log i k ν q ( w i ) H ( ν q ) . Therefore for μ -almost every x,
lim inf k log μ ( B ( x , a k ) ) log a k H ( ν q ) log a ,
and the Billingsley lemma gives error μ H ( ν q ) / log a . □

4. Periodic Points and Rational Cycles

Recall (Lagarias [7]) that a rational Syracuse k-cycle with valuation word ( r 0 , , r k 1 ) is the solution of n ( q R a k ) = c , where R = r i , R i = r 0 + + r i 1 and c = i = 0 k 1 a k 1 i b q R i .
Lemma 4.
For w = ( s 1 , , s k ) put S = s j and S i = s 1 + + s i . Then f w = f s 1 f s k is affine with linear coefficient a k q S , and has the unique fixed point
x w = i = 1 k a i 1 b q S S i q S a k Z a .
Proof. 
Composing x q s ( b + a x ) gives linear coefficient a k q S and constant term β = i = 1 k a i 1 b q S i , so x w = β / ( 1 a k q S ) . Existence and uniqueness hold because | a k q S | a = a k < 1 . □
Remark 4.
Lemma 4 is not new: for a general “Hydra map” it is equation (2.62) of Siegel [9], in the form x = H j ( 0 ) / 1 H j ( 0 ) . Siegel observes that this expression is awkward on account of its denominator and therefore studies the numerator alone, χ H ( j ) : = H j ( 0 ) , which he calls thenumenof H (his Definition 2.14). Extended to infinite strings, χ H is exactly the coding map π of Proposition 4, so that
μ a , b , q = ( χ H ) * Haar measure on Z q .
This is the cleanest description of the measure studied here, and we adopt it: μ is the distribution of Siegel’s numen under Haar measure. Its Fourier transform is Siegel’s characteristic function φ H (his (2.172)), which he identifies with the characteristic function of Tao’s Syracuse random variable, and for which he proves the renormalisation identity φ H ( t ) = p 1 j e 2 π i { b j t / d j } q φ H ( a j t / d j ) (his Proposition 2.18). We claim no novelty for any of this.
Theorem 8.
x w equals the rational Syracuse k-cycle with valuation word w = ( s k , s k 1 , , s 1 ) .
Proof. 
Put r j = s k j for 0 j k 1 . Then R = S and R i = j < i s k j = S S k i , so with m = k i ,
c = i = 0 k 1 a k 1 i b q S S k i = m = 1 k a m 1 b q S S m ,
which is the numerator in Lemma 4. □
The reversal is not cosmetic: the forward dynamics composes on the left while the invariant measure arises from composition on the right (Remark 3), and Theorem 8 is the arithmetic shadow of that fact. We now record the correspondence in the form it deserves.
Theorem 9
(Correspondence). Let σ ( s 1 , , s k ) = ( s 2 , , s k , s 1 ) denote cyclic rotation, and call wprimitiveif w u j for any j 2 . Then:
(i)
x σ w = f s 2 f s k ( x w ) = T k 1 ( x w ) , so the k rotations of w produce the k elements of a single cycle;
(ii)
x u j = x u for every j 1 ;
(iii)
the assignment w { x σ i w } i < k induces a bijection
{ primitive words of length k } / σ { rational Syracuse k - cycles of T a , b , q } .
Proof. (i) Write f w = f s 1 g with g = f s 2 f s k , so f σ w = g f s 1 . From f s 1 ( g ( x w ) ) = x w , applying g gives f σ w ( g ( x w ) ) = g ( x w ) ; uniqueness in Lemma 4 yields x σ w = g ( x w ) . By Theorem 8 the valuation word of x w is ( s k , , s 1 ) , so T ( x w ) = f s k ( x w ) and inductively T k 1 ( x w ) = f s 2 f s k ( x w ) = g ( x w ) .
(ii) f u j = ( f u ) j fixes x u ; uniqueness gives x u j = x u .
(iii) Surjectivity: a rational k-cycle has a valuation word; reverse it and pass to its primitive root, using Theorem 8 and (ii). Injectivity: a cycle determines its valuation word up to cyclic rotation of the base point, and reversal carries rotation classes to rotation classes, since σ w = σ k 1 w ; hence w is determined up to σ , and primitivity removes the ambiguity of (ii). □
Corollary 1.
For ( a , b , q ) = ( 3 , 1 , 2 ) the fixed point of f s is 1 / ( 2 s 3 ) . In particular f 1 fixes 1 , the 3 x + 1 cycle on the negative integers, and f 2 fixes 1, the trivial cycle { 1 , 2 , 4 } .

5. Purity, and the Absolute-Continuity Dichotomy

Proof 
(Proof of Theorem 6). Let μ = μ ac + μ s be the Lebesgue decomposition with respect to λ .
Each f s preserves both classes. Multiplication by a is injective on Z a and satisfies λ ( a S ) = a 1 λ ( S ) , while translation and multiplication by the unit q s preserve λ . Hence for Borel E with λ ( E ) = 0 we get λ ( f s 1 E ) = a λ ( q s E b ) a Z a a λ ( E ) = 0 , so ( f s ) * μ ac λ ; and if μ s is carried by a λ -null set N then ( f s ) * μ s is carried by f s ( N ) , with λ ( f s ( N ) ) = a 1 λ ( N ) = 0 .
The decomposition is preserved. Therefore in
μ = s ν q ( s ) ( f s ) * μ ac + s ν q ( s ) ( f s ) * μ s
the first sum is absolutely continuous and the second is carried by the countable union s f s ( N ) , again λ -null, hence singular. Uniqueness of the Lebesgue decomposition forces
μ ac = s ν q ( s ) ( f s ) * μ ac , μ s = s ν q ( s ) ( f s ) * μ s .
Uniqueness closes the argument. Thus μ ac is a fixed point of the Markov operator M of Proposition 2, which preserves total mass. If c : = μ ac > 0 then μ ac / c is a M -invariant probability measure, hence equals μ by the uniqueness clause of Proposition 2; so μ λ and μ s = 0 . Otherwise c = 0 and μ = μ s λ .
For the stated equivalences: TV ( μ , λ ) = 1 if and only if μ and λ are mutually singular, and by the dichotomy just proved the negation is μ λ . Finally TV ( μ n , λ n ) increases to TV ( μ , λ ) by martingale convergence, the level-n algebras generating the Borel σ -algebra of Z a . □
Remark 5.
The proof uses nothing about μ beyond the fact that it is theuniquefixed point of M . We do not know a derivation from the recursion X = d q s ( b + a X ) that avoids this; purity appears to be a genuinely system-theoretic, rather than distributional, property.
Remark 6
(a weaker criterion, and why it is redundant). The Hellinger affinity ρ n = b μ n ( b ) λ n ( b ) = a n / 2 b μ n ( b ) decreases to ρ ( μ , λ ) , and μ λ iff ρ = 0 . The case t = 1 2 of Theorem 5 gives ρ n Λ ( 1 2 ) / a n , so a > Λ ( 1 2 ) 2 forces singularity. This is never an improvement: t log Λ ( t ) is convex with log Λ ( 1 ) = 0 and ( log Λ ) ( 1 ) = H ( ν q ) , whence log Λ ( 1 2 ) 1 2 H ( ν q ) and Λ ( 1 2 ) 2 a dim . Numerically, for q = 2 the Hellinger threshold is 5.8284 against a dim = 4 .

6. Classification of the Supercritical Regime

Proof 
(Proof of Theorem 7). If a > a dim ( q ) then error = H ( ν q ) / log a < 1 , so error μ < 1 by Proposition 4 and μ is carried by a set of Haar measure zero. It remains to find the integer pairs with a < a dim ( q ) .
By Proposition 1, H ( ν q ) = log q q 1 + log q q 1 . Both summands are strictly decreasing in q on [ 2 , ) : the first has derivative 1 q 1 q 1 < 0 , and the second has derivative q 1 q log q / ( q 1 ) 2 , negative because q 1 q < 1 < log q for q 3 and 1 2 log 2 < 0 at q = 2 . Hence a dim = e H ( ν q ) is strictly decreasing, and since a dim ( 5 ) = 5 5 / 4 / 4 = 1.8692 < 2 we get a dim ( q ) < 2 for all q 5 , leaving no admissible integer a 2 .
For q = 2 : a dim = 4 and a must be odd, so a < 4 forces a = 3 . For q = 3 : a dim = 3 3 / 2 / 2 = 2.5980 and 3 a , so a < a dim forces a = 2 . Neither threshold is attained, since a dim is irrational in both cases. □
Table 1. The two critical multipliers. The ratio is q 1 in every row, as Theorem 1(iii) requires.
Table 1. The two critical multipliers. The ratio is q 1 in every row, as Theorem 1(iii) requires.
q H ( ν q ) a dim a drift ratio
2 1.386294 4.000000 4.000000 1
3 0.954771 2.598076 5.196152 2
5 0.625503 1.869186 7.476744 4
7 0.478469 1.613602 9.681613 6
11 0.335100 1.398080 13.980798 10
Remark 7.
The two survivors are n ( 3 n + b ) / 2 v 2 and n ( 2 n + b ) / 3 v 3 , with error = log 4 / log 3 = 1.26186 and error = H ( ν 3 ) / log 2 = 1.37747 respectively. It is perhaps worth recording that the classical Collatz map is not merely one supercritical member of its family but, together with a single companion, theonlyone.

7. The Two Critical Multipliers

Definition 2.
For a prime q set
a dim ( q ) = exp H ( ν q ) , a drift ( q ) = q E [ v ] = q q / ( q 1 ) .
These are the announced thresholds. By (3), error = 1 exactly when log a = H ( ν q ) , i.e. a = a dim ; and by (2), δ = 0 exactly when log a = E [ v ] log q , i.e. a = a drift . Both depend on q alone and both exceed 1. We emphasise that δ is an expectation: a drift is the multiplier at which the mean logarithmic step E [ log ( a / q v ) ] vanishes, and it does not describe the behaviour of any individual orbit. Note also that a dim and a drift are real numbers while the family is indexed by integers a; the content of Theorems 1 and 3 is which integers fall on which side.
Proof 
(Proof of Theorem 1). Parts (i) and (ii) are Lemmas 1 and 2 and Proposition 1. For (iii), exponentiate (ii):
a dim = e H ( ν q ) = e E [ v ] log q log ( q 1 ) = q E [ v ] q 1 = a drift q 1 .
Hence a drift = ( q 1 ) a dim , and the two agree if and only if q 1 = 1 . □
Proof 
(Proof of Theorem 2). (a) ⇔ (b) is | ( Z / q Z ) × | = q 1 . (b) ⇔ (c) is (4). (c) ⇔ (d) is Proposition 1 together with Theorem 1(iii). For (a) ⇔ (e): the congruence a n + b 0 ( mod q ) has exactly one solution modulo q, while the integers prime to q occupy q 1 residue classes. Every such n therefore satisfies v q ( a n + b ) 1 if and only if q 1 = 1 and that single solution is the class of units, i.e. q = 2 and a + b 0 ( mod 2 ) ; as q a forces a odd, this says b is odd, which is the classical normalisation. □
Proof 
(Proof of Theorem 3). By Theorem 1(iii) and q 3 we have a drift = ( q 1 ) a dim > a dim . If a dim < a < a drift then log a > H ( ν q ) , so error = H ( ν q ) / log a < 1 , and log a < E [ v ] log q , so δ < 0 . Singularity follows from Proposition 4: a measure of Hausdorff dimension < 1 on Z a is carried by a set of Haar measure zero. For q = 2 the interval ( a dim , a drift ) is empty. □
Example 1.
Take q = 3 , so a dim = e 0.954771 = 2.598076 and a drift = 3 3 / 2 = 5.196152 , whose ratio is exactly 2 = q 1 . The integer multiplier a = 4 lies in the band: the map n ( 4 n + b ) / 3 v 3 ( 4 n + b ) has drift log 4 3 2 log 3 = 0.261624 < 0 , so contracts on average, while its invariant measure on Z 4 has error = 0.954771 / log 4 = 0.688654 < 1 and is singular. No such example exists for q = 2 .

8. The Transfer Operator and the Rényi Spectrum

Let L act on C ( Z a ) by ( L f ) ( x ) = s 1 ν q ( s ) f f s ( x ) , let V n C ( Z a ) be the space of functions constant on balls of radius a n (so dim V n = a n , and V 0 is the constants), and for α > 0 let [ f ] α = sup x y | f ( x ) f ( y ) | / d ( x , y ) α , C α = { f : f + [ f ] α < } .
Proof 
(Proof of Theorem 4). (i) Let f V n . Then ( L f ) ( x ) depends on x only through the values f s ( x ) = q s ( b + a x ) modulo a n ; as q s is a unit of Z a , this is determined by b + a x mod a n , hence by x mod a n 1 . So L f V n 1 , and iterating, L n ( V n ) V 0 , i.e. L n f is a constant c ( f ) . By Proposition 2 the measure μ satisfies μ = L * μ , hence L g d μ = g d μ for every g C ( Z a ) ; applying this n times, c ( f ) = L n f d μ = f d μ .
(ii) L f f since L is an average. For the seminorm, Proposition 2 gives d ( f s x , f s y ) = a 1 d ( x , y ) , so
| L f ( x ) L f ( y ) | s 1 ν q ( s ) [ f ] α d ( f s x , f s y ) α = a α [ f ] α d ( x , y ) α .
This is a Lasota–Yorke inequality; since Z a is compact the embedding C α C ( Z a ) is compact by Arzelà–Ascoli, so the Ionescu-Tulcea–Marinescu theorem in the form of Hennion [3] yields quasi-compactness with essential spectral radius at most a α .
(iii) Iterating the seminorm estimate of (ii) gives [ L n g ] α a n α [ g ] α for every n 1 . Suppose now L g = λ g with g C α and | λ | > a α . Then [ g ] α = | λ | n [ L n g ] α a α / | λ | n [ g ] α for every n, and since a α / | λ | < 1 the factor tends to 0; hence [ g ] α = 0 and g is constant, so λ = 1 . The eigenspace is exactly the constants, so 1 is simple. □
Remark 8.
We stress the reading of Theorem 4, since the presence of a uniform contraction invites the expectation of a meaningful mixing rate. A spectral gap exists on each C α , of size 1 a α ; but it is the gap forced by the contraction alone, the residual spectrum is essential, and no eigenvalue other than the trivial one occurs. In particular there is no Ruelle–Pollicott resonance to compute. All analytic content of the system lies in the behaviour as the resolution n grows, not as time grows.
Proof 
(Proof of Theorem 5). By Lemma 1, for t > 0
Λ ( t ) : = s 1 ν q ( s ) t = ( q 1 ) t m 1 q m t = ( q 1 ) t q t 1 ,
so that D t S = log Λ ( t ) / ( 1 t ) log a . Since Λ ( 1 ) = 1 , the numerator vanishes at t = 1 ; by l’Hôpital, lim t 1 D t S = Λ ( 1 ) / log a = H ( ν q ) / log a = error , giving continuity.
For the inequality, set
S n ( t ) = b Z / a n Z μ n ( b ) t , D t ( n ) = log S n ( t ) ( 1 t ) n log a ,
so that D t = lim n D t ( n ) when the limit exists, and D ¯ t = lim sup n D t ( n ) in general.
Step 1: an exact partition. Iterating (5) n times gives μ = | w | = n ν q ( w ) ( f w ) * μ with ν q ( w ) = i ν q ( w i ) . Each ( f w ) * μ is carried by f w ( Z a ) , a ball of radius a n by Proposition 2. In an ultrametric space two balls of equal radius are either equal or disjoint, so for a ball B of radius a n one has ( f w ) * μ ( B ) { 0 , 1 } , and therefore
μ n ( b ) = w : f w ( Z a ) = B ( b , a n ) ν q ( w ) ,
the index classes partitioning Z 1 n as b ranges over Z / a n Z . This identity is exact, with no error term from partial overlap; it is the one place where ultrametricity does genuine work, and it has no analogue over R .
Step 2: sub- and superadditivity. For x i 0 one has i x i t i x i t when t > 1 , with the inequality reversed when 0 < t < 1 . Applying this within each class and summing over b, Step 1 gives
S n ( t ) | w | = n ν q ( w ) t = Λ ( t ) n ( t > 1 ) , S n ( t ) Λ ( t ) n ( 0 < t < 1 ) .
Step 3: sign bookkeeping. If t > 1 then log S n ( t ) n log Λ ( t ) while ( 1 t ) log a < 0 , so dividing reverses the inequality:
D t ( n ) = log S n ( t ) ( 1 t ) n log a log Λ ( t ) ( 1 t ) log a = D t S .
If 0 < t < 1 then log S n ( t ) n log Λ ( t ) while ( 1 t ) log a > 0 , so dividing preserves it and the same bound results. Thus D t ( n ) D t S for everyn and every t > 0 with t 1 ; in particular D ¯ t D t S , no passage to a limit being required.
Finally D ¯ t 1 because Z a has Hausdorff dimension 1 (Lemma 3), and the two bounds combine to give D ¯ t min ( 1 , D t S ) . □
Example 2.
For ( a , q ) = ( 3 , 2 ) one has log ( q 1 ) = 0 and D t S = log ( 2 t 1 ) / ( t 1 ) log 3 , so D 2 S = 1 exactly and D 3 S = log 7 / ( 2 log 3 ) = 0.885622 . Exact computation of μ n for n 16 gives D 2 ( n ) = 0.8184 , 0.8546 , 0.8770 and D 3 ( n ) = 0.7649 , 0.7953 , 0.8136 at n = 8 , 12 , 16 : increasing, and consistent with the bounds min ( 1 , D t S ) in each case.

9. The Classical Case

For ( a , b , q ) = ( 3 , 1 , 2 ) we have ν 2 ( m ) = 2 m , E [ v ] = 2 , H ( ν 2 ) = log 4 , and hence
δ = log 3 log 4 = log 3 4 < 0 , error = log 4 log 3 = 1.261859 > 1 .
Both inequalities are strict and both point the same way, because a dim = a drift = 4 by Theorem 1. Theorem 1 says that these are not two coincidences but one, and Theorem 2 that the reason is the triviality of ( Z / 2 Z ) × .
We are careful about what error > 1 does and does not give. It renders the upper bound of Proposition 4 vacuous; it does not establish that μ is absolutely continuous, nor even that error μ = 1 . By Theorem 7, ( 3 , 2 ) is one of only two integer pairs for which this is so.
What Theorem 6 adds is that the question is now binary and, in principle, decidable from the total variation alone: μ λ if and only if lim n TV ( μ n , λ n × ) < 1 . Exact computation for n 15 gives
0.16667 , 0.27778 , 0.34601 , , 0.43301 , 0.43584 , 0.43825 , 0.44028 ,
with increments decaying geometrically at ratio 0.84 and extrapolating to 0.451 . Since the sequence increases, no finite computation can exclude the limit 1, and we state the dichotomy as open; but the numerical evidence points firmly towards absolute continuity, and by Theorem 6 nothing intermediate is available. A rigorous upper bound TV ( μ , λ × ) < 1 would settle the matter outright, and we regard this as the most interesting question raised here.

10. Comparison with earlier work

The valuation law of Lemma 1 is classical, and we claim no novelty for it; the same is true of the affine unrolling of Proposition 3, which is Tao’s identity (1.7) in [10] and the n-path of [12]. Proposition 2 is Hutchinson’s contraction principle [4] in an ultrametric setting, where it is if anything easier than over R , since balls of equal radius are either equal or disjoint and all overlaps are exact.
The rational-cycle formula recalled in Section 4 is Lagarias [7]; Lemma 4 is Siegel’s (2.62) (Remark 4) and Theorem 8 a reindexing of the two. We claim novelty only for the correspondence Theorem 9, which organises these by rotation classes and primitivity.
The results we believe to be new are Theorems 1, 2, 3, 4, 5, 6, 7 and 9: the exact factor q 1 separating the two critical multipliers, the four-way equivalence, the band of multipliers, the spectral degeneracy, the closed-form Rényi spectrum, the purity dichotomy, the classification of the supercritical regime, and the cycle correspondence. We have found no prior statement of any of these. We regard Theorems 6 and 7 as the principal contributions.
A second body of work requires careful demarcation. Siegel’s dissertation [9] develops a ( p , q ) -adic analysis for exactly the family of maps considered here (his “Hydra maps”, of which (1) is the two-branch case), and constructs the numen χ H discussed in Remark 4. His programme is functional-analytic: he generalises Monna–Springer integration, proves a ( p , q ) -adic Wiener Tauberian theorem, and characterises periodic points of H through density of translates of χ H ^ . The measure μ = ( χ H ) * λ is therefore implicit throughout his work, and its Fourier transform is one of his central objects.
What his treatment does not contain is the measure-geometric analysis undertaken here. Siegel studies χ H as a function and φ H as its Fourier transform; he does not consider the distribution of χ H as a measure with a dimension, an entropy, or a Lebesgue type. In particular the notions of similarity dimension, Hausdorff dimension of a measure, iterated function system, invariant or stationary measure, Lebesgue decomposition, Rényi spectrum, Markov or transfer operator, and archimedean drift do not appear in his text, and neither of the two critical multipliers of Section 4 is defined there. The results we claim—Theorems 1, 2, 3, 4, 5, 6, 7 and 9—are therefore disjoint from his, and are best read as a measure-theoretic complement to a functional-analytic programme that had already identified the right object.
One further overlap requires explicit acknowledgement. Wegner [11] studies the family 3 x + k and obtains a relation between the distributions of the Syracuse iterates for different k, deducing that the oscillation appearing in Tao’s argument is independent of k. That result concerns variation of the additive parameter with ( a , q ) = ( 3 , 2 ) fixed, and it anticipates the isometry remark of Section 11 below, which we therefore do not claim. The present theorems concern variation of the divisor prime q, a direction Wegner does not consider.

11. Limitations

We close by delimiting the scope of the foregoing, since the family (1) contains the Collatz map and it would be easy to read more into Theorem 1 than it contains.
Proposition 5.
For b coprime to a, the measures μ a , b , q and μ a , b , q are exchanged by the map x x , which is an isometry of Z a . More generally, μ a , c b , q = ( c · ) * μ a , b , q for any unit c of Z a .
Proof. 
Unrolling as in Proposition 3, the constant term of the k-fold composition is homogeneous of degree one in b; replacing b by c b therefore multiplies the limit by c. Multiplication by a unit preserves d. □
Corollary 2.
No isometry invariant of μ a , b , q —in particular neither error, nor error μ , nor the Rényi spectrum of Theorem 5, nor the spectrum of L—distinguishes 3 x + 1 from 3 x 1 .
This is not a technicality. The map 3 x 1 possesses the nontrivial cycles { 5 , 7 } and { 17 , 25 , 37 , 41 , 55 , 61 , 91 } , whereas 3 x + 1 is conjectured to have none; equivalently, the 3 x + 1 map on Z has at least four cycles, of which three lie among the negative integers. Any argument for the Collatz conjecture must therefore use the positivity of n, or the sign of b, in an essential step. By Corollary 2 the invariants studied here cannot do so. The quantities a dim and a drift likewise depend only on ( a , q ) and not on b.
Consequently Theorem 1 explains a feature of the classical parameters—that two a priori independent inequalities are one—but supplies no information about the orbits of any particular integer, and has no bearing on the truth of the Collatz conjecture. We regard the interest of the result, such as it is, as lying in the identification of | ( Z / q Z ) × | = 1 as the arithmetic source of a coincidence usually left unremarked.

12. Declarations

This work was carried out independently of any institution and received no funding from any agency in the public, commercial, or not-for-profit sectors. The author declares no competing interests. All computations reported in the paper were performed by the author in double-precision floating point unless stated otherwise; the quantities of Section 5 and 9 involve only sums of positive terms, so no cancellation occurs and the relative error is of order 10 13 throughout. Source code reproducing every table is available from the author on request.

References

  1. Conway, J. H. Unpredictable iterations. Proc. 1972 Number Theory Conference, Univ. Colorado, Boulder, 1972; pp. 49–52. [Google Scholar]
  2. Goldie, C. M. Implicit renewal theory and tails of solutions of random equations. Ann. Appl. Probab. 1991, 1, 126–166. [Google Scholar] [CrossRef]
  3. Hennion, H. Sur un théorème spectral et son application aux noyaux lipchitziens. Proc. Amer. Math. Soc. 1993, 118, 627–634. [Google Scholar] [CrossRef]
  4. Hutchinson, J. E. Fractals and self-similarity. Ind. Univ. Math. J. 1981, 30, 713–747. [Google Scholar]
  5. Kesten, H. Random difference equations and renewal theory for products of random matrices. Acta Math. 1973, 131, 207–248. [Google Scholar] [CrossRef]
  6. Lagarias, J. C. The 3x+1 problem and its generalizations. Amer. Math. Mon. 1985, 92, 3–23. [Google Scholar] [CrossRef]
  7. Lagarias, J. C. The set of rational cycles for the 3x+1 problem. Acta Arith. 1990, 56, 33–53. [Google Scholar] [CrossRef]
  8. Lagarias, J. C. (Ed.) The Ultimate Challenge: The 3x+1 Problem; American Mathematical Society: Providence, RI, 2010. [Google Scholar]
  9. Siegel, M. C. (p,q)-adic analysis and the Collatz conjecture. Ph.D. dissertation, University of Southern California, 2022. [Google Scholar]
  10. Tao, T. Almost all orbits of the Collatz map attain almost bounded values. Forum Math. Pi 2022, 10, e12. [Google Scholar] [CrossRef]
  11. Wegner, F. The Collatz problem generalized to 3x+. k 2021, arXiv:2101.08060. [Google Scholar] [CrossRef]
  12. Terras. A stopping time problem on the positive integers. Acta Arith. 1976, 30, 241–252. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
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.