Dimensional Structure of the Collatz Halting Problem via the Bijectivity Principle
Authors/Creators
Description
Collatz and Frege : The Lost Ark
• 1880s: Research was based on Frege’s Bijectivity and Peano’s arithmetic, where Determinism dominated.
• 1937: Collatz proposed the halting problem, and the turmoil of recursive indeterminacy began.
• 1937–2022: The principles of nature transformed from Determinism to Indeterminacy, while CS evolved naturally through the bijectivity of addresses and data.
• 2022: Bremer et al. proved undecidability and NP-hardness, marking a dead end; simultaneously, research began to overcome the “Pattern Wall” using the same structural approach as memory spaces.
• 2025: Presented a complete resolution via “Dimensional Natural Numbers” N^d under the dual dominance of the Bijective Principle and Trivial Loops.
Discussion & Validation:
-
Participated in the discussion at Communications of the ACM (CACM) regarding Moshe Y. Vardi’s "Solving the Unsolvable."
-
This paper provides the structural answer to the "unsolvability phobia" mentioned by Prof. Vardi, by integrating Frege's Bijectivity Principle. [Link: https://cacm.acm.org/opinion/solving-the-unsolvable/]
Abstract
Despite the 2025 surge in structural approaches, the Collatz conjecture remains unresolved—not because of a lack of structural insight, but due to the persistent absence of an explicit bijectivity principle within the formal arithmetic tradition.
To circumvent these theoretical impasses, we reintroduce the Bijectivity Principle of natural numbers as a structural foundation that provides a definitive perspective on 'initial values.' As demonstrated by Frege’s Theorem, Peano arithmetic is derivable from Hume’s Principle; this confirms that injective uniqueness is not a mere consequence of arithmetic generation, but its fundamental precondition.
In the tradition of arithmetic formalism, this self-evident structural foundation has remained underutilized. By explicitly applying this existing principle, this paper proves that the Collatz sequence is not a chaotic process, but a rearrangement within a high-dimensional structure, governed and dominated by the 1–4–2–1 trivial loop.
This approach transforms the Collatz conjecture from a computational mystery into a self-evident structural property of bijective sets. By leveraging the proven reliability of bijective mapping—the very bedrock of modern computing—this paper presents a direct solution. It demonstrates that the 0, 1–4–2–1 trivial loop dominates all other numerical patterns (including the transitions of $4n+3$ to $4n+1$ and the reduction of even numbers). Consequently, under the Bijectivity Principle, the halting problem is resolved into a singular dimensional structure, rendering the convergence structurally self-evident.
Files
AMS_Collats_I_C (14).pdf
Additional details
Dates
- Updated
-
2025-09-25