A Reduction Program for the Collatz Conjecture

A research program that does not prove the Collatz conjecture. Its purpose is to reduce the conjecture, by honest, one-directional, individually-tracked implications, to a single analytic statement, and then to name that statement and certify the boundary around it. "The way is shut. It was made by those who are Dead, and the Dead keep it, until the time comes. The way is shut." — J.R.R. Tolkien, The Return of the King No claim of a proof of Collatz is made anywhere in this work. The endpoint of the program, in one paragraphCollatz (modulo the elimination of nontrivial cycles) is equivalent to a bounded-deficit statement: along every odd orbit the cumulative 2-adic valuation tracks the equilibrium slope, D_m = m·log₂3 + O(1). The program reduces the conjecture to this, and identifies the residual obstruction precisely: it is the quenched (single-orbit) equidistribution / deterministic normality of the accelerated map's valuation cocycle against the log₂3 rotation. Under the Haar (annealed) measure this is elementary; the gap is its realization on one deterministic integer orbit. We show why this is genuinely irreducible: it has the form of dynamical Borel–Cantelli, measure rigidity, and homogeneous nondivergence, and the hypotheses of none, the cocycle has ×2-entropy but is rank-one (rigid) in the ×3 direction. It is one sharply-pinned instance of the deterministic-versus- random (pseudorandomness / normality) barrier.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-06-08
DOI
https://doi.org/10.5281/zenodo.20598231
Primary Topic
Benford’s Law and Fraud Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Reduction Program for the Collatz Conjecture

John Janik
Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
article

A Reduction Program for the Collatz Conjecture

John Janik
article en

Abstract

A research program that does not prove the Collatz conjecture. Its purpose is to reduce the conjecture, by honest, one-directional, individually-tracked implications, to a single analytic statement, and then to name that statement and certify the boundary around it. "The way is shut. It was made by those who are Dead, and the Dead keep it, until the time comes. The way is shut." — J.R.R. Tolkien, The Return of the King No claim of a proof of Collatz is made anywhere in this work. The endpoint of the program, in one paragraphCollatz (modulo the elimination of nontrivial cycles) is equivalent to a bounded-deficit statement: along every odd orbit the cumulative 2-adic valuation tracks the equilibrium slope, D_m = m·log₂3 + O(1). The program reduces the conjecture to this, and identifies the residual obstruction precisely: it is the quenched (single-orbit) equidistribution / deterministic normality of the accelerated map's valuation cocycle against the log₂3 rotation. Under the Haar (annealed) measure this is elementary; the gap is its realization on one deterministic integer orbit. We show why this is genuinely irreducible: it has the form of dynamical Borel–Cantelli, measure rigidity, and homogeneous nondivergence, and the hypotheses of none, the cocycle has ×2-entropy but is rank-one (rigid) in the ×3 direction. It is one sharply-pinned instance of the deterministic-versus- random (pseudorandomness / normality) barrier.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 4%
Benford’s Law and Fraud Detection
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.