Formal Verification of Structural Complexity Bounds K < N in Multidimensional Collatz Trees via Lean 4
Authors/Creators
Description
This study demonstrates that the Collatz Conjecture, by virtue of originating from the arbitrary selection of an initial natural number, fundamentally manifests as an operational process over potential infinity rather than a static entity enclosed within actual infinity; hence, Lean 4 serves as a direct and pragmatic platform to simulate its real execution steps. By applying the Dynamic Fregean Axioms to the Hamaji Conjecture—which extends this dynamic problem into a multidimensional natural number topology—we dismantle the unconscious omission of dynamic causality (the actual execution steps of node generation and bit-shifting) traditionally rejected in classical static mathematics. We extend the theoretical framework of Strong Normalization based on multidimensional infinite tree topology to a higher algebraic dimension. Spatial structures expanding across 1D (\(N + 1\)), 2D (\(2N + 1\)), and 3D (\(4N + 1\)) are formulated through a unified bit-shift generator \(2^k N + 1\) (\(k \in \{0, 1, 2\}\)) corresponding to modulo algebra (\(\text{mod } 2, \text{mod } 4\)). Furthermore, using the interactive theorem prover Lean 4 (leveraging Mathlib’s omega tactic), we present a fully automated, defect-free formal proof showing that the number of traversals \(K\) along the 3D information compression axis (\(4N + 1\)-type steps) for any starting node value \(N\) is strictly bounded by the algebraic absolute ceiling \(K < N\). This formal verification confirms the inherent structural contraction of the dynamic tree, demonstrating that when execution processes are fully recovered over potential infinity without omission, the generative complexity is naturally encapsulated within its own initial boundaries.
Supplementary file
The formal Lean 4 proof script is permanently archived on Zenodo (DOI: \href{https://doi.org/10.5281/zenodo.21925546}{10.5281/zenodo.21925546}). Please download \texttt{Hamaji-conjecture.lean} from the repository description for full code inspection and formal verification.
Additionally, the repository description includes two standalone interactive HTML tools designed to map and validate this formal process logic directly within standard web browsers:
\begin{itemize}
\item \texttt{Collatz-Sequence-Generator.html}: A causal process generator that dynamically stacks variable-length sequences into horizontal rows, triggering deterministic line breaks strictly at $4n+1$ algebraic generation boundaries using zero-based indexing.
\item \texttt{Collatz-Sequence-Viewer1-3D.html}: A multi-axis logarithmic process viewer that charts the numerical trajectory alongside the generation index $K$ on a unified scale, visually mapping the exact structural ceiling constraint ($K < N$) under step-by-step contraction.
\end{itemize}
These utilities serve as the empirical frontend to the underlying dependent type theory framework, confirming that the relational dynamics of the multidimensional trees are invariant, compilable, and completely error-free.
Formal Proof Code (Lean 4): https://github.com/Shinsuke-Hamaji/collatz-proof-lean4
Files
Zenodo_Hamaji_Conjecture (3).pdf
Additional details
Additional titles
- Translated title (Japanese)
- Lean 4による多次元コラッツ木における構造的複雑度界 K < N の形式検証