Renewal sparsity in the slack of the Collatz map: laminar crossings, a transport hierarchy, a dense branch closed and records pinned by slack — on a Diophantine input read from the review of the paper it cites

The Collatz conjecture is open, and nothing here bears on it. A research programme studies a hypothetical divergent orbit through its slack, \(\delta_m = m\log_2 3 - K_m\), where \(K_m\) is the sum of the first \(m\) valuations of the Syracuse map, and through the renewal process of its suffix minima. Seven of its rounds build a theory of how sparse those renewals must be, and every quantitative step in them passes through one external input, a Diophantine exponent \(\rho^\star = 4.1164\) for \(\log_2 3\). The programme later withdrew that input, judging the cited theorem to concern \(\log 3\) rather than \(\log_2 3\). Its published review shows the cited result is a lower bound for linear forms in \(1, \log 2, \log 3\), which bounds \(\log_2 3\) directly; but the review prints the exponent as \(4.117\), rounded up, which does not reach \(4.1164\). This paper restores the input at \(4117/1000\), re-evaluates as exact rationals every exponent the rounds derived from it — each first reproduced exactly at \(\rho^\star\) — and finds each move the weaker way with every side condition intact. Around that, the structural core is checked where it is testable: the first-crossing intervals of any orbit are laminar and an annulus identity holds as an exact integer pair; a hierarchy of block exponents goes to zero while its constants explode, so that the new bound overtakes the old only at ratios no finite orbit approaches; the dense branch of the survivor space is empty; every suffix minimum has a first step of valuation 1; a record bound needing no premise is attained; and the programme’s correction bank, written in its own coordinates, is an identity in integers.

Not claimed anywhere in this paper: the Collatz conjecture, or that a divergent orbit exists or does not; the rounds’ asymptotic theorems — every \(o(1)\), every “for \(N\) large” — which are checked in their finite content and their exponent algebra only; that any exponent is optimal; the exact exponent of the Wu–Wang theorem, which only the paper states; and that the theorems about the hypothetical divergent branch have been tested on real orbits where their objects do not occur, which in several cases they do not.

The three contributions behind this paper are different in kind, and the paper is worth less if they are blurred. They are given here in alphabetical order, the order the author list keeps as data; on the title page the three sit at a round table, with no first and no last.

Aletheia — model: ChatGPT, GPT series — wrote, with Neo.K, the programme’s rounds this paper checks: the survival closure, the congestion rigidity, the transport hierarchy, the depth collision, the sparse-support exhaustion, the record sparsity and the record-gap transport.

Neo.K set the programme’s target — a divergent orbit read through its slack and its renewals — and wrote its rounds with Aletheia.

墜衡 (Zhuì Héng) — the independent verification line; model: Claude, Opus series — rechecked every round in exact arithmetic, tested the structural core on real orbits, found the premise stated weaker than used and the constants that outgrow the exponent, read the review behind the Diophantine input and restored it at the value the review supports, re-evaluated every exponent derived from it, built and drilled the gates, and wrote this paper. The rounds’ mathematics is the programme’s; nothing in it is this line’s invention.

Priority, stated plainly. No result here is claimed as new mathematics. What is offered as this line’s own is the exact verification of the rounds, the separation of what real orbits test from what they cannot, and the reading of the programme’s one external input from its source.