\documentclass[11pt,a4paper]{article} \usepackage[margin=1in]{geometry} \usepackage{amsmath,amssymb,amsthm} \usepackage{booktabs} \usepackage[hidelinks,breaklinks]{hyperref} \usepackage{enumitem} \theoremstyle{plain}\newtheorem{theorem}{Theorem}\newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma}\newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition}\newtheorem{example}[theorem]{Example} \theoremstyle{remark}\newtheorem{remark}[theorem]{Remark} \newcommand{\N}{\mathbb{N}}\newcommand{\Z}{\mathbb{Z}} \title{Realizer Bounds and Repetition Constraints\\ at the First Coefficient Crossing in the $3x+1$ Problem} \author{Elias De Jes\'us\\ \textit{Independent Researcher}\\ ORCID \href{https://orcid.org/0009-0007-0190-9143}{0009-0007-0190-9143}} \date{14 November 2026} \begin{document}\maketitle \begin{abstract} Terras's coefficient stopping time conjecture asks whether the shortcut Collatz orbit of every integer $n\ge2$ lies below $n$ when its coefficient $\rho_k=3^d/2^k$ first falls below one. Here $k$ counts shortcut steps and $d$ counts their odd inputs. We prove that every eligible realizer descends when the first-crossing word has at most $75$ maximal runs of odd inputs. Any counterexample requires at least $76$ such runs, $10\,439\,860\,591$ steps and $6\,586\,818\,670$ odd inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational approximations to $\log_2 3$, the verified range of Rozier and Terracol, and Rhin's estimate for a linear form in logarithms. We also prove descent for a family with arbitrarily many odd runs. Two further restrictions narrow the remaining words. An initial square $UU$ in a failing word satisfies $|U|<35\log_2 k$. For a counterexample of shortest crossing length, the reciprocal-sum estimate of Nikzad, Frinkle and Bagherzadeh gives a lower bound on $\rho_k$ whose value begins $0.9441733669\ldots$. The open inequality compares the least eligible starting value in each remaining parity class with an explicit threshold. \end{abstract} \section{What is being asked} Write $T(n)=(3n+1)/2$ at odd inputs and $T(n)=n/2$ at even inputs. Fix $n\ge2$. For the parity word $w$ of its first $k$ input states $n,T(n),\dots,T^{k-1}(n)$, let $d$ count the odd inputs. Induction gives \begin{equation}\label{eq:affine} 2^kT^k(n)=3^dn+C_w, \end{equation} where the nonnegative integer $C_w$ depends only on $w$. Write $\rho_k=3^d/2^k$ with $\rho_0=1$. An odd step multiplies the coefficient by $3/2$ and an even step halves it. Let $\tau(n)$ be the first $k$ with $\rho_k<1$, and let $\chi(n)$ be the first $k$ with $T^k(n)M_w . \] Moreover, if the odd runs have lengths $\ell_1,\dots,\ell_s$ and run $i$ starts at time $t_i$, \begin{equation}\label{eq:runsum} M_w=\sum_{i=1}^{s}\frac{1-(2/3)^{\ell_i}}{\rho_{t_i}} . \end{equation} \end{proposition} \begin{proof} The first display is \eqref{eq:affine}. For \eqref{eq:runsum}, each odd step at time $j$ contributes $2^j3^{-d_{j+1}}=1/(3\rho_j)$ to $M_w$, where $d_{j+1}$ counts odd steps through time $j$. Summing a run of $\ell$ consecutive odd steps from $t$ gives $\frac1{3\rho_t}\sum_{r<\ell}(2/3)^r=(1-(2/3)^\ell)/\rho_t$. \end{proof} If a first-crossing word contains $s\ge1$ odd runs, every proper prefix has $\rho_t\ge1$, so each run contributes less than one and each odd step contributes at most $1/3$. Thus \begin{equation}\label{eq:Mbounds} M_wM_w$, since the left side increases with the seed. If a seed $n$ fails, its endpoint satisfies $0\le T^k(n)-nB$. Put $\Lambda=k\ln2-d\ln3>0$. By Proposition \ref{prop:comparator} a failure gives $(e^\Lambda-1)n\le M_w$, hence with \eqref{eq:Mbounds} \begin{equation}\label{eq:lambda} 0<\Lambda1/(3B)$. With the second half of \eqref{eq:lambda} this forces $a/b<\alpha0$. Since $k/d>\alpha$, $q\Lambda+de=(qk-pd)\ln2\ge\ln2$. Two pairs suffice, with certified enclosures $e_{\mathrm{I}}\in(5.22,5.24)\cdot10^{-18}$ at $(p,q)=(9\,881\,527\,843\,552\,324,\,6\,234\,549\,927\,241\,963)$ and $e_{\mathrm{II}}\in(1.24,1.25)\cdot10^{-19}$ at $(p,q)=(6\,724\,555\,128\,221\,608\,268,\,4\,242\,721\,909\,926\,539\,673)$. Pair I gives $d>(0.69-q\cdot75/B)/(5.24\cdot10^{-18})>1.26\cdot10^{17}$. If $d<2^{61}<2.31\cdot10^{18}$, pair II gives $\Lambda>(0.69-2.31\cdot10^{18}\cdot1.25\cdot10^{-19})/(4.25\cdot10^{18})>9\cdot10^{-20}$, hence $n<75/(9\cdot10^{-20})$ and $n+1<2^{70}$; Lemma \ref{lem:runbound} with $G_{75}<1.72\cdot10^{15}$ then gives $d<70\cdot1.72\cdot10^{15}=1.204\cdot10^{17}$, contradicting $d>1.26\cdot10^{17}$. \emph{The tail.} For $d\ge2^{61}$, Rhin's effective estimate \cite{rhin1987} (in the form used by \cite[Prop.~6.3]{rozier2026}) gives $\Lambda\ge k^{-13.3}$, so $n<75(2d)^{13.3}$ and $\log_2(n+1)<7+14\log_2(2d)$. With $2^j\le d<2^{j+1}$, Lemma \ref{lem:runbound} forces $2^j\le d<1.72\cdot10^{15}\,[\,7+14(j+2)\,]$. At $j=61$ the upper bound is $1.52908\cdot10^{18}<2^{61}$. It stays below $2^j$ by induction, since the bracket increases by $14$ while $2^j$ doubles. This contradiction excludes the remaining values of $d$. \end{proof} \begin{remark}[Dependencies of Theorem \ref{thm:75}] The Rozier--Terracol verification supplies the seed bound $n>B$. Combined with \eqref{eq:lambda}, the Farey interval then gives the two integer bounds. In the proof of Theorem \ref{thm:75}, Rhin's estimate enters only in the case $d\ge2^{61}$. Rozier and Terracol \cite[Rem.~5.5]{rozier2026} credit Simons with proposing the classification by local maxima. Priority for the stated first-crossing bounds remains open. \end{remark} \section{A family with arbitrarily many runs} \begin{proposition}\label{prop:110} Repeat the block $110$ exactly $h\ge1$ times and append zeros up to the first coefficient crossing. Every eligible realizer descends at that crossing. \end{proposition} \begin{proof} One block acts by $H(x)+5=9(x+5)/8$, so $-5$ is its fixed point. The block's full coefficient is $9/8$ and its two nonempty proper-prefix coefficients are $3/2$ and $9/4$. Consequently the first crossing occurs among the appended zeros at $k=\lceil h\log_2 9\rceil\le4h$. Iteration gives $H^h(n)+5=9^h(n+5)/8^h$. Integrality implies $8^h\mid n+5$, hence $n\ge8^h-5$. The normalized memory is $5(1-(8/9)^h)<5$ and the appended zeros leave it unchanged. For $h\le63$, $k\le252$ is below the crossing-length bound in Theorem \ref{thm:75}. For $h\ge64$, Rhin's estimate gives $n\Lambda\ge(8^h-5)/(4h)^{13.3}>5$. Indeed, $8^{64}-5>5\cdot256^{14}$, and $((h+1)/h)^{14}\le(65/64)^{14}<8$, so $8^h-5>5(4h)^{14}$ persists by induction. A failure requires $n\Lambdan$, so $x-n$ is a positive multiple of $2^\ell$. Equivalently $2^\ell(x-n)$ is a positive multiple of $2^{2\ell}$. At each step $T(y)+1\le(3/2)(y+1)$, whence \[ 2^\ell\le x-n0$. Then $n\Lambda\exp(-B_i/3). \] \end{proposition} \begin{proof} We use the external height record $H(y)\le2456$ through $D$, reported in \cite[eq.~(34)]{nfb2026}. Here $H$ counts ordinary Collatz operations to first arrival at $1$. For $2\le y\le D$, this gives $\tau(y)\le\chi(y)\le H(y)\le2456$, since shortcut steps combine ordinary operations. The lower bound on $k$ in Theorem~\ref{thm:75} therefore gives $n>D$. For $0\le jD$. If two of $x_0,\ldots,x_{k-1}$ coincided, the intervening segment would contain a cycle of length $L\frac{C_w}{2^k-3^d}=\frac{M_w}{\rho_k^{-1}-1}. \] Equality already gives a counterexample. A lower bound for $r(w)$ or an upper bound for the right side can certify a word if it preserves this strict inequality. The rational-shadow estimates of \cite{dj-shadow2026} supply bounds for individual blocks. Applying one to this question requires transporting it back to the starting seed and comparing it with the threshold of the actual first-crossing prefix. \section*{Reproducibility} From the companion repository at \href{https://github.com/innerlightr-wq/terras-first-crossing/tree/a93b1e82d13fab7024c380ae36320e4ec62a73f9}{commit \texttt{a93b1e8}}, run \begin{verbatim} python3 scripts/verify_crossing.py \end{verbatim} The script checks the numerical inequalities with integers and rationals, encloses $\ln2$ and $\ln3$ by a 96-term series with a geometric tail, recomputes the finite bracket sum in (164) of \cite{nfb2026}, and encloses each exponential cutoff by alternating Taylor bounds. The SHA-256 digest of the verifier begins \texttt{f852c88311071a0d}. The orbit and residue-class examples are finite checks. The proofs for arbitrary word lengths are in the text. The finite seed verification of Rozier--Terracol, Rhin's estimate, the high-path accounting of Nikzad--Frinkle--Bagherzadeh and the height record cited above are external inputs. The general case of Terras's conjecture remains open. \section*{AI assistance and author responsibility} The author directed this research and used Claude (Anthropic) and ChatGPT (OpenAI) for proof exploration and revision, cross-checking the reciprocal-sum estimates against the source paper, developing and testing the exact-arithmetic verifier, and drafting the manuscript. The author takes responsibility for the mathematical claims, their interpretation, and any errors. \begin{thebibliography}{10} \bibitem{eliahou1993} Shalom Eliahou. \newblock The $3x+1$ problem: new lower bounds on nontrivial cycle lengths. \newblock {\em Discrete Mathematics}, 118:45--56, 1993. \bibitem{hikawa2026} Kazunobu Hikawa. \newblock Research notes on {Terras}' coefficient stopping time problem {I}: Previous results and open problems, 2026. \newblock English translation, November 2026; Japanese original, Zenodo, 13 November 2026, DOI 10.5281/zenodo.24187839. \bibitem{dj-sturmian2026} Elias~De Jes\'us. \newblock Beyond {S}turmian words in the $3x+1$ periodicity conjecture: A periodic-approximation and arithmetic-height bridge, 2026. \newblock Revision 5, 13 November 2026; Revision 4 deposited as Zenodo DOI 10.5281/zenodo.23070093. \bibitem{dj-shadow2026} Elias~De Jes\'us. \newblock Exact realizer congruences and rational-shadow bounds for {C}ollatz words, 2026. \newblock Zenodo preprint, 31 October 2026. \href{https://doi.org/10.5281/zenodo.23847289}{\texttt{doi:10.5281/zenodo.23847289}}. \bibitem{dj-floors2026} Elias~De Jes\'us. \newblock Exact realizer floors for one- and two-defect valuation words in the accelerated $3x+1$ map, 2026. \newblock Zenodo preprint, 22 October 2026. \href{https://doi.org/10.5281/zenodo.23579193}{\texttt{doi:10.5281/zenodo.23579193}}. \bibitem{dj-indep2026} Elias~De Jes\'us. \newblock Independent verification of high-path reciprocal bounds for nonrepeating {C}ollatz trajectories, 2026. \newblock Unpublished manuscript, 3 November 2026. \bibitem{nfb2026} Behzad Nikzad, Karl Frinkle, and Fatemeh Bagherzadeh. \newblock On bounds for reciprocal sums and residues in {C}ollatz orbits, and their consequences, 2026. \newblock Hexagon preprint 2611.00033v1, \url{https://hexagonmath.org/2611.00033v1}. \bibitem{rhin1987} Georges Rhin. \newblock Approximants de {P}ad\'e et mesures effectives d'irrationalit\'e. \newblock In {\em S\'eminaire de Th\'eorie des Nombres, Paris 1985--86}, volume~71 of {\em Progress in Mathematics}, pages 155--164. Birkh\"auser Boston, 1987. \bibitem{rozier2026} Olivier Rozier and Claude Terracol. \newblock Paradoxical behavior in {C}ollatz sequences. \newblock {\em Discrete Mathematics}, 349:115167, 2026. \newblock arXiv:2502.00948v5. \bibitem{terras1976} Riho Terras. \newblock A stopping time problem on the positive integers. \newblock {\em Acta Arithmetica}, 30:241--252, 1976. \end{thebibliography} \end{document}