(Collatz Conjecture) Exact CRT Realization, Anchor-Lift Lattices, and Finite Exclusion in Canonical Syracuse Families

Abstract We investigate exact finite trajectories of the accelerated Syracuse map subject to prescribed valuation words, ternary anchor congruences, dyadic conditions, and rational endpoint windows. We derive explicit Chinese-remainder progressions for positive trajectories, recover source and target anchors, and give lossless inverse progression-cylinder and prefix–suffix counting formulas. The central exclusion method lifts both ternary anchors to integers. The two integer anchor lifts give rise to a signed affine quotient relation defining a rank-two congruence lattice. We count its points in explicit rectangles using exact Euclidean floor sums and certified reduced-basis tests. Incorporating the fourteen-step source prefix modulo $2^{41}$ and target integrality modulo $2^{11}$ yields a joint-coset exclusion criterion. For the specified canonical $53$-step model at target height $L' = 3000$, an exact-integer certificate excludes every connection for all $54{,}026$ consecutive gaps $$1500 \le \Delta \le 55525.$$ A separate algebraic precision–parity criterion excludes a prescribed gap corridor for every $L' \ge 3000$. In the middle certificate block, all $93$ source-prefix survivors fail the necessary target congruence $$n' \equiv 415 \pmod{2^{11}}.$$ Independently, we prove an exact anchor-free projection of both endpoints into $2^{30}$ residue windows, retaining the full target condition $$y \equiv -1 \pmod{2^{15}};$$ admissible anchors exist precisely at the projected residues and are unique when they exist. The finite certificate is supported by exact-integer verification programs, complete stage counts, and explicit replay records. The result concerns finite connections within the stated canonical family, not periodicity or unrestricted Collatz convergence. Creator Lee Byoungwoo Independent Researcher, Daejeon, Republic of Korea Keywords accelerated Syracuse map; Collatz conjecture; Chinese remainder progressions; congruence lattice; joint-coset exclusion; exact-integer certificate; Euclidean floor sums; modular congruences; finite trajectories; arithmetic dynamics

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24296697
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

(Collatz Conjecture) Exact CRT Realization, Anchor-Lift Lattices, and Finite Exclusion in Canonical Syracuse Families

Byoungwoo Lee
5 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

(Collatz Conjecture) Exact CRT Realization, Anchor-Lift Lattices, and Finite Exclusion in Canonical Syracuse Families

Byoungwoo Lee
preprint en

Abstract

Abstract We investigate exact finite trajectories of the accelerated Syracuse map subject to prescribed valuation words, ternary anchor congruences, dyadic conditions, and rational endpoint windows. We derive explicit Chinese-remainder progressions for positive trajectories, recover source and target anchors, and give lossless inverse progression-cylinder and prefix–suffix counting formulas. The central exclusion method lifts both ternary anchors to integers. The two integer anchor lifts give rise to a signed affine quotient relation defining a rank-two congruence lattice. We count its points in explicit rectangles using exact Euclidean floor sums and certified reduced-basis tests. Incorporating the fourteen-step source prefix modulo $2^{41}$ and target integrality modulo $2^{11}$ yields a joint-coset exclusion criterion. For the specified canonical $53$-step model at target height $L' = 3000$, an exact-integer certificate excludes every connection for all $54{,}026$ consecutive gaps $$1500 \le \Delta \le 55525.$$ A separate algebraic precision–parity criterion excludes a prescribed gap corridor for every $L' \ge 3000$. In the middle certificate block, all $93$ source-prefix survivors fail the necessary target congruence $$n' \equiv 415 \pmod{2^{11}}.$$ Independently, we prove an exact anchor-free projection of both endpoints into $2^{30}$ residue windows, retaining the full target condition $$y \equiv -1 \pmod{2^{15}};$$ admissible anchors exist precisely at the projected residues and are unique when they exist. The finite certificate is supported by exact-integer verification programs, complete stage counts, and explicit replay records. The result concerns finite connections within the stated canonical family, not periodicity or unrestricted Collatz convergence. Creator Lee Byoungwoo Independent Researcher, Daejeon, Republic of Korea Keywords accelerated Syracuse map; Collatz conjecture; Chinese remainder progressions; congruence lattice; joint-coset exclusion; exact-integer certificate; Euclidean floor sums; modular congruences; finite trajectories; arithmetic dynamics

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon