There is a newer version of the record available.

Published October 30, 2025 | Version v76

A Direct Relocation Proof of the Collatz Conjecture via 4-Dimensional Natural Numbers

Authors/Creators

Description

Abstract

Dynamic Structure Proofs (DSP), based on the one-dimensional infinite sequence absolutely generated by Peano’s successor function "+1", guarantee via child mappings (CM) that any natural number reaches a 4n+1-type odd number, while maintaining bijectivity in parent mappings (PM), such as the $4n+1 \leftrightarrow 3n+1$ orbit. These mappings make it possible to treat the natural number $\mathbb{N}$ as a relocatable substructure. However, DSP provides a local proof of the Collatz Conjecture (CC), but cannot guarantee its branching infinite structure as a globally coherent parent–child system.
In contrast, the spatial degrees of freedom permitted by Cantor’s pairing function transcend Peano’s "+1" constraint by replacing it with root-level parent sequences (PS)—such as Peano’s base pair (0,1), the simplified CC trivial loop (0,1–2–1), or the CC trivial loop (0,1–4–2–1). This substitution enables a bijective relocation from the address dimension $\mathbb{N}_0$ to the natural number space $\mathbb{N}_+$. The resulting dimensional natural number system $\mathbb{N}^d$ operates entirely within Peano’s axiomatic framework, preserving its absolute nature while executing relocation from a relocatable partial structure. 
Furthermore, by replacing "+1" in the tree equivalence theorem $N = E + 1$ with "PS", and rewriting it as $N = E + R$ (nodes = edges + root), the $\mathbb{N}^d$ establishes structural alignment with graph theory. 
Through Peano’s absolute generation and Cantor’s bijective relocation, CC ascends from DSP’s provisional dynamics to a Direct Relocation Proof (DRP), where local bijections evolve into globally consistent mappings.

Files

次元自然木によるコラッツ予想の直接的構造証明(v76).pdf

Files (421.7 kB)

Additional details

Dates

Updated
2025-09-25