[2025-10-13v3]A Unified Proof of the Collatz Conjecture The Invariant Structure of the $3n+1$ Problem: Generalization to All Integers via Phase Expression Theory and Universal Structural Limits.pdf

This paper presents a \textbf{unified and constructive framework} that resolves the long-standing open problem, the \textbf{Collatz Conjecture} ($3n+1$), over all non-zero integers (positive and negative). We introduce the \textbf{Collatz Phase Expression (CPE)}, which models the Collatz map as deterministic geometric transformations. The CPE utilizes the \textbf{Alternating Binary Notation (ABN)}, a method that encodes integers as alternating-sign powers of 2, and decomposes this into structural units: Chain ($\mathbf{R}$), Single ($\mathbf{T}$), and Node ($\mathbf{K}$). Using the CPE's characteristic quantities ($\mu$: unit count, $H_{RT}$: complexity, $B$: bit-length), we establish two \textbf{Universal Structural Limits}. These constraints imply that infinite divergence and non-trivial cycles are structurally impossible: \begin{enumerate} \item A strict linear bound on the total bit-length, $B(F^m (n)) \le B(n) + m$, prevents exponential growth. \item A deterministic, self-regulating trade-off for the local complexity $H_{RT}$ is enforced by the **Fundamental Inequality**, ensuring complexity cannot increase unboundedly. \end{enumerate} These structural constraints demonstrate that every positive sequence converges to the minimal complexity state ($\mathbf{H_{K}=0}$), leading exclusively to the trivial loop $\{1\}$. Furthermore, the same formalism resolves the negative Collatz conjecture by establishing a universal structural upper bound ($\mathbf{H_{RT} < 6}$), which guarantees convergence to the known finite loops (including $\{-1, -3, -11\}$ cycles). The CPE framework provides a deterministic lens for analyzing discrete dynamical systems.

本文提出了一个**统一且建设性的框架**，解决了长期悬而未决的公开问题——针对全体非零整数（正整数与负整数）的**考拉兹猜想（Collatz Conjecture）**（即3n+1问题）。我们引入了**考拉兹相位表达式（Collatz Phase Expression, CPE）**，将考拉兹映射建模为确定性几何变换。该表达式依托**交替二进制表示法（Alternating Binary Notation, ABN）**——一种将整数编码为带交替符号的2的幂次的方法，并将其分解为三类结构单元：链（$mathbf{R}$）、单单元（$mathbf{T}$）与节点（$mathbf{K}$）。借助CPE的特征量（$mu$：单元总数，$H_{RT}$：复杂度，$B$：比特长度），我们确立了两项**通用结构极限**。这些约束从结构层面证明，无限发散与非平凡循环均不可能存在：
1. 总比特长度满足严格线性界 $B(F^m (n)) le B(n) + m$，可阻断指数增长；
2. 局部复杂度$H_{RT}$受**基本不等式（Fundamental Inequality）**约束，呈现确定性的自调节权衡关系，确保复杂度不会无限制增长。
上述结构约束表明，所有正整数序列均会收敛至最小复杂度状态（$mathbf{H_{K}=0}$），最终唯一落入平凡循环${1}$。此外，通过建立通用结构上界$mathbf{H_{RT} < 6}$，同一形式体系亦可解决负考拉兹猜想，该上界可保证序列收敛至已知的有限循环（包括${-1, -3, -11}$循环）。CPE框架为离散动力系统的分析提供了确定性视角。