Collatz Sequence Proof … (Intersection & TSF1) V4

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]

Authors

Publication Details

Published
2026-11-12
DOI
https://doi.org/10.33774/coe-2026-8ntxb
Primary Topic
Smarandache Functions and Recreational Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Collatz Sequence Proof … (Intersection & TSF1) V4

Taha Muhammad
Smarandache Functions and Recreational Number Theory
preprint

Collatz Sequence Proof … (Intersection & TSF1) V4

Taha Muhammad
preprint en

Abstract

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]

Smarandache Functions and Recreational Number Theory
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.

Laika access coming soon