This is an outdated version published on 2026-03-09. Read the most recent version.
Preprint / Version 23

COLLATZ-HASSE-SYRACUSE-ULAM-KAKUTANI (CHSUK) THEOREM: CONVERGENCE OF THE COLLATZ SEQUENCE TO THE TRIVIAL CYCLE

##article.authors##

DOI:

https://doi.org/10.31224/6063

Keywords:

Collatz-Hasse-Syracuse-Ulam-Kakutani (CHSUK) Sequence, Collatz-Hasse-Syracuse-Ulam-Kakutani (CHSUK) Conjecture, Convergence, Bijection, Isomorphism, Dedekind-Peano Axioms, CHSUK-Theorem, CHSUK-Generative-Parameters, Binary-Exponential-Ladder, Modular Periodicity

Abstract

This research report presents the Collatz-Hasse-Syracuse-Ulam-Kakutani (CHSUK) Theorem, which asserts the convergence of the Collatz Sequence to the trivial cycle, thus proving the Collatz Conjecture, which has been a long-standing unsolved problem.  The proof is based on the bijective isomorphism established between the set of positive integers and a carefully designed system with a hierarchy (arborescence) of binary-exponential-ladders defined on the set of positive odd numbers.  The reasoning includes a reductio-ad-absurdum argument to demonstrate domain exhaustion, logically excluding the existence of extraneous objects, such as rogue loops or infinite threads, from the conjecture’s domain.

Downloads

Download data is not yet available.

Downloads

Version justification

emphasized the bijective mapping between the set of natural numbers and BELnet (the set of Binary-Exponential-Ladders) and again between BELnet and the Structured-System-Framework H that is designed merely as a re-organized condensation of the very same BELnet.