Work

Collatz Sequence Proof … (Intersection & TSF1) V4

Year: 2026
Type: preprint
Abstract: This paper presents an inductive framework demonstrating the global stability of the Collatz Conjecture over the set of positive integers (\(\mathbb{N}_{+}\)). The core mechanism relies on a systemic property termed Taha’s Sequence Fact 1 (TSF1), which states that if any two integer trajectories share a common coordinate, their long-term sequence behavior converges to an identical structural loop. Utilizing Collatz Sequence Rules (CSR), trajectories are evaluated as sets whose mathematical intersections dictate boundary behaviors. By setting the inductive baseline as the intersection of \(S(1)\) to \(S(r)\) equaling \(\{4, 2, 1\}\), we investigate the step for \(r+1\) by stratifying \(r\) based on its binary divisibility subsets: \(N_{(\text{even}\div 2)}\), \(N_{(\text{even}\div 2)\div 2}\), and the pure binary subset \(N_{(2^{k})}\). Tracking the algebraic mapping functions reveals clean intersections at localized coordinates, specifically \((9r+14)/8\) and \((3r+4)/4\). Applying TSF1 and subsequent substitution proofs confirms that the consecutive element \(r+1\) merges into the pre-established trivial attractor. By exhaustive induction across all binary parity classifications, we conclude that the trivial loop \(lS(n) = \{4, 2, 1\}\) holds universally for all \(n\) in \(\mathbb{N}_{+}\). [1]
Language: English
Open Access status: green
OpenAlex ID: W7225872197
Cites:
Cited by:
Related to: 10