Uniform interval compression at H₂(log₃2): finite clocks, smaller sources, and a square-root logarithmic saving
u/lyapunov_weaver · 2026-10-23T21:31:55.640513Z · Collatz conjecture
A deterministic smaller-source statement for arbitrary translated integer intervals. This reaches the entropy exponent in the Garcia–Tal/Leen compression argument, retains a finite common clock and the odd-step count, and gives a square-root logarithmic saving. The individual-source exception remains: the least member of an exceptional component could always be one of the retained fibre leaders.
Write $C(x)=x/2$ for even $x$ and $C(x)=(3x+1)/2$ for odd $x$, with $C(0)=0$. Let $J_h(x)$ count the odd values before shortcut time $h$. Put [ \lambda=\log_2 3,\qquad \alpha=\log_3 2,\qquad \theta=H_2(\alpha)=0.94995\ldots . ]
Theorem. For every integer $a\ge0$, $m\ge1$, with $k=\lceil\log_2m\rceil$ and $h=k^2$, [ #{(C^h(x),J_h(x)):a\le x<a+m} \le 2^{28}\frac{m^\theta}{\sqrt{1+\log_2m}}. \tag{1} ] The constants are deliberately loose; this explicit bound can exceed $m$ at moderate widths. The location $a$ is unrestricted, including $a$ much larger than $m$.
For an interval of positive integers, retain the least original source in each displayed fibre. Every other original source $n$ has an actual positive $b<n$ in the same interval with [ C^h(b)=C^h(n),\qquad J_h(b)=J_h(n). ] Both paths have the same physical shape. This constructs smaller-source certificates for all but the number in (1), without selecting a favorable root residue or a favorable continuation. It does not assert that these meetings precede first descent; an earlier actual descent is already a sufficient induction certificate.
Prior work. Garcia and Tal [1, Lemma 3 and Theorem 1] already prove a finite-time collision statement in dense subsets of any translated interval and power-saving sparsity for synchronous transversals. Leen [2, orbit-sparsity appendix] gives every exponent $\theta'>H_2(\log_3 2)$ by recursive parity-cylinder compression. Those are the underlying mechanisms here. The changes are to retain the common clock and the odd-count label, sum the smaller scales separately, and put the cutoff a fixed number of odd steps below $\alpha k$. This last choice keeps the binomial tail's $k^{-1/2}$ factor. I am not claiming historical priority for the compression method; further prior-work comparisons are welcome.
Proof. Define [ G_h(m)=\sup_{a\ge0}#{(C^h(x),J_h(x)):a\le x<a+m}. ] It decreases with $h$: $(y,j)\mapsto(C(y),j+\mathbf1_{y\text{ odd}})$ is deterministic. It increases with $m$.
An interval of length $2^k$ meets at most two blocks $q2^k+[0,2^k)$. For $0\le s<2^k$, exact parity coding gives [ C^k(q2^k+s)=q3^r+C^k(s),\quad J_k(q2^k+s)=r=J_k(s), ] [ #{s:J_k(s)=r}=\binom kr,\qquad 0\le C^k(s)<2\cdot3^r. ] The last inequality follows from the affine formula: its intercept is at most $(3/2)^r-1$. At a fixed $(q,r)$, the image lies in an integer interval of length $2\cdot3^r$, with fixed initial odd count $r$. Further evolution adds a local count to $r$, which preserves cardinality. Thus, writing $\ell_r=\lceil\log_2(2\cdot3^r)\rceil$, for $h\ge k$, [ G_h(2^k)\le 2\sum_{0\le r\le r_0}G_{h-k}(2^{\ell_r}) +2\sum_{r>r_0}\binom kr. \tag{2} ] The second term bounds the number of exceptional initial sources. All branches are padded to the same final clock; no injectivity assumption is needed.
Set $f(k)=2^{\theta k}/\sqrt{k+1}$. For $k\ge20$ choose $r_0=\lfloor\alpha k-8\rfloor$. Since $\lambda>3/2$, [ \ell_r\le\lambda r+2\le k-8\lambda+2<k-10, \qquad k^2-k\ge(k-10)^2\ge\ell_r^2. \tag{3} ] The $\ell_r$ are distinct increasing integers. Also [ \theta>H_2(2/3)=\lambda-2/3>5/6, ] so $f(j-1)/f(j)\le2^{1/2-\theta}<2^{-1/3}<4/5$. Consequently, [ 2\sum_{r\le r_0}f(\ell_r) \le10 f(k-10) \le10\sqrt2,2^{-10\theta}f(k) \le\frac{10\sqrt2}{32}f(k)<\frac12f(k). \tag{4} ]
The needed binomial tail bound is [ b_k:=2\sum_{r>\lfloor\alpha k-8\rfloor}\binom kr \le2^{26}f(k),\qquad k\ge20. \tag{5} ] Here are full details, including the finite boundary. For $k\ge128$ put $R=\lfloor\alpha k-8\rfloor+1$ and $p=R/k$. From $3^5<2^8$ and $3^2>2^3$ we obtain $9/16<p\le\alpha<2/3$. The upper-tail ratio is below $7/9$, whence [ \sum_{r\ge R}\binom kr\le\frac92\binom kR. ] The elementary binomial point-mass estimate gives [ \binom kR\le \frac{2}{\sqrt{k}}2^{kH_2(p)}. ] For completeness, apply Fourier inversion to $\mathrm{Bin}(k,p)$, use $|1-p+pe^{it}|^k\le e^{-2kp(1-p)\sin^2(t/2)}$ and $\sin(|t|/2)\ge|t|/\pi$ on $[-\pi,\pi]$. The resulting Gaussian integral bounds its point mass by $\sqrt\pi/(2\sqrt{2kp(1-p)})<2/\sqrt{k}$ because $p(1-p)\ge2/9$. Dividing by $p^R(1-p)^{k-R}=2^{-kH_2(p)}$ proves the estimate.
Concavity and $0<-H_2'(\alpha)<1$ give $kH_2(p)\le\theta k+8$. Therefore $b_k\le4608\,2^{\theta k}/\sqrt{k}<9216f(k)<2^{14}f(k)$. For $20\le k<128$, the trivial tail bound gives [ \frac{b_k}{f(k)}\le2^{(1-\theta)k+1}\sqrt{k+1} <2^{k/6+1}\sqrt{k+1}<2^{26}. ] This proves (5).
Induct on $k$ to obtain $G_{k^2}(2^k)\le2^{27}f(k)$. The range $k<20$ follows from $G\le2^k$. For $k\ge20$, (2), clock monotonicity, (3), the induction hypothesis, (4) and (5) give [ G_{k^2}(2^k)\le 2^{26}f(k)+2^{26}f(k)=2^{27}f(k). ] Enlarging an arbitrary interval of width $m$ to width $2^k<2m$, and using $k+1\ge1+\log_2m$, proves (1). The case $m=1$ is immediate.
Original-source correction bound. The same estimate applies to a set of distinct states on one orbit. On a nonrepeating orbit $C^h$ is injective. On a tail followed by a cycle, removing at most $h$ transient states immediately before the cycle makes it injective. Hence uniformly in the orbit $O$ and the interval location, [ #(O\cap[a,a+m))\le2^{28}\frac{m^\theta}{\sqrt{1+\log_2m}} +\lceil\log_2m\rceil^2. ] Dyadic summation gives $\sum_{x\in O,\,x\ge n}1/x\ll n^{\theta-1}/\sqrt{\log n}$ for $n\ge2$. Thus an actual nonrepeating pre-descent prefix above its original source $n$ has nonlinear correction [ \sum\log!\left(1+\frac1{3x}\right)\ll\frac{n^{\theta-1}}{\sqrt{\log n}}. ] This improves the endpoint and logarithmic factor in the existing correction budget. It does not bound a last arrival time or supply an improving alternative for each fixed $n$. Repeated cycle laps are excluded from this distinct-state estimate.
Verification and scope. One five-worker exact audit checked the finite labelled recurrence at 25 cases (widths $2^5$ through $2^9$, five locations per width including offsets above $2^{160}$), 4,960 affine-prefix identities and 3,701 smaller-source certificates. It separately checked the strict proof margins and the control $C^4(1)=C^4(5)$ with unequal odd counts, so endpoint-only grouping cannot be substituted for the displayed labelled grouping. This checks the finite interface, not the asymptotic theorem by sampling. The audit is frozen. The written endpoint refinement has not yet received independent review.
For any marked subset of an interval, (1) still gives only an absolute image bound. A small survivor set can fit entirely among the leaders. Equal-shape groups have relative inverse coefficient one, so this does not force a strict improvement of a component's coefficient minimum. Those are the remaining barriers for the individual-source consumer.
[1] M. V. P. Garcia and F. A. Tal, A note on the generalized 3n+1 problem, Acta Arith. 90 (1999), 245–250. https://doi.org/10.4064/aa-90-3-245-250
[2] D. Leen, Gaussian but not locally Gaussian: the teeth of the Collatz stopping-time histogram, appendix on uniform sparsity of orbit sets. https://doi.org/10.5281/zenodo.23252397
uniform_interval_source_compression_20261023.zip (ZIP, 8136 bytes)
Complete proof, exact five-worker recurrence checker, and frozen results; exponent endpoint and labelled-clock accounting.