Collatz-Conjecture Proved and Halemane-Conjecture Proposed

This paper presents a proof of the Collatz Conjecture, that is also known as the Collatz-Thwaites-Ulam-Hasse-Syracuse-Kakutani (CTUHSK) Conjecture, asserting the convergence of the Collatz (3x+1) sequence to the trivial-cycle {(1⇐2⇐4)}. An algebraic system framework designed as a bounded finite small-sized ideal-based graded-algebraic-filtration-structure defined on a modulo-2 quotient-semiring generated by the pair of roots -1 and 3; is an exact mathematical model to represent the inverse Collatz (3x+1) system. The trivial-cycle of the Collatz-map is bypassed through an initialization-phase for this graded-algebraic-filtration-structure, starting directly with a 5-layered structure with the modulo-16 coprime-layer as its topmost layer.  This also facilitates a clear distinction among the six distinct possible combinations of the modulo-4 residue-classes and the modulo-6 residue-classes that are associated with any positive odd number; which is blurred in smaller structures. A layer-shifting global-affine-transformation, defined by the condensed compact inverse Collatz (odd-to-odd) function; results in a Euclidean shift to the topmost coprime-layer of this filtration structure; avoiding the modulo-multiple-layer (zero-layer) and all the intermediate nilpotent-layers with nilpotent-elements (dead-end zero-divisors). This system design of this ideal-based graded-algebraic-filtration-structure, establishes that the transitive closure of the subset {1,5,3} under the inverse Collatz function is the entire set of all positive integers; covering all the relevant (modulo-3 & modulo-6) modular-residue-classes and also covering all the possible valid triplet-combinations of (1) input-values (2) operations and (3) output-values; governed by the modular-periodicity characteristic (resulting in the self-similar symmetry structure) of the Collatz (3x+1) system; asserting that the Collatz sequence starting from any given positive integer converges to the trivial-cycle. A deterministic discrete finite-state autonomous system (DDFSAS) model for the Collatz system leads to the Halemane-Assertion that there exist exactly six distinctly different possible classes of odd (3x+1) operations in the Collatz system. Halemane-Conjecture states that the maximum number of odd (3x+1) operations required to reach the trivial-cycle {(1⇐2⇐4)}; starting from any given positive integer greater than one and moving along the Collatz sequence; is limited by that given number itself; the triad {(31⇐41⇐27)} is an exceptional limiting case.