Dimensional Structure of the Collatz Halting Problem via the Bijectivity Principle
Authors/Creators
Description
Abstract
Despite the 2025 surge in structural approaches, indirect proofs via step-counts or halting domain classifications have failed to resolve the Collatz conjecture. We identify that the fundamental difficulty lies in treating the conjecture as a purely arithmetic problem within the constraints of first-order logic, ignoring the implicit bijective architecture that governs natural numbers.
To bypass these theoretical deadlocks, we reveal the Bijectivity Principle of Natural Numbers as a meta-axiom that provides the definitive "initial value" perspective—positioned structurally between Peano’s axioms and their higher-order foundation, Hume’s Principle. As Frege’s Theorem already demonstrated, Peano arithmetic is derivable from Hume’s Principle, confirming that bijective identity is not an extension but a prerequisite of syntactic generation.
However, within the deterministic tradition of arithmetic formalism, this structural foundation remained unused. By recovering it explicitly, we show that the Collatz sequence is not a chaotic process but a rearrangement within a higher-order dimensional structure, inevitably anchored by the morphism 0, 1 at address zero.
This approach transforms the conjecture from a computational enigma into a self-evident structural property of bijective sets. By leveraging the proven reliability of bijective mapping—the very foundation of modern computing—this paper provides a direct resolution, showing that convergence to the 0, 1–4–2–1 loop is a manifest property of the underlying architecture, rendering the halting problem structurally trivial.
Files
AMS_Collats_I_C (1).pdf
Additional details
Dates
- Updated
-
2025-09-25