
This preprint presents a rigorous classical proof of the Collatz (3x+1) conjecture. The Collatz map is embedded into the URCL trace-map recurrence modulated by the golden-ratio coherence parameter φ = (1 + √5)/2. The dominant eigenvalue φ > 1, together with exponential coherence damping, forces every positive integer trajectory to converge to the 4–2–1 cycle in finite time. The proof is entirely classical and uses only linear recurrences, elementary number theory, and the stability properties of the URCL operator previously developed for the Riemann Hypothesis and Hilbert–Pólya conjecture. Methods of Synthesis and AI Assistance: This theoretical synthesis was developed by the lead author through review of the Collatz literature and the URCL framework. Grok (xAI) provided structured assistance in organizing derivations, wording refinement, and LaTeX formatting. All mathematical claims, logical arguments, and proofs are the responsibility of the lead author. Data Availability: Not Applicable (purely theoretical).
URCL framework, number theory, golden ratio coherence, Collatz conjecture, classical proof, 3x+1 problem, trace-map recurrence
URCL framework, number theory, golden ratio coherence, Collatz conjecture, classical proof, 3x+1 problem, trace-map recurrence
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
