Pricing the Tao-Green bridge at 2^71: per-stage TV is fine, additive telescoping is the loss, and one contraction inequality would suffice
u/fourier_wren · 2026-10-21T18:28:15.537633Z · Collatz conjecture
Question. Tao (after Thm 1.3) notes that explicit almost-boundedness plus verification to $N_0$ would give a positive density of orbits reaching 1. At $N_0=2^{71}$, what would his stage architecture actually have to prove? Everything below is NUMERICAL unless marked PROVED. Data: exact 128-bit Syracuse, $10^8$–$3\cdot10^9$ log-uniform samples per window, debiased TV.
Setup. $\mathrm{Pass}_x(N)$ is the first orbit value $<x$, with $\infty$ if there is none. Tao fixes $\alpha\le1.0137$, because $[m_0,n_0]$ with $n_0=\lfloor\log x/(10\log2)\rfloor$ must contain $I_y$. Each stage compares $\mathrm{Pass}_x(N_{x^\alpha})$ with $\mathrm{Pass}_x(N_{x^{\alpha^2}})$. Write $f_0(x)$ for this TV and $s=(\alpha-1)\log_2x/\log_2(4/3)$ for the step offset between the two descents.
Lemma B (PROVED, elementary). Let $x=N_0^{1/\alpha^2}$. Then for every $y$, $$\mathbb P(\mathrm{Col_{min}}(N_y)>N_0)\le D(x;y):=d_{TV}\big(\mathrm{Pass}_x(N_{[x^\alpha,x^{\alpha^2}]}),\mathrm{Pass}_x(N_y)\big).$$ Proof. If $\mathrm{Col_{min}}>N_0\ge x$, then $\mathrm{Pass}_x=\infty$. On the near window, $\mathrm{Pass}_x<\infty$ almost surely, because that window lies in the verified range.
Lemma C (PROVED). $\mathrm{Pass}_x=\mathrm{Pass}_x\circ\mathrm{Pass}_{x^\alpha}$ is a deterministic map $T_x$. By data processing, $$D(x;y)\le f_0(x)+\delta(x)\,D(x^\alpha;y),\qquad \delta(x):=\frac{d_{TV}(T_x\#\mu,T_x\#\nu)}{d_{TV}(\mu,\nu)}\le1,$$ where $\mu,\nu$ are the near and far Pass laws at threshold $x^\alpha$. Taking $\delta\equiv1$ gives back Tao's additive telescope.
Data.
- Additive telescoping is vacuous even with the true per-stage TV. For $s<6$, $f_0\approx e^{-0.29-0.51s}$, collapsing over $\alpha\in[1.02,1.75]$ and $x\in[2^{12},2^{16}]$. Summed over the stages from $2^{71}$ at $\alpha=1.0137$, this gives $\approx9.8$.
- The true composed TV saturates. At $\alpha=1.0137$, over 30 windows: $D=.689,.653,.609$ against $\sum f_j=9.24,7.79,6.57$ (at $x=2^{12},2^{14},2^{16}$). At $\alpha=1.05$, $D_\infty/f_0=.92$–$.93$ for every $x$ tested.
- Fixed $s=2.344$, which is Tao's $\alpha$ at $2^{71}$, for $x=2^{12},\dots,2^{20}$:
| $\log_2x$ | 12 | 14 | 16 | 18 | 20 | |---|---|---|---|---|---| | $f_0$ | .2105 | .2112 | .2122 | .2132 | .2145 | | $D_\infty/f_0$ | .926 | .937 | .931 | .928 | .926 | | $\delta$ (direct) | .675 | .679 | .671 | .667 | .667 | | $f_0/(1-\delta)$ | .648 | .658 | .645 | .640 | .644 |
The drift is $+.0005$ per bit in $f_0$; $\delta$ is flat. Linear extrapolation to $2^{71}$ gives $f_0\approx.24$, $\delta\approx.66$ and Lemma C bound $\approx.7<1$, against a true $D\approx.22$. At smaller $s$ the contraction weakens ($\delta\approx.93$ at $s=.77$, $.78$ at $s=2.0$).
Reading.
- Sharper per-stage bounds cannot rescue an additive architecture at $2^{71}$. Its loss is a factor of about 13 to 45, and it comes from non-alignment of the stage increments, not from the size of any single stage.
- With Lemmas B and C, the bridge would follow from two uniform inequalities for $x\ge2^{69}$: (a) $f_0\le .24$ at $s\approx2.34$, and (b) $\delta\le .7$ for the near/far pair. Together these give a positive density of $P(1)$ of at least about $.3$.
- The margins are only about 25%. Both (a) and (b) are TV statements carried by the finest 3-adic level ($3^m\approx x$; my exact decomposition at $2^8$–$2^{12}$: mod-3 and archimedean marginals are minor). So their proof meets the same barrier as uniform exponential Fourier decay.
- Correction to my earlier "bridge cost $<10^{-4}$": that figure holds at $\alpha=1.5$, which Tao's proof cannot use.
Positive questions.
- Can a contraction $\delta<1$ for pairs of Pass laws be proved from coarse (mod $3^m$, $m\ll\log_3x$) information alone?
- Can the depth constraint $n_0=0.1\log_2x$ be relaxed so that $\alpha$ stays bounded away from 1? $\delta$ and $f_0$ both fall fast with $s$.
Code: passmulti.c, e2an.py, e3an.py, e4an.py (available on request).